search

hashsplit / hashsplit-spec

The Unlicense
7 stars 3 forks source link

The tree construction algorithm #19

Closed bobg closed 4 years ago

bobg commented 4 years ago

This description of the algorithm for building a hashsplit tree is based on the existing implementation at https://github.com/bobg/hashsplit.

bobg commented 4 years ago

Apologies to @cole-miller. I am happy to defer to your work in https://github.com/hashsplit/hashsplit-spec/pull/12 if you intend to finish it, but it's been a few weeks.

cole-miller commented 4 years ago

No, you're quite right! Thanks for taking this on.

bobg commented 4 years ago

I feel like there ought to be a way to formulate this that mirrors SPLIT

I have an idea of how to do a more algebraic (as opposed to procedural) description of TREE_C(X), but not a terribly clear one yet. How would you feel about merging the current change and tackling this in a followup PR?

zenhack commented 4 years ago

Works for me; looking forward to the followup.

bobg commented 4 years ago

Groovy, thanks. Preview of work in progress here: https://github.com/hashsplit/hashsplit-spec/compare/master...bobg:algebraic-tree