Maps/Operations and Performance: Difference between revisions
From charlesreid1
(Created page with "Link on git.charlesreid1.com: https://charlesreid1.com:3000/cs/java/src/master/hash/timing/TimingMap.java {{MapsFlag}} Category:Maps Category:Java") |
No edit summary |
||
| Line 1: | Line 1: | ||
=Notes= | |||
Link on git.charlesreid1.com: https://charlesreid1.com:3000/cs/java/src/master/hash/timing/TimingMap.java | Link on git.charlesreid1.com: https://charlesreid1.com:3000/cs/java/src/master/hash/timing/TimingMap.java | ||
According to OpenJDK source code, TreeMap should take O(log N) time. So, the TreeMap only LOOKS like it is O(1). Have to get to really large TreeMaps to get actual O(N) performance, I guess. | |||
=Flags= | |||
{{MapsFlag}} | {{MapsFlag}} | ||
Revision as of 00:33, 28 June 2017
Notes
Link on git.charlesreid1.com: https://charlesreid1.com:3000/cs/java/src/master/hash/timing/TimingMap.java
According to OpenJDK source code, TreeMap should take O(log N) time. So, the TreeMap only LOOKS like it is O(1). Have to get to really large TreeMaps to get actual O(N) performance, I guess.
Flags
 |
Maps and Dictionaries Part of Computer Science Notes
Series on Data Structures
Maps/Dictionaries Maps · Maps/ADT · Maps in Java · Maps/OOP · Maps/Operations and Performance Map implementations: Maps/AbstractMap · Maps/UnsortedArrayMap · Maps/SortedArrayMap Dictionary implementations: Dictionaries/LinkedDict · Dictionaries/ArrayDict
Hashes Hash Maps/OOP · Hash Maps/Operations and Performance Hash Maps/Dynamic Resizing · Hash Maps/Collision Handling with Chaining Hash functions: Hash Functions · Hash Functions/Cyclic Permutation Hash map implementations: Hash Maps/AbstractHashMap · Hash Maps/ChainedHashMap
Skip Lists · Java/ConcurrentSkipList · Java implementations: SkipList
Sets Sets · Sets/ADT · Sets in Java · Sets/OOP · Multisets
|