instance Lean.NameSet.instSingletonName_batteries : Singleton Lean.Name Lean.NameSet

Equations

• Lean.NameSet.instSingletonName_batteries = { singleton := fun (n : Lean.Name) => ∅.insert n }

instance Lean.NameSet.instUnion_batteries : Union Lean.NameSet

Equations

• Lean.NameSet.instUnion_batteries = { union := fun (s t : Lean.NameSet) => Lean.RBTree.fold (fun (t : Lean.NameSet) (n : Lean.Name) => t.insert n) t s }

instance Lean.NameSet.instInter_batteries : Inter Lean.NameSet

Equations

• Lean.NameSet.instInter_batteries = { inter := fun (s t : Lean.NameSet) => Lean.RBTree.fold (fun (r : Lean.NameSet) (n : Lean.Name) => if t.contains n = true then r.insert n else r) ∅ s }

instance Lean.NameSet.instSDiff_batteries : SDiff Lean.NameSet

Equations

• Lean.NameSet.instSDiff_batteries = { sdiff := fun (s t : Lean.NameSet) => Lean.RBTree.fold (fun (s : Lean.NameSet) (n : Lean.Name) => Lean.RBTree.erase s n) s t }

def Lean.NameSet.ofList (l : List Lean.Name) : Lean.NameSet

Create a Lean.NameSet from a List. This operation is O(n) in the length of the list.

Equations

• Lean.NameSet.ofList l = List.foldl (fun (s : Lean.NameSet) (n : Lean.Name) => s.insert n) ∅ l

def Lean.NameSet.ofArray (a : Array Lean.Name) : Lean.NameSet

Create a Lean.NameSet from an Array. This operation is O(n) in the size of the array.

Equations

• Lean.NameSet.ofArray a = Array.foldl (fun (s : Lean.NameSet) (n : Lean.Name) => s.insert n) ∅ a