final case class FromCatalogGraph[T <: Table[T]](in: RelationalOperator[T], logicalGraph: LogicalCatalogGraph)(implicit evidence$21: scala.reflect.api.JavaUniverse.TypeTag[T]) extends RelationalOperator[T] with Product with Serializable
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- FromCatalogGraph
- Serializable
- Serializable
- RelationalOperator
- AbstractTreeNode
- TreeNode
- Traversable
- GenTraversable
- GenericTraversableTemplate
- TraversableLike
- GenTraversableLike
- Parallelizable
- TraversableOnce
- GenTraversableOnce
- FilterMonadic
- HasNewBuilder
- Product
- Equals
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Instance Constructors
- new FromCatalogGraph(in: RelationalOperator[T], logicalGraph: LogicalCatalogGraph)(implicit arg0: scala.reflect.api.JavaUniverse.TypeTag[T])
Type Members
-
type
Self = Traversable[RelationalOperator[T]]
- Attributes
- protected[this]
- Definition Classes
- TraversableLike
-
class
WithFilter extends FilterMonadic[A, Repr]
- Definition Classes
- TraversableLike
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
def
++[B >: RelationalOperator[T], That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[RelationalOperator[T]], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
++:[B >: RelationalOperator[T], That](that: Traversable[B])(implicit bf: CanBuildFrom[Traversable[RelationalOperator[T]], B, That]): That
- Definition Classes
- TraversableLike
-
def
++:[B >: RelationalOperator[T], That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[RelationalOperator[T]], B, That]): That
- Definition Classes
- TraversableLike
-
def
/:[B](z: B)(op: (B, RelationalOperator[T]) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
:\[B](z: B)(op: (RelationalOperator[T], B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
_table: T
- Definition Classes
- RelationalOperator
-
def
addString(b: StringBuilder): StringBuilder
- Definition Classes
- TraversableOnce
-
def
addString(b: StringBuilder, sep: String): StringBuilder
- Definition Classes
- TraversableOnce
-
def
addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
- Definition Classes
- TraversableOnce
-
def
aggregate[B](z: ⇒ B)(seqop: (B, RelationalOperator[T]) ⇒ B, combop: (B, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
argString: String
- Definition Classes
- TreeNode
-
def
args: Iterator[Any]
- Definition Classes
- TreeNode
-
def
arity: Int
- Definition Classes
- TreeNode
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
val
children: Array[RelationalOperator[T]]
- Definition Classes
- AbstractTreeNode → TreeNode
-
final
lazy val
childrenAsSet: Set[RelationalOperator[T]]
- Definition Classes
- AbstractTreeNode
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
collect[B, That](pf: PartialFunction[RelationalOperator[T], B])(implicit bf: CanBuildFrom[Traversable[RelationalOperator[T]], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
collectFirst[B](pf: PartialFunction[RelationalOperator[T], B]): Option[B]
- Definition Classes
- TraversableOnce
-
def
companion: GenericCompanion[Traversable]
- Definition Classes
- Traversable → GenTraversable → GenericTraversableTemplate
-
final
def
containsChild(other: RelationalOperator[T]): Boolean
- Definition Classes
- AbstractTreeNode → TreeNode
- Annotations
- @inline()
-
final
def
containsTree(other: RelationalOperator[T]): Boolean
- Definition Classes
- AbstractTreeNode → TreeNode
- Annotations
- @inline()
-
implicit
def
context: RelationalRuntimeContext[T]
- Definition Classes
- RelationalOperator
-
def
copyToArray[B >: RelationalOperator[T]](xs: Array[B], start: Int, len: Int): Unit
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: RelationalOperator[T]](xs: Array[B]): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: RelationalOperator[T]](xs: Array[B], start: Int): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToBuffer[B >: RelationalOperator[T]](dest: Buffer[B]): Unit
- Definition Classes
- TraversableOnce
-
def
count(p: (RelationalOperator[T]) ⇒ Boolean): Int
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
implicit
def
ct: ClassTag[RelationalOperator[T]]
- Attributes
- protected
- Definition Classes
- AbstractTreeNode → TreeNode
-
def
drop(n: Int): Traversable[RelationalOperator[T]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
dropWhile(p: (RelationalOperator[T]) ⇒ Boolean): Traversable[RelationalOperator[T]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
exists(p: (RelationalOperator[T]) ⇒ Boolean): Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
filter(p: (RelationalOperator[T]) ⇒ Boolean): Traversable[RelationalOperator[T]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
filterNot(p: (RelationalOperator[T]) ⇒ Boolean): Traversable[RelationalOperator[T]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
find(p: (RelationalOperator[T]) ⇒ Boolean): Option[RelationalOperator[T]]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
flatMap[B, That](f: (RelationalOperator[T]) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[RelationalOperator[T]], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
def
flatten[B](implicit asTraversable: (RelationalOperator[T]) ⇒ GenTraversableOnce[B]): Traversable[B]
- Definition Classes
- GenericTraversableTemplate
-
def
fold[A1 >: RelationalOperator[T]](z: A1)(op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldLeft[B](z: B)(op: (B, RelationalOperator[T]) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldRight[B](z: B)(op: (RelationalOperator[T], B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
forall(p: (RelationalOperator[T]) ⇒ Boolean): Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
final
def
foreach[O](f: (RelationalOperator[T]) ⇒ O): Unit
- Definition Classes
- AbstractTreeNode → TreeNode → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
- Annotations
- @inline()
-
def
genericBuilder[B]: Builder[B, Traversable[B]]
- Definition Classes
- GenericTraversableTemplate
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
graph: RelationalCypherGraph[T]
- Definition Classes
- FromCatalogGraph → RelationalOperator
-
def
graphName: QualifiedGraphName
- Definition Classes
- FromCatalogGraph → RelationalOperator
-
def
groupBy[K](f: (RelationalOperator[T]) ⇒ K): Map[K, Traversable[RelationalOperator[T]]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
hasDefiniteSize: Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
final
lazy val
hashCode: Int
- Definition Classes
- AbstractTreeNode → TreeNode → AnyRef → Any
-
def
head: RelationalOperator[T]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
headOption: Option[RelationalOperator[T]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
header: RecordHeader
- Definition Classes
- RelationalOperator
-
final
lazy val
height: Int
- Definition Classes
- AbstractTreeNode → TreeNode
- val in: RelationalOperator[T]
-
def
init: Traversable[RelationalOperator[T]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
inits: Iterator[Traversable[RelationalOperator[T]]]
- Definition Classes
- TraversableLike
-
def
isEmpty: Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
isLeaf: Boolean
- Definition Classes
- TreeNode
-
final
def
isTraversableAgain: Boolean
- Definition Classes
- TraversableLike → GenTraversableLike → GenTraversableOnce
-
def
last: RelationalOperator[T]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
lastOption: Option[RelationalOperator[T]]
- Definition Classes
- TraversableLike → GenTraversableLike
- val logicalGraph: LogicalCatalogGraph
-
final
def
map[O <: TreeNode[O]](f: (RelationalOperator[T]) ⇒ O)(implicit arg0: ClassTag[O]): O
- Definition Classes
- AbstractTreeNode → TreeNode
- Annotations
- @inline()
-
def
map[B, That](f: (RelationalOperator[T]) ⇒ B)(implicit bf: CanBuildFrom[Traversable[RelationalOperator[T]], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
def
max[B >: RelationalOperator[T]](implicit cmp: Ordering[B]): RelationalOperator[T]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
maxBy[B](f: (RelationalOperator[T]) ⇒ B)(implicit cmp: Ordering[B]): RelationalOperator[T]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
maybeReturnItems: Option[Seq[Var]]
- Definition Classes
- RelationalOperator
-
def
min[B >: RelationalOperator[T]](implicit cmp: Ordering[B]): RelationalOperator[T]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
minBy[B](f: (RelationalOperator[T]) ⇒ B)(implicit cmp: Ordering[B]): RelationalOperator[T]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString: String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(sep: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(start: String, sep: String, end: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
newBuilder: Builder[RelationalOperator[T], Traversable[RelationalOperator[T]]]
- Attributes
- protected[this]
- Definition Classes
- GenericTraversableTemplate → HasNewBuilder
-
def
nonEmpty: Boolean
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
par: ParIterable[RelationalOperator[T]]
- Definition Classes
- Parallelizable
-
def
parCombiner: Combiner[RelationalOperator[T], ParIterable[RelationalOperator[T]]]
- Attributes
- protected[this]
- Definition Classes
- TraversableLike → Parallelizable
-
def
partition(p: (RelationalOperator[T]) ⇒ Boolean): (Traversable[RelationalOperator[T]], Traversable[RelationalOperator[T]])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
pretty: String
- Definition Classes
- TreeNode
-
def
product[B >: RelationalOperator[T]](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduce[A1 >: RelationalOperator[T]](op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceLeft[B >: RelationalOperator[T]](op: (B, RelationalOperator[T]) ⇒ B): B
- Definition Classes
- TraversableOnce
-
def
reduceLeftOption[B >: RelationalOperator[T]](op: (B, RelationalOperator[T]) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceOption[A1 >: RelationalOperator[T]](op: (A1, A1) ⇒ A1): Option[A1]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceRight[B >: RelationalOperator[T]](op: (RelationalOperator[T], B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceRightOption[B >: RelationalOperator[T]](op: (RelationalOperator[T], B) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
repr: Traversable[RelationalOperator[T]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
resolve(qualifiedGraphName: QualifiedGraphName)(implicit context: RelationalRuntimeContext[T]): RelationalCypherGraph[T]
- Attributes
- protected
- Definition Classes
- RelationalOperator
-
def
reversed: List[RelationalOperator[T]]
- Attributes
- protected[this]
- Definition Classes
- TraversableOnce
-
def
rewrite(f: PartialFunction[RelationalOperator[T], RelationalOperator[T]]): RelationalOperator[T]
- Definition Classes
- TreeNode
-
def
rewriteTopDown(f: PartialFunction[RelationalOperator[T], RelationalOperator[T]]): RelationalOperator[T]
- Definition Classes
- TreeNode
-
def
scan[B >: RelationalOperator[T], That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Traversable[RelationalOperator[T]], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanLeft[B, That](z: B)(op: (B, RelationalOperator[T]) ⇒ B)(implicit bf: CanBuildFrom[Traversable[RelationalOperator[T]], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanRight[B, That](z: B)(op: (RelationalOperator[T], B) ⇒ B)(implicit bf: CanBuildFrom[Traversable[RelationalOperator[T]], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
- Annotations
- @migration
- Migration
(Changed in version 2.9.0) The behavior of
scanRighthas changed. The previous behavior can be reproduced with scanRight.reverse.
-
def
seq: Traversable[RelationalOperator[T]]
- Definition Classes
- Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
-
implicit
def
session: RelationalCypherSession[T]
- Definition Classes
- RelationalOperator
-
def
show(): Unit
- Definition Classes
- TreeNode
-
final
lazy val
size: Int
- Definition Classes
- AbstractTreeNode → TreeNode → GenTraversableLike → TraversableOnce → GenTraversableOnce
-
def
sizeHintIfCheap: Int
- Attributes
- protected[scala.collection]
- Definition Classes
- GenTraversableOnce
-
def
slice(from: Int, until: Int): Traversable[RelationalOperator[T]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
span(p: (RelationalOperator[T]) ⇒ Boolean): (Traversable[RelationalOperator[T]], Traversable[RelationalOperator[T]])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
splitAt(n: Int): (Traversable[RelationalOperator[T]], Traversable[RelationalOperator[T]])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
stringPrefix: String
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
sum[B >: RelationalOperator[T]](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
table: T
- Definition Classes
- RelationalOperator
-
def
tail: Traversable[RelationalOperator[T]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
tails: Iterator[Traversable[RelationalOperator[T]]]
- Definition Classes
- TraversableLike
-
def
take(n: Int): Traversable[RelationalOperator[T]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
takeWhile(p: (RelationalOperator[T]) ⇒ Boolean): Traversable[RelationalOperator[T]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
thisCollection: Traversable[RelationalOperator[T]]
- Attributes
- protected[this]
- Definition Classes
- TraversableLike
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, RelationalOperator[T], Col[RelationalOperator[T]]]): Col[RelationalOperator[T]]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
toArray[B >: RelationalOperator[T]](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toBuffer[B >: RelationalOperator[T]]: Buffer[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toCollection(repr: Traversable[RelationalOperator[T]]): Traversable[RelationalOperator[T]]
- Attributes
- protected[this]
- Definition Classes
- TraversableLike
-
def
toIndexedSeq: IndexedSeq[RelationalOperator[T]]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toIterable: Iterable[RelationalOperator[T]]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toIterator: Iterator[RelationalOperator[T]]
- Definition Classes
- TraversableLike → GenTraversableOnce
-
def
toList: List[RelationalOperator[T]]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toMap[T, U](implicit ev: <:<[RelationalOperator[T], (T, U)]): Map[T, U]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toSeq: Seq[RelationalOperator[T]]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toSet[B >: RelationalOperator[T]]: Set[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toStream: Stream[RelationalOperator[T]]
- Definition Classes
- TraversableLike → GenTraversableOnce
-
def
toString(): String
- Definition Classes
- TreeNode → TraversableLike → AnyRef → Any
-
def
toTraversable: Traversable[RelationalOperator[T]]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
toVector: Vector[RelationalOperator[T]]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
transform[O](f: (RelationalOperator[T], List[O]) ⇒ O): O
- Definition Classes
- TreeNode
-
def
transpose[B](implicit asTraversable: (RelationalOperator[T]) ⇒ GenTraversableOnce[B]): Traversable[Traversable[B]]
- Definition Classes
- GenericTraversableTemplate
- Annotations
- @migration
- Migration
(Changed in version 2.9.0)
transposethrows anIllegalArgumentExceptionif collections are not uniformly sized.
-
def
tt: scala.reflect.api.JavaUniverse.TypeTag[RelationalOperator[T]]
- Attributes
- protected
- Definition Classes
- AbstractTreeNode → TreeNode
-
def
unzip[A1, A2](implicit asPair: (RelationalOperator[T]) ⇒ (A1, A2)): (Traversable[A1], Traversable[A2])
- Definition Classes
- GenericTraversableTemplate
-
def
unzip3[A1, A2, A3](implicit asTriple: (RelationalOperator[T]) ⇒ (A1, A2, A3)): (Traversable[A1], Traversable[A2], Traversable[A3])
- Definition Classes
- GenericTraversableTemplate
-
def
view(from: Int, until: Int): TraversableView[RelationalOperator[T], Traversable[RelationalOperator[T]]]
- Definition Classes
- TraversableLike
-
def
view: TraversableView[RelationalOperator[T], Traversable[RelationalOperator[T]]]
- Definition Classes
- TraversableLike
-
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
- @native() @throws( ... )
-
def
withFilter(p: (RelationalOperator[T]) ⇒ Boolean): FilterMonadic[RelationalOperator[T], Traversable[RelationalOperator[T]]]
- Definition Classes
- TraversableLike → FilterMonadic
-
def
withNewChildren(newChildren: Array[RelationalOperator[T]]): RelationalOperator[T]
- Definition Classes
- AbstractTreeNode → TreeNode
- Annotations
- @inline()