def Lean.PersistentHashMap.ofList {α : Type u_1} [BEq α] [Hashable α] {β : Type u_2} (xs : List (α × β)) : PersistentHashMap α β

Builds a PersistentHashMap from a list of key-value pairs. Values of duplicated keys are replaced by their respective last occurrences.

def Lean.PersistentHashMap.ofListWith {α : Type u_1} [BEq α] [Hashable α] {β : Type u_2} (xs : List (α × β)) (f : α → β → β → β) : PersistentHashMap α β

Variant of ofList which accepts a function that combines values of duplicated keys.

def Lean.PersistentHashMap.ofArray {α : Type u_1} [BEq α] [Hashable α] {β : Type u_2} (xs : Array (α × β)) : PersistentHashMap α β

Builds a PersistentHashMap from an array of key-value pairs. Values of duplicated keys are replaced by their respective last occurrences.

def Lean.PersistentHashMap.ofArrayWith {α : Type u_1} [BEq α] [Hashable α] {β : Type u_2} (xs : Array (α × β)) (f : α → β → β → β) : PersistentHashMap α β

Variant of ofArray which accepts a function that combines values of duplicated keys.

@[specialize #[]]

def Lean.PersistentHashMap.mergeWithM {α : Type u_1} [BEq α] [Hashable α] {m : Type (max u_2 u_1) → Type u_3} {β : Type (max u_2 u_1)} [Monad m] (self other : PersistentHashMap α β) (f : α → β → β → m β) : m (PersistentHashMap α β)

Merge two PersistentHashMaps. The values of keys which appear in both maps are combined using the monadic function f.

@[inline]

def Lean.PersistentHashMap.mergeWith {α : Type u_1} [BEq α] [Hashable α] {β : Type u_2} (self other : PersistentHashMap α β) (f : α → β → β → β) : PersistentHashMap α β

Merge two PersistentHashMaps. The values of keys which appear in both maps are combined using f.