On Tue, Nov 27, 2001 at 07:11:42PM -0500, Tavin Cole wrote: > On Tue, Nov 27, 2001 at 06:54:24PM -0500, Gianni Johansson wrote: <> > > I'm getting the keys from TreeRoutingTable.refTable.elements(). I discard > > the 32 (hex) digit ones, because they don't look like keys to data. > > Does this seem legit to you? > > Yes. All the real keys will be 23 bytes and end in 0x0302 or 0x0203. > The others are probably there from seeding the routing table either > manually or as a result of another node announcing itself. What do > they end in? 0x0000?
Can we use some matching of the keytype bytes instead of the length of the keys to determine this? It is not ok to assume that that keys will always have any length. Any distribution of the keys should be based only on the first single or half byte anyways. Gianni: How are you making the Histograms? I know of one set of Histograming tools under the FreeHep program, called Aida - http://java.freehep.org/ - though I doubt it works under 1.1 as graphics was generally bad before 1.2... Also, wouldn't it be nicer if we got this on the same port as the http access? It really needs some sort of authorization, and so should fit with http based administration access. Using the same visualization stuff for the Diagnostics data would be nice as well (feel free to add more diagnostics fields). -- Oskar Sandberg oskar at freenetproject.org _______________________________________________ Devl mailing list Devl at freenetproject.org http://lists.freenetproject.org/mailman/listinfo/devl
