> A e6993db3f66061a8d847fabb653e98f9 > B e8464f46af5eaf52aa53a2099295667c > C e8c45a48297de8029d2ed1afeca72e2e > > B is closer to A than C because A&B have the same first byte but at the second > byte 0xc4 is closer to 0x99 than 0x46. > > Firstly am I right in saying this? If not please correct me and ignore the > rest of this.
Indeed. > Oskar described this system as lexographic - which > was what I was thinking when I wrote Store. But in a lexographic system as I > understand it (which is likly to be worlds away from any real defination) B > would be closer to A than C because of the first byte (think alphabetic > ordering). The system is lexicographic. However, it's based on the bytes, not the hexadecimal representation of those bytes. So convert the hex string into a string of full bytes (values of 0 to 255) and then do lexicographic comparisons on them. _______________________________________________ Freenet-dev mailing list Freenet-dev at lists.sourceforge.net http://lists.sourceforge.net/mailman/listinfo/freenet-dev
