structure Std.HashMap.Raw (α : Type u) (β : Type v) : Type (max u v)

Hash maps without a bundled well-formedness invariant, suitable for use in nested inductive types. The well-formedness invariant is called Raw.WF. When in doubt, prefer HashMap over HashMap.Raw. Lemmas about the operations on Std.Data.HashMap.Raw are available in the module Std.Data.HashMap.RawLemmas.

This is a simple separate-chaining hash table. The data of the hash map consists of a cached size and an array of buckets, where each bucket is a linked list of key-value pais. The number of buckets is always a power of two. The hash map doubles its size upon inserting an element such that the number of elements is more than 75% of the number of buckets.

The hash table is backed by an Array. Users should make sure that the hash map is used linearly to avoid expensive copies.

The hash map uses == (provided by the BEq typeclass) to compare keys and hash (provided by the Hashable typeclass) to hash them. To ensure that the operations behave as expected, == should be an equivalence relation and a == b should imply hash a = hash b (see also the EquivBEq and LawfulHashable typeclasses). Both of these conditions are automatic if the BEq instance is lawful, i.e., if a == b implies a = b.

Dependent hash maps, in which keys may occur in their values' types, are available as Std.Data.Raw.DHashMap.

• inner : Std.DHashMap.Raw α fun (x : α) => β

  Internal implementation detail of the hash map

@[inline]

def Std.HashMap.Raw.empty {α : Type u} {β : Type v} (capacity : optParam Nat 8) : Std.HashMap.Raw α β

Creates a new empty hash map. The optional parameter capacity can be supplied to presize the map so that it can hold the given number of mappings without reallocating. It is also possible to use the empty collection notations ∅ and {} to create an empty hash map with the default capacity.

Equations

• Std.HashMap.Raw.empty capacity = { inner := Std.DHashMap.Raw.empty capacity }

instance Std.HashMap.Raw.instEmptyCollection {α : Type u} {β : Type v} : EmptyCollection (Std.HashMap.Raw α β)

Equations

• Std.HashMap.Raw.instEmptyCollection = { emptyCollection := Std.HashMap.Raw.empty }

instance Std.HashMap.Raw.instInhabited {α : Type u} {β : Type v} : Inhabited (Std.HashMap.Raw α β)

Equations

• Std.HashMap.Raw.instInhabited = { default := ∅ }

@[inline]

def Std.HashMap.Raw.insert {α : Type u} {β : Type v} [beq : BEq α] [Hashable α] (m : Std.HashMap.Raw α β) (a : α) (b : β) : Std.HashMap.Raw α β

Inserts the given mapping into the map, replacing an existing mapping for the key if there is one.

Equations

• m.insert a b = { inner := m.inner.insert a b }

@[inline]

def Std.HashMap.Raw.insertIfNew {α : Type u} {β : Type v} [BEq α] [Hashable α] (m : Std.HashMap.Raw α β) (a : α) (b : β) : Std.HashMap.Raw α β

If there is no mapping for the given key, inserts the given mapping into the map. Otherwise, returns the map unaltered.

Equations

• m.insertIfNew a b = { inner := m.inner.insertIfNew a b }

@[inline]

def Std.HashMap.Raw.containsThenInsert {α : Type u} {β : Type v} [BEq α] [Hashable α] (m : Std.HashMap.Raw α β) (a : α) (b : β) : Bool × Std.HashMap.Raw α β

Checks whether a key is present in a map, and unconditionally inserts a value for the key.

Equivalent to (but potentially faster than) calling contains followed by insert.

Equations

• m.containsThenInsert a b = match m.inner.containsThenInsert a b with | (replaced, r) => (replaced, { inner := r })

@[inline]

def Std.HashMap.Raw.containsThenInsertIfNew {α : Type u} {β : Type v} [BEq α] [Hashable α] (m : Std.HashMap.Raw α β) (a : α) (b : β) : Bool × Std.HashMap.Raw α β

Checks whether a key is present in a map and inserts a value for the key if it was not found.

If the returned Bool is true, then the returned map is unaltered. If the Bool is false, then the returned map has a new value inserted.

Equivalent to (but potentially faster than) calling contains followed by insertIfNew.

Equations

• m.containsThenInsertIfNew a b = match m.inner.containsThenInsertIfNew a b with | (replaced, r) => (replaced, { inner := r })

@[inline]

def Std.HashMap.Raw.getThenInsertIfNew? {α : Type u} {β : Type v} [BEq α] [Hashable α] (m : Std.HashMap.Raw α β) (a : α) (b : β) : Option β × Std.HashMap.Raw α β

Equivalent to (but potentially faster than) calling get? followed by insertIfNew.

Equations

• m.getThenInsertIfNew? a b = match Std.DHashMap.Raw.Const.getThenInsertIfNew? m.inner a b with | (previous, r) => (previous, { inner := r })

@[inline]

def Std.HashMap.Raw.get? {α : Type u} {β : Type v} [beq : BEq α] [Hashable α] (m : Std.HashMap.Raw α β) (a : α) : Option β

The notation m[a]? is preferred over calling this function directly.

Tries to retrieve the mapping for the given key, returning none if no such mapping is present.

Equations

• m.get? a = Std.DHashMap.Raw.Const.get? m.inner a

@[inline]

def Std.HashMap.Raw.contains {α : Type u} {β : Type v} [BEq α] [Hashable α] (m : Std.HashMap.Raw α β) (a : α) : Bool

Returns true if there is a mapping for the given key. There is also a Prop-valued version of this: a ∈ m is equivalent to m.contains a = true.

Observe that this is different behavior than for lists: for lists, ∈ uses = and contains uses == for comparisons, while for hash maps, both use ==.

Equations

• m.contains a = m.inner.contains a

instance Std.HashMap.Raw.instMembershipOfBEqOfHashable {α : Type u} {β : Type v} [BEq α] [Hashable α] : Membership α (Std.HashMap.Raw α β)

Equations

• Std.HashMap.Raw.instMembershipOfBEqOfHashable = { mem := fun (m : Std.HashMap.Raw α β) (a : α) => a ∈ m.inner }

instance Std.HashMap.Raw.instDecidableMem {α : Type u} {β : Type v} [BEq α] [Hashable α] {m : Std.HashMap.Raw α β} {a : α} : Decidable (a ∈ m)

Equations

• Std.HashMap.Raw.instDecidableMem = inferInstanceAs (Decidable (a ∈ m.inner))

@[inline]

def Std.HashMap.Raw.get {α : Type u} {β : Type v} [BEq α] [Hashable α] (m : Std.HashMap.Raw α β) (a : α) (h : a ∈ m) : β

The notation m[a] or m[a]'h is preferred over calling this function directly.

Retrieves the mapping for the given key. Ensures that such a mapping exists by requiring a proof of a ∈ m.

Equations

• m.get a h = Std.DHashMap.Raw.Const.get m.inner a h

@[inline]

def Std.HashMap.Raw.getD {α : Type u} {β : Type v} [BEq α] [Hashable α] (m : Std.HashMap.Raw α β) (a : α) (fallback : β) : β

Tries to retrieve the mapping for the given key, returning fallback if no such mapping is present.

Equations

• m.getD a fallback = Std.DHashMap.Raw.Const.getD m.inner a fallback

@[inline]

def Std.HashMap.Raw.get! {α : Type u} {β : Type v} [BEq α] [Hashable α] [Inhabited β] (m : Std.HashMap.Raw α β) (a : α) : β

The notation m[a]! is preferred over calling this function directly.

Tries to retrieve the mapping for the given key, panicking if no such mapping is present.

Equations

• m.get! a = Std.DHashMap.Raw.Const.get! m.inner a

instance Std.HashMap.Raw.instGetElem?Mem {α : Type u} {β : Type v} [BEq α] [Hashable α] : GetElem? (Std.HashMap.Raw α β) α β fun (m : Std.HashMap.Raw α β) (a : α) => a ∈ m

Equations

• Std.HashMap.Raw.instGetElem?Mem = GetElem?.mk (fun (m : Std.HashMap.Raw α β) (a : α) => m.get? a) fun [Inhabited β] (m : Std.HashMap.Raw α β) (a : α) => m.get! a

@[inline]

def Std.HashMap.Raw.erase {α : Type u} {β : Type v} [BEq α] [Hashable α] (m : Std.HashMap.Raw α β) (a : α) : Std.HashMap.Raw α β

Removes the mapping for the given key if it exists.

Equations

• m.erase a = { inner := m.inner.erase a }

@[inline]

def Std.HashMap.Raw.size {α : Type u} {β : Type v} (m : Std.HashMap.Raw α β) : Nat

The number of mappings present in the hash map

Equations

• m.size = m.inner.size

@[inline]

def Std.HashMap.Raw.isEmpty {α : Type u} {β : Type v} (m : Std.HashMap.Raw α β) : Bool

Returns true if the hash map contains no mappings.

Note that if your BEq instance is not reflexive or your Hashable instance is not lawful, then it is possible that this function returns false even though is not possible to get anything out of the hash map.

Equations

• m.isEmpty = m.inner.isEmpty

We currently do not provide lemmas for the functions below.

@[inline]

def Std.HashMap.Raw.filterMap {α : Type u} {β : Type v} {γ : Type w} (f : α → β → Option γ) (m : Std.HashMap.Raw α β) : Std.HashMap.Raw α γ

Updates the values of the hash map by applying the given function to all mappings, keeping only those mappings where the function returns some value.

Equations

• Std.HashMap.Raw.filterMap f m = { inner := Std.DHashMap.Raw.filterMap f m.inner }

@[inline]

def Std.HashMap.Raw.map {α : Type u} {β : Type v} {γ : Type w} (f : α → β → γ) (m : Std.HashMap.Raw α β) : Std.HashMap.Raw α γ

Updates the values of the hash map by applying the given function to all mappings.

Equations

• Std.HashMap.Raw.map f m = { inner := Std.DHashMap.Raw.map f m.inner }

@[inline]

def Std.HashMap.Raw.filter {α : Type u} {β : Type v} (f : α → β → Bool) (m : Std.HashMap.Raw α β) : Std.HashMap.Raw α β

Removes all mappings of the hash map for which the given function returns false.

Equations

• Std.HashMap.Raw.filter f m = { inner := Std.DHashMap.Raw.filter f m.inner }

@[inline]

def Std.HashMap.Raw.foldM {α : Type u} {β : Type v} {m : Type w → Type w} [Monad m] {γ : Type w} (f : γ → α → β → m γ) (init : γ) (b : Std.HashMap.Raw α β) : m γ

Monadically computes a value by folding the given function over the mappings in the hash map in some order.

Equations

• Std.HashMap.Raw.foldM f init b = Std.DHashMap.Raw.foldM f init b.inner

@[inline]

def Std.HashMap.Raw.fold {α : Type u} {β : Type v} {γ : Type w} (f : γ → α → β → γ) (init : γ) (b : Std.HashMap.Raw α β) : γ

Folds the given function over the mappings in the hash map in some order.

Equations

• Std.HashMap.Raw.fold f init b = Std.DHashMap.Raw.fold f init b.inner

@[inline]

def Std.HashMap.Raw.forM {α : Type u} {β : Type v} {m : Type w → Type w} [Monad m] (f : α → β → m PUnit) (b : Std.HashMap.Raw α β) : m PUnit

Carries out a monadic action on each mapping in the hash map in some order.

Equations

• Std.HashMap.Raw.forM f b = Std.DHashMap.Raw.forM f b.inner

@[inline]

def Std.HashMap.Raw.forIn {α : Type u} {β : Type v} {m : Type w → Type w} [Monad m] {γ : Type w} (f : α → β → γ → m (ForInStep γ)) (init : γ) (b : Std.HashMap.Raw α β) : m γ

Support for the for loop construct in do blocks.

Equations

• Std.HashMap.Raw.forIn f init b = Std.DHashMap.Raw.forIn f init b.inner

instance Std.HashMap.Raw.instForMProd {α : Type u} {β : Type v} {m : Type w → Type w} : ForM m (Std.HashMap.Raw α β) (α × β)

Equations

• Std.HashMap.Raw.instForMProd = { forM := fun [Monad m] (m_1 : Std.HashMap.Raw α β) (f : α × β → m PUnit) => Std.HashMap.Raw.forM (fun (a : α) (b : β) => f (a, b)) m_1 }

instance Std.HashMap.Raw.instForInProd {α : Type u} {β : Type v} {m : Type w → Type w} : ForIn m (Std.HashMap.Raw α β) (α × β)

Equations

• One or more equations did not get rendered due to their size.

@[inline]

def Std.HashMap.Raw.toList {α : Type u} {β : Type v} (m : Std.HashMap.Raw α β) : List (α × β)

Transforms the hash map into a list of mappings in some order.

Equations

• m.toList = Std.DHashMap.Raw.Const.toList m.inner

@[inline]

def Std.HashMap.Raw.toArray {α : Type u} {β : Type v} (m : Std.HashMap.Raw α β) : Array (α × β)

Transforms the hash map into an array of mappings in some order.

Equations

• m.toArray = Std.DHashMap.Raw.Const.toArray m.inner

@[inline]

def Std.HashMap.Raw.keys {α : Type u} {β : Type v} (m : Std.HashMap.Raw α β) : List α

Returns a list of all keys present in the hash map in some order.

Equations

• m.keys = m.inner.keys

@[inline]

def Std.HashMap.Raw.keysArray {α : Type u} {β : Type v} (m : Std.HashMap.Raw α β) : Array α

Returns an array of all keys present in the hash map in some order.

Equations

• m.keysArray = m.inner.keysArray

@[inline]

def Std.HashMap.Raw.values {α : Type u} {β : Type v} (m : Std.HashMap.Raw α β) : List β

Returns a list of all values present in the hash map in some order.

Equations

• m.values = m.inner.values

@[inline]

def Std.HashMap.Raw.valuesArray {α : Type u} {β : Type v} (m : Std.HashMap.Raw α β) : Array β

Returns an array of all values present in the hash map in some order.

Equations

• m.valuesArray = m.inner.valuesArray

@[inline]

def Std.HashMap.Raw.insertMany {α : Type u} {β : Type v} [BEq α] [Hashable α] {ρ : Type w} [ForIn Id ρ (α × β)] (m : Std.HashMap.Raw α β) (l : ρ) : Std.HashMap.Raw α β

Inserts multiple mappings into the hash map by iterating over the given collection and calling insert. If the same key appears multiple times, the last occurrence takes precendence.

Equations

• m.insertMany l = { inner := Std.DHashMap.Raw.Const.insertMany m.inner l }

@[inline]

def Std.HashMap.Raw.insertManyUnit {α : Type u} [BEq α] [Hashable α] {ρ : Type w} [ForIn Id ρ α] (m : Std.HashMap.Raw α Unit) (l : ρ) : Std.HashMap.Raw α Unit

Inserts multiple keys with the value () into the hash map by iterating over the given collection and calling insert. If the same key appears multiple times, the last occurrence takes precedence.

This is mainly useful to implement HashSet.insertMany, so if you are considering using this, HashSet or HashSet.Raw might be a better fit for you.

Equations

• m.insertManyUnit l = { inner := Std.DHashMap.Raw.Const.insertManyUnit m.inner l }

@[inline]

def Std.HashMap.Raw.ofList {α : Type u} {β : Type v} [BEq α] [Hashable α] (l : List (α × β)) : Std.HashMap.Raw α β

Creates a hash map from a list of mappings. If the same key appears multiple times, the last occurrence takes precedence.

Equations

• Std.HashMap.Raw.ofList l = { inner := Std.DHashMap.Raw.Const.ofList l }

@[inline]

def Std.HashMap.Raw.unitOfList {α : Type u} [BEq α] [Hashable α] (l : List α) : Std.HashMap.Raw α Unit

Creates a hash map from a list of keys, associating the value () with each key.

This is mainly useful to implement HashSet.ofList, so if you are considering using this, HashSet or HashSet.Raw might be a better fit for you.

Equations

• Std.HashMap.Raw.unitOfList l = { inner := Std.DHashMap.Raw.Const.unitOfList l }

def Std.HashMap.Raw.Internal.numBuckets {α : Type u} {β : Type v} (m : Std.HashMap.Raw α β) : Nat

Returns the number of buckets in the internal representation of the hash map. This function may be useful for things like monitoring system health, but it should be considered an internal implementation detail.

Equations

• Std.HashMap.Raw.Internal.numBuckets m = Std.DHashMap.Raw.Internal.numBuckets m.inner

instance Std.HashMap.Raw.instRepr {α : Type u} {β : Type v} [Repr α] [Repr β] : Repr (Std.HashMap.Raw α β)

Equations

• Std.HashMap.Raw.instRepr = { reprPrec := fun (m : Std.HashMap.Raw α β) (prec : Nat) => Repr.addAppParen (Std.Format.text "Std.HashMap.Raw.ofList " ++ reprArg m.toList) prec }

structure Std.HashMap.Raw.WF {α : Type u} {β : Type v} [BEq α] [Hashable α] (m : Std.HashMap.Raw α β) : Prop

Well-formedness predicate for hash maps. Users of HashMap will not need to interact with this. Users of HashMap.Raw will need to provide proofs of WF to lemmas and should use lemmas WF.empty and WF.insert (which are always named exactly like the operations they are about) to show that map operations preserve well-formedness.

• out : m.inner.WF

  Internal implementation detail of the hash map

theorem Std.HashMap.Raw.WF.out {α : Type u} {β : Type v} [BEq α] [Hashable α] {m : Std.HashMap.Raw α β} (self : m.WF) : m.inner.WF

Internal implementation detail of the hash map

theorem Std.HashMap.Raw.WF.empty {α : Type u} {β : Type v} [BEq α] [Hashable α] {c : Nat} : (Std.HashMap.Raw.empty c).WF

theorem Std.HashMap.Raw.WF.emptyc {α : Type u} {β : Type v} [BEq α] [Hashable α] : ∅.WF

theorem Std.HashMap.Raw.WF.insert {α : Type u} {β : Type v} [BEq α] [Hashable α] {m : Std.HashMap.Raw α β} {a : α} {b : β} (h : m.WF) : (m.insert a b).WF

theorem Std.HashMap.Raw.WF.insertIfNew {α : Type u} {β : Type v} [BEq α] [Hashable α] {m : Std.HashMap.Raw α β} {a : α} {b : β} (h : m.WF) : (m.insertIfNew a b).WF

theorem Std.HashMap.Raw.WF.containsThenInsert {α : Type u} {β : Type v} [BEq α] [Hashable α] {m : Std.HashMap.Raw α β} {a : α} {b : β} (h : m.WF) : (m.containsThenInsert a b).snd.WF

theorem Std.HashMap.Raw.WF.containsThenInsertIfNew {α : Type u} {β : Type v} [BEq α] [Hashable α] {m : Std.HashMap.Raw α β} {a : α} {b : β} (h : m.WF) : (m.containsThenInsertIfNew a b).snd.WF

theorem Std.HashMap.Raw.WF.getThenInsertIfNew? {α : Type u} {β : Type v} [BEq α] [Hashable α] {m : Std.HashMap.Raw α β} {a : α} {b : β} (h : m.WF) : (m.getThenInsertIfNew? a b).snd.WF

theorem Std.HashMap.Raw.WF.erase {α : Type u} {β : Type v} [BEq α] [Hashable α] {m : Std.HashMap.Raw α β} {a : α} (h : m.WF) : (m.erase a).WF

theorem Std.HashMap.Raw.WF.filter {α : Type u} {β : Type v} [BEq α] [Hashable α] {m : Std.HashMap.Raw α β} {f : α → β → Bool} (h : m.WF) : (Std.HashMap.Raw.filter f m).WF

theorem Std.HashMap.Raw.WF.insertMany {α : Type u} {β : Type v} [BEq α] [Hashable α] {ρ : Type w} [ForIn Id ρ (α × β)] {m : Std.HashMap.Raw α β} {l : ρ} (h : m.WF) : (m.insertMany l).WF

theorem Std.HashMap.Raw.WF.insertManyUnit {α : Type u} [BEq α] [Hashable α] {ρ : Type w} [ForIn Id ρ α] {m : Std.HashMap.Raw α Unit} {l : ρ} (h : m.WF) : (m.insertManyUnit l).WF

theorem Std.HashMap.Raw.WF.ofList {α : Type u} {β : Type v} [BEq α] [Hashable α] {l : List (α × β)} : (Std.HashMap.Raw.ofList l).WF

theorem Std.HashMap.Raw.WF.unitOfList {α : Type u} [BEq α] [Hashable α] {l : List α} : (Std.HashMap.Raw.unitOfList l).WF