🚀 go-pugleaf

Peter van der Linden wrote:
> Christopher Clark  <compudat@cadvision.com> wrote:
> >  Umm...  Hashtables aren't an ordered storage, which would make the
> >sequential part difficult...
> Good point.   Maybe define an enumeration on the hastable as well.
> Or -- if you restrict to fixed length records -- just read the file
> using an input stream.

  AFAIK, an Enumeration on the Hashtable just returns them in hashcode
order.  Great as an "annoy client" and-or "pseudo-random" switch, but
not very practical.  OTOH, a JDK1.2 TreeMap works nicely, if a bit too
deep for index purposes.

  Personally, I'd extend what I saw in "Java Algorithms" to accept a
RandomAccessFile and a (1.2) Map.  Then, you can tailor your index to
you intended access.  (Mind you, I also like hitting myself in the head
with bricks...)

              LE    E.
It's just so F  X  L  .
                 IB    .  :-)

@>-`--,--
Chris Clark                         kitanin@hotmail.com
Compudata Systems Consulting, Inc.  compudat@cadvision.com
                                    ICQ#9342023

  "Now, I wonder who the deuce that could have been?"
		-Sherlock Holmes