On 24/10/2012, at 12:37 PM, Alan Silverstein wrote: > > Yes, all searches require a non-null starting point, but it's just a > numeric value, not a pointer, so how did it "crash"?
Because Tim is using JudySL, the key for that is a pointer to a char array not a numeric value. > > 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. Me too. Probably starting with IBM VSAM. I think that was one of the first abstract keyed access file systems. Before that keyed searching was actually -- would you believe it -- done by the disk drive in *hardware*. In those days, disks had tracks .. but no sectors. Hmm .. 5Meg removable drives weighed a ton, had 19 platters, and if you were caught smoking with a mile of one you got fired, because a single particle of dust of smoke could cause a head crash. Hey, that would be a good name for a Techno band, "Head Crash". > But > libJudy is so abstract that all kinds of object naming was a problem, Well, the only problem with Judy is the unconventional leading uppercase letter, kind of spoils nice lists of data structures to have just one starting with a capital :) -- john skaller [email protected] http://felix-lang.org ------------------------------------------------------------------------------ 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
