Value Members

1.  final def !=(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

2.  final def ##(): Int

   Definition Classes

   AnyRef → Any

3.  final def ==(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

4.  def append(other: scalan.Library.Ref[scalan.Library.Coll[A]]): scalan.Library.Ref[scalan.Library.Coll[A]]

   Definition Classes

   CollAdapter → Coll

5.  def apply(i: scalan.Library.Ref[Int]): scalan.Library.Ref[A]

   Definition Classes

   CollAdapter → Coll

6.  final def asInstanceOf[T0]: T0

   Definition Classes

   Any

7.  def builder: scalan.Library.Ref[scalan.Library.CollBuilder]

   Definition Classes

   CollAdapter → Coll

8.  def clone(): AnyRef

   Attributes

   protected[lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... ) @native()

9.  final def deps: Array[scalan.Library.Sym]

   Dependencies of this definition from other definitions.

   Dependencies of this definition from other definitions. If definition is interpreted as an operation, then dependencies are arguments of the operation. If definition if compound (like Lambda of ThunkDef) then deps is equals to free variables used in the body of the compound definition. This array also refers to predecessors of this graph node, so it is used to build topological ordering (execution schedule) of operations.

   returns

   array of referencies to other definitions.

   Definition Classes

   Node

10.  def diff(that: scalan.Library.Ref[scalan.Library.Coll[A]]): scalan.Library.Ref[scalan.Library.Coll[A]]

    Definition Classes

    CollAdapter → Coll

11.  implicit lazy val eA: scalan.Library.Elem[A]

    Definition Classes

    CollAdapter → Coll

12.  final def elements: Array[AnyRef]

    All data elements of this graph node to be used in structural equality.

    All data elements of this graph node to be used in structural equality.

    Definition Classes

    Node

    See also

    equals where elements are used.

13.  final def eq(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

14.  def equals(other: Any): Boolean

    Default equality of definitions.

    Default equality of definitions. Two definitions are equal if they have same elements.

    Definition Classes

    Node → Equals → AnyRef → Any

15.  def exists(p: scalan.Library.Ref[(A) ⇒ Boolean]): scalan.Library.Ref[Boolean]

    Definition Classes

    CollAdapter → Coll

16.  def filter(p: scalan.Library.Ref[(A) ⇒ Boolean]): scalan.Library.Ref[scalan.Library.Coll[A]]

    Definition Classes

    CollAdapter → Coll

17.  def finalize(): Unit

    Attributes

    protected[lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

18.  def find(p: scalan.Library.Ref[(A) ⇒ Boolean]): scalan.Library.Ref[scalan.Library.WOption[A]]

    Definition Classes

    CollAdapter → Coll

19.  def flatMap[B](f: scalan.Library.Ref[(A) ⇒ scalan.Library.Coll[B]]): scalan.Library.Ref[scalan.Library.Coll[B]]

    Definition Classes

    CollAdapter → Coll

20.  def foldLeft[B](zero: scalan.Library.Ref[B], op: scalan.Library.Ref[((B, A)) ⇒ B]): scalan.Library.Ref[B]

    Definition Classes

    CollAdapter → Coll

21.  def forall(p: scalan.Library.Ref[(A) ⇒ Boolean]): scalan.Library.Ref[Boolean]

    Definition Classes

    CollAdapter → Coll

22.  final def getClass(): Class[_]

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

23.  def getDeps: Array[scalan.Library.Sym]

    Override to redefine how dependencies are computed.

    Override to redefine how dependencies are computed. For example, in core implementation this is overriden in Lambda and ThunkDef using freeVars.

    Attributes

    protected

    Definition Classes

    Node

24.  def getOrElse(index: scalan.Library.Ref[Int], default: scalan.Library.Ref[A]): scalan.Library.Ref[A]

    Definition Classes

    CollAdapter → Coll

25.  def groupBy[K](key: scalan.Library.Ref[(A) ⇒ K]): scalan.Library.Ref[scalan.Library.Coll[(K, scalan.Library.Coll[A])]]

    Definition Classes

    CollAdapter → Coll

26.  def groupByProjecting[K, V](key: scalan.Library.Ref[(A) ⇒ K], proj: scalan.Library.Ref[(A) ⇒ V]): scalan.Library.Ref[scalan.Library.Coll[(K, scalan.Library.Coll[V])]]

    Definition Classes

    CollAdapter → Coll

27.  def hashCode(): Int

    Computed once and saved to avoid repeated computations, which is not necessary because definitions are immutable by default.

    Computed once and saved to avoid repeated computations, which is not necessary because definitions are immutable by default. If some definition require mutability, this method can be overriden accordingly.

    Definition Classes

    Node → AnyRef → Any

28.  def indexOf(elem: scalan.Library.Ref[A], from: scalan.Library.Ref[Int]): scalan.Library.Ref[Int]

    Definition Classes

    CollAdapter → Coll

29.  def indexWhere(p: scalan.Library.Ref[(A) ⇒ Boolean], from: scalan.Library.Ref[Int]): scalan.Library.Ref[Int]

    Definition Classes

    CollAdapter → Coll

30.  def indices: scalan.Library.Ref[scalan.Library.Coll[Int]]

    Definition Classes

    CollAdapter → Coll

31.  def intersect(that: scalan.Library.Ref[scalan.Library.Coll[A]]): scalan.Library.Ref[scalan.Library.Coll[A]]

    Definition Classes

    CollAdapter → Coll

32.  def isDefinedAt(idx: scalan.Library.Ref[Int]): scalan.Library.Ref[Boolean]

    Definition Classes

    CollAdapter → Coll

33.  def isEmpty: scalan.Library.Ref[Boolean]

    Definition Classes

    CollAdapter → Coll

34.  final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

35.  def lastIndexWhere(p: scalan.Library.Ref[(A) ⇒ Boolean], end: scalan.Library.Ref[Int]): scalan.Library.Ref[Int]

    Definition Classes

    CollAdapter → Coll

36.  def length: scalan.Library.Ref[Int]

    Definition Classes

    CollAdapter → Coll

37.  def map[B](f: scalan.Library.Ref[(A) ⇒ B]): scalan.Library.Ref[scalan.Library.Coll[B]]

    Definition Classes

    CollAdapter → Coll

38.  def mapReduce[K, V](m: scalan.Library.Ref[(A) ⇒ (K, V)], r: scalan.Library.Ref[((V, V)) ⇒ V]): scalan.Library.Ref[scalan.Library.Coll[(K, V)]]

    Definition Classes

    CollAdapter → Coll

39.  def mirror(t: scalan.Library.Transformer): scalan.Library.Ref[scalan.Library.Coll[A]]

    Clone this definition transforming all symbols using t.

    Clone this definition transforming all symbols using t. If new Def[A] is created, it is added to the graph with collapsing and rewriting. Can be overriden to implement node-specific mirroring (see MethodCall).

    t

    mapping of symbols to symbols (Ref[_] => Ref[_])

    returns

    symbol of the logical clone. If d don't contain symbols, then d.self is returned.

    Definition Classes

    Def

40.  final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

41.  final def nodeId: Int

    Unique id of the graph node assigned for each new instance using freshId generator.

    Unique id of the graph node assigned for each new instance using freshId generator. Doesn't participate in equality of this Def, thus definitions with different ids may still be structurally equal. Used to provide global Def numbering.

    Definition Classes

    Node

    Annotations

    @inline()

42.  def nonEmpty: scalan.Library.Ref[Boolean]

    Definition Classes

    CollAdapter → Coll

43.  final def notify(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

44.  final def notifyAll(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

45.  def partition(pred: scalan.Library.Ref[(A) ⇒ Boolean]): scalan.Library.Ref[(scalan.Library.Coll[A], scalan.Library.Coll[A])]

    Definition Classes

    CollAdapter → Coll

46.  def patch(from: scalan.Library.Ref[Int], patch: scalan.Library.Ref[scalan.Library.Coll[A]], replaced: scalan.Library.Ref[Int]): scalan.Library.Ref[scalan.Library.Coll[A]]

    Definition Classes

    CollAdapter → Coll

47.  val resultType: scalan.Library.Elem[scalan.Library.Coll[A]]

    Type of a resulting value produced by the operation represented by this definition.

    Type of a resulting value produced by the operation represented by this definition. For example, if this definition represents application of +: (Int, Int) => Int operation then the result type is Int and resultType should return IntElement.

    Definition Classes

    CollAdapter → Def

48.  def reverse: scalan.Library.Ref[scalan.Library.Coll[A]]

    Definition Classes

    CollAdapter → Coll

49.  def segmentLength(p: scalan.Library.Ref[(A) ⇒ Boolean], from: scalan.Library.Ref[Int]): scalan.Library.Ref[Int]

    Definition Classes

    CollAdapter → Coll

50.  final def self: scalan.Library.Ref[scalan.Library.Coll[A]]

    Reference to this definition created lazily on demand.

    Reference to this definition created lazily on demand.

    Definition Classes

    Def

51.  def size: scalan.Library.Ref[Int]

    Definition Classes

    Coll

52.  def slice(from: scalan.Library.Ref[Int], until: scalan.Library.Ref[Int]): scalan.Library.Ref[scalan.Library.Coll[A]]

    Definition Classes

    CollAdapter → Coll

53.  val source: scalan.Library.Ref[scalan.Library.Coll[A]]
54.  def sum(m: scalan.Library.Ref[scalan.Library.Monoid[A]]): scalan.Library.Ref[A]

    Definition Classes

    CollAdapter → Coll

55.  final def syms: Array[scalan.Library.Sym]

    References to other nodes in this Def instance.

    References to other nodes in this Def instance. Note: This is different form deps for compound definitions like Lambda and ThunkDef.

    Definition Classes

    Node

56.  final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes

    AnyRef

57.  def take(n: scalan.Library.Ref[Int]): scalan.Library.Ref[scalan.Library.Coll[A]]

    Definition Classes

    CollAdapter → Coll

58.  def toString(): String

    User readable string representation of this definition.

    User readable string representation of this definition. (for debugging only)

    Definition Classes

    Node → AnyRef → Any

59.  def transform(t: scalan.Library.Transformer): CollAdapter[A]

    Create a copy of this definition applying the given transformer to all syms.

    Create a copy of this definition applying the given transformer to all syms.

    Definition Classes

    CollAdapter → Def

60.  def unionSet(that: scalan.Library.Ref[scalan.Library.Coll[A]]): scalan.Library.Ref[scalan.Library.Coll[A]]

    Definition Classes

    CollAdapter → Coll

61.  def updateMany(indexes: scalan.Library.Ref[scalan.Library.Coll[Int]], values: scalan.Library.Ref[scalan.Library.Coll[A]]): scalan.Library.Ref[scalan.Library.Coll[A]]

    Definition Classes

    CollAdapter → Coll

62.  def updated(index: scalan.Library.Ref[Int], elem: scalan.Library.Ref[A]): scalan.Library.Ref[scalan.Library.Coll[A]]

    Definition Classes

    CollAdapter → Coll

63.  final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

65.  final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... ) @native()

66.  def zip[B](ys: scalan.Library.Ref[scalan.Library.Coll[B]]): scalan.Library.Ref[scalan.Library.Coll[(A, B)]]

    Definition Classes

    CollAdapter → Coll