Initializing help system before first use

HashMap3

  • java.lang.Object
    • java.util.AbstractMap<K,​V>
      • java.util.HashMap<MapKey3<K1,​K2,​K3>,​V>
        • com.dashoptimization.maps.HashMap3<K1,​K2,​K3,​V>
  • All Implemented Interfaces:
    java.io.Serializable, java.lang.Cloneable, java.util.Map<MapKey3<K1,​K2,​K3>,​V> 
    public final class HashMap3<K1,​K2,​K3,​V>
extends java.util.HashMap<MapKey3<K1,​K2,​K3>,​V>
    A 3-dimensional hash map. Instances of this class map tuples with 3 elements to value and provide some convenience functions to access elements without having to explicitly construct the tuples. Tuples are mapped using their hash codes.
    Since:
    43.00
    See Also:
    Serialized Form

    • Nested Class Summary

      • Nested classes/interfaces inherited from class java.util.AbstractMap

        java.util.AbstractMap.SimpleEntry<K extends java.lang.Object,​V extends java.lang.Object>, java.util.AbstractMap.SimpleImmutableEntry<K extends java.lang.Object,​V extends java.lang.Object>

      • Nested classes/interfaces inherited from interface java.util.Map

        java.util.Map.Entry<K extends java.lang.Object,​V extends java.lang.Object>

    • Constructor Summary

      Constructor Description
      HashMap3()  

    • Method Summary

      Modifier and Type Method Description
      boolean containsKey​(K1 key1, K2 key2, K3 key3)
      Test whether (key1,key2,key3) exists.
      V get​(K1 key1, K2 key2, K3 key3)
      Get the value for tuple (key1,key2,key3).
      V put​(K1 key1, K2 key2, K3 key3, V value)
      Map (key1,key2,key3) to value.

      • Methods inherited from class java.util.HashMap

        clear, clone, compute, computeIfAbsent, computeIfPresent, containsKey, containsValue, entrySet, forEach, get, getOrDefault, isEmpty, keySet, merge, put, putAll, putIfAbsent, remove, remove, replace, replace, replaceAll, size, values

      • Methods inherited from class java.util.AbstractMap

        equals, hashCode, toString

      • Methods inherited from class java.lang.Object

        getClass, notify, notifyAll, wait, wait, wait

      • Methods inherited from interface java.util.Map

        equals, hashCode

    • Constructor Detail

      • HashMap3

        public HashMap3()

    • Method Detail

      • get

        public V get​(K1 key1,
             K2 key2,
             K3 key3)
        Get the value for tuple (key1,key2,key3).
        Parameters:
        key1 - Key for dimension 1.
        key2 - Key for dimension 2.
        key3 - Key for dimension 3.
        Returns:
        null the mapping does not exist.
        Since:
        43.00

      • put

        public V put​(K1 key1,
             K2 key2,
             K3 key3,
             V value)
        Map (key1,key2,key3) to value.
        Parameters:
        key1 - Key for dimension 1.
        key2 - Key for dimension 2.
        key3 - Key for dimension 3.
        value - The value for (key1,key2,key3).
        Returns:
        the previous value for the mapping.
        Since:
        43.00

      • containsKey

        public boolean containsKey​(K1 key1,
                           K2 key2,
                           K3 key3)
        Test whether (key1,key2,key3) exists.
        Parameters:
        key1 - Key for dimension 1.
        key2 - Key for dimension 2.
        key3 - Key for dimension 3.
        Returns:
        true if (key1,key2,key3) is contained in this map, false otherwise.
        Since:
        43.00
Parent Topic Class Summary

© 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.