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

A HashSet that preserves insertion order.

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

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

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

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

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

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

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

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

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

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

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

@[inline]

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

@[inline]

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

@[inline]

def Lake.OrdHashSet.foldl {α : Type u_1} [Hashable α] [BEq α] {β : Type u_2} (f : β → α → β) (init : β) (self : 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 : OrdHashSet α) : m β

@[inline]

def Lake.OrdHashSet.foldr {α : Type u_1} [Hashable α] [BEq α] {β : Type u_2} (f : α → β → β) (init : β) (self : 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 : OrdHashSet α) : m β

@[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

@[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 β

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