| commit | ada02b061aac7cbbf43145beaf5d27d78f9e9fcc | |
| author | Nikodemus Siivola <nikodemus@random-state.net> | |
| Mon, 8 Mar 2010 08:46:37 +0000 (8 10:46 +0200) | ||
| committer | Nikodemus Siivola <nikodemus@random-state.net> | |
| Tue, 9 Mar 2010 14:21:32 +0000 (9 16:21 +0200) | ||
| tree | 8276b844d2bd0e69c102dafca2e64dcb2dd6552d | treesnapshot (tar.gz zip) |
| parent | d4a72df548269ed8cffb35876307c6ecb20625c1 | commitdiff |
faster WHICHEVER
Call RANDOM just once, and build an inline binary search tree
for O(log n) goodness instead of O(n).
Patch by: Gustavo <gugamilare@gmail.com>
Call RANDOM just once, and build an inline binary search tree
for O(log n) goodness instead of O(n).
Patch by: Gustavo <gugamilare@gmail.com>
| control-flow.lisp | diffblobblamehistory |