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

   ReplCollConstMethods → CollConstMethods → ReplColl → Coll

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

   Definition Classes

   CollConstMethods → Coll

6.  final def asInstanceOf[T0]: T0

   Definition Classes

   Any

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

   Definition Classes

   CollConstMethods → Coll

8.  def clone(): AnyRef

   Attributes

   protected[lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... ) @native()

9.  val constValue: SReplColl[SA]

   Value of the source type embedded in this graph node.

   Value of the source type embedded in this graph node.

   Definition Classes

   ReplCollConst → LiftedConst

10.  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

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

    Definition Classes

    CollConstMethods → Coll

12.  implicit final def eA: scalan.Library.Elem[A]

    Definition Classes

    ReplCollConst → ReplCollConstMethods → CollConstMethods → ReplColl → Coll

13.  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.

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

    Definition Classes

    AnyRef

15.  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

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

    Definition Classes

    CollConstMethods → Coll

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

    Definition Classes

    CollConstMethods → Coll

18.  def finalize(): Unit

    Attributes

    protected[lang]

    Definition Classes

    AnyRef

    Annotations

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

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

    Definition Classes

    CollConstMethods → Coll

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

    Definition Classes

    CollConstMethods → Coll

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

    Definition Classes

    CollConstMethods → Coll

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

    Definition Classes

    CollConstMethods → Coll

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

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

24.  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

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

    Definition Classes

    CollConstMethods → Coll

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

    Definition Classes

    CollConstMethods → Coll

27.  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

    CollConstMethods → Coll

28.  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

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

    Definition Classes

    CollConstMethods → Coll

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

    Definition Classes

    CollConstMethods → Coll

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

    Definition Classes

    CollConstMethods → Coll

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

    Definition Classes

    CollConstMethods → Coll

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

    Definition Classes

    CollConstMethods → Coll

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

    Definition Classes

    CollConstMethods → Coll

35.  final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

36.  val lA: Liftable[SA, A]
37.  def lastIndexWhere(p: scalan.Library.Ref[(A) ⇒ Boolean], end: scalan.Library.Ref[Int]): scalan.Library.Ref[Int]

    Definition Classes

    CollConstMethods → Coll

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

    Definition Classes

    ReplCollConstMethods → CollConstMethods → ReplColl → Coll

39.  val liftable: Liftable[SReplColl[SA], scalan.Library.ReplColl[A]]

    Evidence that constValue can be lifted to T

    Evidence that constValue can be lifted to T

    Definition Classes

    ReplCollConst → LiftedConst

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

    Definition Classes

    CollConstMethods → Coll

41.  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

    CollConstMethods → Coll

42.  def mirror(t: scalan.Library.Transformer): scalan.Library.Ref[scalan.Library.ReplColl[A]]

    This default implementation assumes there is no symbols in this node.

    This default implementation assumes there is no symbols in this node. Can be overriden if it is not true for some ST.

    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

    LiftedConst → Def

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

    Definition Classes

    AnyRef

44.  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()

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

    Definition Classes

    CollConstMethods → Coll

46.  final def notify(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

47.  final def notifyAll(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

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

    Definition Classes

    CollConstMethods → Coll

49.  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

    CollConstMethods → Coll

50.  val resultType: scalan.Library.Elem[scalan.Library.ReplColl[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

    ReplCollConst → Def

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

    Definition Classes

    CollConstMethods → Coll

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

    Definition Classes

    CollConstMethods → Coll

53.  final def self: scalan.Library.Ref[scalan.Library.ReplColl[A]]

    Reference to this definition created lazily on demand.

    Reference to this definition created lazily on demand.

    Definition Classes

    Def

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

    Definition Classes

    Coll

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

    Definition Classes

    CollConstMethods → Coll

56.  def sum(m: scalan.Library.Ref[scalan.Library.Monoid[A]]): scalan.Library.Ref[A]

    Definition Classes

    CollConstMethods → Coll

57.  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

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

    Definition Classes

    AnyRef

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

    Definition Classes

    CollConstMethods → Coll

60.  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

61.  def transform(t: scalan.Library.Transformer): scalan.Library.Def[scalan.Library.ReplColl[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

    Def

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

    Definition Classes

    CollConstMethods → Coll

63.  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

    CollConstMethods → Coll

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

    Definition Classes

    CollConstMethods → Coll

65.  def value: scalan.Library.Ref[A]

    Definition Classes

    ReplCollConstMethods → ReplColl

66.  final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... ) @native()

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

    Definition Classes

    CollConstMethods → Coll