Tabasco Sort: a super-optimal merge sort - Paul Khuong: some Lisp
EDIT: 2012-08-29: I added a section to compare comparison counts with known bounds for general comparison sorts and sorting networks. In an earlier post, I noted how tedious coding unrolled sorts can be. Frankly, that’s the main reason I stopped at leaf sorts of size three. Recently, Neil Toronto wrote a nice post on the generation of size-specialised merge sorts. The post made me think about that
行をãƒã‚¤ãƒˆåˆ—ã¨ã—ã¦èªã¿è¾¼ã‚€ - sileã®ãƒ–ãƒã‚°
テã‚ストファイルã®å„行をãƒã‚¤ãƒˆåˆ—ã¨ã—ã¦èªã¿è¾¼ã‚€ãƒžã‚¯ãƒã‚’定義。 SBCLç‰ã®ã‚ˆã†ã«æ–‡å—列を内部的ã«ãƒ¦ãƒ‹ã‚³ãƒ¼ãƒ‰ã¨ã—ã¦è¡¨ç¾ã—ã¦ã„る処ç†ç³»ã§ã¯ã€ãƒ†ã‚ストファイルをèªã¿è¾¼ã‚€éš›ã€ãã®ãƒ•ã‚¡ã‚¤ãƒ«ãŒä¸æ£ãªãƒã‚¤ãƒˆåˆ—ã‚’å«ã‚“ã§ã„ã‚‹ã¨èªã¿è¾¼ã¿ã«å¤±æ•—ã™ã‚‹ã“ã¨ãŒã‚ã‚‹ã®ã§ã€ãã®å¯¾å‡¦ã¨ã—ã¦ã€‚ ;;;; エラーã®ä¾‹ ;;;; sbcl-1.0.40 ;;;; ;; 普通ã®è¡Œèªã¿è¾¼ã¿ãƒžã‚¯ãƒã‚’定義 (defmacro each-file-line ((line filepath) &body body) `(with-open-file (#1=#:in ,filepath) (loop FOR ,line = (read-line #1# nil nil) WHILE ,line DO (progn ,@BODY)))) ;;;; ;; ä¸æ£ãªãƒã‚¤ãƒˆåˆ—ã‚’å«ã‚€ãƒ†ã‚ストファイルã®ä½œæˆ (with-open-file (out "s
æ§‹é€ ä½“ã®ã‚¹ã‚¿ãƒƒã‚¯ã¸ã®å‰²ã‚Šå½“㦠- sileã®ãƒ–ãƒã‚°
SBCLã®ãƒžãƒ‹ãƒ¥ã‚¢ãƒ«(ver 1.0.37)ã«ã‚‚書ã„ã¦ã‚ã‚‹ã“ã¨ã ã‘ã© ... 。 通常ã¯æ§‹é€ 体ã®ã‚¤ãƒ³ã‚¹ã‚¿ãƒ³ã‚¹ã‚’作æˆã™ã‚‹ã¨ãƒ’ープ上ã«ãã®ãŸã‚ã®é ˜åŸŸãŒå‰²ã‚Šå½“ã¦ã‚‰ã‚Œã‚‹ã€‚ ã“ã‚Œã«ã¯(ãŠãらã)ヒープ割り当ã¦ï¼‹GC処ç†ã®ã‚³ã‚¹ãƒˆãŒä¼´ã†ã®ã§ã€æ§‹é€ 体ã¨ã—ã¦ã¾ã¨ã‚るよりもã€ãã®å„フィールドを個別ã«æ‰±ã£ãŸæ–¹ãŒã€ãƒ‘フォーマンス的ã«ã¯æœ‰åˆ©ã ã£ãŸã‚Šã™ã‚‹ã€‚ ;; sbcl-1.0.40 ;; ;; æ§‹é€ ä½“ã®ã‚¤ãƒ³ã‚¹ã‚¿ãƒ³ã‚¹ä½œæˆã®ã‚³ã‚¹ãƒˆã‚’測るãŸã‚プãƒã‚°ãƒ©ãƒ ;; 範囲を表ã™æ§‹é€ 体 (defstruct range start end) ;; 範囲をランダムã«è¤‡æ•°ç”Ÿæˆã—ã€ãれらã®è·é›¢ã®åˆè¨ˆå€¤ã‚’求ã‚ã‚‹ ;; 1) æ§‹é€ ä½“ã‚’ä½¿ã†å ´åˆ (time (let ((total 0)) (loop REPEAT 1000000 DO (let ((r (make-range :start (random 100) :end (rando
ã¯ã¦ãªãƒ–ãƒã‚° | 無料ブãƒã‚°ã‚’作æˆã—よã†
ãƒãƒªã‚¤ã‚«ã®ç„¼å£²ã¨ä¸è¯ç‚’ã‚ ãƒãƒªã‚¤ã‚«ã‚’よãã€è¦‹ã‹ã‘るよã†ã«ãªã‚Šã¾ã—ãŸã‚ˆã€‚生ã‘ç°€ã§ã€æ³³ã„ã§ã„ãŸã‚‚ã®ã‚’一æ¯è³¼å…¥ã—ã¾ã—㟠立派ãªå¤§ããªå¢¨è¢‹ã‚„è‚ã¯å†·å‡ä¿å˜ã—㦠柔らã‹ãªèº«ã¯å£ç¯€ã®ãŠè±†ã€ãŠé‡Žèœã¨åˆã‚ã›ã¦ä¸è¯ã®ç‚’ã‚ã‚‚ã®ã«ã€‚æ–°é®®ãªã«ã‚“ã«ãã®èŒŽã¯åˆ»ã¿ã€é¦™ã‚Šé«˜ã食欲ããられã¾ã™ã 下足ã¯ãƒŸãƒ³ãƒã«ã—…
実行å¯èƒ½ãƒ•ã‚¡ã‚¤ãƒ«ä½œæˆè£œåŠ©ãƒžã‚¯ãƒ(sbcl) - sileã®ãƒ–ãƒã‚°
sbcl(1.0.28)ã§ã¯ã€å®Ÿè¡Œå¯èƒ½ãƒ•ã‚¡ã‚¤ãƒ«ã‚’作æˆã™ã‚‹ã“ã¨ãŒã§ãる。 > (sb-ext:save-lisp-and-die "実行å¯èƒ½ãƒ•ã‚¡ã‚¤ãƒ«å" :toplevel #'エントリ関数 :executable t) エントリ関数ã«ã¯(å¿…é ˆå¼•æ•°ã®æ•°ãŒ0個ãªã‚‰?)ã©ã®ã‚ˆã†ãªé–¢æ•°ã§ã‚‚指定å¯èƒ½ãªã®ã ãŒã€ã„ã‚ã„ã‚クセãŒã‚ã‚‹ãŸã‚期待通りã«å‹•ã関数を一ã‹ã‚‰ä½œæˆã™ã‚‹ã®ã¯ã€è‹¥å¹²æ‰‹é–“å–ã£ãŸã‚Šã™ã‚‹ã€‚ ãªã®ã§ã€ã‚¨ãƒ³ãƒˆãƒªé–¢æ•°ä½œæˆç”¨ã®ãƒžã‚¯ãƒã‚’作æˆã—ãŸã€‚ ãã“ã¾ã§æ±Žç”¨çš„ã§ã¯ãªã„ã®ã§ã€ãã®æ™‚々ã§æ‰‹ã‚’åŠ ãˆã‚‹å¿…è¦ãŒã‚ã‚‹ã¨ã¯æ€ã†ãŒã€ãƒ†ãƒ³ãƒ—レートã¨ã—ã¦ã¯å分ã ã¨æ€ã†ã€‚ 以下コード： ;; パスã®ãƒ•ã‚¡ã‚¤ãƒ«å部分をå–り出㙠(defun basename (pathstring) (let ((path (parse-namestring pathstring))) (format nil "~A~@[.~A~]" (pathn
apropos+describe - sileã®ãƒ–ãƒã‚°
aproposã¨describeを一緒ã«ã—ãŸã‚ˆã†ãªé–¢æ•°ã‚’作æˆã€‚ åå‰ã¯ãã®ã¾ã¾apropos-desc。 aproposを使ãˆã°ã€ã‚·ãƒ³ãƒœãƒ«ä¸€è¦§ãŒå–å¾—ã§ãã‚‹ãŒã€ãã‚Œã«(ãã®ã‚·ãƒ³ãƒœãƒ«ã«ãƒã‚¤ãƒ³ãƒ‰ã—ã¦ã„ã‚‹)関数ãªã©ã®ç°¡å˜ãªæƒ…å ±(引数ã€è¿”り値ã€ãƒ‰ã‚ュメント)も一緒ã«è¡¨ç¤ºã•ã‚Œã‚‹ã‚ˆã†ã«ã—ãŸã€‚ 基本的ã«ã¯ã€apropos-listã®çµæžœã«describeã‚’é©ç”¨ã—ãŸã ã‘ã ãŒã€sbclã®æ¨™æº–ã®describe出力ã¯è‹¥å¹²é‡ãŒå¤šã™ãŽã‚‹ã“ã¨ãŒã‚ã‚‹ã®ã§ã€è‡ªåˆ†ã«å¿…è¦ãªæƒ…å ±ã ã‘を出力ã™ã‚‹ã‚ˆã†ã«ã—ã¦ã€ä¸€è¦§æ€§ã‚’上ã’ã¦ã„る。 例 ;; 第三引数ã¾ã§ã¯ã€apropos関数ã¨åŒæ§˜ ;; "multiple"ã‚’å«ã‚€ã‚·ãƒ³ãƒœãƒ«ã‚’common-lispパッケージã‹ã‚‰æŽ¢ã—ã¦ã€ãã®åå‰ã¨ç°¡æ˜“çš„ãªæƒ…å ±ã‚’è¡¨ç¤ºã™ã‚‹ã€‚ > (apropos-desc "multiple" :common-lisp t) === multiple-value-bind
alpha-char-pã®æŒ™å‹• - sileã®ãƒ–ãƒã‚°
alpha-char-p関数ãŒè‡ªåˆ†ã®äºˆæƒ³å¤–ã®æŒ™å‹•ã‚’ã™ã‚‹ã®ã‚’発見。(確èªã—ãŸã®ã¯ã€sbclã¨clisp) ;; 予想通り > (alpha-char-p #\a) --> T ;; ã“れも > (alpha-char-p #\0) --> NIL ;; 予想外 > (alpha-char-p #\ã‚) --> T 別ã«ã€Œã‚¢ãƒ«ãƒ•ã‚¡ãƒ™ãƒƒãƒˆã€ãŒã€aã‹ã‚‰zã¾ã§ã®æ–‡å—ã ã‘を指ã™ã‚ã‘ã§ã¯ãªã„ã®ã§ã€ä¸Šã®æŒ™å‹•ã¯é©åˆ‡ãªã®ã ã‚ã†ãŒã€ä½•ã¨ãªãã“ã†ã„ã†é–¢æ•°ã¯a〜z,A〜Zã®æ–‡å—ã«ã ã‘trueã‚’è¿”ã™å°è±¡ãŒã‚ã£ãŸ(Cã®isalphaã¨ã‹ã®å½±éŸ¿ã‹?)。 『Common LISP 第2版ã€ã«ã¯ã€alpha-char-pã®èª¬æ˜Žã¨ã—ã¦ã€Œæ¨™æº–æ–‡å—（standard-char-pã«ã‚ˆã£ã¦å®šç¾©ã•ã‚Œã‚‹ã‚‚ã®ï¼‰ã«å¯¾ã—ã¦ã¯æ–‡å—Aã‹ã‚‰Zã¾ã§ã¨aã‹ã‚‰zã¾ã§ãŒã‚¢ãƒ«ãƒ•ã‚¡ãƒ™ãƒƒãƒˆã§ã‚ã‚‹ã€(p.331)ã¨æ›¸ã‹ã‚Œã¦ã„ã‚‹ã®ã§ã€(and (standard-c
コンパイラノート表示 - sileã®ãƒ–ãƒã‚°
最近ã®ãƒãƒ¼ã‚¸ãƒ§ãƒ³ã®SBCL*1ã§ã¯ã€å‡¦ç†é€Ÿåº¦ã‚’最優先ã«ã™ã‚‹å®£è¨€ã‚’è¡Œã£ã¦é–¢æ•°ã‚’コンパイルã—ãŸå ´åˆã§ã‚‚ã€ãƒ‡ãƒ•ã‚©ãƒ«ãƒˆã§ã¯ã‚³ãƒ³ãƒ‘イラノート*2ãŒè¡¨ç¤ºã•ã‚Œãªã„ã“ã¨ãŒã‚ã‚‹*3。 ãã®ãŸã‚ã€æœ€é©åŒ–を確実ã«è¡Œã„ãŸã„å ´åˆã¯ã€ã‚³ãƒ³ãƒ‘イラノートを出力ã™ã‚‹ã‚ˆã†ã«æ˜Žç¤ºçš„ã«å®£è¨€ã™ã‚‹å¿…è¦ãŒã‚る。 (declare (optimize (debug 0) (safety 0) (speed 3) (compilation-speed 0)) ;; ↓ã“ã‚ŒãŒå¿…è¦ (sb-ext:unmuffle-conditions sb-ext:compiler-note)) ã¾ãŸã€ã“ã‚Œã¯ã©ã†ã‚„らdeclaimã§å®£è¨€ã—ãŸå ´åˆã¯ç„¡åŠ¹ã§ã€declareを使ã†å¿…è¦ãŒã‚るよã†ã 。 *1:今回試ã—ãŸã®ã¯1.0.28 *2:最é©åŒ–ã‚’è¡Œã†ãŸã‚ã«ä¿®æ£ãŒå¿…è¦ãªç®‡æ‰€ãªã©ã‚’æ•™ãˆã¦ãれる *3:多分compile-file関数ã§ã‚³ãƒ³ãƒ‘イルを行ã†å ´åˆã¯ã€ãƒ‡ãƒ•ã‚©ãƒ«
SBCL 2.4.11 User Manual
sbcl This manual is part of the SBCL software system. See the README file for more information. This manual is largely derived from the manual for the CMUCL system, which was produced at Carnegie Mellon University and later released into the public domain. This manual is in the public domain and is provided with absolutely no warranty. See the COPYING and CREDITS files for more information.
ランã‚ング
ランã‚ング
ランã‚ング
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
Steel Bank Common Lisp wrap-up post: new Google Summer of Code org in 2013
Engineering a list merge sort - Paul Khuong: some Lisp
Thread: [Sbcl-commits] master: add support for package::form-read-in-package syntax | Steel Bank Common Lisp
random-state.net / SBCL Merchandise (August 3rd 2011)
save-lisp-and-die
Nikodemus' Shop
SBCL 10: Steel Bank Common Lisp's 10th Anniversary Workshop
http://lisphacker.com/blog/display/some-sbclwin32-hacking
Linedit homepage
Edi Weitz - Common Lisp code
Thread: [Sbcl-devel] RFC: --script commandline argument | Steel Bank Common Lisp
{{#tags}}- {{label}}
{{/tags}}