On Monday 2007 July 16, Johannes Schindelin wrote:
The biggest obstacle was a thinko about the scalability. Tree objects
take free form name entries, and therefore a binary search by name is not
possible.
I might be misunderstanding, but in the case of the notes tree objects isn't
it true that the name entries aren't free form, but are guaranteed to be of a
fixed length form:
XX/XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
In which case you can binary search?
Andy
--
Dr Andy Parkins, M Eng (hons), MIET
andyparkins@gmail.com