Class

special.collection.impl.CollsDefs.PairColl

PairCollAdapter

Related Doc: package PairColl

Permalink

case class PairCollAdapter[L, R](source: scalan.Library.Ref[scalan.Library.PairColl[L, R]]) extends scalan.Library.Node with scalan.Library.PairColl[L, R] with scalan.Library.Def[scalan.Library.PairColl[L, R]] with Product with Serializable

Linear Supertypes
Serializable, Serializable, scalan.Library.PairColl[L, R], scalan.Library.Coll[(L, R)], scalan.Library.Def[scalan.Library.PairColl[L, R]], scalan.Library.Node, Product, scala.Equals, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. PairCollAdapter
  2. Serializable
  3. Serializable
  4. PairColl
  5. Coll
  6. Def
  7. Node
  8. Product
  9. Equals
  10. AnyRef
  11. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new PairCollAdapter(source: scalan.Library.Ref[scalan.Library.PairColl[L, R]])

    Permalink

Value Members

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

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  4. def append(other: scalan.Library.Ref[scalan.Library.Coll[(L, R)]]): scalan.Library.Ref[scalan.Library.Coll[(L, R)]]

    Permalink
    Definition Classes
    PairCollAdapterColl
  5. def apply(i: scalan.Library.Ref[Int]): scalan.Library.Ref[(L, R)]

    Permalink
    Definition Classes
    PairCollAdapterColl
  6. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  7. def builder: scalan.Library.Ref[scalan.Library.CollBuilder]

    Permalink
    Definition Classes
    PairCollAdapterColl
  8. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  9. final def deps: Array[scalan.Library.Sym]

    Permalink

    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[(L, R)]]): scalan.Library.Ref[scalan.Library.Coll[(L, R)]]

    Permalink
    Definition Classes
    PairCollAdapterColl
  11. lazy val eA: scalan.Library.Elem[(L, R)]

    Permalink
    Definition Classes
    PairCollAdapterColl
  12. implicit lazy val eL: scalan.Library.Elem[L]

    Permalink
    Definition Classes
    PairCollAdapterPairColl
  13. implicit lazy val eR: scalan.Library.Elem[R]

    Permalink
    Definition Classes
    PairCollAdapterPairColl
  14. final def elements: Array[AnyRef]

    Permalink

    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.

  15. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  16. def equals(other: Any): Boolean

    Permalink

    Default equality of definitions.

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

    Definition Classes
    Node → Equals → AnyRef → Any
  17. def exists(p: scalan.Library.Ref[((L, R)) ⇒ Boolean]): scalan.Library.Ref[Boolean]

    Permalink
    Definition Classes
    PairCollAdapterColl
  18. def filter(p: scalan.Library.Ref[((L, R)) ⇒ Boolean]): scalan.Library.Ref[scalan.Library.Coll[(L, R)]]

    Permalink
    Definition Classes
    PairCollAdapterColl
  19. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  20. def find(p: scalan.Library.Ref[((L, R)) ⇒ Boolean]): scalan.Library.Ref[scalan.Library.WOption[(L, R)]]

    Permalink
    Definition Classes
    PairCollAdapterColl
  21. def flatMap[B](f: scalan.Library.Ref[((L, R)) ⇒ scalan.Library.Coll[B]]): scalan.Library.Ref[scalan.Library.Coll[B]]

    Permalink
    Definition Classes
    PairCollAdapterColl
  22. def foldLeft[B](zero: scalan.Library.Ref[B], op: scalan.Library.Ref[((B, (L, R))) ⇒ B]): scalan.Library.Ref[B]

    Permalink
    Definition Classes
    PairCollAdapterColl
  23. def forall(p: scalan.Library.Ref[((L, R)) ⇒ Boolean]): scalan.Library.Ref[Boolean]

    Permalink
    Definition Classes
    PairCollAdapterColl
  24. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  25. def getDeps: Array[scalan.Library.Sym]

    Permalink

    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
  26. def getOrElse(index: scalan.Library.Ref[Int], default: scalan.Library.Ref[(L, R)]): scalan.Library.Ref[(L, R)]

    Permalink
    Definition Classes
    PairCollAdapterColl
  27. def groupBy[K](key: scalan.Library.Ref[((L, R)) ⇒ K]): scalan.Library.Ref[scalan.Library.Coll[(K, scalan.Library.Coll[(L, R)])]]

    Permalink
    Definition Classes
    PairCollAdapterColl
  28. def groupByProjecting[K, V](key: scalan.Library.Ref[((L, R)) ⇒ K], proj: scalan.Library.Ref[((L, R)) ⇒ V]): scalan.Library.Ref[scalan.Library.Coll[(K, scalan.Library.Coll[V])]]

    Permalink
    Definition Classes
    PairCollAdapterColl
  29. def hashCode(): Int

    Permalink

    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
  30. def indexOf(elem: scalan.Library.Ref[(L, R)], from: scalan.Library.Ref[Int]): scalan.Library.Ref[Int]

    Permalink
    Definition Classes
    PairCollAdapterColl
  31. def indexWhere(p: scalan.Library.Ref[((L, R)) ⇒ Boolean], from: scalan.Library.Ref[Int]): scalan.Library.Ref[Int]

    Permalink
    Definition Classes
    PairCollAdapterColl
  32. def indices: scalan.Library.Ref[scalan.Library.Coll[Int]]

    Permalink
    Definition Classes
    PairCollAdapterColl
  33. def intersect(that: scalan.Library.Ref[scalan.Library.Coll[(L, R)]]): scalan.Library.Ref[scalan.Library.Coll[(L, R)]]

    Permalink
    Definition Classes
    PairCollAdapterColl
  34. def isDefinedAt(idx: scalan.Library.Ref[Int]): scalan.Library.Ref[Boolean]

    Permalink
    Definition Classes
    PairCollAdapterColl
  35. def isEmpty: scalan.Library.Ref[Boolean]

    Permalink
    Definition Classes
    PairCollAdapterColl
  36. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  37. def lastIndexWhere(p: scalan.Library.Ref[((L, R)) ⇒ Boolean], end: scalan.Library.Ref[Int]): scalan.Library.Ref[Int]

    Permalink
    Definition Classes
    PairCollAdapterColl
  38. def length: scalan.Library.Ref[Int]

    Permalink
    Definition Classes
    PairCollAdapterColl
  39. def ls: scalan.Library.Ref[scalan.Library.Coll[L]]

    Permalink
    Definition Classes
    PairCollAdapterPairColl
  40. def map[B](f: scalan.Library.Ref[((L, R)) ⇒ B]): scalan.Library.Ref[scalan.Library.Coll[B]]

    Permalink
    Definition Classes
    PairCollAdapterColl
  41. def mapFirst[T1](f: scalan.Library.Ref[(L) ⇒ T1]): scalan.Library.Ref[scalan.Library.Coll[(T1, R)]]

    Permalink
    Definition Classes
    PairCollAdapterPairColl
  42. def mapReduce[K, V](m: scalan.Library.Ref[((L, R)) ⇒ (K, V)], r: scalan.Library.Ref[((V, V)) ⇒ V]): scalan.Library.Ref[scalan.Library.Coll[(K, V)]]

    Permalink
    Definition Classes
    PairCollAdapterColl
  43. def mapSecond[T1](f: scalan.Library.Ref[(R) ⇒ T1]): scalan.Library.Ref[scalan.Library.Coll[(L, T1)]]

    Permalink
    Definition Classes
    PairCollAdapterPairColl
  44. def mirror(t: scalan.Library.Transformer): scalan.Library.Ref[scalan.Library.PairColl[L, R]]

    Permalink

    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
  45. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  46. final def nodeId: Int

    Permalink

    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()
  47. def nonEmpty: scalan.Library.Ref[Boolean]

    Permalink
    Definition Classes
    PairCollAdapterColl
  48. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  49. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  50. def partition(pred: scalan.Library.Ref[((L, R)) ⇒ Boolean]): scalan.Library.Ref[(scalan.Library.Coll[(L, R)], scalan.Library.Coll[(L, R)])]

    Permalink
    Definition Classes
    PairCollAdapterColl
  51. def patch(from: scalan.Library.Ref[Int], patch: scalan.Library.Ref[scalan.Library.Coll[(L, R)]], replaced: scalan.Library.Ref[Int]): scalan.Library.Ref[scalan.Library.Coll[(L, R)]]

    Permalink
    Definition Classes
    PairCollAdapterColl
  52. val resultType: scalan.Library.Elem[scalan.Library.PairColl[L, R]]

    Permalink

    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
    PairCollAdapterDef
  53. def reverse: scalan.Library.Ref[scalan.Library.Coll[(L, R)]]

    Permalink
    Definition Classes
    PairCollAdapterColl
  54. def rs: scalan.Library.Ref[scalan.Library.Coll[R]]

    Permalink
    Definition Classes
    PairCollAdapterPairColl
  55. def segmentLength(p: scalan.Library.Ref[((L, R)) ⇒ Boolean], from: scalan.Library.Ref[Int]): scalan.Library.Ref[Int]

    Permalink
    Definition Classes
    PairCollAdapterColl
  56. final def self: scalan.Library.Ref[scalan.Library.PairColl[L, R]]

    Permalink

    Reference to this definition created lazily on demand.

    Reference to this definition created lazily on demand.

    Definition Classes
    Def
  57. def size: scalan.Library.Ref[Int]

    Permalink
    Definition Classes
    Coll
  58. def slice(from: scalan.Library.Ref[Int], until: scalan.Library.Ref[Int]): scalan.Library.Ref[scalan.Library.Coll[(L, R)]]

    Permalink
    Definition Classes
    PairCollAdapterColl
  59. val source: scalan.Library.Ref[scalan.Library.PairColl[L, R]]

    Permalink
  60. def sum(m: scalan.Library.Ref[scalan.Library.Monoid[(L, R)]]): scalan.Library.Ref[(L, R)]

    Permalink
    Definition Classes
    PairCollAdapterColl
  61. final def syms: Array[scalan.Library.Sym]

    Permalink

    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
  62. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  63. def take(n: scalan.Library.Ref[Int]): scalan.Library.Ref[scalan.Library.Coll[(L, R)]]

    Permalink
    Definition Classes
    PairCollAdapterColl
  64. def toString(): String

    Permalink

    User readable string representation of this definition.

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

    Definition Classes
    Node → AnyRef → Any
  65. def transform(t: scalan.Library.Transformer): PairCollAdapter[L, R]

    Permalink

    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
    PairCollAdapterDef
  66. def unionSet(that: scalan.Library.Ref[scalan.Library.Coll[(L, R)]]): scalan.Library.Ref[scalan.Library.Coll[(L, R)]]

    Permalink
    Definition Classes
    PairCollAdapterColl
  67. def updateMany(indexes: scalan.Library.Ref[scalan.Library.Coll[Int]], values: scalan.Library.Ref[scalan.Library.Coll[(L, R)]]): scalan.Library.Ref[scalan.Library.Coll[(L, R)]]

    Permalink
    Definition Classes
    PairCollAdapterColl
  68. def updated(index: scalan.Library.Ref[Int], elem: scalan.Library.Ref[(L, R)]): scalan.Library.Ref[scalan.Library.Coll[(L, R)]]

    Permalink
    Definition Classes
    PairCollAdapterColl
  69. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  70. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  71. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  72. def zip[B](ys: scalan.Library.Ref[scalan.Library.Coll[B]]): scalan.Library.Ref[scalan.Library.Coll[((L, R), B)]]

    Permalink
    Definition Classes
    PairCollAdapterColl

Inherited from Serializable

Inherited from Serializable

Inherited from scalan.Library.PairColl[L, R]

Inherited from scalan.Library.Coll[(L, R)]

Inherited from scalan.Library.Node

Inherited from Product

Inherited from scala.Equals

Inherited from AnyRef

Inherited from Any

Ungrouped