Array iterator

This module provides an iterator for arrays that is accessible via Array.iterM.

@[unbox]

structure Std.Iterators.Types.ArrayIterator (α : Type w) : Type w

The underlying state of a list iterator. Its contents are internal and should not be used by downstream users of the library.

• array : Array α

  Internal implementation detail of the iterator library.

• pos : Nat

  Internal implementation detail of the iterator library.

theorem Std.Iterators.Types.ArrayIterator.ext {α : Type w} {x y : ArrayIterator α} (array : x.array = y.array) (pos : x.pos = y.pos) : x = y

theorem Std.Iterators.Types.ArrayIterator.ext_iff {α : Type w} {x y : ArrayIterator α} : x = y ↔ x.array = y.array ∧ x.pos = y.pos

theorem Std.Iterators.Types.ArrayIterator.exists_iff {α : Type w} {P : ArrayIterator α → Prop} : (∃ (s : ArrayIterator α), P s) ↔ ∃ (array : Array α), ∃ (pos : Nat), P { array := array, pos := pos }

@[match_pattern, inline]

def Array.iterFromIdxM {α : Type w} (array : Array α) (m : Type w → Type w') (pos : Nat) [Pure m] : Std.IterM m α

Returns a finite monadic iterator for the given array starting at the given index. The iterator yields the elements of the array in order and then terminates.

The pure version of this iterator is Array.iterFromIdx.

Termination properties:

• Finite instance: always
• Productive instance: always

Equations

• array.iterFromIdxM m pos = { internalState := { array := array, pos := pos } }

@[inline]

def Array.iterM {α : Type w} (array : Array α) (m : Type w → Type w') [Pure m] : Std.IterM m α

Returns a finite monadic iterator for the given array. The iterator yields the elements of the array in order and then terminates. There are no side effects.

The pure version of this iterator is Array.iter.

Termination properties:

• Finite instance: always
• Productive instance: always

Equations

• array.iterM m = array.iterFromIdxM m 0

@[instance_reducible, inline]

instance Std.Iterators.Types.ArrayIterator.instIterator {m : Type w → Type w'} {α : Type w} [Pure m] : Iterator (ArrayIterator α) m α

Equations

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

instance Std.Iterators.Types.ArrayIterator.instFinite {α : Type w} {m : Type w → Type w'} [Pure m] : Finite (ArrayIterator α) m

@[instance_reducible, inline]

instance Std.Iterators.Types.ArrayIterator.instIteratorLoop {m : Type w → Type w'} {α : Type w} [Monad m] {n : Type x → Type x'} [Monad n] : IteratorLoop (ArrayIterator α) m n

Equations

• Std.Iterators.Types.ArrayIterator.instIteratorLoop = Std.IteratorLoop.defaultImplementation