A data structure that uses a hash function to compute an index into an array of buckets from which node objects can be quickly obtained.
| 29 | * array of buckets from which node objects can be quickly obtained. |
| 30 | */ |
| 31 | public interface HashTable<T extends Node> extends Iterable<T> |
| 32 | { |
| 33 | /** |
| 34 | * Gets a node by its hash value. |
| 35 | * |
| 36 | * @param value the node value |
| 37 | * @return the associated node |
| 38 | */ |
| 39 | T get(long value); |
| 40 | } |
no outgoing calls
no test coverage detected