A closed lower or upper bound of a bounded comparison operation.
In a closed bound, the endpoint
is a part of the designated interval;
therefore, the minimum / maximum value of the interval is the endpoint.
no subtypes hierarchy
Initializer 
ClosedBound(ExistsNonemptyExpression endpoint) Parameters:

Attributes  
children  Source Codeshared actual [ExistsNonemptyExpression] children The child nodes of this node. 
endpoint  Source Codeshared actual ExistsNonemptyExpression endpoint The endpoint of the bound, against which the operand is compared. Refines Bound.endpoint 
hash  Source Codeshared actual Integer hash The hash value of the value, which allows the value to be an element of a hashbased set or key of a hashbased map. Implementations must respect the constraint that:
Therefore, a class which refines Refines Object.hash 
Inherited Attributes 
Attributes inherited from: Node 
Attributes inherited from: Object 
Methods  
copy  Source Codeshared ClosedBound copy(ExistsNonemptyExpression endpoint = ...) Parameters:

equals  Source Codeshared 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 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 
Inherited Methods 
Methods inherited from: Node 