structure Lean.Ptr (α : Type u) : Type u

• value : α

Instances For

• Lean.instBEqPtr
• Lean.instHashablePtr

unsafe instance Lean.instHashablePtr {α : Type u_1} : Hashable (Lean.Ptr α)

Equations

• Lean.instHashablePtr = { hash := fun (a : Lean.Ptr α) => hash64 (USize.toUInt64 (ptrAddrUnsafe a)) }

unsafe instance Lean.instBEqPtr {α : Type u_1} : BEq (Lean.Ptr α)

Equations

• Lean.instBEqPtr = { beq := fun (a b : Lean.Ptr α) => ptrAddrUnsafe a == ptrAddrUnsafe b }

unsafe def Lean.PtrSet (α : Type) : Type

Set of pointers. It is a low-level auxiliary datastructure used for traversing DAGs.

Equations

• Lean.PtrSet α = Lean.HashSet (Lean.Ptr α)

unsafe def Lean.mkPtrSet {α : Type} (capacity : optParam Nat 64) : Lean.PtrSet α

Equations

• Lean.mkPtrSet capacity = Lean.mkHashSet capacity

@[inline, reducible]

unsafe abbrev Lean.PtrSet.insert {α : Type} (s : Lean.PtrSet α) (a : α) : Lean.PtrSet α

Equations

• Lean.PtrSet.insert s a = Lean.HashSet.insert s { value := a }

@[inline, reducible]

unsafe abbrev Lean.PtrSet.contains {α : Type} (s : Lean.PtrSet α) (a : α) : Bool

Equations

• Lean.PtrSet.contains s a = Lean.HashSet.contains s { value := a }