array.mlw 3.91 KB
Newer Older
1

2 3
(* Arrays *)

4 5 6
module Array

  use import int.Int
7
  use import map.Map as M
8

9
  type array 'a model {| length : int; mutable elts : map int 'a |}
10

11
  logic ([]) (a: array 'a) (i :int) : 'a = M.([]) a.elts i
12

13
  parameter ([]) : a:array 'a -> i:int ->
14
    { 0 <= i < length a } 'a reads a { result = a[i] }
15

16
  parameter set : a:array 'a -> i:int -> v:'a ->
17
    { 0 <= i < length a } unit writes a { a.elts = (old a.elts)[i <- v] }
18

19 20 21 22 23 24
  (* unsafe get/set operations with no precondition *)
  parameter unsafe_get : a:array 'a -> i:int ->
    { } 'a reads a { result = a[i] }
  parameter unsafe_set : a:array 'a -> i:int -> v:'a ->
    { } unit writes a { a.elts = (old a.elts)[i <- v] }

25 26
  parameter length : a:array 'a -> {} int { result = a.length }

27 28 29
  parameter make : n:int -> v:'a ->
    {}
    array 'a
30
    { length result = n and forall i:int. 0 <= i < n -> result[i] = v}
31 32 33 34 35 36 37 38 39 40 41 42 43 44

  parameter append : a1:array 'a -> a2:array 'a ->
    {}
    array 'a
    { length result = length a1 + length a2 and
      (forall i:int. 0 <= i < length a1 -> result[i] = a1[i]) and
      (forall i:int. 0 <= i < length a2 -> result[length a1 + i] = a2[i]) }

  parameter sub : a:array 'a -> ofs:int -> len:int ->
    { 0 <= ofs and ofs + len <= length a }
    array 'a
    { length result = len and
      forall i:int. 0 <= i < len -> result[i] = a[ofs + i] }

45 46 47 48
  parameter copy : a:array 'a ->
    {}
    array 'a
    { length result = length a and
49 50 51 52 53
      forall i:int. 0 <= i < length result -> result[i] = a[i] }

  parameter fill : a:array 'a -> ofs:int -> len:int -> v:'a ->
   { 0 <= ofs and ofs + len <= length a }
   unit
54 55 56 57
   writes a
   { (forall i:int.
       (0 <= i < ofs or ofs + len <= i < length a) -> a[i] = (old a)[i])
     and
58 59 60
     (forall i:int.
       ofs <= i < ofs + len -> a[i] = v) }

61
  parameter blit :
62 63 64 65
   a1:array 'a -> ofs1:int -> a2:array 'a -> ofs2:int -> len:int ->
   { 0 <= ofs1 and ofs1 + len <= length a1 and
     0 <= ofs2 and ofs2 + len <= length a2 }
   unit
66 67 68 69
   writes a2
   { (forall i:int.
       (0 <= i < ofs2 or ofs2 + len <= i < length a2) -> a2[i] = (old a2)[i])
     and
70 71
     (forall i:int.
       ofs2 <= i < ofs2 + len -> a2[i] = a1[ofs1 + i - ofs2]) }
72

73 74 75
  (* TODO?
     - concat : 'a array list -> 'a array
     - to_list
76
     - of_list
77
  *)
78 79 80

end

81 82 83
module ArraySorted

  use import module Array
84
  clone import map.MapSorted as M with type elt = int
85

86
  logic sorted_sub (a : array int) (l u : int) =
87 88
    M.sorted_sub a.elts l u

89
  logic sorted (a : array int) =
90 91 92 93 94 95 96
    M.sorted_sub a.elts 0 a.length

end

module ArrayEq

  use import module Array
97
  use import map.MapEq as M
98 99 100 101

  logic array_eq_sub (a1 a2: array 'a) (l u: int) =
    map_eq_sub a1.elts a2.elts l u

102
  logic array_eq (a1 a2: array 'a) =
103 104 105 106 107 108 109 110 111 112
    a1.length = a2.length and
    array_eq_sub a1 a2 0 a1.length

end

module ArrayPermut

  use import module Array
  clone import map.MapPermut as M

113 114 115
  logic exchange (a1 a2: array 'a) (i j: int) =
    M.exchange a1.elts a2.elts i j

116
  logic permut_sub (a1 a2: array 'a) (l u: int) =
117 118
    M.permut_sub a1.elts a2.elts l u

119
  logic permut (a1 a2: array 'a) =
120 121 122 123
    a1.length = a2.length and M.permut_sub a1.elts a2.elts 0 a1.length

end

124
(***
125 126 127 128 129
module TestArray

  use import int.Int
  use import module Array

130
  let test_append () =
131 132
    let a1 = make 17 2 in
    assert { a1[3] = 2 };
133
    set a1 3 4;
134 135 136 137 138 139 140 141 142
    assert { a1[3] = 4 };
    let a2 = make 25 3 in
    assert { a2[0] = 3 }; (* needed to prove a[17]=3 below *)
    let a  = append a1 a2 in
    assert { length a = 42 };
    assert { a[3] = 4 };
    assert { a[17] = 3 };
    ()

143
  let test_fill () =
144 145 146
    let a = make 17 True in
    fill a 10 4 False;
    assert { a[10] = False }
147

148 149 150 151 152 153 154 155 156 157
  let test_blit () =
    let a1 = make 17 True in
    let a2 = make 25 False in
    blit a1 10 a2 17 7;
    assert { a1[10] = True  };
    assert { a2[16] = False };
    assert { a2[17] = True  };
    assert { a2[23] = True  };
    assert { a2[24] = False }

158
end
159
***)
160

161
(*
162
Local Variables:
163
compile-command: "unset LANG; make -C .. modules/stdlib"
164
End:
165
*)