Class IntVertexDijkstraShortestPath.IdentifierMap

  • Enclosing class:
    IntVertexDijkstraShortestPath<E>

    private class IntVertexDijkstraShortestPath.IdentifierMap
    extends java.lang.Object
    A very special case linear probing hash table, fit for this particular use case. The code assumes several invariants such as that the user will never add more elements than its capacity, etc.
    • Field Summary

      Fields 
      Modifier and Type Field Description
      private int[] keys  
      private int m  
      private int[] values  
    • Constructor Summary

      Constructors 
      Constructor Description
      IdentifierMap​(int m)  
    • Method Summary

      All Methods Instance Methods Concrete Methods 
      Modifier and Type Method Description
      int get​(int key)  
      private int hash​(int key)  
      void put​(int key, int value)  
      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
    • Field Detail

      • keys

        private int[] keys
      • values

        private int[] values
      • m

        private int m
    • Constructor Detail

      • IdentifierMap

        public IdentifierMap​(int m)
    • Method Detail

      • put

        public void put​(int key,
                        int value)
      • get

        public int get​(int key)
      • hash

        private int hash​(int key)