1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59

with import ./lib.nix;

let

  /* Supposedly tail recursive version:

  range_ = accum: first: last:
    if first == last then ([first] ++ accum)
    else range_ ([first] ++ accum) (builtins.add first 1) last;

  range = range_ [];
  */

  x = 12;

  err = abort "urgh";

in

assert 3 < 7;
assert !(7 < 3);
assert !(3 < 3);

assert 3 <= 7;
assert !(7 <= 3);
assert 3 <= 3;

assert !(3 > 7);
assert 7 > 3;
assert !(3 > 3);

assert !(3 >= 7);
assert 7 >= 3;
assert 3 >= 3;

assert 2 > 1 == 1 < 2;
assert 1 + 2 * 3 >= 7;
assert !(1 + 2 * 3 < 7);

# Not integer, but so what.
assert "aa" < "ab";
assert !("aa" < "aa");
assert "foo" < "foobar";
[
  (sum (range 1 50))
  (123 + 456)
  (0 + -10 + -(-11) + -x)
  (10 - 7 - -2)
  (10 - (6 - -1))
  (10 - 1 + 2)
  (3 * 4 * 5)
  (56088 / 123 / 2)
  (3 + 4 * const 5 0 - 6 / id 2)

  (builtins.bitAnd 12 10) # 0b1100 & 0b1010 =  8
  (builtins.bitOr  12 10) # 0b1100 | 0b1010 = 14
  (builtins.bitXor 12 10) # 0b1100 ^ 0b1010 =  6
]