@tellahq/rescript 10.1.0-alpha.1

package/lib/ocaml/belt_Float.ml

@@ -0,0 +1,50 @@
+(* Copyright (C) 2017 Hongbo Zhang, 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. *)
+
+(** [`Belt.Float`]()
+    Utililites for Float
+*)
+
+external isNaN : float -> bool = "isNaN" [@@bs.val]
+
+external toInt: float -> int = "%intoffloat"
+
+external fromInt: int -> float = "%identity"
+
+external fromString: string -> float = "parseFloat" [@@bs.val]
+
+let fromString i =
+  match (fromString i) with
+  | i when isNaN i -> None
+  | i -> Some i
+
+external toString: float -> string = "String" [@@bs.val]
+
+external ( + ) : float -> float -> float = "%addfloat"
+
+external ( - ) : float -> float -> float = "%subfloat"
+
+external ( * ) : float -> float -> float = "%mulfloat"
+
+external ( / ) : float -> float -> float = "%divfloat"

package/lib/ocaml/belt_Float.mli

@@ -0,0 +1,106 @@
+(* 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 includes convenience methods for handling `float` types. *)
+
+external toInt: float -> int = "%intoffloat"
+(**
+Converts a given `float` to an `int`.
+
+```res example
+Js.log(Belt.Float.toInt(1.0) === 1) /* true */
+```
+*)
+
+external fromInt: int -> float = "%identity"
+(** 
+  Converts a given `int` to a `float`.
+
+  ```res example
+  Js.log(Belt.Float.fromInt(1) === 1.0) /* true */
+  ```
+*)
+
+val fromString: string -> float option
+(** 
+  Converts a given `string` to a `float`. Returns `Some(float)` when the input is a number, `None` otherwise.
+
+  ```res example
+  Js.log(Belt.Float.fromString("1.0") === Some(1.0)) /* true */
+  ```
+*)
+
+
+external toString: float -> string = "String" [@@bs.val]
+(**
+  Converts a given `float` to a `string`. Uses the JavaScript `String` constructor under the hood.
+
+  ```res example
+  Js.log(Belt.Float.toString(1.0) === "1.0") /* true */
+  ```
+*)
+
+external ( + ) : float -> float -> float = "%addfloat"
+(**
+  Addition of two `float` values.
+  Can be opened in a module to avoid dot-notation (`+.`), however this yields a shadow warning (Warning number 44) in the default configuration.
+
+  ```res example
+  open Belt.Float
+  Js.log(2.0 + 2.0 === 4.0) /* true */
+  ```
+*)
+
+external ( - ) : float -> float -> float = "%subfloat"
+(**
+  Subtraction of two `float` values.
+  Can be opened in a module to avoid dot-notation (`-.`), however this yields a shadow warning (Warning number 44) in the default configuration.
+
+  ```res example
+  open Belt.Float
+  Js.log(2.0 - 1.0 === 1.0) /* true */
+  ```
+*)
+
+external ( * ) : float -> float -> float = "%mulfloat"
+(**
+  Multiplication of two `float` values.
+  Can be opened in a module to avoid dot-notation (`*.`), however this yields a shadow warning (Warning number 44) in the default configuration.
+
+  ```res example
+  open Belt.Float
+  Js.log(2.0 * 2.0 === 4.0) /* true */
+  ```
+*)
+
+external ( / ) : float -> float -> float = "%divfloat"
+(** 
+  Division of two `float` values.
+  Can be opened in a module to avoid dot-notation (`/.`), however this yields a shadow warning (Warning number 44) in the default configuration.
+
+  ```res example
+  open Belt.Float
+  Js.log(4.0 / 2.0 === 2.0) /* true */
+  ```
+*)

package/lib/ocaml/belt_HashMap.ml

@@ -0,0 +1,226 @@
+(***********************************************************************)
+(*                                                                     *)
+(*                                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 Library General Public License, with    *)
+(*  the special exception on linking described in file ../LICENSE.     *)
+(*                                                                     *)
+(*  Adapted by Hongbo Zhang, Authors of ReScript 2017                            *)
+(***********************************************************************)
+
+
+module N = Belt_internalBuckets 
+module C = Belt_internalBucketsType
+module A = Belt_Array
+
+
+type ('a, 'id) eq = ('a, 'id) Belt_Id.eq
+type ('a, 'id) hash = ('a, 'id) Belt_Id.hash
+type ('a, 'id) id = ('a, 'id) Belt_Id.hashable
+type ('a,'b,'id) t =
+  ( ('a, 'id) hash, ('a, 'id) eq, 'a, 'b) N.t
+
+
+let clear = C.clear
+let size h = h.C.size
+let forEach = N.forEach
+let forEachU = N.forEachU 
+let reduce = N.reduce 
+let reduceU = N.reduceU
+let logStats = N.logStats
+let keepMapInPlaceU  = N.keepMapInPlaceU 
+let keepMapInPlace  = N.keepMapInPlace
+let toArray = N.toArray
+let copy  = N.copy
+let keysToArray = N.keysToArray
+let valuesToArray = N.valuesToArray 
+let getBucketHistogram  = N.getBucketHistogram 
+let isEmpty = C.isEmpty
+
+
+let rec copyBucketReHash ~hash ~h_buckets ~ndata_tail old_bucket = 
+  match C.toOpt old_bucket with 
+  | None -> ()
+  | Some cell ->
+    let nidx = hash cell.N.key [@bs] 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;
+    copyBucketReHash ~hash ~h_buckets ~ndata_tail  cell.N.next
+
+
+let resize ~hash 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
+      copyBucketReHash ~hash ~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 replaceInBucket ~eq  key info cell = 
+  if eq cell.N.key key [@bs]
+  then
+    begin
+      cell.N.value <- info;
+      false
+    end
+  else
+    match C.toOpt cell.N.next with 
+    | None -> true 
+    | Some cell -> 
+      replaceInBucket ~eq key info cell
+
+let set0 h key value ~eq ~hash = 
+  let h_buckets = h.C.buckets  in 
+  let buckets_len = A.length h_buckets in 
+  let i = hash key [@bs] 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; value; next = C.emptyOpt});
+    h.C.size <- (h.C.size + 1);
+  | Some bucket -> 
+      if replaceInBucket ~eq key value bucket then begin
+        A.setUnsafe h_buckets i (C.return {N.key; value; next = l});
+        h.C.size <- (h.C.size + 1);
+      end 
+    );
+    if h.C.size  > buckets_len lsl 1 then resize ~hash h
+      
+(* if `key` already exists, replace it, otherwise add it 
+   Here we add it to the head, it could be tail
+*)      
+let set  h key value =
+  set0 h key value
+   ~eq:(Belt_Id.getEqInternal h.C.eq)
+   ~hash:(Belt_Id.getHashInternal h.C.hash)
+
+let rec removeInBucket  h h_buckets  i key prec bucket ~eq =
+  match C.toOpt bucket with
+  | None -> ()
+  | Some cell ->
+    let cell_next = cell.N.next in 
+    if eq cell.N.key key [@bs]
+    then 
+      begin        
+        prec.N.next <- cell_next ; 
+        h.C.size <- (h.C.size  - 1);        
+      end
+    else removeInBucket ~eq h h_buckets i key cell cell_next
+
+
+let remove h key = 
+  let h_buckets = h.C.buckets  in 
+  let i = (Belt_Id.getHashInternal h.C.hash) key [@bs] land (A.length h_buckets - 1) in  
+  let bucket = A.getUnsafe h_buckets i in 
+  match C.toOpt bucket with 
+  | None -> ()
+  | Some cell -> 
+    let eq = (Belt_Id.getEqInternal h.C.eq) in 
+    if eq cell.N.key key [@bs] then 
+    begin 
+      A.setUnsafe h_buckets i cell.N.next;
+      h.C.size <- (h.C.size  - 1)
+    end 
+    else  
+      removeInBucket ~eq h h_buckets i key  cell cell.N.next
+
+
+let rec getAux ~eq key buckets = 
+  match C.toOpt buckets with 
+  | None ->
+    None
+  | Some cell ->
+    if eq key cell.N.key [@bs] then Some cell.N.value
+    else getAux ~eq key  cell.N.next
+
+let get h key =
+  let h_buckets = h.C.buckets  in 
+  let nid = (Belt_Id.getHashInternal h.C.hash) key [@bs] land (A.length h_buckets - 1) in 
+  match C.toOpt (A.getUnsafe h_buckets nid) with
+  | None -> None
+  | Some (cell1 : _ N.bucket) ->
+    let eq = Belt_Id.getEqInternal h.C.eq in
+    if eq key cell1.key [@bs] then 
+      Some  cell1.value
+    else
+      match C.toOpt cell1.N.next with
+      | None -> None
+      | Some cell2 ->
+        if eq key cell2.key [@bs] then 
+          Some cell2.value else
+          match C.toOpt cell2.next with
+          | None -> None
+          | Some cell3 ->
+            if eq key cell3.key [@bs] then 
+              Some cell3.value
+            else 
+              getAux ~eq key cell3.next
+
+
+let rec memInBucket key cell ~eq = 
+  eq cell.N.key key [@bs] || 
+  (match C.toOpt cell.N.next with 
+   | None -> false 
+   | Some nextCell -> 
+     memInBucket ~eq key nextCell)
+
+let has h key =
+  let h_buckets = h.C.buckets  in 
+  let nid = (Belt_Id.getHashInternal h.C.hash) key [@bs] 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 ~eq:(Belt_Id.getEqInternal h.C.eq) key bucket
+
+
+
+
+let make (type key identity) ~hintSize ~(id : (key,identity) id) =
+  let module M = (val id) in 
+  C.make ~hash:M.hash ~eq:M.eq  ~hintSize
+
+  
+let fromArray (type a  identity) arr ~id:(id:(a,identity) id) =     
+  let module M = (val id) in
+  let hash, eq = M.hash, M.eq in  
+  let len = A.length arr in 
+  let v = C.make ~hash ~eq ~hintSize:len in 
+  let eq, hash = Belt_Id.getEqInternal eq, Belt_Id.getHashInternal hash in   
+  for i = 0 to len - 1 do 
+    let key,value = (A.getUnsafe arr i) in 
+    set0 ~eq ~hash v key value
+  done ;
+  v
+
+let mergeMany h arr = 
+  let hash, eq = Belt_Id.getHashInternal h.C.hash , Belt_Id.getEqInternal h.C.eq in 
+  let len = A.length arr in 
+  for i = 0 to len - 1 do 
+    let key,value = (A.getUnsafe arr i) in 
+    set0 h  ~eq ~hash key value
+  done
+    
+
+module Int = Belt_HashMapInt
+module String = Belt_HashMapString