File: .lake/packages/aesop/Aesop/Util/UnorderedArraySet.lean

full_name: _private.«.lake».packages.aesop.Aesop.Util.UnorderedArraySet.0.Aesop.UnorderedArraySet.rep
code: structure UnorderedArraySet (α) [BEq α] where
  private mk ::
  private rep : Array α
  deriving Inhabited
goal: Array α

full_name: Aesop.UnorderedArraySet
code: structure UnorderedArraySet (α) [BEq α] where
  private mk ::
  private rep : Array α
  deriving Inhabited
goal: Type u_1

full_name: Aesop.instInhabitedUnorderedArraySet
code: structure UnorderedArraySet (α) [BEq α] where
  private mk ::
  private rep : Array α
  deriving Inhabited
goal: {a : Type u_1} → {a_1 : BEq a} → Inhabited (Aesop.UnorderedArraySet a)

full_name: _private.«.lake».packages.aesop.Aesop.Util.UnorderedArraySet.0.Aesop.UnorderedArraySet.mk
code: structure UnorderedArraySet (α) [BEq α] where
  private mk ::
  private rep : Array α
  deriving Inhabited
goal: Aesop.UnorderedArraySet α

full_name: Aesop.UnorderedArraySet.empty
code: /-- O(1) -/
protected def empty : UnorderedArraySet α 
goal: Aesop.UnorderedArraySet α

full_name: Aesop.UnorderedArraySet.instEmptyCollection
code: instance : EmptyCollection (UnorderedArraySet α) 
goal: EmptyCollection (Aesop.UnorderedArraySet α)

full_name: Aesop.UnorderedArraySet.singleton
code: /-- O(1) -/
protected def singleton (a : α) : UnorderedArraySet α 
goal: Aesop.UnorderedArraySet α

full_name: Aesop.UnorderedArraySet.insert
code: /-- O(n) -/
def insert (x : α) : UnorderedArraySet α → UnorderedArraySet α
  
goal: Aesop.UnorderedArraySet α → Aesop.UnorderedArraySet α

full_name: Aesop.UnorderedArraySet.ofDeduplicatedArray
code: /-- Precondition: `xs` contains no duplicates. -/
protected def ofDeduplicatedArray (xs : Array α) : UnorderedArraySet α 
goal: Aesop.UnorderedArraySet α

full_name: Aesop.UnorderedArraySet.ofSortedArray
code: /-- Precondition: `xs` is sorted. -/
protected def ofSortedArray (xs : Array α) : UnorderedArraySet α 
goal: Aesop.UnorderedArraySet α

full_name: Aesop.UnorderedArraySet.ofArray
code: /-- O(n*log(n)) -/
protected def ofArray [ord : Ord α] [Inhabited α] (xs : Array α) :
    UnorderedArraySet α 
goal: Aesop.UnorderedArraySet α

full_name: Aesop.UnorderedArraySet.ofArraySlow
code: /-- O(n^2) -/
protected def ofArraySlow (xs : Array α) : UnorderedArraySet α 
goal: Aesop.UnorderedArraySet α

full_name: Aesop.UnorderedArraySet.ofHashSet
code: protected def ofHashSet [Hashable α] (xs : HashSet α) : UnorderedArraySet α 
goal: Aesop.UnorderedArraySet α

full_name: Aesop.UnorderedArraySet.ofPersistentHashSet
code: protected def ofPersistentHashSet [Hashable α] (xs : PersistentHashSet α) : UnorderedArraySet α 
goal: Aesop.UnorderedArraySet α

full_name: Aesop.UnorderedArraySet.toArray
code: protected def toArray (s : UnorderedArraySet α) : Array α 
goal: Array α

full_name: Aesop.UnorderedArraySet.erase
code: /-- O(n) -/
def erase (x : α) (s : UnorderedArraySet α) : UnorderedArraySet α 
goal: Aesop.UnorderedArraySet α

full_name: Aesop.UnorderedArraySet.filterM
code: /-- O(n) -/
def filterM [Monad m] (p : α → m Bool) (s : UnorderedArraySet α) :
    m (UnorderedArraySet α) 
goal: m (Aesop.UnorderedArraySet α)

full_name: Aesop.UnorderedArraySet.filter
code: /-- O(n) -/
def filter (p : α → Bool) (s : UnorderedArraySet α) : UnorderedArraySet α 
goal: Aesop.UnorderedArraySet α

full_name: Aesop.UnorderedArraySet.merge
code: /-- O(n*m) -/
def merge (s t : UnorderedArraySet α) : UnorderedArraySet α 
goal: Aesop.UnorderedArraySet α

full_name: Aesop.UnorderedArraySet.instAppend
code: instance : Append (UnorderedArraySet α) 
goal: Append (Aesop.UnorderedArraySet α)

full_name: Aesop.UnorderedArraySet.contains
code: /-- O(n) -/
def contains (x : α) (s : UnorderedArraySet α) : Bool 
goal: Bool

full_name: Aesop.UnorderedArraySet.foldM
code: /-- O(n) -/
def foldM [Monad m] (f : σ → α → m σ) (init : σ) (s : UnorderedArraySet α) :
    m σ 
goal: m σ

full_name: Aesop.UnorderedArraySet.instForInOfMonad
code: instance [Monad m] : ForIn m (UnorderedArraySet α) α 
goal: ForIn m (Aesop.UnorderedArraySet α) α

full_name: Aesop.UnorderedArraySet.fold
code: /-- O(n) -/
def fold (f : σ → α → σ) (init : σ) (s : UnorderedArraySet α) : σ 
goal: σ

full_name: Aesop.UnorderedArraySet.partition
code: def partition (f : α → Bool) (s : UnorderedArraySet α) :
    (UnorderedArraySet α × UnorderedArraySet α) 
goal: Aesop.UnorderedArraySet α × Aesop.UnorderedArraySet α

full_name: Aesop.UnorderedArraySet.size
code: /-- O(1) -/
def size (s : UnorderedArraySet α) : Nat 
goal: Nat

full_name: Aesop.UnorderedArraySet.isEmpty
code: /-- O(1) -/
def isEmpty (s : UnorderedArraySet α) : Bool 
goal: Bool

full_name: Aesop.UnorderedArraySet.anyM
code: /-- O(n) -/
def anyM [Monad m] (p : α → m Bool) (s : UnorderedArraySet α) (start := 0)
    (stop := s.size) : m Bool 
goal: m Bool

full_name: Aesop.UnorderedArraySet.any
code: /-- O(n) -/
def any (p : α → Bool) (s : UnorderedArraySet α) (start := 0) (stop := s.size) :
    Bool 
goal: Bool

full_name: Aesop.UnorderedArraySet.allM
code: /-- O(n) -/
def allM [Monad m] (p : α → m Bool) (s : UnorderedArraySet α) (start := 0)
    (stop := s.size) : m Bool 
goal: m Bool

full_name: Aesop.UnorderedArraySet.all
code: /-- O(n) -/
def all (p : α → Bool) (s : UnorderedArraySet α) (start := 0) (stop := s.size) :
    Bool 
goal: Bool

full_name: Aesop.UnorderedArraySet.instBEq
code: instance : BEq (UnorderedArraySet α) 
goal: BEq (Aesop.UnorderedArraySet α)

full_name: Aesop.UnorderedArraySet.instToString
code: instance [ToString α] : ToString (UnorderedArraySet α) 
goal: ToString (Aesop.UnorderedArraySet α)

full_name: Aesop.UnorderedArraySet.instToFormat
code: instance [ToFormat α] : ToFormat (UnorderedArraySet α) 
goal: Lean.ToFormat (Aesop.UnorderedArraySet α)

full_name: Aesop.UnorderedArraySet.instToMessageData
code: instance [ToMessageData α] : ToMessageData (UnorderedArraySet α) 
goal: Lean.ToMessageData (Aesop.UnorderedArraySet α)