@tellahq/rescript 10.1.4-republish-1 → 10.1.4-republish-2

package/lib/ocaml/map.cppo.mli

@@ -1,191 +0,0 @@
-#ifdef TYPE_STRING
-type key = string
-#elif defined TYPE_INT
-type key = int
-#else
-[%error "unknown type"]
-#endif
-type 'value t
-(** The type of maps from type `key` to type `'value`. *)
-
-val empty: 'v t
-
-val isEmpty: 'v t -> bool
-
-val has: 'v t -> key -> bool
-
-val cmpU: 'v t -> 'v t -> ('v -> 'v -> int [@bs]) -> int
-val cmp: 'v t -> 'v t -> ('v -> 'v -> int) -> int
-
-val eqU: 'v t -> 'v t -> ('v -> 'v -> bool [@bs]) -> bool
-val eq: 'v t -> 'v t -> ('v -> 'v -> bool) -> bool
-(**
-  `eq m1 m2` tests whether the maps `m1` and `m2` are
-  equal, that is, contain equal keys and associate them with
-  equal data.
-*)
-
-val findFirstByU : 'v t -> (key -> 'v -> bool [@bs]) -> (key * 'v) option
-val findFirstBy : 'v t -> (key -> 'v -> bool) -> (key * 'v) option
-(**
-  `findFirstBy m p` uses funcion `f` to find the first key value pair
-  to match predicate `p`.
-
-  ```
-  let s0 = fromArray ~id:(module IntCmp) [|4,"4";1,"1";2,"2,"3""|];;
-  findFirstBy s0 (fun k v -> k = 4 ) = option (4, "4");;
-  ```
-*)
-
-val forEachU: 'v t -> (key -> 'v -> unit [@bs]) -> unit
-val forEach: 'v t -> (key -> 'v -> unit) -> unit
-(**
-  `forEach m f` applies `f` to all bindings in map `m`.
-  `f` receives the key as first argument, and the associated value
-  as second argument. The bindings are passed to `f` in increasing
-  order with respect to the ordering over the type of the keys.
-*)
-
-val reduceU: 'v t -> 'v2 -> ('v2 -> key -> 'v -> 'v2 [@bs]) -> 'v2
-val reduce: 'v t -> 'v2 -> ('v2 -> key -> 'v -> 'v2) -> 'v2
-(**
-  `reduce m a f` computes `(f kN dN ... (f k1 d1 a)...)`,
-  where `k1 ... kN` are the keys of all bindings in `m`
-  (in increasing order), and `d1 ... dN` are the associated data.
-*)
-
-val everyU: 'v t -> (key -> 'v -> bool [@bs]) -> bool
-val every: 'v t -> (key -> 'v -> bool) -> bool
-(** `every m p` checks if all the bindings of the map
-    satisfy the predicate `p`. Order unspecified *)
-
-val someU: 'v t -> (key -> 'v -> bool [@bs]) -> bool
-val some: 'v t -> (key -> 'v -> bool) -> bool
-(** `some m p` checks if at least one binding of the map
-    satisfy the predicate `p`. Order unspecified *)
-
-val size: 'v t -> int
-
-val toList: 'v t -> (key * 'v) list
-(** In increasing order. *)
-
-val toArray: 'v t -> (key * 'v) array
-
-
-val fromArray: (key * 'v) array -> 'v t
-
-val keysToArray: 'v t -> key array
-
-val valuesToArray: 'v t -> 'v array
-
-val minKey: _ t -> key option
-
-val minKeyUndefined: _ t -> key Js.undefined
-
-val maxKey: _ t -> key option
-
-val maxKeyUndefined: _ t -> key Js.undefined
-
-val minimum: 'v t -> (key * 'v) option
-
-val minUndefined: 'v t -> (key * 'v) Js.undefined
-
-val maximum: 'v t -> (key * 'v) option
-
-val maxUndefined: 'v t -> (key * 'v) Js.undefined
-
-val get: 'v t -> key -> 'v option
-
-val getUndefined: 'v t -> key -> 'v Js.undefined
-
-val getWithDefault: 'v t -> key -> 'v -> 'v
-
-val getExn: 'v t -> key -> 'v
-
-val checkInvariantInternal: _ t -> unit
-(**
-  **raise** when invariant is not held
-*)
-
-val remove: 'v t -> key -> 'v t
-(** `remove m x` returns a map containing the same bindings as
-    `m`, except for `x` which is unbound in the returned map. *)
-
-val removeMany: 'v t -> key array -> 'v t
-
-val set: 'v t -> key -> 'v -> 'v t
-(**
-  `set m x y` returns a map containing the same bindings as
-  `m`, plus a binding of `x` to `y`. If `x` was already bound
-  in `m`, its previous binding disappears.
-*)
-
-val updateU: 'v t -> key -> ('v option -> 'v option [@bs]) -> 'v t
-val update: 'v t -> key -> ('v option -> 'v option) -> 'v t
-
-val mergeU:
-  'v t -> 'v2 t ->
-  (key -> 'v option -> 'v2 option -> 'c option [@bs]) ->
-  'c t
-val merge:
-  'v t -> 'v2 t ->
-  (key -> 'v option -> 'v2 option -> 'c option) ->
-  'c t
-(**
-  `merge m1 m2 f` computes a map whose keys is a subset of keys of `m1`
-  and of `m2`. The presence of each such binding, and the corresponding
-  value, is determined with the function `f`.
-*)
-
-val mergeMany: 'v t -> (key * 'v) array -> 'v t
-
-
-val keepU:
-  'v t ->
-  (key -> 'v -> bool [@bs]) ->
-  'v t
-val keep:
-  'v t ->
-  (key -> 'v -> bool) ->
-  'v t
-(** `keep m p` returns the map with all the bindings in `m`
-    that satisfy predicate `p`. *)
-
-val partitionU:
-  'v t ->
-  (key -> 'v -> bool [@bs]) ->
-  'v t * 'v t
-val partition:
-  'v t ->
-  (key -> 'v -> bool) ->
-  'v t * 'v t
-(**
-  `partition m p` returns a pair of maps `(m1, m2)`, where
-  `m1` contains all the bindings of `s` that satisfy the
-  predicate `p`, and `m2` is the map with all the bindings of
-  `s` that do not satisfy `p`.
-*)
-
-val split: key -> 'v t -> 'v t * 'v option * 'v t
-(**
-  `split x m` returns a triple `(l, data, r)`, where
-  `l` is the map with all the bindings of `m` whose key
-  is strictly less than `x`;
-  `r` is the map with all the bindings of `m` whose key
-  is strictly greater than `x`;
-  `data` is `None` if `m` contains no binding for `x`,
-  or `Some v` if `m` binds `v` to `x`.
-*)
-
-val mapU: 'v t -> ('v -> 'v2 [@bs]) -> 'v2 t
-val map: 'v t -> ('v -> 'v2) -> 'v2 t
-(**
-  `map m f` returns a map with same domain as `m`, where the
-  associated value `a` of all bindings of `m` has been
-  replaced by the result of the application of `f` to `a`.
-  The bindings are passed to `f` in increasing order
-  with respect to the ordering over the type of the keys.
-*)
-
-val mapWithKeyU: 'v t -> (key -> 'v -> 'v2 [@bs]) -> 'v2 t
-val mapWithKey: 'v t -> (key -> 'v -> 'v2) -> 'v2 t

package/lib/ocaml/map.ml

@@ -1,480 +0,0 @@
-(**************************************************************************)
-(*                                                                        *)
-(*                                 OCaml                                  *)
-(*                                                                        *)
-(*             Xavier Leroy, projet Cristal, INRIA Rocquencourt           *)
-(*                                                                        *)
-(*   Copyright 1996 Institut National de Recherche en Informatique et     *)
-(*     en Automatique.                                                    *)
-(*                                                                        *)
-(*   All rights reserved.  This file is distributed under the terms of    *)
-(*   the GNU Lesser General Public License version 2.1, with the          *)
-(*   special exception on linking described in the file LICENSE.          *)
-(*                                                                        *)
-(**************************************************************************)
-
-module type OrderedType =
-  sig
-    type t
-    val compare: t -> t -> int
-  end
-
-module type S =
-  sig
-    type key
-    type +'a t
-    val empty: 'a t
-    val is_empty: 'a t -> bool
-    val mem:  key -> 'a t -> bool
-    val add: key -> 'a -> 'a t -> 'a t
-    val update: key -> ('a option -> 'a option) -> 'a t -> 'a t
-    val singleton: key -> 'a -> 'a t
-    val remove: key -> 'a t -> 'a t
-    val merge:
-          (key -> 'a option -> 'b option -> 'c option) -> 'a t -> 'b t -> 'c t
-    val union: (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t
-    val compare: ('a -> 'a -> int) -> 'a t -> 'a t -> int
-    val equal: ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
-    val iter: (key -> 'a -> unit) -> 'a t -> unit
-    val fold: (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
-    val for_all: (key -> 'a -> bool) -> 'a t -> bool
-    val exists: (key -> 'a -> bool) -> 'a t -> bool
-    val filter: (key -> 'a -> bool) -> 'a t -> 'a t
-    val partition: (key -> 'a -> bool) -> 'a t -> 'a t * 'a t
-    val cardinal: 'a t -> int
-    val bindings: 'a t -> (key * 'a) list
-    val min_binding: 'a t -> (key * 'a)
-    val min_binding_opt: 'a t -> (key * 'a) option
-    val max_binding: 'a t -> (key * 'a)
-    val max_binding_opt: 'a t -> (key * 'a) option
-    val choose: 'a t -> (key * 'a)
-    val choose_opt: 'a t -> (key * 'a) option
-    val split: key -> 'a t -> 'a t * 'a option * 'a t
-    val find: key -> 'a t -> 'a
-    val find_opt: key -> 'a t -> 'a option
-    val find_first: (key -> bool) -> 'a t -> key * 'a
-    val find_first_opt: (key -> bool) -> 'a t -> (key * 'a) option
-    val find_last: (key -> bool) -> 'a t -> key * 'a
-    val find_last_opt: (key -> bool) -> 'a t -> (key * 'a) option
-    val map: ('a -> 'b) -> 'a t -> 'b t
-    val mapi: (key -> 'a -> 'b) -> 'a t -> 'b t
-  end
-
-module Make(Ord: OrderedType) = struct
-
-    type key = Ord.t
-
-    type 'a t =
-        Empty
-      | Node of {l:'a t; v:key; d:'a; r:'a t; h:int}
-
-    let height = function
-        Empty -> 0
-      | Node {h} -> h
-
-    let create l x d r =
-      let hl = height l and hr = height r in
-      Node{l; v=x; d; r; h=(if hl >= hr then hl + 1 else hr + 1)}
-
-    let singleton x d = Node{l=Empty; v=x; d; r=Empty; h=1}
-
-    let bal l x d r =
-      let hl = match l with Empty -> 0 | Node {h} -> h in
-      let hr = match r with Empty -> 0 | Node {h} -> h in
-      if hl > hr + 2 then begin
-        match l with
-          Empty -> invalid_arg "Map.bal"
-        | Node{l=ll; v=lv; d=ld; r=lr} ->
-            if height ll >= height lr then
-              create ll lv ld (create lr x d r)
-            else begin
-              match lr with
-                Empty -> invalid_arg "Map.bal"
-              | Node{l=lrl; v=lrv; d=lrd; r=lrr}->
-                  create (create ll lv ld lrl) lrv lrd (create lrr x d r)
-            end
-      end else if hr > hl + 2 then begin
-        match r with
-          Empty -> invalid_arg "Map.bal"
-        | Node{l=rl; v=rv; d=rd; r=rr} ->
-            if height rr >= height rl then
-              create (create l x d rl) rv rd rr
-            else begin
-              match rl with
-                Empty -> invalid_arg "Map.bal"
-              | Node{l=rll; v=rlv; d=rld; r=rlr} ->
-                  create (create l x d rll) rlv rld (create rlr rv rd rr)
-            end
-      end else
-        Node{l; v=x; d; r; h=(if hl >= hr then hl + 1 else hr + 1)}
-
-    let empty = Empty
-
-    let is_empty = function Empty -> true | _ -> false
-
-    let rec add x data = function
-        Empty ->
-          Node{l=Empty; v=x; d=data; r=Empty; h=1}
-      | Node {l; v; d; r; h} as m ->
-          let c = Ord.compare x v in
-          if c = 0 then
-            if d == data then m else Node{l; v=x; d=data; r; h}
-          else if c < 0 then
-            let ll = add x data l in
-            if l == ll then m else bal ll v d r
-          else
-            let rr = add x data r in
-            if r == rr then m else bal l v d rr
-
-    let rec find x = function
-        Empty ->
-          raise Not_found
-      | Node {l; v; d; r} ->
-          let c = Ord.compare x v in
-          if c = 0 then d
-          else find x (if c < 0 then l else r)
-
-    let rec find_first_aux v0 d0 f = function
-        Empty ->
-          (v0, d0)
-      | Node {l; v; d; r} ->
-          if f v then
-            find_first_aux v d f l
-          else
-            find_first_aux v0 d0 f r
-
-    let rec find_first f = function
-        Empty ->
-          raise Not_found
-      | Node {l; v; d; r} ->
-          if f v then
-            find_first_aux v d f l
-          else
-            find_first f r
-
-    let rec find_first_opt_aux v0 d0 f = function
-        Empty ->
-          Some (v0, d0)
-      | Node {l; v; d; r} ->
-          if f v then
-            find_first_opt_aux v d f l
-          else
-            find_first_opt_aux v0 d0 f r
-
-    let rec find_first_opt f = function
-        Empty ->
-          None
-      | Node {l; v; d; r} ->
-          if f v then
-            find_first_opt_aux v d f l
-          else
-            find_first_opt f r
-
-    let rec find_last_aux v0 d0 f = function
-        Empty ->
-          (v0, d0)
-      | Node {l; v; d; r} ->
-          if f v then
-            find_last_aux v d f r
-          else
-            find_last_aux v0 d0 f l
-
-    let rec find_last f = function
-        Empty ->
-          raise Not_found
-      | Node {l; v; d; r} ->
-          if f v then
-            find_last_aux v d f r
-          else
-            find_last f l
-
-    let rec find_last_opt_aux v0 d0 f = function
-        Empty ->
-          Some (v0, d0)
-      | Node {l; v; d; r} ->
-          if f v then
-            find_last_opt_aux v d f r
-          else
-            find_last_opt_aux v0 d0 f l
-
-    let rec find_last_opt f = function
-        Empty ->
-          None
-      | Node {l; v; d; r} ->
-          if f v then
-            find_last_opt_aux v d f r
-          else
-            find_last_opt f l
-
-    let rec find_opt x = function
-        Empty ->
-          None
-      | Node {l; v; d; r} ->
-          let c = Ord.compare x v in
-          if c = 0 then Some d
-          else find_opt x (if c < 0 then l else r)
-
-    let rec mem x = function
-        Empty ->
-          false
-      | Node {l; v; r} ->
-          let c = Ord.compare x v in
-          c = 0 || mem x (if c < 0 then l else r)
-
-    let rec min_binding = function
-        Empty -> raise Not_found
-      | Node {l=Empty; v; d} -> (v, d)
-      | Node {l} -> min_binding l
-
-    let rec min_binding_opt = function
-        Empty -> None
-      | Node {l=Empty; v; d} -> Some (v, d)
-      | Node {l}-> min_binding_opt l
-
-    let rec max_binding = function
-        Empty -> raise Not_found
-      | Node {v; d; r=Empty} -> (v, d)
-      | Node {r} -> max_binding r
-
-    let rec max_binding_opt = function
-        Empty -> None
-      | Node {v; d; r=Empty} -> Some (v, d)
-      | Node {r} -> max_binding_opt r
-
-    let rec remove_min_binding = function
-        Empty -> invalid_arg "Map.remove_min_elt"
-      | Node {l=Empty; r} -> r
-      | Node {l; v; d; r} -> bal (remove_min_binding l) v d r
-
-    let merge t1 t2 =
-      match (t1, t2) with
-        (Empty, t) -> t
-      | (t, Empty) -> t
-      | (_, _) ->
-          let (x, d) = min_binding t2 in
-          bal t1 x d (remove_min_binding t2)
-
-    let rec remove x = function
-        Empty ->
-          Empty
-      | (Node {l; v; d; r} as m) ->
-          let c = Ord.compare x v in
-          if c = 0 then merge l r
-          else if c < 0 then
-            let ll = remove x l in if l == ll then m else bal ll v d r
-          else
-            let rr = remove x r in if r == rr then m else bal l v d rr
-
-    let rec update x f = function
-        Empty ->
-          begin match f None with
-          | None -> Empty
-          | Some data -> Node{l=Empty; v=x; d=data; r=Empty; h=1}
-          end
-      | Node {l; v; d; r; h} as m ->
-          let c = Ord.compare x v in
-          if c = 0 then begin
-            match f (Some d) with
-            | None -> merge l r
-            | Some data ->
-                if d == data then m else Node{l; v=x; d=data; r; h}
-          end else if c < 0 then
-            let ll = update x f l in
-            if l == ll then m else bal ll v d r
-          else
-            let rr = update x f r in
-            if r == rr then m else bal l v d rr
-
-    let rec iter f = function
-        Empty -> ()
-      | Node {l; v; d; r} ->
-          iter f l; f v d; iter f r
-
-    let rec map f = function
-        Empty ->
-          Empty
-      | Node {l; v; d; r; h} ->
-          let l' = map f l in
-          let d' = f d in
-          let r' = map f r in
-          Node{l=l'; v; d=d'; r=r'; h}
-
-    let rec mapi f = function
-        Empty ->
-          Empty
-      | Node {l; v; d; r; h} ->
-          let l' = mapi f l in
-          let d' = f v d in
-          let r' = mapi f r in
-          Node{l=l'; v; d=d'; r=r'; h}
-
-    let rec fold f m accu =
-      match m with
-        Empty -> accu
-      | Node {l; v; d; r} ->
-          fold f r (f v d (fold f l accu))
-
-    let rec for_all p = function
-        Empty -> true
-      | Node {l; v; d; r} -> p v d && for_all p l && for_all p r
-
-    let rec exists p = function
-        Empty -> false
-      | Node {l; v; d; r} -> p v d || exists p l || exists p r
-
-    (* Beware: those two functions assume that the added k is *strictly*
-       smaller (or bigger) than all the present keys in the tree; it
-       does not test for equality with the current min (or max) key.
-
-       Indeed, they are only used during the "join" operation which
-       respects this precondition.
-    *)
-
-    let rec add_min_binding k x = function
-      | Empty -> singleton k x
-      | Node {l; v; d; r} ->
-        bal (add_min_binding k x l) v d r
-
-    let rec add_max_binding k x = function
-      | Empty -> singleton k x
-      | Node {l; v; d; r} ->
-        bal l v d (add_max_binding k x r)
-
-    (* Same as create and bal, but no assumptions are made on the
-       relative heights of l and r. *)
-
-    let rec join l v d r =
-      match (l, r) with
-        (Empty, _) -> add_min_binding v d r
-      | (_, Empty) -> add_max_binding v d l
-      | (Node{l=ll; v=lv; d=ld; r=lr; h=lh}, Node{l=rl; v=rv; d=rd; r=rr; h=rh}) ->
-          if lh > rh + 2 then bal ll lv ld (join lr v d r) else
-          if rh > lh + 2 then bal (join l v d rl) rv rd rr else
-          create l v d r
-
-    (* Merge two trees l and r into one.
-       All elements of l must precede the elements of r.
-       No assumption on the heights of l and r. *)
-
-    let concat t1 t2 =
-      match (t1, t2) with
-        (Empty, t) -> t
-      | (t, Empty) -> t
-      | (_, _) ->
-          let (x, d) = min_binding t2 in
-          join t1 x d (remove_min_binding t2)
-
-    let concat_or_join t1 v d t2 =
-      match d with
-      | Some d -> join t1 v d t2
-      | None -> concat t1 t2
-
-    let rec split x = function
-        Empty ->
-          (Empty, None, Empty)
-      | Node {l; v; d; r} ->
-          let c = Ord.compare x v in
-          if c = 0 then (l, Some d, r)
-          else if c < 0 then
-            let (ll, pres, rl) = split x l in (ll, pres, join rl v d r)
-          else
-            let (lr, pres, rr) = split x r in (join l v d lr, pres, rr)
-
-    let rec merge f s1 s2 =
-      match (s1, s2) with
-        (Empty, Empty) -> Empty
-      | (Node {l=l1; v=v1; d=d1; r=r1; h=h1}, _) when h1 >= height s2 ->
-          let (l2, d2, r2) = split v1 s2 in
-          concat_or_join (merge f l1 l2) v1 (f v1 (Some d1) d2) (merge f r1 r2)
-      | (_, Node {l=l2; v=v2; d=d2; r=r2}) ->
-          let (l1, d1, r1) = split v2 s1 in
-          concat_or_join (merge f l1 l2) v2 (f v2 d1 (Some d2)) (merge f r1 r2)
-      | _ ->
-          assert false
-
-    let rec union f s1 s2 =
-      match (s1, s2) with
-      | (Empty, s) | (s, Empty) -> s
-      | (Node {l=l1; v=v1; d=d1; r=r1; h=h1}, Node {l=l2; v=v2; d=d2; r=r2; h=h2}) ->
-          if h1 >= h2 then
-            let (l2, d2, r2) = split v1 s2 in
-            let l = union f l1 l2 and r = union f r1 r2 in
-            match d2 with
-            | None -> join l v1 d1 r
-            | Some d2 -> concat_or_join l v1 (f v1 d1 d2) r
-          else
-            let (l1, d1, r1) = split v2 s1 in
-            let l = union f l1 l2 and r = union f r1 r2 in
-            match d1 with
-            | None -> join l v2 d2 r
-            | Some d1 -> concat_or_join l v2 (f v2 d1 d2) r
-
-    let rec filter p = function
-        Empty -> Empty
-      | Node {l; v; d; r} as m ->
-          (* call [p] in the expected left-to-right order *)
-          let l' = filter p l in
-          let pvd = p v d in
-          let r' = filter p r in
-          if pvd then if l==l' && r==r' then m else join l' v d r'
-          else concat l' r'
-
-    let rec partition p = function
-        Empty -> (Empty, Empty)
-      | Node {l; v; d; r} ->
-          (* call [p] in the expected left-to-right order *)
-          let (lt, lf) = partition p l in
-          let pvd = p v d in
-          let (rt, rf) = partition p r in
-          if pvd
-          then (join lt v d rt, concat lf rf)
-          else (concat lt rt, join lf v d rf)
-
-    type 'a enumeration = End | More of key * 'a * 'a t * 'a enumeration
-
-    let rec cons_enum m e =
-      match m with
-        Empty -> e
-      | Node {l; v; d; r} -> cons_enum l (More(v, d, r, e))
-
-    let compare cmp m1 m2 =
-      let rec compare_aux e1 e2 =
-          match (e1, e2) with
-          (End, End) -> 0
-        | (End, _)  -> -1
-        | (_, End) -> 1
-        | (More(v1, d1, r1, e1), More(v2, d2, r2, e2)) ->
-            let c = Ord.compare v1 v2 in
-            if c <> 0 then c else
-            let c = cmp d1 d2 in
-            if c <> 0 then c else
-            compare_aux (cons_enum r1 e1) (cons_enum r2 e2)
-      in compare_aux (cons_enum m1 End) (cons_enum m2 End)
-
-    let equal cmp m1 m2 =
-      let rec equal_aux e1 e2 =
-          match (e1, e2) with
-          (End, End) -> true
-        | (End, _)  -> false
-        | (_, End) -> false
-        | (More(v1, d1, r1, e1), More(v2, d2, r2, e2)) ->
-            Ord.compare v1 v2 = 0 && cmp d1 d2 &&
-            equal_aux (cons_enum r1 e1) (cons_enum r2 e2)
-      in equal_aux (cons_enum m1 End) (cons_enum m2 End)
-
-    let rec cardinal = function
-        Empty -> 0
-      | Node {l; r} -> cardinal l + 1 + cardinal r
-
-    let rec bindings_aux accu = function
-        Empty -> accu
-      | Node {l; v; d; r} -> bindings_aux ((v, d) :: bindings_aux accu r) l
-
-    let bindings s =
-      bindings_aux [] s
-
-    let choose = min_binding
-
-    let choose_opt = min_binding_opt
-
-end