On 25/02/2014, at 8:28 AM, Alan Silverstein wrote: > John et al, thanks for playing -- > >> First: lets assume multiples of word size only. > > Not really nice, although presently built into JudyNL of course. > >> This is WLOG due to the Ocaml trick... > > WLOG? Ocaml?
WLOG is mathspeak for Without Loss of Generality. Sorry :) Ocaml is a programming language. Ocaml strings are multiple words with null padding at the end plus an indicator how many bytes of padding got added. > >> ...store the length of the string modulo word size at the end of the >> string. > > OK, that means on a 4-byte machine, a value of 0-3 at the end of the > string? How do you distinguish this from any random bits within the > key? There's a length control, but it counts machine words of the string not bytes. > >> Or something like this .. :) > > Or something. :-) The data structure is well document in Ocaml. So we know it works :) > > Careful with that, look at the header files, there are already bit > patterns stored within Judy node pointers that libJudy itself uses. > This includes a root pointer to a whole JudyL array. Oops :) -- john skaller [email protected] http://felix-lang.org ------------------------------------------------------------------------------ Flow-based real-time traffic analytics software. Cisco certified tool. Monitor traffic, SLAs, QoS, Medianet, WAAS etc. with NetFlow Analyzer Customize your own dashboards, set traffic alerts and generate reports. Network behavioral analysis & security monitoring. All-in-one tool. http://pubads.g.doubleclick.net/gampad/clk?id=126839071&iu=/4140/ostg.clktrk _______________________________________________ Judy-devel mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/judy-devel
