[英]HashMap or TreeMap or LinkedHashMap which one is fastest to iterate over?
[英]Iterate HashMap one full time, with no repeats
我的目标:
我的问题如下:
代码:我希望这是足够的SSCCE。 我试图尽可能地削减脂肪......
import java.util.Iterator;
import java.util.Map.Entry;
import java.util.concurrent.ConcurrentHashMap;
public class WaitTime {
static ConcurrentHashMap<String, Integer> mobInstanceMap = new ConcurrentHashMap<String, Integer>();
static ConcurrentHashMap<String, Integer> npcInstanceMap = new ConcurrentHashMap<String, Integer>();
public static void main(String[] args){
mobInstanceMap.put("mob1", 0);
mobInstanceMap.put("mob2", 0);
mobInstanceMap.put("mob3", 0);
npcInstanceMap.put("npc1", 0);
npcInstanceMap.put("npc2", 0);
npcInstanceMap.put("npc3", 0);
while(true){
updateEntityLocations();
try {
Thread.sleep(20);
} catch (InterruptedException e) {
e.printStackTrace();
}
}
}
private static void updateEntityLocations() {
long entityMovementLoopStartTime = System.nanoTime();
Iterator<Entry<String, Integer>> it = mobInstanceMap.entrySet().iterator();
while (it.hasNext()) {
Entry<String, Integer> mobEntity = it.next();
String mobName = mobEntity.getKey();
int lastWalkTime = mobEntity.getValue();
int mobWalkSpeed = 4000;
long walkWaitTime = lastWalkTime;
long elapsedTime = (long) ((System.nanoTime() - entityMovementLoopStartTime) / 100.0);
walkWaitTime += elapsedTime;
if (walkWaitTime >= mobWalkSpeed){
System.out.println("Wasted time(walking)(" + mobName + "): " + (walkWaitTime - mobWalkSpeed));
//mobInstanceMap.put(mobName, 0);
mobInstanceMap.replace(mobName, 0);
} else { //!(walkWaitTime >= walkSpeed)
//mobInstanceMap.put(mobName, (int) walkWaitTime);
mobInstanceMap.replace(mobName, (int) walkWaitTime);
}
}
Iterator<Entry<String, Integer>> it1 = npcInstanceMap.entrySet().iterator();
while (it.hasNext()) {
Entry<String, Integer> npcEntity = it1.next();
String npcCoords = npcEntity.getKey();
int lastWalkTime = npcEntity.getValue();
int npcWalkSpeed = 4000;
long walkWaitTime = lastWalkTime;
long elapsedTime = (long) ((System.nanoTime() - entityMovementLoopStartTime) / 100.0);
walkWaitTime += elapsedTime;
if (walkWaitTime >= npcWalkSpeed){
System.out.println("Wasted time(walking)(" + npcCoords + "): " + (walkWaitTime - npcWalkSpeed));
npcInstanceMap.put(npcCoords, 0);
} else { //!(walkWaitTime >= walkSpeed)
npcInstanceMap.put(npcCoords, (int) walkWaitTime);
}
}
}
}
安慰:
Wasted time(walking)(mob2): 58
Wasted time(walking)(mob1): 1983
Wasted time(walking)(mob3): 2288
Wasted time(walking)(mob3): 266
Wasted time(walking)(mob1): 122
Wasted time(walking)(mob3): 232
Wasted time(walking)(mob2): 23
Wasted time(walking)(mob1): 674
Wasted time(walking)(mob3): 27
Wasted time(walking)(mob1): 159
Wasted time(walking)(mob3): 1723
Wasted time(walking)(mob2): 119
Wasted time(walking)(mob1): 676
Wasted time(walking)(mob3): 1698
Wasted time(walking)(mob3): 3983
Wasted time(walking)(mob1): 182
正如你所看到的,如果用put(注释掉)来运行它而不是替换它运行得稍微慢一些,而且更不稳定。
你会踢自己,但第二个循环引用第一个迭代器。
Iterator<Entry<String, Integer>> it1 = npcInstanceMap.entrySet().iterator();
while (it.hasNext()) {
...
}
另外,正如这个答案所暗示的那样,我建议不要使用迭代器。
for(String mob : mobInstanceMap.keySet()){
String mobName = mob;
int lastWalkTime = mobInstanceMap.get(mob);
int mobWalkSpeed = 4000;
long walkWaitTime = lastWalkTime;
long elapsedTime = (long) ((System.nanoTime() - entityMovementLoopStartTime) / 100.0);
walkWaitTime += elapsedTime;
if (walkWaitTime >= mobWalkSpeed){
System.out.println("Wasted time(walking)(" + mobName + "): " + (walkWaitTime - mobWalkSpeed));
mobInstanceMap.put(mobName, 0);
} else { //!(walkWaitTime >= walkSpeed)
mobInstanceMap.put(mobName, (int) walkWaitTime);
}
}
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.