which one is performance wise advantageious from List,Set,Map?
Answers were Sorted based on User's Feedback
Answer / debapriya
See HasMap is used when u want to use key value pair
If u r storing Any Objects the better u write ur code for
hascode implementation ,the better the the retrieval process is
Set maintains order,each time u add a object ,it checks
whether it exists or not calling equals which in turn calls
the hashcode method(x.equals(y) means x.hashcode==y.hashcode)
List --->in case if u use Vector or ArrayList since both of
them implenets RandomAccessInterface so retrieval is faster
but addition or deletion is slower
LinkedList --->deletion or insertion is faster but does not
implemet RandomAccess interface
| Is This Answer Correct ? | 4 Yes | 0 No |
Answer / r.jainrocks@gmail.com
hi Debapriya,
can u send me some more info on collection...
i.e.
In which kind of application Set is better
In which kind of application Map is better
In which kind of application List is better
just named those kind of applications
thanks in advance...
| Is This Answer Correct ? | 0 Yes | 0 No |
Answer / pkj
List : storing of data is fast but retrieval is slow.
Map : Stroing of data is slow. But retrieval is slow.
Set : Stroing of data is slow. But retrieval is slow.
Depending on the req the collection can be used
| Is This Answer Correct ? | 1 Yes | 2 No |
What is <> used for in java?
How many threads does a core java have?
What are the differences between getting and load method?
How to change value in arraylist java?
Which is the best approach for creating thread ?
What restrictions are placed on method overriding?
What is an exception in java?
Which is bigger double or float?
Can we define package statement after import statement in java?
How do you declare an infinite loop?
Can an unreachable object become reachable again?
What is the use of hashmap in java?