|
From: Geoff H. <ghu...@ws...> - 2002-11-07 23:42:16
|
On Mon, 4 Nov 2002, Neal Richter wrote: > > mapping and you're consistently doing comparisons for *every* key, > > you're fine. The ordering will be different on the compressed strings, > > but as long as everything is unique, I can't think of a problem. > > This is a lot of calls! Yes. But as I said, I don't remember enough of the Berkeley DB details to know if that's the only method for comparing keys. If we change it, will things stay consistent? -- -Geoff Hutchison Williams Students Online http://wso.williams.edu/ |