moozã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ / 2010å¹´10æœˆ11æ—¥ - ã¯ã¦ãªãƒ

ãƒã‚¤ãƒŽãƒãƒŠBlog

æ—¥ã€…ã®é›‘æ„Ÿç‰æ°—ãŒã¤ã‘ã°ã‚‚ã†ä»Šå¹´ã‚‚æ®‹ã™ã¨ã“ã‚ã‚ã¨äºŒæ—¥ã§ã™ãã€‚ ã¿ãªã•ã‚“è‰¯ã„ãŠå¹´ã‚’ï¼ â€¦ã¨ã€ãã®å‰ã«ä»Šå¹´æœ€å¾Œã®ã‚¤ãƒ™ãƒ³ãƒˆãŒâ€¦ï¼ çµå±€ã€å†è²©ã™ã‚‹å¤ã®æœ¬ä»¥å¤–ã¯ä½•ã‚‚ä½œã‚Œã¾ã›ã‚“ã§ã—ãŸorzï½ºï¾žï¾’ï¾ï¾ï½»ï½² ã¡ã‚‡ã£ã¨å‘ŠçŸ¥ã‚’ å§”è¨—å…ˆã®ã€ŒMount Positionã€ã•ã‚“ã®çœ¼é¡æ‚ªé”ã‚¹ãƒˆãƒƒã‚ãƒ³ã‚°æœ¬ã¨ æ±ãƒ”-27bã€€AUTOMATIC[Î±]ã•ã‚“ã®ãƒ©ã‚°ãƒŠãƒã‚¯ã‚ªãƒ³ãƒ©ã‚¤ãƒ³ï¼£ï¼§é›†ã« ã‚²ã‚¹ãƒˆã‚¤ãƒ©ã‚¹ãƒˆã‚’ä¸€æžšãšã¤æã‹ã›ã¦ã„ãŸã ãã¾ã—ãŸã€‚ ãã‚Œã§ã¯ã€å†¬ã‚³ãƒŸã«å‚åŠ ã•ã‚Œã‚‹æ–¹ã¯å¹´æœ«å¹´å§‹å†·ãˆè¾¼ã¿ã‚‚åŽ³ã—ããªã‚‹ã‚ˆã†ãªã®ã§ãŠæ°—ã‚’ã¤ã‘ã¦ï¼ è‡ªåˆ†ã‚‚å£²ã‚Šã“ã—ã¦ã¾ã™ã®ã§ç¾åœ°ã§ãŠä¼šã„ã§ããŸã‚‰å®œã—ããŠé¡˜ã„ã—ã¾ã™ã€‚ ãŠã¯ã‚‰ã£ããƒ¼ãƒ¼ï¼ ãªã‚“ã¨ã‹ç„¡äº‹ã«(ï¼Ÿ)15å¹´ç¥ã‚‚çµ‚äº†ã—ã€ä¸€å®‰å¿ƒã®æ–‡å€‰ã§ã™ã€‚ ã‚¹ãƒ†ãƒ¼ã‚¸ã‚‚ã‚µã‚¤ãƒ³ä¼šã‚‚ç·Šå¼µã—ã¾ãã‚Šã§ã‚‚ã†å¤§å¤‰ã§ã—ãŸãŒã€ã¨ã¦ã‚‚ã„ã„çµŒé¨“ã«ãªã£ãŸã¨æ€ã„ã¾ã™ã€‚ ç·Šå¼µã—ã™ãŽã¦ã€ã‚µã‚¤ãƒ³ä¼šã§è‡ªåˆ†ã®ã‚µã‚¤ãƒ³ã®æ¨ªã«æã„ãŸã¡ã³ãƒ›ãƒã«ä½•ä½“ã‹å¥‡å½¢ã‚’ç”£ã¿å‡ºã—ã¦ã—

mooz 2010/10/11

illust

ãƒªãƒ³ã‚¯

EmacsWiki: When To Use If

This page is about conditional control of program flow (evaluation). All EmacsLisp control structures are functions (in the broad sense, which includes mac ros): they return a value. Sometimes you are not interested in this value (that is, it is not used by the calling code). For more information about conditional expressions, see Conditionals or use â€˜C-h f condâ€™, â€˜C-h ifâ€™ etc. When to Use Which Co

mooz 2010/10/11

when, unless, if, cond, and, or, case ãªã©ã®ä½¿ã„åˆ†ã‘ã«é–¢ã—ã¦

elisp

ãƒªãƒ³ã‚¯

Yet another icomplete - è²³ä½°ä¼æ‹¾é™¸å¤œæ—¥è¨˜

icompleteã®ç¸®å°ç‰ˆã®ã‚ˆã†ãªã‚‚ã®ã‚’ä½œã£ãŸ. å‹•æ©Ÿ anything-find-fileã‚‚Idoã‚‚è‚Œã«åˆã‚ãªã„ã—, Iciclesãªã‚“ã¦ã‚‚ã†åˆæœŸçŠ¶æ…‹ã®ã‚¤ãƒ³ã‚¿ãƒ•ã‚§ãƒ¼ã‚¹ãŒè¦‹è¾›ã™ãŽã¦ã‚«ã‚¹ã‚¿ãƒžã‚¤ã‚ºã™ã‚‹æ°—ã«ã‚‚ãªã‚Œãªã‹ã£ãŸã®ã§, http://d.hatena.ne.jp/mooz/20101003/p1ã¯éžå¸¸ã«ç´ æ™´ã‚‰ã—ã‹ã£ãŸ. ã•ã‚‰ã«ã‚¤ãƒ³ã‚¯ãƒªãƒ¡ãƒ³ã‚¿ãƒ«ã«è£œå®Œã§ãã‚Œã°, auto-fu.zshã®ã‚ˆã†ã«ã§ããã†. ãŸã , icomplete-modeã‚’ãã®ã¾ã¾æœ‰åŠ¹ã«ã—ãŸã®ã§ã¯ã„ã‚ã„ã‚ç«¶åˆã—ã¦ã†ã¾ãã„ã‹ãªã‹ã£ãŸ. ãã‚‚ãã‚‚åˆ¥ãƒãƒƒãƒ•ã‚¡ã«å€™è£œä¸€è¦§ã‚’å‡ºã—ãŸã„ã®ã«, icompleteã¯ãƒŸãƒ‹ãƒãƒƒãƒ•ã‚¡ã«ã™ã¹ã¦ã‚’è©°ã‚è¾¼ã‚‚ã†ã¨ã™ã‚‹. å€™è£œä¸€è¦§ã®è¡¨ç¤ºæ–¹æ³•ã¯å¾“æ¥é€šã‚Šã§, è¡¨ç¤ºã®ãƒˆãƒªã‚¬ã ã‘å…¥åŠ›ã«é€£å‹•ã—ã¦æ¬²ã—ã„. ãã‚“ãªã‚ã‘ã§, æ–°ãŸã«icompleteã‚‚ã©ãã‚’å®Ÿè£…ã—ãŸ. æ©Ÿèƒ½ å…¥åŠ›ã«å¿œã˜ã¦è‡ªå‹•çš„ã«è£œå®Œå€™è£œãƒãƒƒãƒ•ã‚¡ã‚’è¡¨ç¤º æ›–

mooz 2010/10/11

auto-fu.zsh ãƒ©ã‚¤ã‚¯ãª.

emacs

ãƒªãƒ³ã‚¯

ãƒ†ã‚¯ãƒ‹ã‚«ãƒ«éŸ³æ¥½å¥½ãã®ä¿ºãŒã‚ˆã†ã¤ã¹ã‹ã‚‰éŸ³æ¥½ã‚’ç´¹ä»‹ã™ã‚‹ã‚¹ãƒ¬ : ã¯ã‚Œãžã†

mooz 2010/10/11

éŸ³æ¥½

ãƒªãƒ³ã‚¯

ã‚µãƒ¼ãƒ“ã‚¹çµ‚äº†ã®ãŠçŸ¥ã‚‰ã›

ã‚µãƒ¼ãƒ“ã‚¹çµ‚äº†ã®ãŠçŸ¥ã‚‰ã› ã„ã¤ã‚‚Yahoo! JAPANã®ã‚µãƒ¼ãƒ“ã‚¹ã‚’ã”åˆ©ç”¨ã„ãŸã ãèª ã«ã‚ã‚ŠãŒã¨ã†ã”ã–ã„ã¾ã™ã€‚ ãŠå®¢æ§˜ãŒã‚¢ã‚¯ã‚»ã‚¹ã•ã‚ŒãŸã‚µãƒ¼ãƒ“ã‚¹ã¯æœ¬æ—¥ã¾ã§ã«ã‚µãƒ¼ãƒ“ã‚¹ã‚’çµ‚äº†ã„ãŸã—ã¾ã—ãŸã€‚ ä»Šå¾Œã¨ã‚‚Yahoo! JAPANã®ã‚µãƒ¼ãƒ“ã‚¹ã‚’ã”æ„›é¡§ãã ã•ã„ã¾ã™ã‚ˆã†ã€ã‚ˆã‚ã—ããŠé¡˜ã„ã„ãŸã—ã¾ã™ã€‚

mooz 2010/10/11

ostream_iterator, istream_iterator

c++

ãƒªãƒ³ã‚¯

wait freeã®æ„ç¾©ï¼Ÿ

ç—…æ°—ã®ç¾Žå°‘å¥³ @lyrical_logical @kumagi STM ã¯ã‚ã‹ã‚Šã‚„ã™ã obstruction-free ã§ã™ã‚ˆãã£ã¦ã„ã†ã®ã¯ã‚ã£ã¦ã€ãã‚Œä»¥å¤–ãªã‚“ã§ã™ã‚ˆï¼ ãã¾ãŽ @kumagi TMä»¥å¤–ã§Obstruction-freeã£ã¦æœ‰ã‚‹ã®ã‹ãªã€‚Obstruction-freeã£ã¦è¨€è‘‰ãã®ã‚‚ã®ãŒTMã®ãŸã‚ã«ä½œã‚‰ã‚ŒãŸã‚ˆã†ãªäº‹æ…‹ã§â€¦ã€‚

mooz 2010/10/11

ãƒªãƒ³ã‚¯

Ola Bini: Programming Language Synchronicity

The second day of Emerging Languages camp was at least as good as the first day. We also managed to squeeze in four more talks, since everybode agreed that the afternoon pause was too long and ineffective during day one. At the end of the day my brain was substantially melted that I didnâ€™t even contemplate finishing these comments. But after some sleep I think I have a fresh perspective. The sessi

mooz 2010/10/11

Ioke ã®ä½œè€…. Ruby, Lisp, io, ...

hacker

ãƒªãƒ³ã‚¯

Ioke

Ioke is a dynamic language targeted at the Java Virtual Machine. It's been designed from scratch to be a highly flexible general purpose language. It is a prototype-based programming language that is inspired by Io, Smalltalk, Lisp and Ruby. Ioke is hosted at Kenai. This is where bugs are reported, mailing lists are joined, and the source code can be found. The link to the project at Kenai can be

mooz 2010/10/11

"prototype-based programming language that is inspired by Io, Smalltalk, Lisp and Ruby"

programming_language

ãƒªãƒ³ã‚¯

ç¢ºçŽ‡çš„ãƒãƒ•å¤‰æ›(ç›´ç·š)

ãƒãƒ•å¤‰æ›ã«ã¯ã€ä¸€èˆ¬åŒ–ãƒãƒ•å¤‰æ›ã¨ç¢ºçŽ‡çš„ãƒãƒ•å¤‰æ›ãŒã‚ã‚Šã¾ã™ã€‚ç¢ºçŽ‡çš„ãƒãƒ•å¤‰æ›ã¯ã€ç”»åƒã®ä¸ã‹ã‚‰ç›´ç·šã‚’æŽ¢ã—å‡ºã™æ™‚ã«ä½¿ã„ã¾ã™ã€‚ ç«¯ç‚¹ã§ã‚ã‚‹å§‹ç‚¹ã¨çµ‚ç‚¹ã‚’ã‚‚ã¤ç·šåˆ†ã‚’æ¤œå‡ºã—ã¾ã™ã€‚ æ¿ƒæ·¡ç”»åƒã«ã‚ãƒ£ãƒ‹ãƒ¼ãƒ•ã‚£ãƒ«ã‚¿ã‚’ã—ã¦ã€ç·šåˆ†åŒ–ã—ãŸç”»åƒã«ã€ç¢ºçŽ‡çš„ãƒãƒ•å¤‰æ›ã—ã¾ã™ã€‚ åŽŸç”»ã‹ã‚‰ç·šåˆ†ã‚’æ¤œå‡ºã—ã¾ã™ã€‚ ç·šåˆ†ã‚’æ¤œå‡ºã¯ã€å„ç·šåˆ†ã®äº¤ç‚¹ã€ãªã™è§’åº¦ã‚’æ±‚ã‚ãŸã‚Šã™ã‚‹ã“ã¨ã«å¿œç”¨ã§ãã¾ã™ã€‚ è¨ˆæ¸¬ã®åŸºç¤Žã«ãªã‚‹ã‚‚ã®ã§ã™ã€‚ åŽŸç”» ã‚ãƒ£ãƒ‹ãƒ¼ãƒ•ã‚£ãƒ«ã‚¿ãƒ¼ã‚’ã—ã¾ã™ã€‚ç·šåˆ†ç”»åƒã«ã—ã¾ã™ã€‚ç¢ºçŽ‡çš„ãƒãƒ•å¤‰æ›ã‚’å®Ÿè¡Œã—ã¾ã™ã€‚æ¤œå‡ºã•ã‚ŒãŸç›´ç·šã¯èµ¤ã„ç·šã§ç”»åƒä¸Šã«è¡¨ç¤ºã•ã‚Œã¾ã™ã€‚ ã¾ãŸã€ãã®ã¨ãæ¤œå‡ºã•ã‚ŒãŸç›´ç·šã®å§‹ç‚¹ã¨çµ‚ç‚¹ã‚’ç”»é¢ä¸Šã«è¡¨ç¤ºã—ã¾ã™ã€‚ çµæžœ ç”»é¢ä¸Šã«ã€ãƒãƒ•å¤‰æ›ã®çµæžœã‚’è¡¨ç¤ºã—ã¾ã™ã€‚ ãƒ©ã‚¤ãƒ–ãƒ©ãƒªé–¢æ•° MvcClp_Init int MvcClp_Init( void ) æˆ»ã‚Šå€¤ æ£å¸¸çµ‚äº†ã®æ™‚ã¯ã€0ã‚’è¿”ã—ã¾ã™ã€‚ãã‚Œä»¥å¤–ã¯ã€ä»¥ä¸‹ã®å€¤ã‚’è¿”ã—ã¾ã™ã€‚ -1ï¼šãƒ—ãƒãƒ†ã‚¯ãƒˆã‚ãƒ¼ãŒã‚ã‚Šã¾ã›ã‚“ -

mooz 2010/10/11

cv

ãƒªãƒ³ã‚¯

XOR linked list - Wikipedia

This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources:Â "XOR linked list"Â â€“Â newsÂ Â· newspapersÂ Â· booksÂ Â· scholarÂ Â· JSTOR (October 2009) (Learn how and when to remove this message) An XOR linked list is a type of data structure used in computer programming. It t

mooz 2010/10/11

"å‰å¾Œã®è¦ç´ ã¸ã®ãƒã‚¤ãƒ³ã‚¿ã‚’ãƒªã‚¹ãƒˆãƒŽãƒ¼ãƒ‰ã«å«ã‚ãšã€äºŒã¤ã®ãƒã‚¤ãƒ³ã‚¿å€¤ã®æŽ’ä»–çš„è«–ç†å’Œã‚’ä¿æŒã™ã‚‹" http://hamigaki.sourceforge.jp/doc/html/xor_list.html

data_structure

ãƒªãƒ³ã‚¯

è¿‘ä»£ãƒ‡ã‚¸ã‚¿ãƒ«ãƒ©ã‚¤ãƒ–ãƒ©ãƒªãƒ¼ã®ç”»åƒã®ä½™ç™½ã‚’åˆ‡ã£ã¦ãƒšãƒ¼ã‚¸åˆ†å‰²ã™ã‚‹ãŸã‚ã®å‡¦ç† - ãƒ‡ãƒ¼

è¿‘ãƒ‡ã‚¸ã®ç”»åƒã®ä½™ç™½ã‚’å–ã£ã¦å·¦å³ã«åˆ†å‰²ã™ã‚‹ - hitode909ã®æ—¥è¨˜ã‚’è¦‹ã¦ã¦ã€ è¿‘ä»£ãƒ‡ã‚¸ã‚¿ãƒ«ã®ç”»åƒã‚’ä½™ç™½åˆ‡ã£ã¦ãƒšãƒ¼ã‚¸åˆ†å‰²ã™ã‚‹ã®ã€çŸ¥ã£ã¦ã„ã‚Œã°ä¸€çž¬ã§ã§ãã‚‹å•é¡Œã ã¨æ€ã†ã‚“ã ã‘ã©ã€ã‚„ã£ãŸã“ã¨ãªã„ã®ã§è©¦ã™ã‹ 2010-10-11 11:51:42 via P3:PeraPeraPrv ã¨æ€ã£ãŸã®ã§ã‚„ã£ã¦ã¿ãŸã€‚ é¸æŠžã•ã‚ŒãŸé ˜åŸŸ ã‚„ã£ã¦ã‚‹ã“ã¨ å…ƒç”»åƒãŒè¶…ã§ã‹ã„ã®ã§å°ã•ãã—ã¦å‡¦ç†ã™ã‚‹(é€Ÿããªã‚‹) cannyã‚¨ãƒƒã‚¸ã‚’æ¤œå‡ºã—ãŸã‚ã¨ç¢ºçŽ‡çš„ãƒãƒ•å¤‰æ›ã§ç·šã‚’æ¤œå‡º(ç¸¦æ¨ª) ã‚ã¨ã¯å˜ç´”ã«ã€ æ¨ªç·šã®ã†ã¡ä¸€ç•ªä¸Šã‚’topã« æ¨ªç·šã®ã†ã¡ä¸€ç•ªä¸‹ã‚’bottomã« ç¸¦ç·šã®ã†ã¡ä¸€ç•ªå·¦ã‚’leftã« ç¸¦ç·šã®ã†ã¡ä¸€ç•ªå³ã‚’rightã« ã«ã—ã¦ã€ã“ã®çŸ©å½¢ã‚’ä½™ç™½ã‚’å–ã‚Šé™¤ã„ãŸé ˜åŸŸã¨ã™ã‚‹ã€‚ ã“ã®ã¨ãçœŸã‚“ä¸ã«è¬Žã®é»’ã„é ˜åŸŸãŒã‚ã£ã¦ã€ãã®ä¸Šä¸‹ãŒæ¤œå‡ºã•ã‚Œã‚‹ã“ã¨ãŒã‚ã‚‹ã®ã§ã€ã‚ã¾ã‚Šä¸ŠéŽãŽãŸã‚Šä¸‹éŽãŽãŸã‚Šã™ã‚‹ç·šã¯ä½¿ã‚ãªã„ã‚ˆã†ã«ã—ãŸã€‚ï¼ˆã‹ãªã‚Šãƒ†ã‚ãƒˆã‚¦ï¼‰ ãƒšãƒ¼ã‚¸ã®ä¸å¿ƒ

mooz 2010/10/11

cv

ãƒªãƒ³ã‚¯

ã—ã¼ã‚ŠãŸã¦ãƒ–ãƒã‚° Canny Edge Detection -ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ -

å¼·åº¦: sqrt(fx*fx+fy*fy) å‹¾é…æ–¹å‘ã®é‡ååŒ–: tan=fy/fx 0åº¦æ–¹å‘ï¼š-0.4142<tan<=0.4142 45åº¦æ–¹å‘ï¼š0.4142<tan<2.4142 90åº¦æ–¹å‘ï¼š |tan|>=2.4142 135åº¦æ–¹å‘ï¼š-2.4142<tan<=-0.4142 STEP3:ã‚¨ãƒƒã‚¸ã®ç´°ç·šåŒ–å‡¦ç†ï¼ˆNon-maximum Suppressionï¼‰ ã¼ã‹ã—ã¦å¤ªããªã£ãŸã‚¨ãƒƒã‚¸ã‚’ç´°ãã™ã‚‹ãŸã‚ã®ç´°ç·šåŒ–å‡¦ç†ã€‚ ã‚¨ãƒƒã‚¸ã¨é‰›ç›´æ–¹å‘ã®éš£æŽ¥ç”»ç´ 2ã¤ã¨æ¯”è¼ƒã— æœ€å¤§ã§ãªã‘ã‚Œã°0ã¨ã™ã‚‹ï¼ˆéžæœ€å¤§å€¤æŠ‘åˆ¶ï¼‰ ä½ç½®(x,y)ã®ã‚¨ãƒƒã‚¸å¼·åº¦ã‚’s(x,y)ã¨ã™ã‚‹ã¨ â‘ 0åº¦æ–¹å‘ if s(x,y)>s(x-1,y)&&s(x,y)>s(x+1,y) s(x,y)=s(x,y); else s(x,y)=0; â‘¡45åº¦æ–¹å‘ if s(x,y)>s(x-1,y+1)&&s(x,y)>s(x+1,y-1) s(x,y)=s

mooz 2010/10/11

cv

ãƒªãƒ³ã‚¯

deferred.el ã®ã§ãã‚‹ã¾ã§ï¼šèª¿æŸ»ã€è¨è¨ˆã¨å®Ÿè£… - æŠ€è¡“æ—¥è¨˜ï¼ kiwanami

deferred.elã‚’ä½œã‚‹ä¸Šã§ã®å‚è€ƒã«ã—ãŸæƒ…å ±ã‚„ã€è¨è¨ˆãƒ»å®Ÿè£…ã®ãƒ¡ãƒ¢ã§ã™ã€‚ ä¸€èˆ¬çš„ãªDeferredã®ç†è§£ã‚„ã€Deferredã®æƒ…å ±ã¾ã¨ã‚ã¨ã—ã¦ã‚‚ä½¿ãˆã‚‹ã‹ã‚‚ã—ã‚Œã¾ã›ã‚“ã€‚ Deferredã«ã¤ã„ã¦ ã‚³ãƒ¼ãƒ«ãƒãƒƒã‚¯ã‚’ã†ã¾ãæ›¸ãã‚¤ãƒ‡ã‚£ã‚ªãƒ éžåŒæœŸå‡¦ç†ã®æŠ½è±¡åŒ–ã®é“å…· æ±Žç”¨æ€§ãŒé«˜ãã€ä½¿ã„å§‹ã‚ã‚‹ã¨ç„¡ã„ã¨å›°ã‚‹ãƒ¬ãƒ™ãƒ« å¾Œè¿°ã®brazilã•ã‚“ã®è¨˜äº‹ãŒå¤§å¤‰ã‚ªã‚¹ã‚¹ãƒ¡ã§ã™ã€‚ å‚è€ƒã«ã—ãŸæƒ…å ±ãªã© åŸºæœ¬çš„ã«å¤ã„è¨˜äº‹ï¼ˆ2å¹´ä»¥ä¸Šå‰ï¼‰ãŒå¤šãã€JavaScriptç•Œã®ä¸ã§ã¯ã™ã§ã«ãƒ–ãƒ¼ãƒ ã¯éŽãŽåŽ»ã£ã¦ã€å¸¸è˜ã®åŸŸã«ãªã£ã¦ã„ã‚‹ã‚ˆã†ã§ã™ã€‚ãã†ã¯è¨€ã£ã¦ã‚‚ã€deferred.elã‚’å®Ÿè£…ã™ã‚‹ãŸã‚ã«éŽåŽ»ã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ãªã©ã‚’æŽ˜ã‚Šèµ·ã“ã—ã¦èªã¿ç›´ã—ã¦ã¿ãŸã®ã§ã™ãŒã€è‡ªåˆ†ã®ä¸ã§ã¯å†ç™ºè¦‹ã™ã‚‹ã“ã¨ã‚‚å¤šã‹ã£ãŸã§ã™ã€‚ JSDeferred deferred.elã§ä¸€ç•ªå‚è€ƒã«ã—ãŸå®Ÿè£…ã§ã™ã€‚å®Ÿè£…ãŒã‚·ãƒ³ãƒ—ãƒ«ã§ã™ã€‚ å¾Œè¿°ã®Mochikit.Asyncã®Deferredã«

mooz 2010/10/11

ãƒªãƒ³ã‚¯

grep ãƒãƒƒãƒ•ã‚¡ãŒã‚ã£ã¦ã‚‚ rgrep ã™ã‚‹ - ã‚ã‹ã‚‰ã‚“

ä¸€åº¦ rgrep ã—ã¦ *grep* ãƒãƒƒãƒ•ã‚¡ã‚’å‰Šé™¤ã—ã¦ã„ãªã„å ´åˆã€æ¬¡ã« rgrep ã—ã‚ˆã†ã¨ã—ãŸã¨ãã« "rgrep: Buffer is read-only: #<buffer *grep*>" ã¨ã„ã‚ã‚Œå®Ÿè¡Œã§ãã¾ã›ã‚“ã€‚ãã®å¯¾ç–ã§ã™ã€‚ (defadvice rgrep (before my-rgrep activate) "*grep*ãƒãƒƒãƒ•ã‚¡ãŒã‚ã‚Œã°ã€ãã‚Œã‚’å‰Šé™¤ã™ã‚‹ã‹ç¢ºèªã™ã‚‹" (when (get-buffer "*grep*") (when (y-or-n-p "ç¾åœ¨ã® *grep* ã‚’å‰Šé™¤ã—ã¾ã™ã‹") (kill-buffer (get-buffer "*grep*")))))

mooz 2010/10/11

rgrep: Buffer is read-only: #<buffer *grep*> ã®å¯¾ç–.

emacs

ãƒªãƒ³ã‚¯

ãƒ›ãƒ¯ãƒƒãƒˆãƒ»ã‚¢ãƒ»ãƒ¯ãƒ³ãƒ€ãƒ•ãƒ«ãƒ»ãƒ¯ãƒ¼ãƒ«ãƒ‰ ã‚¹ã‚¿ãƒƒã‚¯ãƒžã‚·ãƒ³ã¨ãƒ¬ã‚¸ã‚¹ã‚¿ãƒžã‚·ãƒ³

ãªã‚“ã§ç¾ä»£ã®ä¸»æµãª VM (JVM/CLR) ã¯ï¼Œã¨ã‚‚ã«ã‚¹ã‚¿ãƒƒã‚¯ãƒžã‚·ãƒ³ãƒ¢ãƒ‡ãƒ«ãªã‚“ã ã‚ã†â€¦ ? ã¨ã„ã†ç–‘å•ãŒç”Ÿã¾ã‚Œã¾ã—ãŸï¼Ž ã‚ã¨ï¼Œãƒœã‚¹ã‹ã‚‰å‡ºãŸï¼ŒJava ã«ç‰¹åŒ–ã—ã¦ã„ã‚‹ JVM ä¸Šã§ï¼ŒæžœãŸã—ã¦åŠ¹çŽ‡ã®è‰¯ã„å®Ÿè£…ã¯ã§ãã‚‹ã®ã ã‚ã†ã‹ ? ã¨ã„ã†è³ªå•ã«ã‚‚ï¼Œæ˜Žç¢ºã«ç”ãˆã‚‹ã“ã¨ãŒã§ããªãã¦ï¼Œã‚ãŸãµãŸã—ã¦ã—ã¾ã£ãŸã®ã§ï¼Œã¡ã‚‡ã£ã¨èª¿ã¹ã¦ã¿ã¾ã—ãŸï¼Ž é«˜é€Ÿã‹ã¤ç§»æ¤æ€§ã®é«˜ã„ Java Virtual Machine ã®è¨è¨ˆã¨å®Ÿè£… ãªã©ã«ã‚ˆã‚‹ã¨ï¼Œã©ã†ã‚„ã‚‰ã‚¹ã‚¿ãƒƒã‚¯ãƒžã‚·ãƒ³ã«ã¯ï¼Œ (1) ç§»æ¤æ€§ã®ç¢ºä¿ãŒå®¹æ˜“ ãã‚‚ãã‚‚ï¼Œå¤šãã® CPU ã‚¢ãƒ¼ã‚ãƒ†ã‚¯ãƒãƒ£ã¯ãƒ¬ã‚¸ã‚¹ã‚¿ãƒžã‚·ãƒ³ã§ã‚ã‚‹ãŸã‚ï¼Œã€Œãªãœ JVM ã¯ã‚¹ã‚¿ãƒƒã‚¯ã‚¢ãƒ¼ã‚ãƒ†ã‚¯ãƒãƒ£ãªã®ã‹ ?ã€ã¨ã„ã†ç–‘å•ãŒç”Ÿã¾ã‚Œã‚‹ã“ã¨ã¨ãªã‚‹ï¼Ž ä¸€è¦‹ã‚¹ã‚¿ãƒƒã‚¯ã‚¢ãƒ¼ã‚ãƒ†ã‚¯ãƒãƒ£ã¯ï¼Œãƒ¬ã‚¸ã‚¹ã‚¿ã‚¢ãƒ¼ã‚ãƒ†ã‚¯ãƒãƒ£ã¨ã¯å®Ÿè¡Œãƒ¢ãƒ‡ãƒ«ãŒæ ¹æœ¬çš„ã«ç•°ãªã‚‹ãŸã‚ï¼ŒåŠ¹çŽ‡çš„ãªå®Ÿè£…ãŒé›£ã—ãï¼ŒJIT ãªã©ã®å®Ÿè£…ã‚‚é¢å€’ã«ãªã‚Šãã†ãªã‚¤ãƒ¡ãƒ¼ã‚¸ãŒã‚ã‚‹ï¼Ž # ã‚¹

mooz 2010/10/11

å‡¦ç†ç³»

ãƒªãƒ³ã‚¯

ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

ã‚¿ã‚°

2010å¹´10æœˆ11æ—¥ã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (15ä»¶)

ãƒã‚¤ãƒŽãƒãƒŠBlog

EmacsWiki: When To Use If

Yet another icomplete - è²³ä½°ä¼æ‹¾é™¸å¤œæ—¥è¨˜

ãƒ†ã‚¯ãƒ‹ã‚«ãƒ«éŸ³æ¥½å¥½ãã®ä¿ºãŒã‚ˆã†ã¤ã¹ã‹ã‚‰éŸ³æ¥½ã‚’ç´¹ä»‹ã™ã‚‹ã‚¹ãƒ¬ : ã¯ã‚Œãžã†

ã‚µãƒ¼ãƒ“ã‚¹çµ‚äº†ã®ãŠçŸ¥ã‚‰ã›

wait freeã®æ„ç¾©ï¼Ÿ

Ola Bini: Programming Language Synchronicity

Ioke

ç¢ºçŽ‡çš„ãƒãƒ•å¤‰æ›(ç›´ç·š)

XOR linked list - Wikipedia

è¿‘ä»£ãƒ‡ã‚¸ã‚¿ãƒ«ãƒ©ã‚¤ãƒ–ãƒ©ãƒªãƒ¼ã®ç”»åƒã®ä½™ç™½ã‚’åˆ‡ã£ã¦ãƒšãƒ¼ã‚¸åˆ†å‰²ã™ã‚‹ãŸã‚ã®å‡¦ç† - ãƒ‡ãƒ¼

ã—ã¼ã‚ŠãŸã¦ãƒ–ãƒã‚° Canny Edge Detection -ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ -

deferred.el ã®ã§ãã‚‹ã¾ã§ï¼šèª¿æŸ»ã€è¨è¨ˆã¨å®Ÿè£… - æŠ€è¡“æ—¥è¨˜ï¼ kiwanami

grep ãƒãƒƒãƒ•ã‚¡ãŒã‚ã£ã¦ã‚‚ rgrep ã™ã‚‹ - ã‚ã‹ã‚‰ã‚“

ãƒ›ãƒ¯ãƒƒãƒˆãƒ»ã‚¢ãƒ»ãƒ¯ãƒ³ãƒ€ãƒ•ãƒ«ãƒ»ãƒ¯ãƒ¼ãƒ«ãƒ‰ ã‚¹ã‚¿ãƒƒã‚¯ãƒžã‚·ãƒ³ã¨ãƒ¬ã‚¸ã‚¹ã‚¿ãƒžã‚·ãƒ³

ãŠçŸ¥ã‚‰ã›

ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ã—ãŸã‚¨ãƒ³ãƒˆãƒªãƒ¼ã®ã‚¿ã‚¤ãƒˆãƒ«å¤‰æ›´æ©Ÿèƒ½ã®æä¾›ã‚’ä¸€æ™‚çš„ã«åœæ¢ã—ã¾ã™

ã€å¾©æ—§æ¸ˆã€‘ã€Œãƒžã‚¤ãƒ›ãƒƒãƒˆã‚¨ãƒ³ãƒˆãƒªãƒ¼ã€ã€ŒãŠæ°—ã«å…¥ã‚Šã€ã€Œé–¢å¿ƒãƒ¯ãƒ¼ãƒ‰ã€ãŒåˆ©ç”¨ã§ããªã„éšœå®³ãŒç™ºç”Ÿã—ã¦ã„ã¾ã—ãŸ

ä»Šé€±ã®ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯æ•°ãƒ©ãƒ³ã‚ãƒ³ã‚°ï¼ˆ2025å¹´1æœˆç¬¬3é€±ï¼‰

å…¬å¼Twitter

ã‚ãƒ¼ãƒœãƒ¼ãƒ‰ã‚·ãƒ§ãƒ¼ãƒˆã‚«ãƒƒãƒˆä¸€è¦§

ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

å…¬å¼Twitter

ã¯ã¦ãªã®ã‚µãƒ¼ãƒ“ã‚¹

ã‚¿ã‚°

2010å¹´10æœˆ11æ—¥ã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (15ä»¶)

ãŠçŸ¥ã‚‰ã›

ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ã—ãŸã‚¨ãƒ³ãƒˆãƒªãƒ¼ã®ã‚¿ã‚¤ãƒˆãƒ«å¤‰æ›´æ©Ÿèƒ½ã®æä¾›ã‚’ä¸€æ™‚çš„ã«åœæ­¢ã—ã¾ã™

ä»Šé€±ã®ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯æ•°ãƒ©ãƒ³ã‚­ãƒ³ã‚°ï¼ˆ2025å¹´1æœˆç¬¬3é€±ï¼‰

å…¬å¼Twitter

ã‚­ãƒ¼ãƒœãƒ¼ãƒ‰ã‚·ãƒ§ãƒ¼ãƒˆã‚«ãƒƒãƒˆä¸€è¦§

å…¬å¼Twitter

ã¯ã¦ãªã®ã‚µãƒ¼ãƒ“ã‚¹

2010å¹´10æœˆ11æ—¥ã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (15ä»¶)

ãŠçŸ¥ã‚‰ã›

ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ã—ãŸã‚¨ãƒ³ãƒˆãƒªãƒ¼ã®ã‚¿ã‚¤ãƒˆãƒ«å¤‰æ›´æ©Ÿèƒ½ã®æä¾›ã‚’ä¸€æ™‚çš„ã«åœæ¢ã—ã¾ã™

ä»Šé€±ã®ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯æ•°ãƒ©ãƒ³ã‚ãƒ³ã‚°ï¼ˆ2025å¹´1æœˆç¬¬3é€±ï¼‰

å…¬å¼Twitter

ã‚ãƒ¼ãƒœãƒ¼ãƒ‰ã‚·ãƒ§ãƒ¼ãƒˆã‚«ãƒƒãƒˆä¸€è¦§

å…¬å¼Twitter

ã¯ã¦ãªã®ã‚µãƒ¼ãƒ“ã‚¹