structure Aesop.OrderedHashSet (α : Type u_1) [BEq α] [Hashable α] : Type u_1

A hash set that preserves the order of insertions.

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

@[instance_reducible]

instance Aesop.instInhabitedOrderedHashSet {a✝ : Type u_1} {a✝¹ : BEq a✝} {a✝² : Hashable a✝} : Inhabited (OrderedHashSet a✝)

@[instance_reducible]

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

def Aesop.OrderedHashSet.emptyWithCapacity {α : Type u_1} [BEq α] [Hashable α] (n : Nat) : OrderedHashSet α

def Aesop.OrderedHashSet.insert {α : Type u_1} [BEq α] [Hashable α] (x : α) (s : OrderedHashSet α) : OrderedHashSet α

def Aesop.OrderedHashSet.insertMany {α : Type u_1} [BEq α] [Hashable α] {ρ : Type u_2} [ForIn Id ρ α] (xs : ρ) (s : OrderedHashSet α) : OrderedHashSet α

def Aesop.OrderedHashSet.ofArray {α : Type u_1} [BEq α] [Hashable α] (xs : Array α) : OrderedHashSet α

def Aesop.OrderedHashSet.contains {α : Type u_1} [BEq α] [Hashable α] (x : α) (s : OrderedHashSet α) : Bool

@[instance_reducible]

instance Aesop.OrderedHashSet.instMembership {α : Type u_1} [BEq α] [Hashable α] : Membership α (OrderedHashSet α)

@[instance_reducible]

instance Aesop.OrderedHashSet.instDecidableMem {α : Type u_1} [BEq α] [Hashable α] {x : α} {s : OrderedHashSet α} : Decidable (x ∈ s)

@[specialize #[]]

def Aesop.OrderedHashSet.foldlM {α : Type u_1} [BEq α] [Hashable α] {m : Type u_2 → Type u_3} {β : Type u_2} [Monad m] (f : β → α → m β) (init : β) (s : OrderedHashSet α) : m β

def Aesop.OrderedHashSet.foldl {α : Type u_1} [BEq α] [Hashable α] {β : Type u_2} (f : β → α → β) (init : β) (s : OrderedHashSet α) : β

@[specialize #[]]

def Aesop.OrderedHashSet.foldrM {α : Type u_1} [BEq α] [Hashable α] {m : Type u_2 → Type u_3} {β : Type u_2} [Monad m] (f : α → β → m β) (init : β) (s : OrderedHashSet α) : m β

def Aesop.OrderedHashSet.foldr {α : Type u_1} [BEq α] [Hashable α] {β : Type u_2} (f : α → β → β) (init : β) (s : OrderedHashSet α) : β

@[instance_reducible]

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