scalaz/scalaz/IndSeq

IndSeq

final
class IndSeq[A](val self: FingerTree[Int, A])

Indexed sequences, based on scalaz.FingerTree

The measure is the count of the preceding elements, provided by UnitReducer((e: Int) => 1).

Companion
object
class Object
trait Matchable
class Any

Value members

Concrete methods

def ++(xs: IndSeq[A]): IndSeq[A]
def +:(x: => A): IndSeq[A]
def :+(x: => A): IndSeq[A]
def apply(i: Int): A
def drop(n: Int): IndSeq[A]
def flatMap[B](f: A => IndSeq[B]): IndSeq[B]
def init: IndSeq[A]
def length: Int
def map[B](f: A => B): IndSeq[B]
def replace(i: Int, a: => A): IndSeq[A]
def split(i: Int): (IndSeq[A], IndSeq[A])
def tail: IndSeq[A]
def take(n: Int): IndSeq[A]

Concrete fields

val self: FingerTree[Int, A]

Implicits

Implicits

implicit
def sizer[A]: Reducer[A, Int]