Hi guys,
I want to merge Two HashMaps.
I could use map1.putAll(map2); but I don't want to overwrite the key's as yes they will have conflicting keys.
So the keys in each map will be like this
word1 word1
word2 word2
word3 word3
and when I merge them I would like:
word1 word2 word3 word4 word5 word6
It can just overwrite the keys, aslong as the keys are incremental and use the first key text i.e. reads one of the pairs and extracts 'word' so each would be word1 word2.
But the other caveat I was thinking of the mobile environment and what I can do without having to put up a loading screen or even capable of.
So as a starter I suppose:
HashMap<String, Object> hm1 = new HashMap<String, Object>();
hm1.put("key1", "a");
hm1.put("key2", "a");
hm1.put("key3", "a");
HashMap<String, Object> hm2 = new HashMap<String, Object>();
hm2.put("key1", "1");
hm2.put("key2", "2");
hm2.put("key3", "3");
HashMap<String, Object> newHM = new HashMap<String, Object>();
String keyWord = "";
for (String s: hm1.keySet()) {
keyWord = s;
break;
}
int count = 0;
for (Object o : hm1.values()) {
newHM.put(keyWord+count, o);
}
for (Object o : hm2.values()) {
newHM.put(keyWord+count, o);
}
But I'm wondering, how efficient is this? It looks correct, And is there a better way to do it? I don't want to use extra object's unnecessarily