IndSeq

Indexed sequences, based on scalaz.FingerTree

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

Source: FingerTree.scala

Linear Supertypes

Ops[FingerTree[Int, A]], AnyRef, Any

Abstract Value Members

abstract def self: FingerTree[Int, A]

Definition Classes
Ops

Concrete Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
def ++(xs: IndSeq[A]): IndSeq[A]
def +:(x: ⇒ A): IndSeq[A]
def :+(x: ⇒ A): IndSeq[A]
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def apply(i: Int): A
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def drop(n: Int): IndSeq[A]
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def flatMap[B](f: (A) ⇒ IndSeq[B]): IndSeq[B]
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
def init: IndSeq[A]
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def length: Int
def map[B](f: (A) ⇒ B): IndSeq[B]
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def replace(i: Int, a: ⇒ A): IndSeq[A]
implicit def sizer[A]: Reducer[A, Int]
def split(i: Int): (IndSeq[A], IndSeq[A])
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def tail: IndSeq[A]
def take(n: Int): IndSeq[A]
def toString(): String

Definition Classes
AnyRef → Any
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Docs: object IndSeq | package scalaz

sealed trait IndSeq[A] extends Ops[FingerTree[Int, A]]

Abstract Value Members

abstract def self: FingerTree[Int, A]

Concrete Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

def ++(xs: IndSeq[A]): IndSeq[A]

def +:(x: ⇒ A): IndSeq[A]

def :+(x: ⇒ A): IndSeq[A]

final def ==(arg0: Any): Boolean

def apply(i: Int): A

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def drop(n: Int): IndSeq[A]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def flatMap[B](f: (A) ⇒ IndSeq[B]): IndSeq[B]

final def getClass(): Class[_]

def hashCode(): Int

def init: IndSeq[A]

final def isInstanceOf[T0]: Boolean

def length: Int

def map[B](f: (A) ⇒ B): IndSeq[B]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def replace(i: Int, a: ⇒ A): IndSeq[A]

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

def split(i: Int): (IndSeq[A], IndSeq[A])

final def synchronized[T0](arg0: ⇒ T0): T0

def tail: IndSeq[A]

def take(n: Int): IndSeq[A]

def toString(): String

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

Inherited from Ops[FingerTree[Int, A]]

Inherited from AnyRef

Inherited from Any

Ungrouped