On Aug 17, 2012, at 7:22 PM, John Clizbe <[email protected]> wrote:
> Jeffrey Johnson wrote: > …snip… > As you see, all the files in KDB are created/opened as BTrees. However, I need > to check which value is the sort key of the table key, keyID or hash. > Sorry for not looking. I'm also assuming that the dump is a sequential iteration using DB_NEXT (again unchecked). AFAIK, the leaves on the btree are returned sorted (wrto the key) under these assumptions. >> The one _ESSENTIAL_ additional change might be to override >> the key comparison with memcmp (the default in Berkeley DB) if >> little endian integers were somehow used as keys. > > I believe that's handled by the Ocaml runtime. I'll check after dinner > Nice! 73 de Jeff _______________________________________________ Sks-devel mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/sks-devel
