https://github.com/kazu-yamamoto/bst

Binary search tree based on a logarithmic method
https://github.com/kazu-yamamoto/bst

Last synced: about 1 month ago
JSON representation

Binary search tree based on a logarithmic method

• Host: GitHub
• URL: https://github.com/kazu-yamamoto/bst
• Owner: kazu-yamamoto
• Created: 2010-08-18T02:11:48.000Z (about 14 years ago)
• Default Branch: master
• Last Pushed: 2011-02-10T05:19:42.000Z (almost 14 years ago)
• Last Synced: 2024-05-09T14:58:23.215Z (6 months ago)
• Language: Haskell
• Homepage:
• Size: 3.65 MB
• Stars: 8
• Watchers: 4
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# 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