本文探讨了JDK中RandomAccess接口的意义，分析了List通过for循环与Iterator遍历的性能差异，指出某些情况下for循环可能优于Iterator。同时讨论了HashMap为何未实现RandomAccess接口。
无意中在RandomAccess接口里，看到JDK自带的说明有如下一段
It is recognized that the distinction between random and sequential access is often fuzzy. For example, some List implementations provide asymptotically linear access times if they get huge, but constant access times in practice.Such a List implementation should generally implement this interface. As a rule of thumb, a List implementation should implement this interface if, for typical instances of the class, this loop:
for (int i=0, n=list.size(); i < n; i++)
list.get(i);
runs faster than this loop:
for (Iterator i=list.iterator(); i.hasNext(); )
i.next();
这段话的意思，难道遍历List for 循环遍历 要比 get 更比Iterator 更快？
凭直觉应该是 Iterator 更快吧。
说到随机访问的话，HashMap 应该更多地进行随机访问吧，可JDK 里偏偏 HashMap 没有实现 RandomAcess接口
It is recognized that the distinction between random and sequential access is often fuzzy. For example, some List implementations provide asymptotically linear access times if they get huge, but constant access times in practice.Such a List implementation should generally implement this interface. As a rule of thumb, a List implementation should implement this interface if, for typical instances of the class, this loop:
for (int i=0, n=list.size(); i < n; i++)
list.get(i);
runs faster than this loop:
for (Iterator i=list.iterator(); i.hasNext(); )
i.next();
这段话的意思，难道遍历List for 循环遍历 要比 get 更比Iterator 更快？
凭直觉应该是 Iterator 更快吧。
说到随机访问的话，HashMap 应该更多地进行随机访问吧，可JDK 里偏偏 HashMap 没有实现 RandomAcess接口
扫一扫
537
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
