Yoshinori Tahara 横æµå¸, ç¥å¥å·ç, Japan 好ããªãã®: Common Lisp, Kinesis, ã¢ã¼ãã³ãã§ã¢, Kensington Expert Mouse 詳細ãããã£ã¼ã«ã表示 ⺠2021 (4) ⺠8æ (3) ⺠1æ (1) ⺠2019 (4) ⺠7æ (4) ⺠2015 (4) ⺠9æ (1) ⺠6æ (1) ⺠4æ (2) ⺠2014 (12) ⺠9æ (2) ⺠7æ (2) ⺠6æ (2) ⺠3æ (1) ⺠2æ (2) ⺠1æ (3) ⺠2013 (13) ⺠11æ (1) ⺠9æ (2) ⺠8æ (2) ⺠7æ (1) ⺠6æ (1) ⺠5æ (1) ⺠4æ (1) ⺠3æ (2) ⺠2æ (1) ⺠1æ (1) ⺠2012 (38) ⺠12æ (1) ⺠11æ (2) ⺠10
ã¯ãã¼ã¸ã£ (å é¨ç¶æ ãä¿æããé¢æ°ãSICP 2 ç« ã§ã¯æ®å¿µãªèª¤ç¨ã¨ããã¦ããã¾ã) ãç¨ãã¦ããã¼ã¿ã«å¯¾ããæç¶ããæ½è±¡åããä¾ãããã¤ããè¦ããã¾ãã ãªãã¸ã§ã¯ãã®åçãã¼ãã¼ éããªãã¸ã§ã¯ãããå¿ è¦ã«å¿ãã¦èªã¿è¾¼ãã ãéæ¾ãããããããã®é¢æ°ãä½ã£ã¦ã¿ã¾ããã (define dynload (opt-lambda (load (post-load void) (unload void)) (let ((o #f)) (values (lambda () (unless o (set! o (load)) (post-load o)) o) (lambda () (when o (unload o) (set! o #f)) #f))))) å©ç¨ä¾: (define search-db (receive (compile done) (dynload (lambda () (q
var funcs = [[],[],[],[]]; for(var i=0;i<3;i++){ // ã°ãã¼ãã«ã®iãåç § funcs[0].push(function(){return i;}); // functionå ã®xãåç § funcs[1].push((function(){ var x = i; return function(){return x;}; })()); // functionå ã®iãåç §ï¼å¼æ°ã§æ¸¡ãï¼ funcs[2].push((function(i){ return function(){return i;}; })(i)); // with()å ã®ãªãã¸ã§ã¯ãã®ããããã£iã®å¤ãåç § with({i:i}){ funcs[3].push(function(){return i;}); } } //çµæåºå:Firebugã§ã for(var i=0;i
Download ;;; closure.el --- Experimental closure prototypes ;; Copyright (C) 2008 Mike Mattie ;; Author: Mike Mattie ;; Version: 961 ;; License: LGPL-V3 ;;; Commentary: ;; these are experimental prototypes. The final versions need to be ;; implemented at the C level. ;;; Code: ;;---------------------------------------------------------------------- ;; definition and creation ;;--------------------
(thanks to id:koyachiãdel.icio.us/rtk2106) OOPã¨FPã¨ãé¢æ°ããªãã¸ã§ã¯ããã¯ãã¼ã¸ã£ã®ä½¿ãåãã«ã¤ãã¦èãã¾ãã é¢æ°åãè¯ãã®ãããªãã¸ã§ã¯ãæåãè¯ãã®ããç¥ãããã¨æã£ã¦ãã¾ãããè²ã ãªãã¼ã¸ãèªã¿ãç¾æç¹ã§ä¸å¿ã®çããå¾ã¾ããã ã«ã¦ã³ã¿ãä¾ã«ãã¦ãé¢æ°ãã¹ã³ã¼ãããªãã¸ã§ã¯ããã¯ãã¼ã¸ã£ã®é ã«è¦ã¦è¡ãã¾ããé¢æ°é¢æ°ã¯å¦çã§ããå ¥åã¨åºåãããã¾ããé¢æ°åããã°ã©ãã³ã°ã§ã¯ãé¢æ°å士ã®å ¥åã¨åºåãé£çµãããã°ã©ã ãæ§æããã¾ãã var current = 0; function next(v){ return v + 1 } function previous(v){ return v - 1 } ok( 1 == ( current = next(current) ) ); ok( 2 == ( current = next(cu
On Lisp ãç解ããããã®ã¡ã¢ã§ãã ãªãã¸ã§ã¯ãæåLisp ãªãã¸ã§ã¯ãæåLispã®ç« ã«ã¯ä»¥ä¸ã®ãããªè¨è¿°ãããã¾ãã CLOSã®å°æ¥ã¯Lispããªãã¸ã§ã¯ãæåã®ãã©ãã¤ã ãåãè¾¼ã¿å§ããå ã«è¦ããããç¥ããªãï¼å®éã«ã¯ï¼Lispã¯ãªãã¸ã§ã¯ãæåã®ãã©ãã¤ã ãä»ãå¤ãããå«ãã§ããã¨è¨ãæ¹ãæ£ç¢ºã ï¼ãããLispã®åºãæµããååã«ã¯ååãç¡ãï¼ãªãã¸ã§ã¯ãæåããã°ã©ãã³ã°ã«ã¯ååãããã®ã§ï¼ç¾å¨ï¼Lispããªãã¸ã§ã¯ãæåè¨èªã ã¨èª¬ãå¾åãããï¼ãLispã¯æ¡å¼µå¯è½ãªè¨èªã§ï¼ãã®å é¨ã§ãªãã¸ã§ã¯ãæåããã°ã©ãã³ã°ã容æã«è¡ãããã¨è¨ãæ¹ãçå®ã«è¿ãã ããï¼ ããã¦ããããæ¸ããã¦ãã¾ãã å®éï¼æ¡å¼µæ§ã¯ãªãã¸ã§ã¯ãæåã¹ã¿ã¤ã«ã®æ大ã®å©ç¹ã®ä¸ã¤ã ï¼ããã°ã©ã ã¯åä¸ã®ã¢ããªã·ãã¯ãªã³ã¼ãã®å¡ã«ãªãã®ã§ã¯ãªãï¼å°ããé¨åæ¯ã«æ¸ããï¼åã ã«ç®çã«å¾ã£ã¦ã©ãã«ãä»ãï¼ãã£ã¦å¾æ¥
ã©ã³ãã³ã°
ã©ã³ãã³ã°
ã©ã³ãã³ã°
ãªãªã¼ã¹ãé害æ å ±ãªã©ã®ãµã¼ãã¹ã®ãç¥ãã
ææ°ã®äººæ°ã¨ã³ããªã¼ã®é ä¿¡
å¦çãå®è¡ä¸ã§ã
j次ã®ããã¯ãã¼ã¯
kåã®ããã¯ãã¼ã¯
lãã¨ã§èªã
eã³ã¡ã³ãä¸è¦§ãéã
oãã¼ã¸ãéã
{{#tags}}- {{label}}
{{/tags}}