case class CollConst[SA, A](constValue: SColl[SA], lA: Liftable[SA, A]) extends scalan.Library.Node with LiftedConst[SColl[SA], scalan.Library.Coll[A]] with scalan.Library.Coll[A] with scalan.Library.Def[scalan.Library.Coll[A]] with CollConstMethods[A] with Product with Serializable
- Alphabetic
- By Inheritance
- CollConst
- Serializable
- Serializable
- CollConstMethods
- Coll
- LiftedConst
- Def
- Node
- Product
- Equals
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
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
-
def
append(other: scalan.Library.Ref[scalan.Library.Coll[A]]): scalan.Library.Ref[scalan.Library.Coll[A]]
- Definition Classes
- CollConstMethods → Coll
-
def
apply(i: scalan.Library.Ref[Int]): scalan.Library.Ref[A]
- Definition Classes
- CollConstMethods → Coll
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
builder: scalan.Library.Ref[scalan.Library.CollBuilder]
- Definition Classes
- CollConstMethods → Coll
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
val
constValue: SColl[SA]
Value of the source type embedded in this graph node.
Value of the source type embedded in this graph node.
- Definition Classes
- CollConst → LiftedConst
-
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
-
def
diff(that: scalan.Library.Ref[scalan.Library.Coll[A]]): scalan.Library.Ref[scalan.Library.Coll[A]]
- Definition Classes
- CollConstMethods → Coll
-
implicit final
def
eA: scalan.Library.Elem[A]
- Definition Classes
- CollConst → CollConstMethods → Coll
-
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.
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
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
-
def
exists(p: scalan.Library.Ref[(A) ⇒ Boolean]): scalan.Library.Ref[Boolean]
- Definition Classes
- CollConstMethods → Coll
-
def
filter(p: scalan.Library.Ref[(A) ⇒ Boolean]): scalan.Library.Ref[scalan.Library.Coll[A]]
- Definition Classes
- CollConstMethods → Coll
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
find(p: scalan.Library.Ref[(A) ⇒ Boolean]): scalan.Library.Ref[scalan.Library.WOption[A]]
- Definition Classes
- CollConstMethods → Coll
-
def
flatMap[B](f: scalan.Library.Ref[(A) ⇒ scalan.Library.Coll[B]]): scalan.Library.Ref[scalan.Library.Coll[B]]
- Definition Classes
- CollConstMethods → Coll
-
def
foldLeft[B](zero: scalan.Library.Ref[B], op: scalan.Library.Ref[((B, A)) ⇒ B]): scalan.Library.Ref[B]
- Definition Classes
- CollConstMethods → Coll
-
def
forall(p: scalan.Library.Ref[(A) ⇒ Boolean]): scalan.Library.Ref[Boolean]
- Definition Classes
- CollConstMethods → Coll
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
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
-
def
getOrElse(index: scalan.Library.Ref[Int], default: scalan.Library.Ref[A]): scalan.Library.Ref[A]
- Definition Classes
- CollConstMethods → Coll
-
def
groupBy[K](key: scalan.Library.Ref[(A) ⇒ K]): scalan.Library.Ref[scalan.Library.Coll[(K, scalan.Library.Coll[A])]]
- Definition Classes
- CollConstMethods → Coll
-
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
-
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
-
def
indexOf(elem: scalan.Library.Ref[A], from: scalan.Library.Ref[Int]): scalan.Library.Ref[Int]
- Definition Classes
- CollConstMethods → Coll
-
def
indexWhere(p: scalan.Library.Ref[(A) ⇒ Boolean], from: scalan.Library.Ref[Int]): scalan.Library.Ref[Int]
- Definition Classes
- CollConstMethods → Coll
-
def
indices: scalan.Library.Ref[scalan.Library.Coll[Int]]
- Definition Classes
- CollConstMethods → Coll
-
def
intersect(that: scalan.Library.Ref[scalan.Library.Coll[A]]): scalan.Library.Ref[scalan.Library.Coll[A]]
- Definition Classes
- CollConstMethods → Coll
-
def
isDefinedAt(idx: scalan.Library.Ref[Int]): scalan.Library.Ref[Boolean]
- Definition Classes
- CollConstMethods → Coll
-
def
isEmpty: scalan.Library.Ref[Boolean]
- Definition Classes
- CollConstMethods → Coll
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- val lA: Liftable[SA, A]
-
def
lastIndexWhere(p: scalan.Library.Ref[(A) ⇒ Boolean], end: scalan.Library.Ref[Int]): scalan.Library.Ref[Int]
- Definition Classes
- CollConstMethods → Coll
-
def
length: scalan.Library.Ref[Int]
- Definition Classes
- CollConstMethods → Coll
-
val
liftable: Liftable[SColl[SA], scalan.Library.Coll[A]]
Evidence that constValue can be lifted to T
Evidence that constValue can be lifted to T
- Definition Classes
- CollConst → LiftedConst
-
def
map[B](f: scalan.Library.Ref[(A) ⇒ B]): scalan.Library.Ref[scalan.Library.Coll[B]]
- Definition Classes
- CollConstMethods → Coll
-
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
-
def
mirror(t: scalan.Library.Transformer): scalan.Library.Ref[scalan.Library.Coll[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
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
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()
-
def
nonEmpty: scalan.Library.Ref[Boolean]
- Definition Classes
- CollConstMethods → Coll
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
partition(pred: scalan.Library.Ref[(A) ⇒ Boolean]): scalan.Library.Ref[(scalan.Library.Coll[A], scalan.Library.Coll[A])]
- Definition Classes
- CollConstMethods → Coll
-
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
-
val
resultType: scalan.Library.Elem[scalan.Library.Coll[A]]
Type of a resulting value produced by the operation represented by this definition.
-
def
reverse: scalan.Library.Ref[scalan.Library.Coll[A]]
- Definition Classes
- CollConstMethods → Coll
-
def
segmentLength(p: scalan.Library.Ref[(A) ⇒ Boolean], from: scalan.Library.Ref[Int]): scalan.Library.Ref[Int]
- Definition Classes
- CollConstMethods → Coll
-
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
-
def
size: scalan.Library.Ref[Int]
- Definition Classes
- Coll
-
def
slice(from: scalan.Library.Ref[Int], until: scalan.Library.Ref[Int]): scalan.Library.Ref[scalan.Library.Coll[A]]
- Definition Classes
- CollConstMethods → Coll
-
def
sum(m: scalan.Library.Ref[scalan.Library.Monoid[A]]): scalan.Library.Ref[A]
- Definition Classes
- CollConstMethods → Coll
-
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
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
take(n: scalan.Library.Ref[Int]): scalan.Library.Ref[scalan.Library.Coll[A]]
- Definition Classes
- CollConstMethods → Coll
-
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
-
def
transform(t: scalan.Library.Transformer): scalan.Library.Def[scalan.Library.Coll[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
-
def
unionSet(that: scalan.Library.Ref[scalan.Library.Coll[A]]): scalan.Library.Ref[scalan.Library.Coll[A]]
- Definition Classes
- CollConstMethods → Coll
-
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
-
def
updated(index: scalan.Library.Ref[Int], elem: scalan.Library.Ref[A]): scalan.Library.Ref[scalan.Library.Coll[A]]
- Definition Classes
- CollConstMethods → Coll
-
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( ... ) @native()
-
def
zip[B](ys: scalan.Library.Ref[scalan.Library.Coll[B]]): scalan.Library.Ref[scalan.Library.Coll[(A, B)]]
- Definition Classes
- CollConstMethods → Coll