TreeMap4
- java.lang.Object
-
- java.util.AbstractMap<K,V>
-
- java.util.TreeMap<ComparableMapKey4<K1,K2,K3,K4>,V>
-
- com.dashoptimization.maps.TreeMap4<K1,K2,K3,K4,V>
-
- All Implemented Interfaces:
-
java.io.Serializable
,java.lang.Cloneable
,java.util.Map<ComparableMapKey4<K1,K2,K3,K4>,V>
,java.util.NavigableMap<ComparableMapKey4<K1,K2,K3,K4>,V>
,java.util.SortedMap<ComparableMapKey4<K1,K2,K3,K4>,V>
public final class TreeMap4<K1 extends java.lang.Comparable<? super K1>,K2 extends java.lang.Comparable<? super K2>,K3 extends java.lang.Comparable<? super K3>,K4 extends java.lang.Comparable<? super K4>,V> extends java.util.TreeMap<ComparableMapKey4<K1,K2,K3,K4>,V>
A 4-dimensional tree map. Instances of this class map tuples with 4 elements to value and provide some convenience functions to access elements without having to explicitly construct the tuples. The mapping is implemented by an ordered data structure that orders elements by pairwise comparison- Since:
- 43.00
- See Also:
- Serialized Form
-
-
Constructor Summary
Constructor Description TreeMap4()
-
Method Summary
Modifier and Type Method Description boolean
containsKey(K1 key1, K2 key2, K3 key3, K4 key4)
Test whether(key1,key2,key3,key4)
exists.V
get(K1 key1, K2 key2, K3 key3, K4 key4)
Get the value for tuple(key1,key2,key3,key4)
.V
put(K1 key1, K2 key2, K3 key3, K4 key4, V value)
Map(key1,key2,key3,key4)
tovalue
.-
Methods inherited from class java.util.TreeMap
ceilingEntry, ceilingKey, clear, clone, comparator, containsKey, containsValue, descendingKeySet, descendingMap, entrySet, firstEntry, firstKey, floorEntry, floorKey, forEach, get, headMap, headMap, higherEntry, higherKey, keySet, lastEntry, lastKey, lowerEntry, lowerKey, navigableKeySet, pollFirstEntry, pollLastEntry, put, putAll, remove, replace, replace, replaceAll, size, subMap, subMap, tailMap, tailMap, values
-
-
-
-
Method Detail
-
get
public V get(K1 key1, K2 key2, K3 key3, K4 key4)
Get the value for tuple(key1,key2,key3,key4)
.- Parameters:
-
key1
- Key for dimension 1. -
key2
- Key for dimension 2. -
key3
- Key for dimension 3. -
key4
- Key for dimension 4. - Returns:
-
null
the mapping does not exist. - Since:
- 43.00
-
put
public V put(K1 key1, K2 key2, K3 key3, K4 key4, V value)
Map(key1,key2,key3,key4)
tovalue
.- Parameters:
-
key1
- Key for dimension 1. -
key2
- Key for dimension 2. -
key3
- Key for dimension 3. -
key4
- Key for dimension 4. -
value
- The value for(key1,key2,key3,key4)
. - Returns:
- the previous value for the mapping.
- Since:
- 43.00
-
containsKey
public boolean containsKey(K1 key1, K2 key2, K3 key3, K4 key4)
Test whether(key1,key2,key3,key4)
exists.- Parameters:
-
key1
- Key for dimension 1. -
key2
- Key for dimension 2. -
key3
- Key for dimension 3. -
key4
- Key for dimension 4. - Returns:
-
true
if(key1,key2,key3,key4)
is contained in this map,false
otherwise./ - Since:
- 43.00
-
-
© 2001-2024 Fair Isaac Corporation. All rights reserved. This documentation is the property of Fair Isaac Corporation (“FICO”). Receipt or possession of this documentation does not convey rights to disclose, reproduce, make derivative works, use, or allow others to use it except solely for internal evaluation purposes to determine whether to purchase a license to the software described in this documentation, or as otherwise set forth in a written software license agreement between you and FICO (or a FICO affiliate). Use of this documentation and the software described in it must conform strictly to the foregoing permitted uses, and no other use is permitted.