All these comparison words produce -1 (all bits set) if the condition
is true, otherwise 0. Note that the words that compare for equality
(= <> 0= 0<> d= d<> d0= d0<>
) work for for both signed and
unsigned numbers.
u2<u3 and u1 in [u2,u3) or: u2>=u3 and u1 not in [u3,u2). This works for
unsigned and signed numbers (but not a mixture). Another way to think
about this word is to consider the numbers as a circle (wrapping
around from max-u
to 0 for unsigned, and from max-n
to
min-n for signed numbers); now consider the range from u2 towards
increasing numbers up to and excluding u3 (giving an empty range if
u2=u3); if u1 is in this range, within
returns true.