This file provides an empty iterator.

structure Std.Iterators.Types.Empty (m : Type w → Type w') (β : Type w) : Type w

The internal state of the IterM.empty iterator.

@[inline]

def Std.IterM.empty (m : Type w → Type w') (β : Type w) : IterM m β

Returns an iterator that terminates immediately.

Termination properties:

• Finite instance: always
• Productive instance: always

Equations

• Std.IterM.empty m β = { internalState := { } }

def Std.Iterators.Types.Empty.PlausibleStep {m : Type w → Type w'} {β : Type w} : IterM m β → (step : IterStep (IterM m β) β) → Prop

Equations

• Std.Iterators.Types.Empty.PlausibleStep x✝ step = (step = Std.IterStep.done)

@[implicit_reducible]

instance Std.Iterators.Types.Empty.instIterator {m : Type w → Type w'} {β : Type w} [Monad m] : Iterator (Empty m β) m β

Equations

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

instance Std.Iterators.Types.Empty.instFinite {m : Type w → Type w'} {β : Type w} [Monad m] : Finite (Empty m β) m

@[implicit_reducible]

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

Equations

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