> The second problem is that First doesn't mean first in the > array it means >= the key. So you have 5 search operators: > > >= > == < <= > > ALL of which require a valid input key. The names First, > Next, Get, Prev, Last, are a bit unconventional > (Ge, Gt, Eq, Lt, Le) would have been better. But they're just > names, the actual C interface is perfect.
My bad, I thought First/Next/Prev/Last was a good model, over 10 years ago. Yeah, in hindsight GE/GT/LT/LE might have been better, although I would uppercase both letters of the abbreviation. :-) Yes, all searches require a non-null starting point, but it's just a numeric value, not a pointer, so how did it "crash"? As you said, at a deeper level I think the concept of searching either inclusive or exclusive of the starting point was a solid concept... I'd seen the same "design pattern" many times before in other contexts. But libJudy is so abstract that all kinds of object naming was a problem, including the name of the package itself! Cheers, Alan Silverstein ------------------------------------------------------------------------------ Everyone hates slow websites. So do we. Make your web apps faster with AppDynamics Download AppDynamics Lite for free today: http://p.sf.net/sfu/appdyn_sfd2d_oct _______________________________________________ Judy-devel mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/judy-devel
