🚀 go-pugleaf

        Thanks, I am trying  to do it works now, but I fell some confusing
about the Collection, Iterators and this structures, do you know any good
book or link with this topics?


John P. McGrath <JPMcGrath@fast.net> escribi� en el mensaje de noticias
MPG.12e8a841e91bc97998972e@forums.borland.com...
> On Thu, 13 Jan 2000 08:02:05 -0400, Patricio Vera S. wrote:
>
> FYI, cross-posting is against the rules for this news server.
>
> > I need load some tables to memory for a rapid search (i don't
> > want use D.B., just text files), i want to know which is the
> > better Collection to do it. My tables has a key area, where
> > the seek for partial keys goes from the start to the end, and
> > the data has anything.
>
> This sounds like a Map to me.
>
> There are a number of Map implementations, and you have not provided
> enough information to determine which is best.  But here are some you
> should look at:
>
>    HashMap - A hash table implementation of Map.  Provides fast lookup,
> but can incur significant overhead if the HashMap has to be expanded.
>
>    Hashtable - Very similar to HashMap, but is synchronized, which is
> good if you need to access it from multiple threads, but is slower as a
> result.
>
>    TreeMap - A tree implementation of Map.  Slower than HashMap, but does
> not incur the expansion costs that HashMap does.
>
> --
> John P. McGrath
> <JPMcGrath@fast.net>
> <jpm@nscs.fast.net>