ArrayLike

trait ArrayLike[+A] extends ArrayLikeBase[A]

This the base trait for all collections based on Array like classes, Arrays, ArrayBuffers etc. that compile time platform Array classes. So currently there are just two classes for each type A, An ArrImut that wraps a standard immutable Array to produce an immutable array, and a ArrBuff that wraps an ArrayBuffer. Currently this just in a standard ArrayBuffer. Where A is a compound value types or an AnyVal type.

trait ArrayLikeBase[A]
class Any
class AnyBuff[A]
trait ArrImut[A]
class Arr[A]
trait ArrArrayDbl[A]
class Booleans
class Chars
class Dbls
class Floats
class Ints
class Longs
class Strings
trait ValueNsArr[A]
trait DblNsArr[A]
trait Dbl1sArr[A]
class Angles
trait Dbl2sArr[A]
class MyDbl2s
class LatLongs
class PolygonLL
class LinePath
class PolygonM
class Pt2MArr
class Pt2s
trait Dbl3sArr[A]
class PolygonM3
class Pt3MArr
class Pt3s
trait Dbl4sArr[A]
class LineSegs
trait Dbl5sArr[A]
trait Dbl6sArr[A]
trait Dbl7sArr[A]
trait IntNsArr[A]
trait Int1sArr[A]
class Colours
trait Int2sArr[A]
class Coods
class Roords
class HCens
class HSides
class HVerts
trait Int4sArr[A]
class CoodLines
trait LongNsArr[A]
trait Long1sArr[A]
class DblsBuff
class IntBuff
class LongsBuff
trait ValueNsBuffer[A]
trait DblNsBuffer[A]
trait Dbl2sBuffer[A]
class MinesBuff
class Pt2Buff
trait Dbl3sBuffer[A]
class Pt3Buff
class Pt3MBuff
trait Dbl4sBuffer[A]
trait IntNsBuffer[A]
trait Int1sBuffer[A, M]
trait Int2sBuffer[A, M]
class CoodBuff
class RoordBuff
class HVertBuff
trait Int4sBuffer[A, M]
trait LongNsBuffer[A]
trait Long1sBuffer[A, ArrA]

Type members

Types

type ThisT <: ArrayLike[A]

The final type of this object.

The final type of this object.

Value members

Abstract methods

@inline
def apply(index: Int): A

Concrete methods

def collect[B, BB <: ArrImut[B]](pf: PartialFunction[A, B])(implicit ev: ArrTBuilder[B, BB]): BB

Collects values of B by applying partial function to only those elements of A, for which the PartialFunction is defined.

Collects values of B by applying partial function to only those elements of A, for which the PartialFunction is defined.

def collectList[B](pf: PartialFunction[A, B]): List[B]

Collects a List values of B by applying partial function to only those elements of A, for which the PartialFunction is defined.

Collects a List values of B by applying partial function to only those elements of A, for which the PartialFunction is defined.

def contains[A1 >: A](elem: A1): Boolean
@inline
def cycleGet(index: Int): A

Applies an index to this ArrayLike collection which cycles back to element 0, when it reaches the end of the collection. Accepts even negative integers as an index value without throwing an exception.

Applies an index to this ArrayLike collection which cycles back to element 0, when it reaches the end of the collection. Accepts even negative integers as an index value without throwing an exception.

def eMap[B, ArrB <: ArrImut[B]](f: A => EMon[B])(implicit ev: ArrTBuilder[B, ArrB]): EMon[ArrB]
def eMapList[B](f: A => EMon[B]): EMon[List[B]]
@inline
def empty: Boolean
def existsCount(f: A => Boolean): Int

Counts the number of elements that fulfil the condition A => Boolean

Counts the number of elements that fulfil the condition A => Boolean

def fHeadElse[B](noHead: => B)(ifHead: A => B): B
def fMax[B](defaultValue: B)(f: A => B)(implicit cmp: Ordering[B]): B

Gives the maximum value of type B, produced by applying the function from A to B on each element of this collection, or the default value if the collection is empty.

Gives the maximum value of type B, produced by applying the function from A to B on each element of this collection, or the default value if the collection is empty.

def fMin[B](defaultValue: B)(f: A => B)(implicit cmp: Ordering[B]): B

Gives the minimum value of type B, produced by applying the function from A to B on each element of this collection, or the default value if the collection is empty.

Gives the minimum value of type B, produced by applying the function from A to B on each element of this collection, or the default value if the collection is empty.

def filter[ArrA <: ArrImut[A]](f: A => Boolean)(implicit ev: ArrTBuilder[A, ArrA]): ArrA
def filterNot[ArrA <: ArrImut[A]](f: A => Boolean)(implicit ev: ArrTBuilder[A, ArrA]): ArrA
def filterToList(f: A => Boolean): List[A]
def flatMap[ArrB <: ArrImut[_]](f: A => ArrB)(implicit ev: ArrTFlatBuilder[ArrB]): ArrB

Specialised flatMap to an immutable Arr.

Specialised flatMap to an immutable Arr.

def foldHeadTail[B](initial: B)(fHead: (B, A) => B)(fTail: (B, A) => B): B
def foldLeft[B](initial: B)(f: (B, A) => B): B
def foldTailLeft[B](initial: B)(f: (B, A) => B): B
def forAll(p: A => Boolean): Boolean
def foreach[U](f: A => U): Unit
def foreachInit[U](f: A => U): Unit
def foreachReverse[U](f: A => U): Unit

Consider changing this name, as might not be appropriate to all sub classes.

Consider changing this name, as might not be appropriate to all sub classes.

def foreachTail[U](f: A => U): Unit
@inline
def head: A
def headToStringElse(ifEmptyString: String): String
def iFlatMap[ArrB <: ArrImut[_]](f: (A, Int) => ArrB)(implicit build: ArrTFlatBuilder[ArrB]): ArrB

Specialised flatMap with index to an immutable Arr.

Specialised flatMap with index to an immutable Arr.

def iFlatMap[ArrB <: ArrImut[_]](iInit: Int)(f: (A, Int) => ArrB)(implicit build: ArrTFlatBuilder[ArrB]): ArrB

Specialised flatMap with index to an immutable Arr.

Specialised flatMap with index to an immutable Arr.

def iForAll(p: (A, Int) => Boolean): Boolean
override def iForeach[U](f: (A, Int) => U): Unit
Definition Classes
def iForeach[U](startIndex: Int)(f: (A, Int) => U): Unit

foreach with index.

foreach with index.

def iForeachReverse[U](f: (A, Int) => U): Unit
def iMap[B, ArrB <: ArrImut[B]](f: (A, Int) => B)(implicit ev: ArrTBuilder[B, ArrB]): ArrB

Specialised map with index to an immutable ArrBase of B. This method should be overridden in sub classes.

Specialised map with index to an immutable ArrBase of B. This method should be overridden in sub classes.

def ifEmpty[B](vEmpty: => B, vNonEmpty: => B): B
def indexOf(elem: A): Int
def indexWhere(f: A => Boolean): Int

Return the index of the first element where predicate is true, or -1 if predicate not true forall.

Return the index of the first element where predicate is true, or -1 if predicate not true forall.

def iterFlatMap[B, ArrB <: ArrImut[B]](f: A => Iterable[B])(implicit ev: ArrTBuilder[B, ArrB]): ArrB

FlatMaps over a function from A to any Iterable.

FlatMaps over a function from A to any Iterable.

@inline
def last: A
def map[B, ArrB <: ArrImut[B]](f: A => B)(implicit ev: ArrTBuilder[B, ArrB]): ArrB

Specialised map to an immutable ArrBase of B.

Specialised map to an immutable ArrBase of B.

def map2To1[B, ArrB <: ArrImut[B]](f: (A, A) => B)(implicit ev: ArrTBuilder[B, ArrB]): ArrB

map 2 elements of A to 1 element of B. Ignores the last element on a collection of odd numbered length.

map 2 elements of A to 1 element of B. Ignores the last element on a collection of odd numbered length.

def mapCollectGoods[B, BB <: ArrImut[B]](f: A => EMon[B])(implicit ev: ArrTBuilder[B, BB]): BB

maps from A to EMon[B], collects the good values.

maps from A to EMon[B], collects the good values.

def mapList[B <: AnyRef](f: A => B): List[B]

maps ValueProduct collection to List

maps ValueProduct collection to List

def mapWithAcc[B, ArrB <: ArrImut[B], C](initC: C)(f: (A, C) => (B, C))(implicit ev: ArrTBuilder[B, ArrB]): ArrB
def max[B >: A](implicit ord: Ordering[B]): A
def min[B >: A](implicit ord: Ordering[B]): A
def mkString(seperator: String): String

Not sure about this method.

Not sure about this method.

@inline
def nonEmpty: Boolean
@inline

Method for keeping the typer happy when returning this as an instance of ThisT.

Method for keeping the typer happy when returning this as an instance of ThisT.

def sum(implicit ev: Sumable[A]): A
def sumBy(f: A => Int): Int
def toList: List[A]
def toStrsCommaFold(fToStr: A => String): String
def toStrsCommaNoSpaceFold(fToStr: A => String): String
def toStrsCommaParenth(fToStr: A => String): String
def toStrsFold(seperator: String, f: A => String): String
def toStrsSemiFold(fToStr: A => String): String
def toStrsSemiParenth(fToStr: A => String): String
def zipMap[B, C, ArrC <: ArrImut[C]](operator: ArrayLike[B])(f: (A, B) => C)(implicit ev: ArrTBuilder[C, ArrC]): ArrC

Takes a second collection as a parameter and zips the elements of this collection and the operand collection and applies the specialised map function from type A and type B to type C.

Takes a second collection as a parameter and zips the elements of this collection and the operand collection and applies the specialised map function from type A and type B to type C.

def zipMap2[B, C, D, ArrD <: ArrImut[D]](operator1: ArrayLike[B], operator2: ArrayLike[C])(f: (A, B, C) => D)(implicit ev: ArrTBuilder[D, ArrD]): ArrD

Takes a second collection and third collections as parameters and zips the elements of this collection and the operand collections and applies the specialised map function from type A and type B and type C to type D.

Takes a second collection and third collections as parameters and zips the elements of this collection and the operand collections and applies the specialised map function from type A and type B and type C to type D.

Inherited methods

def elemsLen: Int

The number of elements in the collection. These collections use underlying mutable Arrays and ArrayBuffers. The length of the underlying Array maybe longer by a multiple of this number.

The number of elements in the collection. These collections use underlying mutable Arrays and ArrayBuffers. The length of the underlying Array maybe longer by a multiple of this number.

Inherited from
ArrayLikeBase
def lenStr: String

Just a handy short cut to give the length of this collection as a string.

Just a handy short cut to give the length of this collection as a string.

Inherited from
ArrayLikeBase