> ...Still, find-between would certainly perform better than running > Next and then checking if the returned key is outside your bounds.
You know I'm not so sure? It's easy to forget how efficient the Judy tree is at prev/next operations, because of how the tree is built and populated internally. Also as Doug used to be fond of pointing out, once you get something into CPU cache it's "instantaneous" to rereference it. So doing a vanilla JudySL prev/next and then looking at the result might not be too expensive compared with some new API that was smarter about range lookups. We tend to assume that hunting through 1M elements takes 1M longer than one element, but neighbor elements (however far apart in index space) are nearly constant time to step across (on average). You can't really know until you do some experiments and measurements. Although without a new API there's a limit to what you can compare against. Cheers, Alan Silverstein ------------------------------------------------------------------------------ Monitor your physical, virtual and cloud infrastructure from a single web console. Get in-depth insight into apps, servers, databases, vmware, SAP, cloud infrastructure, etc. Download 30-day Free Trial. Pricing starts from $795 for 25 servers or applications! http://p.sf.net/sfu/zoho_dev2dev_nov _______________________________________________ Judy-devel mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/judy-devel
