Hashing

Bitmask Hashing

Hashing maps a key into a compact table index or signature for fast insert, lookup, counting, grouping, and matching.

Kind

bitmask

Time

O(1) expected

Space

O(N)

Steps

Input Keys

[0]

[1]

[2]

[3]

[4]

[5]

[6]

Hash Table / State

bucket 0

empty

bucket 1

empty

bucket 2

empty

bucket 3

empty

bucket 4

empty

bucket 5

empty

bucket 6

empty

bucket 7

empty

Step Timeline

Code + Variables

1mask = 0

2toggle bit for each property

3use mask as hash key

4match equal masks

mask0

Loading Lab...