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

package/lib/ocaml/hashset.cppo.ml

@@ -1,165 +0,0 @@
-#ifdef TYPE_STRING
-type key = string
-type seed = int
-external caml_hash_mix_string : seed -> string -> seed  = "?hash_mix_string"
-external final_mix : seed -> seed = "?hash_final_mix"
-let hash (s : key) =   
-  final_mix  (caml_hash_mix_string 0 s )
-    
-#elif defined TYPE_INT
-type key = int
-type seed = int
-external caml_hash_mix_int : seed -> int -> seed  = "?hash_mix_int"
-external final_mix : seed -> seed = "?hash_final_mix"
-let hash (s : key) = 
-  final_mix (caml_hash_mix_int 0 s)
-#else 
-  [%error "unknown type"]
-#endif
-
-module N = Belt_internalSetBuckets
-module C = Belt_internalBucketsType
-module A = Belt_Array
-
-type t = (unit, unit, key) N.t 
-
-let rec copyBucket  ~h_buckets ~ndata_tail  old_bucket = 
-  match C.toOpt old_bucket with 
-  | None -> ()
-  | Some cell ->
-    let nidx = hash cell.N.key  land (A.length h_buckets - 1) in 
-    let v = C.return cell in 
-    begin match C.toOpt (A.getUnsafe ndata_tail nidx) with
-      | None -> 
-        A.setUnsafe h_buckets nidx  v
-      | Some tail ->
-        tail.N.next <- v  (* cell put at the end *)            
-    end;          
-    A.setUnsafe ndata_tail nidx  v;
-    copyBucket  ~h_buckets ~ndata_tail  cell.N.next
-
-
-let tryDoubleResize  h =
-  let odata = h.C.buckets  in
-  let osize = A.length odata in
-  let nsize = osize * 2 in
-  if nsize >= osize then begin (* no overflow *)
-    let h_buckets = A.makeUninitialized nsize  in
-    let ndata_tail = A.makeUninitialized nsize  in (* keep track of tail *)
-    h.C.buckets <-h_buckets;          (* so that indexfun sees the new bucket count *)
-    for i = 0 to osize - 1 do
-      copyBucket  ~h_buckets ~ndata_tail (A.getUnsafe odata i)
-    done;
-    for i = 0 to nsize - 1 do
-      match C.toOpt (A.getUnsafe ndata_tail i) with
-      | None -> ()
-      | Some tail -> tail.N.next <- C.emptyOpt
-    done
-  end
-
-
-
-let rec removeBucket  h h_buckets  i (key : key) prec cell =
-  let cell_next = cell.N.next in 
-  if  cell.N.key = key 
-  then 
-    begin
-      prec.N.next <- cell_next;
-      h.C.size <- (h.C.size - 1);        
-    end
-  else 
-    match C.toOpt cell_next with 
-    | None -> 
-      ()
-    | Some cell_next ->
-      removeBucket h h_buckets i key cell cell_next
-
-let remove h (key : key)=  
-  let h_buckets = h.C.buckets  in 
-  let i = hash key  land (A.length h_buckets - 1) in  
-  let l = A.getUnsafe h_buckets i in 
-  match C.toOpt l with 
-  | None -> ()
-  | Some cell -> 
-    let next_cell = cell.N.next in 
-    if  cell.N.key = key then 
-      begin 
-        h.C.size <- (h.C.size- 1) ;
-        A.setUnsafe h_buckets i next_cell
-      end
-    else       
-      match C.toOpt next_cell with 
-      | None -> ()
-      | Some next_cell -> 
-        removeBucket h h_buckets i key cell next_cell
-
-
-let rec addBucket  h (key : key)  cell = 
-  if cell.N.key <> key then
-    let  n = cell.N.next in 
-    match C.toOpt n with 
-    | None ->  
-      h.C.size <- (h.C.size+ 1);
-      cell.N.next <- (C.return {N.key;  next = C.emptyOpt});
-    | Some n -> addBucket h  key  n
-
-let add h (key : key)  =
-  let h_buckets = h.C.buckets  in 
-  let buckets_len = A.length h_buckets in 
-  let i = hash key land (buckets_len - 1) in 
-  let l = A.getUnsafe h_buckets i in  
-  (match C.toOpt l with                                    
-  | None -> 
-    A.setUnsafe h_buckets i 
-      (C.return {N.key ; next = C.emptyOpt});
-    h.C.size <- (h.C.size + 1);  
-  | Some cell -> 
-    addBucket  h key cell);
-  if h.C.size> buckets_len lsl 1 then tryDoubleResize  h
-
-let rec memInBucket (key : key) cell = 
-  cell.N.key = key  || 
-  (match C.toOpt cell.N.next with 
-   | None -> false 
-   | Some nextCell -> 
-     memInBucket key nextCell)
-
-let has h key =
-  let h_buckets = h.C.buckets  in 
-  let nid = hash key  land (A.length h_buckets - 1) in 
-  let bucket = A.getUnsafe h_buckets nid in 
-  match C.toOpt bucket with 
-  | None -> false 
-  | Some bucket -> 
-    memInBucket key bucket
-
-
-let make ~hintSize = C.make ~hintSize ~hash:() ~eq:()
-
-let clear = C.clear
-let size h = h.C.size
-let forEachU = N.forEachU
-let forEach = N.forEach 
-let reduceU = N.reduceU
-let reduce = N.reduce
-let logStats = N.logStats
-let toArray = N.toArray
-let copy = N.copy
-let getBucketHistogram = N.getBucketHistogram 
-let isEmpty = C.isEmpty
-
-let fromArray arr = 
-  let len = A.length arr in 
-  let v = C.make ~hintSize:len ~hash:() ~eq:() in 
-  for i = 0 to len - 1 do 
-    add v (A.getUnsafe arr i)
-  done ;
-  v
-
-(* TOOD: optimize heuristics for resizing *)  
-let mergeMany h arr =   
-  let len = A.length arr in 
-  for i = 0 to len - 1 do 
-    add h (A.getUnsafe arr i)
-  done
-

package/lib/ocaml/hashset.cppo.mli

@@ -1,77 +0,0 @@
-
-(* Copyright (C) 2017 Authors of ReScript
- *
- * This program is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * In addition to the permissions granted to you by the LGPL, you may combine
- * or link a "work that uses the Library" with a publicly distributed version
- * of this file to produce a combined library or application, then distribute
- * that combined work under the terms of your choosing, with no requirement
- * to comply with the obligations normally placed on you by section 4 of the
- * LGPL version 3 (or the corresponding section of a later version of the LGPL
- * should you choose to use a later version).
- *
- * This program is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with this program; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *)
-
-(**
-  This module is [`Belt.HashSet`]() specialized with key type to be a primitive type.
-
-  It is more efficient in general, the  API is the same with [`Belt.HashSet`]() except its key type is fixed,
-  and identity is not needed(using the built-in one)
-
-  **See** [`Belt.HashSet`]()
-*)
-
-
-#ifdef TYPE_STRING
-type key = string
-#elif defined TYPE_INT
-type key = int
-#else
-[%error "unknown type"]
-#endif
-
-
-type t
-
-val make: hintSize:int -> t
-
-val clear: t -> unit
-
-val isEmpty: t -> bool
-
-val add:  t -> key -> unit
-
-val copy: t -> t
-
-val has: t -> key -> bool
-
-val remove: t -> key -> unit
-
-val forEachU: t -> (key  -> unit [@bs]) ->  unit
-val forEach: t -> (key  -> unit) ->  unit
-
-val reduceU: t -> 'c -> ( 'c -> key -> 'c [@bs]) ->   'c
-val reduce: t -> 'c -> ( 'c -> key -> 'c) ->   'c
-
-val size: t -> int
-
-val logStats: t -> unit
-
-val toArray: t -> key array
-
-val fromArray: key array -> t
-
-val mergeMany: t -> key array -> unit
-
-val getBucketHistogram: t -> int array