CollBuilder

Abstract Value Members

abstract def Monoids: MonoidBuilder
abstract def emptyColl[T](implicit tT: RType[T]): Coll[T]

Create an empty collection with items of the given type.
Create an empty collection with items of the given type. Even though there are no items, the type of them is specified.
abstract def flattenColl[A](coll: Coll[Coll[A]])(implicit arg0: RType[A]): Coll[A]

Flattens a two-dimensional array by concatenating all its rows into a single array.
Flattens a two-dimensional array by concatenating all its rows into a single array.
returns
An array obtained by concatenating rows of this array.
abstract def fromArray[T](arr: Array[T])(implicit arg0: RType[T]): Coll[T]

Wrap array into collection.
Wrap array into collection.

Annotations
@Internal()
abstract def fromItems[T](items: T*)(implicit cT: RType[T]): Coll[T]

Construct a new collection from the given list of arguments.
Construct a new collection from the given list of arguments. The arguments should be of the same type for which there should be an implicit type descriptor at the call site.

Annotations
@Reified()
abstract def fromMap[K, V](m: Map[K, V])(implicit arg0: RType[K], arg1: RType[V]): Coll[(K, V)]

Construct a collection of (K,V) pairs using PairColl representation, in which keys and values are stored as separate unboxed arrays.
Construct a collection of (K,V) pairs using PairColl representation, in which keys and values are stored as separate unboxed arrays.

Annotations
@Internal()
abstract def makePartialView[A, B](source: Coll[A], f: (A) ⇒ B, calculated: Array[Boolean], calculatedItems: Array[B])(implicit arg0: RType[B]): Coll[B]

Annotations
@Internal()
abstract def makeView[A, B](source: Coll[A], f: (A) ⇒ B)(implicit arg0: RType[B]): Coll[B]

Create a new collection in which every item is executed lazily form the corresponding item of the source collection.
Create a new collection in which every item is executed lazily form the corresponding item of the source collection.
source
collection which is used as the source of items
f
function to compute each item of this collection from the source item This is O(1) operation, all executions of f are delayed until the corresponding item of this collection is needed in some operation.

Annotations
@Internal()
abstract def outerJoin[K, L, R, O](left: Coll[(K, L)], right: Coll[(K, R)])(l: ((K, L)) ⇒ O, r: ((K, R)) ⇒ O, inner: ((K, (L, R))) ⇒ O)(implicit arg0: RType[K], arg1: RType[O]): Coll[(K, O)]

Performs outer join operation between left and right collections.
Performs outer join operation between left and right collections. This is a restricted version of relational join operation. It expects left and right collections have distinct K values in pairs (otherwise exception is thrown). Under this condition resulting collection has size <= left.size + right.size.
l
projection function executed for each element of left
r
projection function executed for each element of right
inner
projection function which is executed for matching items (K, L) and (K, R) with the same K
returns
collection of (K, O) pairs, where each key comes form either left or right collection and values are produced by projections

Since
2.0
abstract def pairColl[A, B](as: Coll[A], bs: Coll[B]): PairColl[A, B]
abstract def replicate[T](n: Int, v: T)(implicit arg0: RType[T]): Coll[T]

Creates a new collection by replicating value v.
Creates a new collection by replicating value v.
n
how many times to replicate value v
v
value to replicate
returns
collection of the form (v, v, v, ... v) of n elements.
abstract def unzip[A, B](xs: Coll[(A, B)]): (Coll[A], Coll[B])

Deconstruct collection of (A,B) pairs into pair of collections.
Deconstruct collection of (A,B) pairs into pair of collections. If xs is represented as PairColl, then this is O(1) operation (no data is touched).
abstract def xor(left: Coll[Byte], right: Coll[Byte]): Coll[Byte]

Element-wise xor of two collections.

Concrete Value Members

final def !=(arg0: Any): Boolean

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

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
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] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

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

Definition Classes
Any
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def pairCollFromArrays[A, B](as: Array[A], bs: Array[B])(implicit arg0: RType[A], arg1: RType[B]): PairColl[A, B]

Annotations
@Internal()
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
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 Doc: package collection

trait CollBuilder extends AnyRef

Abstract Value Members

abstract def Monoids: MonoidBuilder

abstract def emptyColl[T](implicit tT: RType[T]): Coll[T]

abstract def flattenColl[A](coll: Coll[Coll[A]])(implicit arg0: RType[A]): Coll[A]

abstract def fromArray[T](arr: Array[T])(implicit arg0: RType[T]): Coll[T]

abstract def fromItems[T](items: T*)(implicit cT: RType[T]): Coll[T]

abstract def fromMap[K, V](m: Map[K, V])(implicit arg0: RType[K], arg1: RType[V]): Coll[(K, V)]

abstract def makePartialView[A, B](source: Coll[A], f: (A) ⇒ B, calculated: Array[Boolean], calculatedItems: Array[B])(implicit arg0: RType[B]): Coll[B]

abstract def makeView[A, B](source: Coll[A], f: (A) ⇒ B)(implicit arg0: RType[B]): Coll[B]

abstract def outerJoin[K, L, R, O](left: Coll[(K, L)], right: Coll[(K, R)])(l: ((K, L)) ⇒ O, r: ((K, R)) ⇒ O, inner: ((K, (L, R))) ⇒ O)(implicit arg0: RType[K], arg1: RType[O]): Coll[(K, O)]

abstract def pairColl[A, B](as: Coll[A], bs: Coll[B]): PairColl[A, B]

abstract def replicate[T](n: Int, v: T)(implicit arg0: RType[T]): Coll[T]

abstract def unzip[A, B](xs: Coll[(A, B)]): (Coll[A], Coll[B])

abstract def xor(left: Coll[Byte], right: Coll[Byte]): Coll[Byte]

Concrete Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def pairCollFromArrays[A, B](as: Array[A], bs: Array[B])(implicit arg0: RType[A], arg1: RType[B]): PairColl[A, B]

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

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from AnyRef

Inherited from Any

Ungrouped