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

(* SPDX-License-Identifier: AGPL-3.0-or-later *)
(* Copyright © 2021-2024 OCamlPro *)
(* Written by the Owi programmers *)

type 'a t =
  { index : int
  ; value : 'a
  }

let get v = v.value

let get_index v = v.index

let map f v = { index = v.index; value = f v.value }

let return index value = { index; value }

let has_index idx { index; _ } = idx = index

let get_at i values =
  match List.find_opt (has_index i) values with
  | None -> None
  | Some { value; _ } -> Some value

let list_to_array l =
  List.sort
    (fun { index = i1; value = _ } { index = i2; value = _ } ->
      Int.compare i1 i2 )
    l
  |> List.map (fun { value; _ } -> value)
  |> Array.of_list

let pp pp_v fmt { index; value } =
  Fmt.pf fmt "{ index = %d ; value = %a }" index pp_v value

let pp_list pp_v fmt l =
  let pp fmt v = pp pp_v fmt v in
  Fmt.pf fmt "[%a]" (Fmt.list ~sep:(fun fmt () -> Fmt.pf fmt " ; ") pp) l