Hi I'm using judy to write a small database and have made good headway with the judy1/L team.
But now I am at the junction where I would need a general tree structure. To be specific: - I have no key/value distinction, just a pointer to some data - there is no mapping to integers - all i have is a compare function As a simple exapmple one could imagine some struct with several entries, one of which is a double. And I want the structure to be sorted by that double and have a cmp function to do so. So that I can then insert/delete in logarithmic time. I was thinking of implementing a binary tree using JudL ** to achieve this, but wanted to ask first if this has actually been done already. Thanks Torsten ** To save me going astray and just grabbing the next avl tree from the net. ------------------------------------------------------------------------------ Cloud Computing - Latest Buzzword or a Glimpse of the Future? This paper surveys cloud computing today: What are the benefits? Why are businesses embracing it? What are its payoffs and pitfalls? http://www.accelacomm.com/jaw/sdnl/114/51425149/ _______________________________________________ Judy-devel mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/judy-devel
