case class Three[V, A](v: V, a1: A, a2: A, a3: A)(implicit r: Reducer[A, V]) extends Finger[V, A] with Product with Serializable
- Source
- FingerTree.scala
- Alphabetic
- By Inheritance
- Three
- Serializable
- Product
- Equals
- Finger
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- def +:(a: A): Four[V, A]
Append the given element to the right
- def :+(a: A): Four[V, A]
Prepends the given element to the left
- def :-|(a: A): Three[V, A]
Replaces the last element of this finger with
a
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- val a1: A
- val a2: A
- val a3: A
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- def foldMap[B](f: (A) => B)(implicit m: Semigroup[B]): B
- def foreach(f: (A) => Unit): Unit
Apply the given side effect to each element.
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def iterator: Iterator[A]
An iterator that visits each element.
- def lhead: A
- def ltail: Two[V, A]
- def map[B, V2](f: (A) => B)(implicit r: Reducer[B, V2]): Three[V2, B]
- val measure: v.type
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- def productElementNames: Iterator[String]
- Definition Classes
- Product
- def reverseIterator: Iterator[A]
An iterator that visits each element in reverse order.
- def rhead: A
- def rtail: Two[V, A]
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toList: List[A]
- Definition Classes
- Finger
- def toTree: FingerTree[V, A]
- val v: V
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- def |-:(a: A): Three[V, A]
Replaces the first element of this finger with
a