> search would work fine. > > The circular comparison, by the way, is a special case, and I don't think > the topology of the comparison space is likely to become any more > complicated. > > I did find the code for doing keys a bit confusing - If all that's being > used for keys are SHA1 hashes, why aren't they just byte arrays of length > 20? Because they dont have to be SHA1 hashes. I'm not entriely sure what you mean by this statement. -------------- next part -------------- A non-text attachment was scrubbed... Name: not available Type: application/pgp-signature Size: 232 bytes Desc: not available URL: <https://emu.freenetproject.org/pipermail/devl/attachments/20000804/dc7fb874/attachment.pgp>
- [Freenet-dev] Other versions... Will Dye
- [Freenet-dev] Other versions... Adam Langley
- [Freenet-dev] Other versions... Ian Clarke
- [Freenet-dev] Other versions... Bram Cohen
- [Freenet-dev] Datastore form... Henry Hemming
- [Freenet-dev] Datastore form... Oskar Sandberg
- [Freenet-dev] Datastore form... Henry Hemming
- [Freenet-dev] Datastore form... Oskar Sandberg
- [Freenet-dev] Datastore form... Scott G. Miller
- [Freenet-dev] Datastore formats ... Bram Cohen
- [Freenet-dev] Datastore form... Scott G. Miller
- [Freenet-dev] Datastore form... Brandon
- [Freenet-dev] Datastore form... Oskar Sandberg
- [Freenet-dev] Datastore form... Oskar Sandberg
- [Freenet-dev] Datastore form... Bram Cohen
- [Freenet-dev] Datastore formats and s... Greg Titus
- [Freenet-dev] Datastore formats and scalability [email protected]
- [Freenet-dev] Datastore formats and scalability Brandon
- [Freenet-dev] Datastore formats and scalabili... Travis Bemann
- [Freenet-dev] Datastore formats and scala... Brandon
- [Freenet-dev] Datastore formats and s... Travis Bemann
