structure Lean.SMap (α : Type u) (β : Type v) [BEq α] [Hashable α] : Type (max u v)

Staged map for implementing the Environment. The idea is to store imported entries into a hashtable and local entries into a persistent hashtable.

Hypotheses:

• The number of entries (i.e., declarations) coming from imported files is much bigger than the number of entries in the current file.
• HashMap is faster than PersistentHashMap.
• When we are reading imported files, we have exclusive access to the map, and efficient destructive updates are performed.

Remarks:

• We never remove declarations from the Environment. In principle, we could support deletion by using (PHashMap α (Option β)) where the value none would indicate that an entry was "removed" from the hashtable.
• We do not need additional bookkeeping for extracting the local entries.

• stage₁ : Bool
• map₁ : Std.HashMap α β
• map₂ : Lean.PHashMap α β

instance Lean.SMap.instInhabited {α : Type u} {β : Type v} [BEq α] [Hashable α] : Inhabited (Lean.SMap α β)

def Lean.SMap.empty {α : Type u} {β : Type v} [BEq α] [Hashable α] : Lean.SMap α β

Equations

• Lean.SMap.empty = { stage₁ := true, map₁ := ∅, map₂ := { root := Lean.PersistentHashMap.Node.entries Lean.PersistentHashMap.mkEmptyEntriesArray } }

@[inline]

def Lean.SMap.fromHashMap {α : Type u} {β : Type v} [BEq α] [Hashable α] (m : Std.HashMap α β) (stage₁ : Bool := true) : Lean.SMap α β

Equations

• Lean.SMap.fromHashMap m stage₁ = { stage₁ := stage₁, map₁ := m, map₂ := { root := Lean.PersistentHashMap.Node.entries Lean.PersistentHashMap.mkEmptyEntriesArray } }

@[specialize #[]]

def Lean.SMap.insert {α : Type u} {β : Type v} [BEq α] [Hashable α] : Lean.SMap α β → α → β → Lean.SMap α β

@[specialize #[]]

def Lean.SMap.insert' {α : Type u} {β : Type v} [BEq α] [Hashable α] : Lean.SMap α β → α → β → Lean.SMap α β

Equations

• { stage₁ := true, map₁ := m₁, map₂ := m₂ }.insert' x✝ x = { stage₁ := true, map₁ := m₁.insert x✝ x, map₂ := m₂ }
• { stage₁ := false, map₁ := m₁, map₂ := m₂ }.insert' x✝ x = { stage₁ := false, map₁ := m₁, map₂ := Lean.PersistentHashMap.insert m₂ x✝ x }

@[specialize #[]]

def Lean.SMap.find? {α : Type u} {β : Type v} [BEq α] [Hashable α] : Lean.SMap α β → α → Option β

Equations

• { stage₁ := true, map₁ := m₁, map₂ := map₂ }.find? x = m₁[x]?
• { stage₁ := false, map₁ := m₁, map₂ := m₂ }.find? x = (Lean.PersistentHashMap.find? m₂ x).orElse fun (x_1 : Unit) => m₁[x]?

@[inline]

def Lean.SMap.findD {α : Type u} {β : Type v} [BEq α] [Hashable α] (m : Lean.SMap α β) (a : α) (b₀ : β) : β

@[inline]

def Lean.SMap.find! {α : Type u} {β : Type v} [BEq α] [Hashable α] [Inhabited β] (m : Lean.SMap α β) (a : α) : β

@[specialize #[]]

def Lean.SMap.contains {α : Type u} {β : Type v} [BEq α] [Hashable α] : Lean.SMap α β → α → Bool

Equations

• { stage₁ := true, map₁ := m₁, map₂ := map₂ }.contains x = m₁.contains x
• { stage₁ := false, map₁ := m₁, map₂ := m₂ }.contains x = (m₁.contains x || Lean.PersistentHashMap.contains m₂ x)

@[specialize #[]]

def Lean.SMap.find?' {α : Type u} {β : Type v} [BEq α] [Hashable α] : Lean.SMap α β → α → Option β

Similar to find?, but searches for result in the hashmap first. So, the result is correct only if we never "overwrite" map₁ entries using map₂.

def Lean.SMap.forM {α : Type u} {β : Type v} [BEq α] [Hashable α] {m : Type u_1 → Type u_1} [Monad m] (s : Lean.SMap α β) (f : α → β → m PUnit) : m PUnit

Equations

• s.forM f = do Std.HashMap.forM f s.map₁ Lean.PersistentHashMap.forM s.map₂ f

instance Lean.SMap.instForMProd {α : Type u} {β : Type v} [BEq α] [Hashable α] {m : Type u_1 → Type u_1} : ForM m (Lean.SMap α β) (α × β)

Equations

• Lean.SMap.instForMProd = { forM := fun [Monad m] (s : Lean.SMap α β) (f : α × β → m PUnit) => s.forM fun (x : α) (y : β) => f (x, y) }

instance Lean.SMap.instForInProd {α : Type u} {β : Type v} [BEq α] [Hashable α] {m : Type (max u_1 u_2) → Type u_1} : ForIn m (Lean.SMap α β) (α × β)

Equations

• Lean.SMap.instForInProd = { forIn := fun {β_1 : Type (max ?u.38 ?u.37)} [Monad m] => ForM.forIn }

def Lean.SMap.switch {α : Type u} {β : Type v} [BEq α] [Hashable α] (m : Lean.SMap α β) : Lean.SMap α β

Move from stage 1 into stage 2.

@[inline]

def Lean.SMap.foldStage2 {α : Type u} {β : Type v} [BEq α] [Hashable α] {σ : Type w} (f : σ → α → β → σ) (s : σ) (m : Lean.SMap α β) : σ

def Lean.SMap.foldM {α : Type u} {β : Type v} [BEq α] [Hashable α] {σ : Type w} {m : Type w → Type w} [Monad m] (f : σ → α → β → m σ) (init : σ) (map : Lean.SMap α β) : m σ

Monadic fold over a staged map.

Equations

• Lean.SMap.foldM f init map = do let __do_lift ← Std.HashMap.foldM f init map.map₁ Lean.PersistentHashMap.foldlM map.map₂ f __do_lift

def Lean.SMap.fold {α : Type u} {β : Type v} [BEq α] [Hashable α] {σ : Type w} (f : σ → α → β → σ) (init : σ) (m : Lean.SMap α β) : σ

Equations

• Lean.SMap.fold f init m = Lean.PersistentHashMap.foldl m.map₂ f (Std.HashMap.fold f init m.map₁)

def Lean.SMap.numBuckets {α : Type u} {β : Type v} [BEq α] [Hashable α] (m : Lean.SMap α β) : Nat

Equations

• m.numBuckets = Std.HashMap.Internal.numBuckets m.map₁

def Lean.SMap.toList {α : Type u} {β : Type v} [BEq α] [Hashable α] (m : Lean.SMap α β) : List (α × β)

def List.toSMap {α : Type u_1} {β : Type u_2} [BEq α] [Hashable α] (es : List (α × β)) : Lean.SMap α β

Equations

• One or more equations did not get rendered due to their size.

instance Lean.instReprSMap {α : Type u_1} {β : Type u_2} {x✝ : BEq α} {x✝¹ : Hashable α} [Repr α] [Repr β] : Repr (Lean.SMap α β)