| /**Below are 2 implementations of the same function for checking whether a binary tree is sorted. isSortedA was made by myself as an answer to an exercise in FP in Scala. isSortedB was found on github as an answer to the same exercise. I assume isSortedB is better, but can anyone tell me why (other than the fact that I left out @annotation.tailrec).*/ | |
| def isSortedA[A](as: Array[A], gt: (A, A) => Boolean): Boolean = { | |
| def go(n: Int): Boolean = { | |
| if (n <= 0) true | |
| else if (!gt(as(n), as(n-1)))false | |
| else go(n-1) | |
| } | |
| go(as.length-1) | |
| } |
In August 2007 a hacker found a way to expose the PHP source code on facebook.com. He retrieved two files and then emailed them to me, and I wrote about the issue:
http://techcrunch.com/2007/08/11/facebook-source-code-leaked/
It became a big deal:
http://www.techmeme.com/070812/p1#a070812p1
The two files are index.php (the homepage) and search.php (the search page)
| (ns jquerytest.core) | |
| (def jquery (js* "$")) | |
| (jquery | |
| (fn [] | |
| (-> (jquery "div.meat") | |
| (.html "This is a test.") | |
| (.append "<div>Look here!</div>")))) |