An ‘if
’ comprehension clause, also knows as a filter clause.
An ‘if
’ comprehension clause consists of the keyword ‘if
’,
a condition list and a following clause
.
Examples:
if (person.age >= 18) person if (exists typeArguments = that.typeArguments) for (typeArgument in typeArguments) typeArgument.type
no subtypes hierarchy
Initializer |
IfComprehensionClause(Conditions conditions, ComprehensionClause clause) Parameters:
|
Attributes | |
children | shared actual [Conditions, ComprehensionClause] children The child nodes of this node. Refines Node.children |
clause | shared actual ComprehensionClause clause The following / next / inner comprehension clause. |
conditions | shared Conditions conditions The condition list of the comprehension clause. |
hash | shared 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: InitialComprehensionClause |
Attributes inherited from: Node |
Attributes inherited from: Object hash , string |
Methods | |
copy | shared IfComprehensionClause copy(Conditions conditions = ..., ComprehensionClause clause = ...) Parameters:
|
equals | shared actual Boolean equals(Object that) Determine if two values are equal. 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 | shared actual Result transform<out Result>(Transformer<Result> transformer) Transform this node with the given If you have a Refines Node.transform |
visit | shared 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 |