Statements (55)
Predicate | Object |
---|---|
gptkbp:instanceOf |
gptkb:Java_Platform
Map lake |
gptkbp:allows |
Concurrent modifications
|
gptkbp:hasGoals |
clear()
size() containsKey(Object key) entrySet() get(Object key) keySet() put(K key, V value) remove(Object key) values() descendingMap() firstKey() floorKey(K key) forEach(BiConsumer<? super K,? super V> action) headMap(K toKey) lastKey() lowerKey(K key) pollFirstEntry() pollLastEntry() remove(Object key, Object value) tailMap(K fromKey) ceilingKey(K_key) higherKey(K_key) putIfAbsent(K_key,_V_value) replace(K_key,_V_oldValue,_V_newValue) replace(K_key,_V_value) subMap(K_fromKey,_K_toKey) |
https://www.w3.org/2000/01/rdf-schema#label |
ConcurrentSkipListMap
|
gptkbp:implements |
Serializable
Cloneable |
gptkbp:isBasedOn |
Skip List
|
gptkbp:isLocatedIn |
gptkb:Java
|
gptkbp:isNamedAfter |
gptkb:HashMap
gptkb:TreeMap |
gptkbp:isOrganizedBy |
true
|
gptkbp:isPartOf |
Java Collections Framework
java.util.concurrent |
gptkbp:isThreatenedBy |
true
|
gptkbp:isUsedIn |
Multithreaded_applications
|
gptkbp:isVisitedBy |
gptkb:SynchronizedMap
Hashtable |
gptkbp:provides |
Concurrent access
Logarithmic time complexity for insertion operations Logarithmic time complexity for deletion operations Higher concurrency than TreeMap Logarithmic time complexity for search operations Lower contention than ConcurrentHashMap Navigable methods |
gptkbp:supports |
Null values
Null keys |
gptkbp:wasAffecting |
gptkb:Java_6
|
gptkbp:wasSupportedBy |
true
|