Documentation

Duper.Util.LazyList

inductive Duper.LazyList (α : Type u) :
Instances For
    @[irreducible]
    def Duper.LazyList.size {α : Type u} :
    LazyList α → Nat
    Equations
    Instances For
      @[inline]
      def Duper.LazyList.pure {α : Type u} :
      α → LazyList α
      Equations
      Instances For
        @[irreducible]
        def Duper.LazyList.toList {α : Type u} :
        LazyList α → List α
        Equations
        Instances For
          @[irreducible]
          def Duper.LazyList.head {α : Type u} [Inhabited α] :
          LazyList α → α
          Equations
          Instances For
            @[irreducible]
            def Duper.LazyList.append {α : Type u} :
            LazyList α → LazyList α → LazyList α
            Equations
            Instances For
              @[irreducible]
              Equations
              Instances For
                partial def Duper.LazyList.interleaveω.iωrec {α : Type u} (i j : Nat) (q : Std.Queue (LazyList α)) (x : LazyList (LazyList α)) :
                def Duper.LazyList.bindω {α : Type u} {β : Type v} (xs : LazyList α) (f : α → LazyList β) :
                Equations
                Instances For
                  @[inline]
                  def Duper.LazyList.zip {α : Type u} {β : Type v} :
                  LazyList α → LazyList β → LazyList (α × β)
                  Equations
                  Instances For
                    @[inline]
                    def Duper.LazyList.bind {α : Type u} {β : Type v} (x : LazyList α) (f : α → LazyList β) :
                    Equations
                    Instances For
                      Equations
                      • One or more equations did not get rendered due to their size.
                      Equations
                      • One or more equations did not get rendered due to their size.
                      @[specialize #[]]
                      partial def Duper.LazyList.iterate {α : Type u} (f : α → α) :
                      α → LazyList α
                      @[specialize #[]]
                      partial def Duper.LazyList.iterate₂ {α : Type u} (f : α → α → α) :
                      α → α → LazyList α
                      partial def Duper.LazyList.cycle {α : Type u} :
                      LazyList α → LazyList α
                      partial def Duper.LazyList.repeats {α : Type u} :
                      α → LazyList α
                      @[irreducible]
                      Equations
                      Instances For
                        def Duper.LazyList.approxToString {α : Type u} [ToString α] (as : LazyList α) (n : Nat := 10) :
                        Equations
                        Instances For