You are right. There is currently both an array (used for finding the closest reference, no one has been bothered to build a tree) and a Hash. A serialization just has to be a list of these triplets, and then read each one, and put it in the array, as well as in the hashtable.
On Thu, 13 Apr 2000, Bill Trost wrote: > Brandon writes: > > What needs to go into the datastore? > > It`s just a hash table of keys to filenames. > > Uh, more than that, isn't it? Offhand, I would expect an ordered list > of (hash, address, optional-filename) triples. The order tells you > which one gets thrown out of the cache next. > > Anything else I'm missing? My description seems to match class > DataStoreItem in StandardDataStore.java. > > _______________________________________________ > Freenet-dev mailing list > Freenet-dev at lists.sourceforge.net > http://lists.sourceforge.net/mailman/listinfo/freenet-dev -- Oskar Sandberg md98-osa at nada.kth.se #!/bin/perl -sp0777i<X+d*lMLa^*lN%0]dsXx++lMlN/dsM0<j]dsj $/=unpack('H*',$_);$_=`echo 16dio\U$k"SK$/SM$n\EsN0p[lN*1 lK[d2%Sa2/d0$^Ixp"|dc`;s/\W//g;$_=pack('H*',/((..)*)$/) _______________________________________________ Freenet-dev mailing list Freenet-dev at lists.sourceforge.net http://lists.sourceforge.net/mailman/listinfo/freenet-dev
