git.iko.soy/urbit.org
on 5e6a67f help sign in
urbit.org/docs/programming/reference/library/src/2f/gate/aor.md
64 lines 965 B history raw
1### `++aor`
3Alphabetic order
5Computes whether `a` and `b` are in alphabetical order, producing a
6boolean.
8Accepts
9-------
11`a` is a noun.
13`b` is a noun.
15Produces
16--------
18A boolean atom.
21Source
22------
24 ++ aor :: a-order
25 ~/ %aor
26 |= {a/* b/*}
27 ^- ?
28 ?: =(a b) &
29 ?. ?=(@ a)
30 ?: ?=(@ b) |
31 ?: =(-.a -.b)
32 $(a +.a, b +.b)
33 $(a -.a, b -.b)
34 ?. ?=(@ b) &
35 |-
36 =+ [c=(end 3 1 a) d=(end 3 1 b)]
37 ?: =(c d)
38 $(a (rsh 3 1 a), b (rsh 3 1 b))
39 (lth c d)
42Examples
43--------
45 ~zod/try=> (aor 'a' 'b')
46 %.y
47 ~zod/try=> (aor 'b' 'a')
48 %.n
49 ~zod/try=> (aor "foo" "bar")
50 %.n
51 ~zod/try=> (aor "bar" "foo")
52 %.y
53 ~zod/try=> (aor "abcdefz" "abcdefa")
54 %.n
55 ~zod/try=> (aor "abcdefa" "abcdefz")
56 %.y
57 ~zod/try=> (aor 10.000 17.000)
58 %.y
59 ~zod/try=> (aor 10 9)
60 %.n
64***