Path: csiph.com!x330-a1.tempe.blueboxinc.net!usenet.pasdenom.info!gegeweb.org!de-l.enfer-du-nord.net!feeder2.enfer-du-nord.net!texta.sil.at!newscore.univie.ac.at!aconews-feed.univie.ac.at!aconews.univie.ac.at!not-for-mail
Newsgroups: comp.lang.java.programmer
From: Andreas Leitgeb <avl@gamma.logic.tuwien.ac.at>
Subject: Re: Something Better than ArrayList
References: <hoa007h62o1tas6h5p6qlls6i8i2nf9q84@4ax.com> <7rr5d8-iug.ln1@hurricane.fredriksson.dy.fi>
Reply-To: avl@logic.at
User-Agent: slrn/pre0.9.9-111 (Linux)
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Message-ID: <slrnj00nds.phi.avl@gamma.logic.tuwien.ac.at>
Date: 21 Jun 2011 09:00:44 GMT
Lines: 18
NNTP-Posting-Host: gamma.logic.tuwien.ac.at
X-Trace: 1308646844 tunews.univie.ac.at 5640 128.130.175.3
X-Complaints-To: abuse@tuwien.ac.at
Xref: x330-a1.tempe.blueboxinc.net comp.lang.java.programmer:5461

Donkey Hottie <donkey@fredriksson.dy.fi> wrote:
> 21.6.2011 8:34, Gene Wirchenko kirjoitti:
>>      Now, I need symbol table processing.  There will be a lot of
>> lookups.  What class is like ArrayList in being an expandable array
>> but that has an order?

> I think you need a Map<String,String>

>>   I also want to have more than one data item
>> per entry.

Map<String,List<DataItem>>

> That is the interface, the implementation could be
> HashMap<String,String> or TreeMap<String,String>
> HashMap does not keep ordering, but TreeMap does. Both offer the lookup
> with symbol name though, and that is what you need, I think.
>