A ‘for’ loop with an optional failure clause, that is, a for’ clause (forClause), optionally followed by an else’ failure clause (failClause).

Examples (multi-line):

for (i in 1:12) {

for (person in people) {                                  
    if (!person.greeted) {
        print("Hello, ``person.name``!");
} else {
    print("Hello, World!");

no subtypes hierarchy

ForFail(ForClause forClause, FailClause? failClause = null)
  • forClause

    The ‘for’ clause of the loop.

  • failClause = null

    The ‘else’ failure clause of the loop, if present.

childrenSource Codeshared actual [ForClause, FailClause=] children

The child nodes of this node.

failClauseSource Codeshared FailClause? failClause

The ‘else’ failure clause of the loop, if present.

forClauseSource Codeshared ForClause forClause

The ‘for’ clause of the loop.

hashSource Codeshared 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.

Refines Object.hash
Inherited Attributes
Attributes inherited from: Node
Attributes inherited from: Object
copySource Codeshared ForFail copy(ForClause forClause = ..., FailClause? failClause = ...)
  • forClause = this.forClause
  • failClause = this.failClause
equalsSource Codeshared 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.

transformSource Codeshared 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.

Inherited Methods
Methods inherited from: Node