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) { print(month(i)); } for (person in people) { if (!person.greeted) { print("Hello, ``person.name``!"); break; } } else { print("Hello, World!"); }
Anything
no subtypes hierarchy
Initializer |
ForFail(ForClause forClause, FailClause? failClause = ...) Parameters:
|
Attributes | |
children | Source Codeshared actual [ForClause, FailClause=] children The child nodes of this node. Refines Node.children |
failClause | Source Codeshared FailClause? failClause The ‘ |
forClause | Source Codeshared ForClause forClause The ‘ |
hash | Source 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:
Therefore, a class which refines In general, Note that when executing on a Java Virtual Machine, the
64-bit Refines Object.hash |
Inherited Attributes |
Attributes inherited from: Node |
Attributes inherited from: Object hash , string |
Methods | |
copy | Source Codeshared ForFail copy(ForClause forClause = ..., FailClause? failClause = ...) Parameters:
|
equals | Source Codeshared actual Boolean equals(Object that) Determine if two values are equal. For any two non-null objects x == y Implementations should respect the constraints that:
Furthermore it is recommended that implementations
ensure that if A class which explicitly refines Note that an implementation of Refines Object.equals |
transform | Source Codeshared actual Result transform<out Result>(Transformer<Result> transformer) Transform this node with the given If you have a Refines Node.transform |
visit | Source Codeshared actual void visit(Visitor visitor) Visit this node with the given Refines Node.visit |
Inherited Methods |
Methods inherited from: Node |
Methods inherited from: Object equals |