scala.slick.ast

Union

final case class Union(left: Node, right: Node, all: Boolean, leftGen: Symbol = new AnonSymbol(), rightGen: Symbol = new AnonSymbol()) extends BinaryNode with DefNode with SimplyTypedNode with Product with Serializable

A union of type (CollectionType(c, t), CollectionType(_, t)) => CollectionType(c, t).

Linear Supertypes
Serializable, java.io.Serializable, Product, Equals, SimplyTypedNode, DefNode, BinaryNode, Node, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Union
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. SimplyTypedNode
  7. DefNode
  8. BinaryNode
  9. Node
  10. AnyRef
  11. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Union(left: Node, right: Node, all: Boolean, leftGen: Symbol = new AnonSymbol(), rightGen: Symbol = new AnonSymbol())

Type Members

  1. type Self = Union

    Definition Classes
    UnionSimplyTypedNodeNode

Value Members

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

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  3. final def ##(): Int

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

    Definition Classes
    AnyRef
  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  6. val all: Boolean

  7. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  8. def buildType: Type

    Attributes
    protected
    Definition Classes
    UnionSimplyTypedNode
  9. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  10. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  11. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  12. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  13. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  14. val left: Node

    Definition Classes
    UnionBinaryNode
  15. val leftGen: Symbol

  16. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  17. def nodeBuildTypedNode[T >: Union.this.type <: Node](newNode: T, newType: Type): T

    Definition Classes
    Node
  18. def nodeChildNames: collection.Seq[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
    UnionNode
  19. lazy val nodeChildren: collection.Seq[Node]

    Definition Classes
    BinaryNodeNode
  20. def nodeGenerators: collection.Seq[(Symbol, Node)]

    Definition Classes
    UnionDefNode
  21. def nodeHasType: Boolean

    Definition Classes
    Node
  22. final def nodeIntrinsicSymbol: IntrinsicSymbol

    The intrinsic symbol that points to this Node object.

    The intrinsic symbol that points to this Node object.

    Definition Classes
    Node
  23. final def nodeMapChildren(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 is set to true, the type of this node is kept even if the children have changed.

    Definition Classes
    Node
  24. final def nodeMapGenerators(f: (Symbol) ⇒ Symbol): Node

    Definition Classes
    DefNode
  25. final def nodeMapScopedChildren(f: (Option[Symbol], Node) ⇒ Node): Self with DefNode

    Definition Classes
    DefNode
  26. def nodePeekType: Type

    Definition Classes
    Node
  27. def nodeRebuild(left: Node, right: Node): Union

    Attributes
    protected[this]
    Definition Classes
    UnionBinaryNode
  28. final def nodeRebuild(ch: IndexedSeq[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* perform any optimization to reuse the current node. This method always returns a fresh copy.

    Attributes
    protected[this]
    Definition Classes
    BinaryNodeNode
  29. final def nodeRebuildOrThis(ch: IndexedSeq[Node]): Self

    Rebuild this node with a new list of children unless all children are identical to the current ones.

    Rebuild this node with a new list of children unless all children are identical to the current ones.

    Attributes
    protected[this]
    Definition Classes
    Node
  30. def nodeRebuildWithGenerators(gen: IndexedSeq[Symbol]): Union

    Attributes
    protected[this]
    Definition Classes
    UnionDefNode
  31. def nodeRebuildWithType(tpe: Type): Self

    Definition Classes
    Node
  32. def nodeType: Type

    The current type of this node

    The current type of this node

    Definition Classes
    Node
  33. final def nodeTyped(tpe: Type): Union.this.type

    Return this Node with a Type assigned.

    Return this Node with a Type assigned. This may only be called on freshly constructed nodes with no other existing references, i.e. creating the Node plus assigning it a Type must be atomic.

    Definition Classes
    Node
  34. final def nodeTypedOrCopy(tpe: 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
  35. final def nodeUntypedOrCopy: Self

    Return this Node with no Type assigned (if it's type has not been observed yet) or an untyped copy.

    Return this Node with no Type assigned (if it's type has not been observed yet) or an untyped copy.

    Definition Classes
    Node
  36. final def nodeWithComputedType(scope: SymbolScope = SymbolScope.empty, typeChildren: Boolean = false, retype: 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 typeChildren is set to true. if retype is also set to true, the existing type of this node is replaced. If this node does not yet have a type, the types of all children are computed.

    Definition Classes
    Node
  37. final def nodeWithComputedType2(scope: SymbolScope, typeChildren: Boolean, retype: Boolean): Self

    Definition Classes
    SimplyTypedNodeNode
  38. final def notify(): Unit

    Definition Classes
    AnyRef
  39. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  40. val right: Node

    Definition Classes
    UnionBinaryNode
  41. val rightGen: Symbol

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

    Definition Classes
    AnyRef
  43. def toString(): String

    Definition Classes
    UnionNode → AnyRef → Any
  44. final def wait(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Serializable

Inherited from java.io.Serializable

Inherited from Product

Inherited from Equals

Inherited from SimplyTypedNode

Inherited from DefNode

Inherited from BinaryNode

Inherited from Node

Inherited from AnyRef

Inherited from Any

Ungrouped