structure Lake.OrdHashSet (α : Type u_1) [Hashable α] [BEq α] : Type u_1

A HashSet that preserves insertion order.

• toHashSet : Std.HashSet α
• toArray : Array α

@[instance_reducible]

instance Lake.OrdHashSet.instCoeHashSet {α : Type u_1} [Hashable α] [BEq α] : Coe (OrdHashSet α) (Std.HashSet α)

Equations

• Lake.OrdHashSet.instCoeHashSet = { coe := Lake.OrdHashSet.toHashSet }

def Lake.OrdHashSet.empty {α : Type u_1} [Hashable α] [BEq α] : OrdHashSet α

Equations

• Lake.OrdHashSet.empty = { toHashSet := ∅, toArray := #[] }

@[instance_reducible]

instance Lake.OrdHashSet.instEmptyCollection {α : Type u_1} [Hashable α] [BEq α] : EmptyCollection (OrdHashSet α)

Equations

• Lake.OrdHashSet.instEmptyCollection = { emptyCollection := Lake.OrdHashSet.empty }

def Lake.OrdHashSet.mkEmpty {α : Type u_1} [Hashable α] [BEq α] (size : Nat) : OrdHashSet α

Equations

• Lake.OrdHashSet.mkEmpty size = { toHashSet := ∅, toArray := Array.mkEmpty size }

def Lake.OrdHashSet.insert {α : Type u_1} [Hashable α] [BEq α] (self : OrdHashSet α) (a : α) : OrdHashSet α

Equations

• self.insert a = if self.toHashSet.contains a = true then self else { toHashSet := self.toHashSet.insert a, toArray := self.toArray.push a }

def Lake.OrdHashSet.appendArray {α : Type u_1} [Hashable α] [BEq α] (self : OrdHashSet α) (arr : Array α) : OrdHashSet α

Equations

• self.appendArray arr = Array.foldl (fun (x1 : Lake.OrdHashSet α) (x2 : α) => x1.insert x2) self arr

@[instance_reducible]

instance Lake.OrdHashSet.instHAppendArray {α : Type u_1} [Hashable α] [BEq α] : HAppend (OrdHashSet α) (Array α) (OrdHashSet α)

Equations

• Lake.OrdHashSet.instHAppendArray = { hAppend := Lake.OrdHashSet.appendArray }

def Lake.OrdHashSet.append {α : Type u_1} [Hashable α] [BEq α] (self other : OrdHashSet α) : OrdHashSet α

Equations

• self.append other = self.appendArray other.toArray

@[instance_reducible]

instance Lake.OrdHashSet.instAppend {α : Type u_1} [Hashable α] [BEq α] : Append (OrdHashSet α)

Equations

• Lake.OrdHashSet.instAppend = { append := Lake.OrdHashSet.append }

def Lake.OrdHashSet.ofArray {α : Type u_1} [Hashable α] [BEq α] (arr : Array α) : OrdHashSet α

Equations

• Lake.OrdHashSet.ofArray arr = (Lake.OrdHashSet.mkEmpty arr.size).appendArray arr

@[inline]

def Lake.OrdHashSet.all {α : Type u_1} [Hashable α] [BEq α] (f : α → Bool) (self : OrdHashSet α) : Bool

Equations

• Lake.OrdHashSet.all f self = self.toArray.all f

@[inline]

def Lake.OrdHashSet.any {α : Type u_1} [Hashable α] [BEq α] (f : α → Bool) (self : OrdHashSet α) : Bool

Equations

• Lake.OrdHashSet.any f self = self.toArray.any f

@[inline]

def Lake.OrdHashSet.foldl {α : Type u_1} [Hashable α] [BEq α] {β : Type u_2} (f : β → α → β) (init : β) (self : OrdHashSet α) : β

Equations

• Lake.OrdHashSet.foldl f init self = Array.foldl f init self.toArray

@[inline]

def Lake.OrdHashSet.foldlM {α : Type u_1} [Hashable α] [BEq α] {m : Type u_2 → Type u_3} {β : Type u_2} [Monad m] (f : β → α → m β) (init : β) (self : OrdHashSet α) : m β

Equations

• Lake.OrdHashSet.foldlM f init self = Array.foldlM f init self.toArray

@[inline]

def Lake.OrdHashSet.foldr {α : Type u_1} [Hashable α] [BEq α] {β : Type u_2} (f : α → β → β) (init : β) (self : OrdHashSet α) : β

Equations

• Lake.OrdHashSet.foldr f init self = Array.foldr f init self.toArray

@[inline]

def Lake.OrdHashSet.foldrM {α : Type u_1} [Hashable α] [BEq α] {m : Type u_2 → Type u_3} {β : Type u_2} [Monad m] (f : α → β → m β) (init : β) (self : OrdHashSet α) : m β

Equations

• Lake.OrdHashSet.foldrM f init self = Array.foldrM f init self.toArray

@[inline]

def Lake.OrdHashSet.forM {α : Type u_1} [Hashable α] [BEq α] {m : Type u_2 → Type u_3} [Monad m] (f : α → m PUnit) (self : OrdHashSet α) : m PUnit

Equations

• Lake.OrdHashSet.forM f self = Array.forM f self.toArray

@[inline]

def Lake.OrdHashSet.forIn {α : Type u_1} [Hashable α] [BEq α] {m : Type u_2 → Type u_3} {β : Type u_2} [Monad m] (self : OrdHashSet α) (init : β) (f : α → β → m (ForInStep β)) : m β

Equations

• self.forIn init f = forIn self.toArray init f

@[instance_reducible]

instance Lake.OrdHashSet.instForInOfMonad {α : Type u_1} [Hashable α] [BEq α] {m : Type u_2 → Type u_3} [Monad m] : ForIn m (OrdHashSet α) α

Equations

• Lake.OrdHashSet.instForInOfMonad = { forIn := fun {β : Type ?u.2} => Lake.OrdHashSet.forIn }