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

package/lib/ocaml/mapLabels.ml

@@ -0,0 +1,480 @@
+(**************************************************************************)
+(*                                                                        *)
+(*                                 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:key -> data:'a -> 'a t -> 'a t
+    val update: key:key -> f:('a option -> 'a option) -> 'a t -> 'a t
+    val singleton: key -> 'a -> 'a t
+    val remove: key -> 'a t -> 'a t
+    val merge:
+          f:(key -> 'a option -> 'b option -> 'c option) -> 'a t -> 'b t -> 'c t
+    val union: f:(key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t
+    val compare: cmp:('a -> 'a -> int) -> 'a t -> 'a t -> int
+    val equal: cmp:('a -> 'a -> bool) -> 'a t -> 'a t -> bool
+    val iter: f:(key:key -> data:'a -> unit) -> 'a t -> unit
+    val fold: f:(key:key -> data:'a -> 'b -> 'b) -> 'a t -> init:'b -> 'b
+    val for_all: f:(key -> 'a -> bool) -> 'a t -> bool
+    val exists: f:(key -> 'a -> bool) -> 'a t -> bool
+    val filter: f:(key -> 'a -> bool) -> 'a t -> 'a t
+    val partition: f:(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: f:(key -> bool) -> 'a t -> key * 'a
+    val find_first_opt: f:(key -> bool) -> 'a t -> (key * 'a) option
+    val find_last: f:(key -> bool) -> 'a t -> key * 'a
+    val find_last_opt: f:(key -> bool) -> 'a t -> (key * 'a) option
+    val map: f:('a -> 'b) -> 'a t -> 'b t
+    val mapi: f:(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 ~key: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 ~key:x ~data l in
+            if l == ll then m else bal ll v d r
+          else
+            let rr = add ~key: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 ~key: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 ~key:x ~f l in
+            if l == ll then m else bal ll v d r
+          else
+            let rr = update ~key: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 ~key:v ~data: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 ~init:accu =
+      match m with
+        Empty -> accu
+      | Node {l; v; d; r} ->
+          fold ~f r ~init:(f ~key:v ~data:d (fold ~f l ~init:accu))
+
+    let rec for_all ~f:p = function
+        Empty -> true
+      | Node {l; v; d; r} -> p v d && for_all ~f:p l && for_all ~f:p r
+
+    let rec exists ~f:p = function
+        Empty -> false
+      | Node {l; v; d; r} -> p v d || exists ~f:p l || exists ~f: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 ~f:p = function
+        Empty -> Empty
+      | Node {l; v; d; r} as m ->
+          (* call [p] in the expected left-to-right order *)
+          let l' = filter ~f:p l in
+          let pvd = p v d in
+          let r' = filter ~f: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 ~f:p = function
+        Empty -> (Empty, Empty)
+      | Node {l; v; d; r} ->
+          (* call [p] in the expected left-to-right order *)
+          let (lt, lf) = partition ~f:p l in
+          let pvd = p v d in
+          let (rt, rf) = partition ~f: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

package/lib/ocaml/mapm.cppo.ml

@@ -0,0 +1,177 @@
+#ifdef TYPE_INT
+module I = Belt_internalMapInt
+type key = int
+#elif defined TYPE_STRING
+module I = Belt_internalMapString
+type key = string
+#else
+  [%error "unknown type"]
+#endif  
+module N = Belt_internalAVLtree
+module A = Belt_Array 
+
+
+
+
+type 'a t = {
+  mutable data : 'a I.t
+} 
+
+
+let make () = {data = None}
+let isEmpty m = N.isEmpty m.data
+let clear m =  m.data<- None
+(* let singleton k v = t ~data:(N.singleton k v) *)
+
+let minKeyUndefined m = N.minKeyUndefined m.data
+let minKey m = N.minKey m.data
+let maxKeyUndefined m = N.maxKeyUndefined m.data
+let maxKey m = N.maxKey m.data
+let minimum m = N.minimum m.data
+let minUndefined m = N.minUndefined m.data
+let maximum m = N.maximum m.data
+let maxUndefined m = N.maxUndefined m.data
+
+let set (m : _ t) k v = 
+  let old_data = m.data in 
+  let v = I.addMutate old_data k v in 
+  if v != old_data then 
+    m.data <-v 
+
+let forEachU d f = N.forEachU d.data f
+let forEach d f = forEachU d (fun[@bs] a b -> f a b)    
+let mapU d f = {data = N.mapU d.data f}
+let map d f = mapU d (fun[@bs] a -> f a )    
+let mapWithKeyU d f = { data = (N.mapWithKeyU d.data f)}
+let mapWithKey d f = mapWithKeyU d (fun [@bs] a b -> f a b)    
+let reduceU d acc f  = N.reduceU d.data acc f
+let reduce d acc f = reduceU d acc (fun[@bs] a b c -> f a b c)    
+let everyU d f = N.everyU d.data f
+let every d f = everyU d (fun[@bs] a b -> f a b)    
+let someU d f = N.someU d.data f    
+let some d f = someU d (fun[@bs] a b -> f a b)
+let size d = N.size d.data
+let toList d = N.toList d.data
+let toArray d = N.toArray d.data
+let keysToArray d = N.keysToArray d.data
+let valuesToArray d = N.valuesToArray d.data
+let checkInvariantInternal d = N.checkInvariantInternal d.data
+let has d v = I.has d.data v 
+
+
+let rec removeMutateAux nt (x : key)= 
+  let k = nt.N.key in 
+  if x = k then 
+    let {N.left = l; right = r} = nt in       
+    match l, r with
+    | None, _ -> r  
+    | _, None -> l 
+    | _,  Some nr ->  
+      nt.right <- (N.removeMinAuxWithRootMutate nt nr);
+      Some (N.balMutate nt)
+  else 
+    begin 
+      if x < k then 
+        match  nt.left with         
+        | None -> Some nt 
+        | Some l ->
+          nt.left <- (removeMutateAux l x );
+          Some (N.balMutate nt)
+      else 
+        match  nt.right with 
+        | None -> Some nt 
+        | Some r -> 
+          nt.right <- (removeMutateAux r x);
+          Some (N.balMutate nt)
+    end
+
+let remove d v = 
+  let oldRoot = d.data in 
+  match  oldRoot with 
+  | None -> ()
+  | Some root -> 
+    let newRoot = removeMutateAux root v in 
+    if newRoot != oldRoot then 
+      d.data <- newRoot   
+
+
+let rec updateDone t (x : key)  f  =   
+  match  t with 
+  | None ->
+    (match f None [@bs] with
+    | Some data -> N.singleton x data
+    | None -> t)
+  | Some nt -> 
+    let k = nt.N.key in 
+    (* let  c = (Belt_Cmp.getCmpInternal cmp) x k [@bs] in   *)
+    if k = x then begin     
+      match f (Some nt.value) [@bs] with
+      | None ->
+        let {N.left = l; right = r} = nt in
+        begin match  l,  r with
+          | None,  _ -> r
+          | _, None  -> l
+          | _, Some nr ->
+            nt.right <- (N.removeMinAuxWithRootMutate nt nr);
+            Some (N.balMutate nt)
+        end
+      | Some data -> 
+        nt.value <- data;
+        Some nt
+    end      
+    else
+      let {N.left = l; right = r} = nt in 
+      (if x < k then                   
+         let ll = updateDone  l x f in
+         nt.left <- ll
+       else   
+         nt.right <- (updateDone  r x f);
+      );
+      Some (N.balMutate nt)
+        
+let updateU t x f =       
+  let oldRoot = t.data in 
+  let newRoot = updateDone oldRoot x f  in 
+  if newRoot != oldRoot then 
+    t.data <- newRoot 
+let update t x f = updateU t x (fun[@bs] a -> f a )
+let rec removeArrayMutateAux t xs i len   =  
+  if i < len then 
+    let ele = A.getUnsafe xs i in 
+    let u = removeMutateAux t ele  in 
+    match  u with 
+    | None -> None
+    | Some t -> removeArrayMutateAux t xs (i+1) len 
+  else Some t    
+
+let removeMany (d : _ t) xs =  
+  let oldRoot = d.data in 
+  match  oldRoot with 
+  | None -> ()
+  | Some nt -> 
+    let len = A.length xs in 
+    let newRoot = removeArrayMutateAux nt xs 0 len in 
+    if newRoot != oldRoot then 
+      d.data <- newRoot
+
+
+
+(* let split = I.split  *)
+(* let merge = I.merge  *)
+
+
+let fromArray xs = 
+  { data = I.fromArray xs }
+
+let cmpU d0 d1 f = 
+  I.cmpU d0.data d1.data f
+let cmp d0 d1 f = cmpU d0 d1 (fun[@bs] a b -> f a b)          
+
+let eqU d0 d1 f = 
+  I.eqU d0.data d1.data f
+let eq d0 d1 f = eqU d0 d1 (fun[@bs] a b -> f a b)    
+
+let get d x =   I.get d.data x 
+let getUndefined d x = I.getUndefined d.data x 
+let getWithDefault d x def = I.getWithDefault d.data x def  
+let getExn d x = I.getExn d.data x