• Nikodemus Siivola's avatar
    faster WHICHEVER · ada02b06
    Nikodemus Siivola authored
     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>
    ada02b06
control-flow.lisp 4.96 KB