Sets, Maps, and Hashing

Hash Function

Function that allows duplicate elements to be stored in a collection

Hash Code

Integer value that a search key is converted to in a hash function

Map

Interface that stores key value/pairs and provides a quick lookup for a value using a key

HashMap

Map that is efficient for locating a value, inserting an entry, and deleting an entry

TreeMap

Map that is efficient for traversing the keys in a sorted order

LinkedHashMap

Map that supports ordering of entries in a map. They may be retried either in the order in which they were inserted into the map or in the order in which they were last accessed known as access order

Open Addressing

Method of finding an open location in a hash table in the event of a collision

Linear Probing

Method of open addressing by resolving collisions in a linear fashion

Quadratic Probing

Method of open addressing by resolving collisions in a quadratic fashion

Separate Chaining

Method of open addressing by storing codes with the same index in the same location

Double Hashing

Method of open addressing by using two functions to resolve collisions

Bucket

Name of a single location storing two hash codes

Collision

Situation in which two keys are mapped to the same index in a hash table

List

Structure in which the indexes are integers

HashMapSet

Structure that stores unordered, non-duplicate elements

Hash Table

Table with indexes that stores a hash code

Hashing

Technique that retries the value using the index obtained from the key without preforming a search