tag:blogger.com,1999:blog-3227963714264318937.comments2012-01-25T20:45:54.133-08:00Coding PatternsGabe Mootharthttps://plus.google.com/114088255262950905963noreply@blogger.comBlogger10125tag:blogger.com,1999:blog-3227963714264318937.post-72184794236066968832012-01-25T20:45:54.133-08:002012-01-25T20:45:54.133-08:00"This is really only a proof-of-concept, of c..."This is really only a proof-of-concept, of course. You can't use Lisp in a real project because nobody knows Lisp. "<br /><br />I know Lisp and use it on real projects.Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-3227963714264318937.post-28059923471701483982011-11-26T03:08:43.509-08:002011-11-26T03:08:43.509-08:00(floor (fromIntegral n/2))
should be written as
...(floor (fromIntegral n/2))<br /><br />should be written as<br /><br />(n `div` 2)Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-3227963714264318937.post-53932388653854231812010-12-10T01:36:03.767-08:002010-12-10T01:36:03.767-08:00Glad to find another Colemak user. I am learning C...Glad to find another Colemak user. I am learning Colemak for 3 days. <br /><br />Unlearning Qwerty is a hard process. D and G, S and R is often mistaken :-)<br /><br />But my hands don't hurt any more. They are just confused.Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-3227963714264318937.post-82848019741457877552010-02-09T21:12:38.193-08:002010-02-09T21:12:38.193-08:00(Note, I'm using F[0] = 0, F[1] = 1, F[2] = 1,...(Note, I'm using F[0] = 0, F[1] = 1, F[2] = 1, F[3] = 2, ...<br />Thus indicies which are multiples of three give even Fibonacci numbers.)<br /><br />By the recursion relation:<br />Sum[F[3*i],{i,0,n}] = Sum[F[3*i-1] + F[3*i-2],{i,1,n}] = Sum[F[i],{i,0,3*n}] / 2.<br /><br />From the analytical form, F[n] = (phi^n - (-1/phi)^n)/sqrt(5), you can derive:<br />Sum[F[i],{i,0,n}] = F[n+2] - 1.<br /><br />Then for large enough arguments, you can approximate F[n] as phi^n / sqrt(5):<br /><br />phi = (1 + sqrt(5))/2<br />f = 4000000<br />n = floor(log(sqrt(5)*f)/log(phi))<br />n = n - n mod 3<br />ans = (floor(phi^(n+2) / sqrt(5) + 1/2) - 1) / 2<br /><br />Anyway, thanks for the interesting post. I'm going to have to give Haskell a shot. Hope you have fun with Project Euler.Franknoreply@blogger.comtag:blogger.com,1999:blog-3227963714264318937.post-7296686288568863602009-01-27T01:50:00.000-08:002009-01-27T01:50:00.000-08:00Thanks for writing up this nice little script, cha...Thanks for writing up this nice little script, chaining is what i liked the most in your code, this definitely makes dom building a nicer experience. But one thing which is bugging me is that, everytime I call the domBuilder method it loops through the <B>autoTags[]</B> array and creates those functions again and again, don't you think creating those functions each time should be avoided....one last thing that is can you please explain a little bit why did you store 'parent_el.document' in the 'document' property of 'that' object, it's not clear to me or may b I am missing something, but if I remove that line, I get an error. anyway thanks again for the effort....Arnabcnoreply@blogger.comtag:blogger.com,1999:blog-3227963714264318937.post-28621237268992222462008-04-20T21:23:00.000-07:002008-04-20T21:23:00.000-07:00Agreed! I have found this to the be case in my ex...Agreed! I have found this to the be case in my experience as well.Daniel Peckhamhttp://focus.tracinglight.comnoreply@blogger.comtag:blogger.com,1999:blog-3227963714264318937.post-73354699048633440342007-10-10T14:26:00.000-07:002007-10-10T14:26:00.000-07:00I've been getting some feedback that these links a...I've been getting some feedback that these links aren't working for everyone. I'll try to get that fixed. In the meantime, sorry!Gabehttp://www.blogger.com/profile/16926123100967129905noreply@blogger.comtag:blogger.com,1999:blog-3227963714264318937.post-83972702572341683892007-10-09T17:02:00.000-07:002007-10-09T17:02:00.000-07:00Dan,Thanks for stopping by!Dan,<BR/>Thanks for stopping by!Gabehttp://www.blogger.com/profile/16926123100967129905noreply@blogger.comtag:blogger.com,1999:blog-3227963714264318937.post-43285028029141184772007-10-08T10:50:00.000-07:002007-10-08T10:50:00.000-07:00Hi Gabe, looking forward to reading this blog.Hi Gabe, looking forward to reading this blog.Daniel Phttp://focus.tracinglight.com/noreply@blogger.comtag:blogger.com,1999:blog-3227963714264318937.post-13964530023550107972007-10-03T09:04:00.000-07:002007-10-03T09:04:00.000-07:00Test CommentTest CommentGabehttp://www.blogger.com/profile/16926123100967129905noreply@blogger.com