structure Std.HashSet.Raw (α : Type u) : Type u

Hash sets 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 HashSet over HashSet.Raw. Lemmas about the operations on Std.Data.HashSet.Raw are available in the module Std.Data.HashSet.RawLemmas.

This is a simple separate-chaining hash table. The data of the hash set consists of a cached size and an array of buckets, where each bucket is a linked list of keys. The number of buckets is always a power of two. The hash set 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 set is used linearly to avoid expensive copies.

The hash set uses == (provided by the BEq typeclass) to compare elements 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.

• inner : Std.HashMap.Raw α Unit

  Internal implementation detail of the hash set.

@[inline]

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

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

Equations

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

instance Std.HashSet.Raw.instEmptyCollection {α : Type u} : EmptyCollection (Std.HashSet.Raw α)

Equations

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

instance Std.HashSet.Raw.instInhabited {α : Type u} : Inhabited (Std.HashSet.Raw α)

Equations

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

@[inline]

def Std.HashSet.Raw.insert {α : Type u} [BEq α] [Hashable α] (m : Std.HashSet.Raw α) (a : α) : Std.HashSet.Raw α

Inserts the given element into the set. If the hash set already contains an element that is equal (with regard to ==) to the given element, then the hash set is returned unchanged.

Equations

• m.insert a = { inner := m.inner.insertIfNew a () }

instance Std.HashSet.Raw.instSingletonOfBEqOfHashable {α : Type u} [BEq α] [Hashable α] : Singleton α (Std.HashSet.Raw α)

Equations

• Std.HashSet.Raw.instSingletonOfBEqOfHashable = { singleton := fun (a : α) => Std.HashSet.Raw.empty.insert a }

instance Std.HashSet.Raw.instInsertOfBEqOfHashable {α : Type u} [BEq α] [Hashable α] : Insert α (Std.HashSet.Raw α)

Equations

• Std.HashSet.Raw.instInsertOfBEqOfHashable = { insert := fun (a : α) (s : Std.HashSet.Raw α) => s.insert a }

instance Std.HashSet.Raw.instLawfulSingleton {α : Type u} [BEq α] [Hashable α] : LawfulSingleton α (Std.HashSet.Raw α)

Equations

• ⋯ = ⋯

@[inline]

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

Checks whether an element is present in a set and inserts the element if it was not found. If the hash set already contains an element that is equal (with regard to ==) to the given element, then the hash set is returned unchanged.

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

Equations

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

@[inline]

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

Returns true if the given element is present in the set. 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 use == for comparisons, while for hash sets, both use ==.

Equations

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

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

Equations

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

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

Equations

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

@[inline]

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

Removes the element if it exists.

Equations

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

@[inline]

def Std.HashSet.Raw.size {α : Type u} (m : Std.HashSet.Raw α) : Nat

The number of elements present in the set

Equations

• m.size = m.inner.size

@[inline]

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

Checks if given key is contained and returns the key if it is, otherwise none. The result in the some case is guaranteed to be pointer equal to the key in the map.

Equations

• m.get? a = m.inner.getKey? a

@[inline]

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

Retrieves the key from the set that matches a. Ensures that such a key exists by requiring a proof of a ∈ m. The result is guaranteed to be pointer equal to the key in the set.

Equations

• m.get a h = m.inner.getKey a h

@[inline]

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

Checks if given key is contained and returns the key if it is, otherwise fallback. If they key is contained the result is guaranteed to be pointer equal to the key in the set.

Equations

• m.getD a fallback = m.inner.getKeyD a fallback

@[inline]

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

Checks if given key is contained and returns the key if it is, otherwise panics. If no panic occurs the result is guaranteed to be pointer equal to the key in the set.

Equations

• m.get! a = m.inner.getKey! a

@[inline]

def Std.HashSet.Raw.isEmpty {α : Type u} (m : Std.HashSet.Raw α) : Bool

Returns true if the hash set contains no elements.

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 m.contains a = false for all a.

Equations

• m.isEmpty = m.inner.isEmpty

We currently do not provide lemmas for the functions below.

We currently do not provide lemmas for the functions below.

@[inline]

def Std.HashSet.Raw.filter {α : Type u} [BEq α] [Hashable α] (f : α → Bool) (m : Std.HashSet.Raw α) : Std.HashSet.Raw α

Removes all elements from the hash set for which the given function returns false.

Equations

• Std.HashSet.Raw.filter f m = { inner := Std.HashMap.Raw.filter (fun (a : α) (x : Unit) => f a) m.inner }

@[inline]

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

Monadically computes a value by folding the given function over the elements in the hash set in some order.

Equations

• Std.HashSet.Raw.foldM f init b = Std.HashMap.Raw.foldM (fun (b : β) (a : α) (x : Unit) => f b a) init b.inner

@[inline]

def Std.HashSet.Raw.fold {α : Type u} {β : Type v} (f : β → α → β) (init : β) (m : Std.HashSet.Raw α) : β

Folds the given function over the elements of the hash set in some order.

Equations

• Std.HashSet.Raw.fold f init m = Std.HashMap.Raw.fold (fun (b : β) (a : α) (x : Unit) => f b a) init m.inner

@[inline]

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

Carries out a monadic action on each element in the hash set in some order.

Equations

• Std.HashSet.Raw.forM f b = Std.HashMap.Raw.forM (fun (a : α) (x : Unit) => f a) b.inner

@[inline]

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

Support for the for loop construct in do blocks.

Equations

• Std.HashSet.Raw.forIn f init b = Std.HashMap.Raw.forIn (fun (a : α) (x : Unit) (acc : β) => f a acc) init b.inner

instance Std.HashSet.Raw.instForM {α : Type u} {m : Type v → Type v} : ForM m (Std.HashSet.Raw α) α

Equations

• Std.HashSet.Raw.instForM = { forM := fun [Monad m] (m_1 : Std.HashSet.Raw α) (f : α → m PUnit) => Std.HashSet.Raw.forM f m_1 }

instance Std.HashSet.Raw.instForIn {α : Type u} {m : Type v → Type v} : ForIn m (Std.HashSet.Raw α) α

Equations

• Std.HashSet.Raw.instForIn = { forIn := fun {β : Type ?u.24} [Monad m] (m_1 : Std.HashSet.Raw α) (init : β) (f : α → β → m (ForInStep β)) => Std.HashSet.Raw.forIn f init m_1 }

@[inline]

def Std.HashSet.Raw.all {α : Type u} (m : Std.HashSet.Raw α) (p : α → Bool) : Bool

Check if all elements satisfy the predicate, short-circuiting if a predicate fails.

Equations

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

@[inline]

def Std.HashSet.Raw.any {α : Type u} (m : Std.HashSet.Raw α) (p : α → Bool) : Bool

Check if any element satisfies the predicate, short-circuiting if a predicate succeeds.

Equations

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

@[inline]

def Std.HashSet.Raw.toList {α : Type u} (m : Std.HashSet.Raw α) : List α

Transforms the hash set into a list of elements in some order.

Equations

• m.toList = m.inner.keys

@[inline]

def Std.HashSet.Raw.toArray {α : Type u} (m : Std.HashSet.Raw α) : Array α

Transforms the hash set into an array of elements in some order.

Equations

• m.toArray = m.inner.keysArray

@[inline]

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

Inserts multiple elements into the hash set. Note that unlike repeatedly calling insert, if the collection contains multiple elements that are equal (with regard to ==), then the last element in the collection will be present in the returned hash set.

Equations

• m.insertMany l = { inner := m.inner.insertManyUnit l }

@[inline]

def Std.HashSet.Raw.ofList {α : Type u} [BEq α] [Hashable α] (l : List α) : Std.HashSet.Raw α

Creates a hash set from a list of elements. Note that unlike repeatedly calling insert, if the collection contains multiple elements that are equal (with regard to ==), then the last element in the collection will be present in the returned hash set.

Equations

• Std.HashSet.Raw.ofList l = { inner := Std.HashMap.Raw.unitOfList l }

@[inline]

def Std.HashSet.Raw.ofArray {α : Type u} [BEq α] [Hashable α] (l : Array α) : Std.HashSet.Raw α

Creates a hash set from an array of elements. Note that unlike repeatedly calling insert, if the collection contains multiple elements that are equal (with regard to ==), then the last element in the collection will be present in the returned hash set.

Equations

• Std.HashSet.Raw.ofArray l = { inner := Std.HashMap.Raw.unitOfArray l }

@[inline]

def Std.HashSet.Raw.union {α : Type u} [BEq α] [Hashable α] (m₁ : Std.HashSet.Raw α) (m₂ : Std.HashSet.Raw α) : Std.HashSet.Raw α

Computes the union of the given hash sets, by traversing m₂ and inserting its elements into m₁.

Equations

• m₁.union m₂ = Std.HashSet.Raw.fold (fun (acc : Std.HashSet.Raw α) (x : α) => acc.insert x) m₁ m₂

instance Std.HashSet.Raw.instUnionOfBEqOfHashable {α : Type u} [BEq α] [Hashable α] : Union (Std.HashSet.Raw α)

Equations

• Std.HashSet.Raw.instUnionOfBEqOfHashable = { union := Std.HashSet.Raw.union }

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

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

Equations

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

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

Equations

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

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

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

• out : m.inner.WF

  Internal implementation detail of the hash set

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

Internal implementation detail of the hash set

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

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

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

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

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

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

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

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