git.iko.soy/urbit.org
on 492ae2f help sign in
urbit.org/docs/programming/reference/library/src/2f/gate/dor.md
55 lines 829 B history raw
1### `++dor`
3Numeric order
5Computes whether `a` and `b` are in ascending numeric order, producing a
6boolean.
8Accepts
9-------
11`a` is a noun.
13`b` is a noun.
15Produces
16--------
18A boolean atom.
20Source
21------
23 ++ dor :: d-order
24 ~/ %dor
25 |= {a/* b/*}
26 ^- ?
27 ?: =(a b) &
28 ?. ?=(@ a)
29 ?: ?=(@ b) |
30 ?: =(-.a -.b)
31 $(a +.a, b +.b)
32 $(a -.a, b -.b)
33 ?. ?=(@ b) &
34 (lth a b)
37Examples
38--------
40 ~zod/try=> (dor 1 2)
41 %.y
42 ~zod/try=> (dor 2 1)
43 %.n
44 ~zod/try=> (dor ~[1 2 3] ~[1 2 4])
45 %.y
46 ~zod/try=> (dor ~[1 2 4] ~[1 2 3])
47 %.n
48 ~zod/try=> (dor (limo ~[99 100 10.000]) ~[99 101 10.000])
49 %.y
50 ~zod/try=> (dor ~[99 101 10.999] (limo ~[99 100 10.000]))
51 %.n
55***