A set complement expression.

Defined via complement. Left-associative.

Examples:

receivers~blocked
primes ~ HashSet { 2 }

no subtypes hierarchy

Initializer
ComplementOperation(UnioningExpression leftOperand, IntersectingExpression rightOperand)
Parameters:
  • leftOperand

    The “this” set, from which elements for the result set are taken.

  • rightOperand

    The “other” set, the elements of which are not present in the result set.

Attributes
childrenshared actual [UnioningExpression, IntersectingExpression] children

The child nodes of this node.

Refines BinaryOperation.children ultimately refines Node.children
hashshared actual Integer hash

The hash value of the value, which allows the value to be an element of a hash-based set or key of a hash-based map. Implementations must respect the constraint that:

  • if x==y then x.hash==y.hash.

Therefore, a class which refines equals must also refine hash.

Because the Integer type is platform-dependent a compiler for a given platform is permitted to further manipulate the calculated hash for an object, and the resulting hash may differ between platforms.

Refines Object.hash
leftOperandshared actual UnioningExpression leftOperand

The “this” set, from which elements for the result set are taken.

operatorshared actual String operator

The text of the operator.

rightOperandshared actual IntersectingExpression rightOperand

The “other” set, the elements of which are not present in the result set.

Inherited Attributes
Attributes inherited from: BinaryOperation
Attributes inherited from: Expression
Attributes inherited from: Node
Attributes inherited from: Object
hash, string
Attributes inherited from: Operation
Methods
copyshared ComplementOperation copy(UnioningExpression leftOperand = ..., IntersectingExpression rightOperand = ...)
Parameters:
  • leftOperand = this.leftOperand
  • rightOperand = this.rightOperand
equalsshared actual Boolean equals(Object that)

Determine if two values are equal. Implementations should respect the constraints that:

  • if x===y then x==y (reflexivity),
  • if x==y then y==x (symmetry),
  • if x==y and y==z then x==z (transitivity).

Furthermore it is recommended that implementations ensure that if x==y then x and y have the same concrete class.

A class which explicitly refines equals() is said to support value equality, and the equality operator == is considered much more meaningful for such classes than for a class which simply inherits the default implementation of identity equality from Identifiable.

Refines Object.equals
transformshared actual Result transform<out Result>(Transformer<Result> transformer)

Transform this node with the given transformer by calling the appropriate transformX method on the transformer.

If you have a Node node that’s actually an LIdentifier instance, then the runtime will call LIdentifier.transform; therefore, this method is by nature narrowing. This means that if transformer is a NarrowingTransformer, calling node.transform(transformer) is equivalent to calling transformer.transformNode(node). On the other hand, if transformer is a WideningTransformer, then the two operations are very different.

visitshared actual void visit(Visitor visitor)

Visit this node with the given visitor. Calls the appropriate visitX method on the visitor.

Refines Node.visit
Inherited Methods
Methods inherited from: Node
Methods inherited from: Object
equals