is the smallest entry of strictly greater than containing value
. The constraint holds since 3 is the smallest entry located
after entry 2 that contains value 9. Items of are permutable.
Originally introduced for modelling the fact that a nucleotide
has to be consumed as soon as possible at cycle after a given
cycle represented by variable . - See also related: (identify an
element in a table), (allow to iterate over the values of a
table). - Derived Collection - Arc input(s) - Arc generator -
Arc arity - Arc constraint(s) - Graph property(ies) -
Constraint(s) on sets - Graph model Parts (A) and (B) of Figure
5.227.1 respectively show the initial and final graph associated
with the second graph constraint of the Example slot. Since we
use the graph property, the arcs of the final graph are stressed
in bold. Figure 5.227.1. Initial and final graph of the
constraint Figure 5.227.2 depicts the automaton associated with
the constraint. Let and respectively be the and the attributes
of the item of the collections.