A hash set that preserves the order of insertions.
- toArray : Array α
- toHashSet : Std.HashSet α
Instances For
Equations
Instances For
instance
Aesop.instInhabitedOrderedHashSet
{a✝ : Type u_1}
{a✝¹ : BEq a✝}
{a✝² : Hashable a✝}
:
Inhabited (OrderedHashSet a✝)
Equations
Equations
Equations
Instances For
def
Aesop.OrderedHashSet.insert
{α : Type u_1}
[BEq α]
[Hashable α]
(x : α)
(s : OrderedHashSet α)
:
Equations
Instances For
def
Aesop.OrderedHashSet.insertMany
{α : Type u_1}
[BEq α]
[Hashable α]
{ρ : Type u_2}
[ForIn Id ρ α]
(xs : ρ)
(s : OrderedHashSet α)
:
Equations
Instances For
Equations
Instances For
def
Aesop.OrderedHashSet.contains
{α : Type u_1}
[BEq α]
[Hashable α]
(x : α)
(s : OrderedHashSet α)
:
Equations
Instances For
instance
Aesop.OrderedHashSet.instMembership
{α : Type u_1}
[BEq α]
[Hashable α]
:
Membership α (OrderedHashSet α)
Equations
instance
Aesop.OrderedHashSet.instDecidableMem
{α : Type u_1}
[BEq α]
[Hashable α]
{x : α}
{s : OrderedHashSet α}
:
Equations
@[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 β
Equations
Instances For
def
Aesop.OrderedHashSet.foldl
{α : Type u_1}
[BEq α]
[Hashable α]
{β : Type u_2}
(f : β → α → β)
(init : β)
(s : OrderedHashSet α)
:
β
Equations
Instances For
@[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 β
Equations
Instances For
def
Aesop.OrderedHashSet.foldr
{α : Type u_1}
[BEq α]
[Hashable α]
{β : Type u_2}
(f : α → β → β)
(init : β)
(s : OrderedHashSet α)
:
β
Equations
Instances For
instance
Aesop.OrderedHashSet.instForInOfMonad
{α : Type u_1}
[BEq α]
[Hashable α]
{m : Type u_2 → Type u_3}
[Monad m]
:
ForIn m (OrderedHashSet α) α