A ‘for
’ clause, that is, the keyword ‘for
’ followed by an iterator
and a block
.
(Not to be confused with a complete ‘for
’ loop (ForFail
), which also includes an optional failure clause.)
Examples:
for (person in people) { print(person.name); } for (name->person in peopleByName) { print("``name``: ``person.age``"); }
no subtypes hierarchy
Initializer |
ForClause(ForIterator iterator, Block block) Parameters:
|
Attributes | |
block | Source Codeshared Block block The block of the ‘ Within this block, the variable of the |
children | Source Codeshared actual [ForIterator, Block] children The child nodes of this node. Refines Node.children |
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 |
iterator | Source Codeshared ForIterator iterator The iterator of the ‘ |
Inherited Attributes |
Attributes inherited from: Node |
Attributes inherited from: Object hash , string |
Methods | |
copy | Source Codeshared ForClause copy(ForIterator iterator = ..., Block block = ...) 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 |