2007-05-01ãã1ã¶æéã®è¨äºä¸è¦§
è¨èªãé¸ã¶åºæº - lethevert is a programmerPerlã§æ¸ãã¨Rubyã¿ããã«ãªãããªã¨æã£ã¦ããã© sub f { my $x = shift; my $g = sub { my $y = shift; $x + $y }; my $h = sub { my $x = shift; $g->(10) }; $h; } print f(10)->(1), "\n"; $ perl hoge.pl 2â¦
ãã¥ã¼ãã£ãªã¹ãå®£è¨ (ã¡ãã¾æ°æ¸)ä½è : æ¢ ç°æ夫,èæ¨å¥ä¸éåºç社/ã¡ã¼ã«ã¼: çæ©æ¸æ¿çºå£²æ¥: 2007/05/08ã¡ãã£ã¢: æ°æ¸è³¼å ¥: 15人 ã¯ãªãã¯: 170åãã®ååãå«ãããã° (696件) ãè¦ãã¨ããããèªãã ï¼èæ¨ããã®æ¬ã¯èªãã ãã¨ç¡ãã£ãã®ã ãæ¢ ç°ãâ¦
Error - Houston ChronicleGoogle Trendsã®æ°ããæ©è½ï¼æè¿æãæ¤ç´¢ããããã¼ã¯ã¼ãTop100ãåºåããï¼ç¾å¨ã®Top10ã¯ãããªæã 1. singer irene 2. fellini film 3. monokini designer gernreich 4. julianne hough 5. what did mill mahar say was a wayâ¦
404 Blog Not Found:ããããPHPã«é¢ãã¦ä¸è¨ãã£ã¨ããé£ãè¨äºã ã¨ã¯æãã®ã ããããããã©ãã¯ããã¯ããã¦ããã®ã§ï¼ãã¾ãphpãç¥ããªã身ã¨ãã¦ã¯åå¼·ã«ãªãï¼ ITT-WEB - Dankogaiã¯PHPã®å¤æ ãæ¼ããã¦ããããç¥ã£ã¦ã¯ããªã ãã¼ãããã¡ - ãã¼ãâ¦
ã¢ã³ããã¤ãã¯é»æ°ç¾ã®å¤¢ãè¦ãã? (ãã¤ã«ã¯æ庫 SF (229))ä½è : ãã£ãªããã»Kã»ãã£ãã¯,ã«ãã¼ãã¶ã¤ã³:åäºå®æ(ãã¸ããã³),æµ åä¹ å¿åºç社/ã¡ã¼ã«ã¼: æ©å·æ¸æ¿çºå£²æ¥: 1977/03/01ã¡ãã£ã¢: æåº«è³¼å ¥: 70人 ã¯ãªãã¯: 769åãã®ååãå«ãããã° (418â¦
erlangã¯ããã»ã¹ãã¨ã«ãã£ã¯ã·ã§ããªãæã£ã¦ããï¼putã§å¤ãããï¼getã§åå¾ãï¼eraseã§æ¶ãï¼ 1> put(foo, {1, 2, 3}). undefined 2> put(bar, "hoge"). undefined 3> get(foo). {1,2,3} 4> get(bar). "hoge" 5> get(). [{foo,{1,2,3}},{bar,"hoge"}] 6>â¦
é£æ³æ¤ç´¢ã¨ã³ã¸ã³ reflexaé£æ³æ¤ç´¢ã¨ã³ã¸ã³ï¼ãâ¯â¯ã¨ããã°ÃÃãã¨ããå½¢å¼ã®æ¤ç´¢ãè¡ãï¼wikipediaã®ãã¼ã¿ã使ã£ã¦ãããããï¼åºæ¬çã«åè©ããæ¤ç´¢ã§ããªããããªã®ã§ï¼è©ä¾¡ãåä½ï¼æ©è½ãªã©ãé£æ³ããã¨ããããã«ã¯ãããªãããã
å°æ³æ¿æ¨©âãããã¹ã®é¦ç¸ãã¯ä½ãå¤ããã®ã (ä¸å ¬æ°æ¸)ä½è : å å±±èåºç社/ã¡ã¼ã«ã¼: ä¸å¤®å ¬è«æ°ç¤¾çºå£²æ¥: 2007/04ã¡ãã£ã¢: æ°æ¸è³¼å ¥: 1人 ã¯ãªãã¯: 22åãã®ååãå«ãããã° (40件) ãè¦ãå°æ³æ¿æ¨©5å¹´5ã¶æã«å¯¾ãã¦ï¼é¦ç¸ãå¼·ããªã¼ãã¼ã·ãããæã£ã¦â¦
What's new in Perl 5.10?Nordic Perl WorkShopã®ã¹ã©ã¤ãï¼'use feature'ã使ããã¨ã§Perl6ã®æ©è½ãçµæ§ä½¿ãããããï¼ã±ã£ã¨è¦ãã¨ãã sayã使ãã ãããã¯ã«å±ããstateå¤æ° switchæã®ãµãã¼ãï¼ smart hash æ£è¦è¡¨ç¾ãtrieæé©åå¯è½ ãã®è¾ºããããâ¦
Google DriveC#-likeãªpropertyãjavaã«å°å ¥ããããããããªãï¼ãããã«ç¡é§ã«getter/setterãå¤ãã¦èªã¿ã«ããï¼IDEãèªåçæãã¦ãããã¨ããã®ãéã«ç¡æå³ã«getter/setterãå¢ããã¦ããæ°ãããï¼
Perlã§ã¯UTF8æååã§ãã«ããã¤ããªãã¡ã¤ã«åãã¡ããã¨æ±ããªãã¨ãã話ãæ¸ãã¦ããã¦ãã ãã㪠- æµ ååå¸ï¼ blog風å³ï¼ - ã²ã¨ãã§ãã°ã«ã¼ã 404 Blog Not Found:perl - utf8ãªãã¡ã¤ã«å æ´å²ã¯ç¹°ãè¿ããã®ã㪠- æµ ååå¸ï¼ blog風å³ï¼ - ã²ã¨ãã§â¦
ç²¾éã®å®ã人 (æ°æ½®æ庫)ä½è : ä¸æ©èç©ååºç社/ã¡ã¼ã«ã¼: æ°æ½®ç¤¾çºå£²æ¥: 2007/03/28ã¡ãã£ã¢: æåº«è³¼å ¥: 14人 ã¯ãªãã¯: 135åãã®ååãå«ãããã° (334件) ãè¦ãæ±æ´é¢¨ãã¡ã³ã¿ã¸ã¼ï¼10å¹´åãããããã·ãªã¼ãºãç¶ãã¦ãã¦æè¿æ庫åããããããï¼å ç«¥â¦
ãããã¦ã¿ã¦ãããã (ã¤ã³ã°ã¬ã³ã¬ã³ã³ããã¯ã¹)ä½è : ãã¨åºç社/ã¡ã¼ã«ã¼: ã¹ã¯ã¦ã§ã¢ã»ã¨ããã¯ã¹çºå£²æ¥: 2007/04/25ã¡ãã£ã¢: ã³ãã㯠ã¯ãªãã¯: 41åãã®ååãå«ãããã° (56件) ãè¦ãWeb漫ç»ã§çµæ§æåã ã£ããã®ããã¤ã®ã¾ã«ãã³ããã¯ã«ãªã£ã¦â¦
ãªãsplit $;, $_[1]ãªã®ãã¯å®¿é¡ã¨ãããã¨ã§ã 404 Blog Not Found:perl - åæã«æ¡å¼µ - tie my %hash, 'FizzBuzz' $;ã£ã¦ä½ã¨æã£ãã®ã§perldoc perlvar The subscript separator for multidimensional array emulation. If you refer to a hash element â¦
ã©ããã¦ããã°ã©ãã«ã»ã»ã»ããã°ã©ã ãæ¸ããªãã®ã? Perlã ã¨ããæ¸ããããªã®ã§ï¼åå¼·ä¸ã®Erlangã§æ¸ãã¦ã¿ãï¼ -module(f). -export([fizzbuzz/0]). fizzbuzz() -> lists:foreach(fun(X) -> io:format("~p~n", [fizzbuzz(X)]) end, lists:seq(1, 100)).â¦
åèªã®æå³ã大éæã«ç¥ãããã®ãµã¼ãã¹ï¼èªã®å®ç¾©ã¯ä»¥ä¸ã®ããã«æ½åºããããããï¼ èªã®å®ç¾©ããã¦ããããªæãæ¢ãã¢ã¸ã¥ã¼ã«ãã®ã¢ã¸ã¥ã¼ã«ã¯ã人éãæ¤ç´¢ã¨ã³ã¸ã³ã使ã£ã¦èªã®å®ç¾©ãæ¢ãéã«ã人éããããããªè¡åã人éãããããªå¤æã模å£ã§ããªãâ¦
æåã³ã¼ããæå®ãã¦éã C-x RET c æåã³ã¼ããå ¥å RET C-x C-f éããªãã C-x RET c æåã³ã¼ããå ¥å RET C-x C-v RETã ããã§ãã emacsã§æåã³ã¼ããæå®ãã¦éã - PCæ¥è¨ èªåå¤å¥ã失æããã¨ãã«ä½¿ããï¼
The Way of Testivus If you write code, write tests. Donât get stuck on unit testing dogma. Embrace unit testing karma. Think of code and test as one. The test is more important than the unit. The best time to test is when the code is freshâ¦
ã¬ã¼ããçã§ããã¨ãã«bodyãå®è¡ãããï¼when ...ã§æå®ããï¼ä¾ãã°ï¼çµ¶å¯¾å¤ãæ±ããabs/1ã¯ä»¥ä¸ã®ããã«å®ç¾©ã§ããï¼ abs(N) when N >= 0 -> N; abs(N) -> -N.
ã¬ã¼ãã§æå®ããªãã¦ãifã§æ¡ä»¶åå²ã§ãã abs(N) -> if N >= 0 -> N; true -> -N end. æ§æ㯠if Condition1 -> Expr1; ... ConditionN -> ExprN end
ãã¿ã¼ã³ãããã®æ¡ä»¶åå²ãCaseã使ã£ã¦å³è¾ºã«æ¸ããã¨ãã§ããï¼æ§æ㯠case Expr of Pattern1 -> Expr1; ... PatternN -> ExprN end ããã§qsortãæ¸ãæããã¨ï¼ qsort(List) -> case List of [] -> []; [Pivot|Rest] -> qsort([X || X <- Rest, X =< Piâ¦
funã使ãã¨ç¡åé¢æ°ãä½ããã¨ãã§ããï¼ 4> F = fun(X) -> X+1 end. #Fun<erl_eval.6.72228031> 5> F(1). 2 6> F(2). 3ããã使ã£ã¦é«éé¢æ°ãæ¸ããã¨ãã§ããï¼ä¾ãã°qsortã«æ¯è¼é¢æ°ãæå®ã§ããï¼ qsort([], _) -> []; qsort([Pivot|Rest], Func) -> qsort([X || X <- Rest,</erl_eval.6.72228031>â¦
integerã¨floatãããï¼ 1> 42. 42 2> 3.14. 3.14000$ã§æåcharã®å¤ 3> $A. 65 4> $a. 97 5> $\t. 9base#numberã§baseé²æ°ã®numberã®å¤ï¼å¥ã«2,8,16é²æ°ã«éã£ã¦ããªãï¼ 6> 2#1111. 15 7> 8#777. 511 8> 3#10. 3 9> 16#ff. 25536é²æ°ã§æ¢ã¾ã£ãï¼ 12> 36#1â¦
reference manualã«ããã¨ï¼ An atom is a literal, a constant with name. ãã¾ãã¡ç解ãã¦ããªããï¼èª¬æãã«ããï¼ãã©ã°ã¨ãã«ä½¿ããã¦ããï¼''ã§å²ã¾ããæååãï¼[a-z][\w@]*ã®å½¢å¼ãã¨ãæååãã¢ãã ã«ãªãï¼ã®ã§ï¼ä»¥ä¸ã®ç©ã¯ã¢ãã ï¼ foo foo_baâ¦
Erlangã«ã¯Booleanåã¯ãªãï¼trueã¨falseã¨ããã¢ãã ã®ã¿åå¨ããï¼and,or,xor,notã®è«çæ¼ç®åãå©ç¨ã§ããï¼ 1> true. true 2> false. false 3> true and true. true 4> true and false. false 5> true or false. true 6> false or false. false 7> true â¦
è¤åãã¼ã¿åï¼åè¦ç´ ã¸ã®ã¢ã¯ã»ã¹ã¯éãï¼ãªãã©ã«ã¯{}ã§å²ã¾ããè¦ç´ ã§è¡¨ç¾ããï¼ æ§é ä½ã表ç¾ããã®ã«å©ç¨ãããï¼ 23> T = {"john", 23, male, {jan, 6}}. {"john",23,male,{jan,6}}BIF(built-in function)ã¨ãã¦element, setelement, sizeãªã©ãããï¼â¦
è¤åãã¼ã¿åï¼åè¦ç´ ã¸ã®ã¢ã¯ã»ã¹ã¯é ãï¼[]ã§å²ã¾ããè¦ç´ ã§è¡¨ç¾ãã 27> [1,2,3,4,5]. [1,2,3,4,5]prologã¿ãã[|]ã§headã¨tailã表ãï¼[|]ã¯2é æ¼ç®åã§consã¨å¼ã³ï¼[]ã¯å®æ°ã§nilã¨å¼ã¶ãããï¼ 6> [1 | [2 | []]]. [1,2]BIFã¨ãã¦hd, tl, sizeãªã©ããâ¦
æååã¯""ã§å²ã 30> "erlang". "erlang"æååã¯æå(æ°å¤)ã®ãªã¹ããªãã§ä»¥ä¸ã®ããã«è¡¨ç¾ã§ããï¼ 31> [$e, $r, $l, $a, $n, $g]. "erlang"ãªã¹ããªãã§é£çµå¯è½ 32> "hello, " ++ "erlang". "hello, erlang"
é常ã®å¤§å°ï¼åå¤æ¯è¼æ¼ç®ï¼ 40> 1 == 2. false 41> 1 /= 2. true 42> 1 < 2. true 43> 1 > 2. false 44> 1 =< 2. true 45> 1 >= 2. falseåå¤ã§ãªãã®ã¯/=ã§è¡¨ç¾ãï¼less thanãç°ãªãåãæ¯è¼ããã¨ãã¯åã®å¤§å°ãæ¯è¼ãããããï¼ä»¥ä¸ã®ãããªåã®é åºãâ¦
[ Expr || Qualifier1, ..., QualifierN]ã§è¡¨ç¾ããï¼QualifierIã¯trueãfalseãè¿ãæ¡ä»¶ãX ããããä¾ã¨ãã¦quicksort -module(foo). -export([qsort/1]). qsort([]) -> []; qsort([Pivot|Rest]) -> qsort([X || X <- Rest, X =< Pivot]) ++ [Pivot] ++ qsâ¦