collecition class

[Parameswaran Thangavel]

hi

i provided the consolidated info about the

collection classes which i liked some to comment on

it..


List

accessed based on Index value
its an ordered collections

ArrayList
fast iteration
implement RandomAccess interface

Vector
Synchronised form of ArrayList

LinkedList

Faster addition and deletion.
Able to add at either end(front and back)
Insertion or Access order

set

unique values

Hashset
unordered and unsorted

LinkedHashset
Insertion or Access order

Treeset
sorted by natural orders

Map
key/value pairs

HashMap
unordered & unsorted
one null key and many null value
faster insertion and deletion than linkedhasmap

Hashtable
synchronised version of HashMap
null are not allowed.


LinkedHashMap
Faster iteration
Access or insertion order.

TreeMap
sorted version based on natural ordering





for any addition and deletion of above info do it on the same

[Saranyan Narayanan]

Good job with summarizing the same.

If possible add something about the decision for an array instead of collection, in some cases

[Joe Sondow]

Very nice summary. I see one small fact that differs from K&B's info. You say that LinkedHashSet is ordered by Insertion or Access order (same as LinkedHashMap), but on page 429 of K&B they say that although LinkedHashMap is ordered by insertion order or last access order, LinkedHashSet is only ordered by insertion order.

And you didn't capitalize the Set interface, but that's not a big deal either, since we all know it's capitalized.

Good job!

[Parameswaran Thangavel]

hi joe

this is how k&b is given

Optionally, you can construct a LinkedHashSet
so that it maintains the order in which elements were last accessed, rather than the
order in which elements were inserted.