final case class RangeFrom(start: Long = 1L) extends NullaryNode with SimplyTypedNode with Product with Serializable
A Query of this special Node represents an infinite stream of consecutive numbers starting at the given number. This is used as an operand for zipWithIndex. It is not exposed directly in the query language because it cannot be represented in SQL outside of a 'zip' operation.
- Source
- Node.scala
- Alphabetic
- By Inheritance
- RangeFrom
- Serializable
- Serializable
- Product
- Equals
- SimplyTypedNode
- NullaryNode
- Node
- Dumpable
- AnyRef
- Any
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- All
Instance Constructors
- new RangeFrom(start: Long = 1L)
Type Members
-
type
Self = RangeFrom
- Definition Classes
- RangeFrom → SimplyTypedNode → Node
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
- def +(other: String): String
- def ->[B](y: B): (RangeFrom, B)
-
final
def
:@(newType: Type): Self
Return this Node with a Type assigned (if no other type has been seen for it yet) or a typed copy.
Return this Node with a Type assigned (if no other type has been seen for it yet) or a typed copy.
- Definition Classes
- Node
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
final
def
buildCopy: Self
Build a copy of this node with the current children.
Build a copy of this node with the current children.
- Attributes
- protected[this]
- Definition Classes
- NullaryNode → Node
-
def
buildType: CollectionType
- Definition Classes
- RangeFrom → SimplyTypedNode
-
def
childNames: Iterable[String]
Names for the child nodes to show in AST dumps.
Names for the child nodes to show in AST dumps. Defaults to a numbered sequence starting at 0 but can be overridden by subclasses to produce more suitable names.
- Definition Classes
- Node
-
def
children: ConstArray[Nothing]
All child nodes of this node.
All child nodes of this node. Must be implemented by subclasses.
- Definition Classes
- NullaryNode → Node
-
final
def
childrenForeach[R](f: (Node) ⇒ R): Unit
Apply a side-effecting function to all direct children from left to right.
Apply a side-effecting function to all direct children from left to right. Note that
n.childrenForeach(f)
is equivalent to
n.children.foreach(f)
but can be implemented more efficiently in
Nodesubclasses. n.children.foreach(f) }}} implemented more efficiently inNodesubclasses. n.childrenForeach(f) }}} implemented more efficiently inNodesubclasses.- Definition Classes
- NullaryNode → Node
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
- def ensuring(cond: (RangeFrom) ⇒ Boolean, msg: ⇒ Any): RangeFrom
- def ensuring(cond: (RangeFrom) ⇒ Boolean): RangeFrom
- def ensuring(cond: Boolean, msg: ⇒ Any): RangeFrom
- def ensuring(cond: Boolean): RangeFrom
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
- def formatted(fmtstr: String): String
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
getDumpInfo: DumpInfo
Return the name, main info, attribute info and named children
-
def
hasType: Boolean
Check if this node has a type without marking the type as seen.
Check if this node has a type without marking the type as seen.
- Definition Classes
- Node
-
final
def
infer(scope: Scope = Map.empty, typeChildren: Boolean = false): Self
Rebuild this node and all children with their computed type.
Rebuild this node and all children with their computed type. If this node already has a type, the children are only type-checked again if
typeChildrenretype- Definition Classes
- Node
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
mapChildren(f: (Node) ⇒ Node, keepType: Boolean = false): Self
Apply a mapping function to all children of this node and recreate the node with the new children.
Apply a mapping function to all children of this node and recreate the node with the new children. If all new children are identical to the old ones, this node is returned. If
keepType- Definition Classes
- NullaryNode → Node
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
nodeType: Type
The current type of this node.
The current type of this node.
- Definition Classes
- Node
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
peekType: Type
Get the current type of this node for debug output without marking it as seen.
Get the current type of this node for debug output without marking it as seen.
- Attributes
- protected[this]
- Definition Classes
- Node
-
def
rebuild: RangeFrom
- Definition Classes
- RangeFrom → NullaryNode
-
final
def
rebuild(ch: ConstArray[Node]): Self
Rebuild this node with a new list of children.
Rebuild this node with a new list of children. Implementations of this method must not reuse the current node. This method always returns a fresh copy.
- Attributes
- protected[this]
- Definition Classes
- NullaryNode → Node
- val start: Long
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
final
def
toString(): String
- Definition Classes
- Node → AnyRef → Any
-
final
def
untyped: Self
Return this Node with no Type assigned (if it has not yet been observed) or an untyped copy.
Return this Node with no Type assigned (if it has not yet been observed) or an untyped copy.
- Definition Classes
- Node
-
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( ... )
-
final
def
withChildren(ch2: ConstArray[Node]): Self
Rebuild this node with new child nodes unless all children are identical to the current ones, in which case this node is returned.
Rebuild this node with new child nodes unless all children are identical to the current ones, in which case this node is returned.
- Definition Classes
- Node
-
final
def
withInferredType(scope: Scope, typeChildren: Boolean): Self
- Definition Classes
- SimplyTypedNode → Node
- def →[B](y: B): (RangeFrom, B)
edit this text on github
Scala Language-Integrated Connection Kit
This is the API documentation for the Slick database library. It should be used as an additional resource to the user manual.
Further documentation for Slick can be found on the documentation pages.
To the slick package list...