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

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

A HashSet that preserves insertion order.

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

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

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

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

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

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

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

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

@[inline]

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

@[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 : Lake.OrdHashSet α) : m β

@[inline]

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

@[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 : Lake.OrdHashSet α) : m β