Iterators on DTreeMap

@[inline]

def Std.TreeMap.iter {α : Type u} {β : Type v} {cmp : α → α → Ordering} (m : TreeMap α β cmp) : Iter (α × β)

Returns a finite iterator over the entries of a tree map. The iterator yields the elements of the map in order and then terminates.

Termination properties:

• Finite instance: always
• Productive instance: always

Equations

• m.iter = Std.Iter.map (fun (e : (_ : α) × β) => (e.fst, e.snd)) m.inner.iter

@[inline]

def Std.TreeMap.keysIter {α β : Type u} {cmp : α → α → Ordering} (m : TreeMap α β cmp) : Iter α

Returns a finite iterator over the keys of a tree map. The iterator yields the keys in order and then terminates.

The key and value types must live in the same universe.

Termination properties:

• Finite instance: always
• Productive instance: always

Equations

• m.keysIter = m.inner.keysIter

@[inline]

def Std.TreeMap.valuesIter {α β : Type u} {cmp : α → α → Ordering} (m : TreeMap α β cmp) : Iter β

Returns a finite iterator over the values of a tree map. The iterator yields the values in order and then terminates.

The key and value types must live in the same universe.

Termination properties:

• Finite instance: always
• Productive instance: always

Equations

• m.valuesIter = m.inner.valuesIter

@[simp]

theorem Std.TreeMap.toList_iter {α : Type u_1} {β : Type u_2} {cmp : α → α → Ordering} (m : TreeMap α β cmp) : m.iter.toList = m.toList

@[simp]

theorem Std.TreeMap.keysIter_toList {α β : Type u_1} {cmp : α → α → Ordering} (m : TreeMap α β cmp) : m.keysIter.toList = m.keys

@[simp]

theorem Std.TreeMap.valuesIter_toList {α β : Type u_1} {cmp : α → α → Ordering} (m : TreeMap α β cmp) : m.valuesIter.toList = m.values