What are HashMap and HashSet value's order [duplicate]

In a word - yes. Neither HashMap or HashSet give any guarantee on the order of iteration.

The HashMap API does not define the order of iteration.

However, if you look at the implementation of HashMap, you can deduce that there is a complex transient relationship between the iteration order, the keys' hash values, the order in which the keys were inserted and the size of the hashtable. This relationship gets scrambled if the hashtable resizes itself.

Please refer:

Is the order of values retrieved from a HashMap the insertion order

If you want the values in the order you insert you have to use LinkedHasmap other wise you can use TreeMap where sort by the key. hash does not give any order because it uses the hascode to order values it may vary depend on the object.

A HashMap stores key value pairs. A HashSet is an unordered collection of objects in which each there can be no repeats. Neither are necessarily iterated in order insertion or otherwise. There are ordered implementations but you would not use the standard HashMap or HashSet classes.

Talked about further here

Linked Hash Map does maintain insertion order

HashMap is a implementation of Map interface. Map is a data structure to say that A corresponds to B.

Map<Integer, String> map = new HashMap<Integer, String>();
map.put(new Integer(1), "Test");

In the case above we know that every time that we look for 1, the correspondent is "Test".

Sets are something completely different. Sets ensures that no duplicate object will exists in your collection. HashSet is an implementation of Set interface.

To insert and retrieve something in order you could use LinkedHashMap, LinkedHashSet, ArrayList (implementation of List interface) and others

Wrapping it up:

• Map - correspond objects
• Set - Ensure unique objects in a collection