hashmap

Associative array structure

A hashmap is a data structure that stores key-value pairs for rapid lookup.

Given a key, a hashmap retrieves its associated value in nearly constant time by converting the key into an array index through a hash function.

Also called a hash table or dictionary.

The hashmap stores user IDs mapped to their profile data.

structure

key-value

Data pair structure

  • bucketOpen-top carrying vessel
  • entryAccess or submission
  • tableHorizontal furniture surface

array · node · pair · slot · index · chaining · collision · rehashing · resize · capacity

operations

lookup

Act of retrieving information

  • getObtain or become
  • putPlace in position
  • deleteRemove or erase

insert · update · retrieve · search · access · contains · iterate · clear · merge · compute

hashing

collision

Forceful contact between objects

SHA · murmur · hashcode · modulo · prime · deterministic · uniform

implementations

object

Tangible entity or aim

  • JSONLightweight data interchange format
  • propertiesQualities or owned assets
  • cacheConcealed storage spot

registry · index

performance

amortized

Gradually written off

worst-case · clustering · allocation

Opposites
ordering

hashmaplinked list

Sequential nodes with pointers

B-tree · sequence

access pattern

hashmaparray

Ordered collection or display

linked list · stream · queue · stack · iterator

structure type

hashmapscalar

Quantity with magnitude only

array · tree · graph · list · set

Family

hash, map, hashes, hashed, hashing, maps, mapped, mapping, mapper

Familiarity
Top 1,000,000
Profile
Used worldwide · Timeless · Abstract · Rated G