Binary search tree based on a logarithmic method
Haskell Shell Python Ruby
Switch branches/tags
Nothing to show
Latest commit d2c3d27 Feb 10, 2011 @kazu-yamamoto adding a file.
Permalink
Failed to load latest commit information.
Data
benchmark-rational
benchmark
benchmark2
omega
test
test2
.gitignore
README.md

README.md

Sized binary search tree

  • Nievergelt & Reingold <1+sqrt 2,sqrt2> (METHOD=1)
  • Roura (METHOD=2)
  • Adams (4,2) (METHOD=3) -- this is the default code
  • Adams (3,2) (METHOD=4)
  • Nievergelt & Reingold <3,2> (METHOD=5)

Tests with HUnit and QuickCheck

You can run tests:

% cd test
% runghc -i.. -DMETHOD=1 Test.hs
% runghc -i.. Test.hs --maximum-generated-tests=10000 -t difference