@tellahq/rescript 10.1.0-alpha.1

package/lib/ocaml/internal_set.cppo.ml

@@ -0,0 +1,134 @@
+#ifdef TYPE_STRING
+type value = string
+module S = Belt_SortArrayString
+#elif defined TYPE_INT  
+type value = int
+module S = Belt_SortArrayInt
+#else
+  [%error "unknown type"]  
+#endif
+
+
+module N = Belt_internalAVLset
+module A = Belt_Array 
+
+
+type t = value N.t
+
+let rec has (t : t) (x : value)  =
+  match t with 
+  | None -> false
+  | Some n  ->                
+    let v = n.value in 
+    x = v || has (if x < v then n.left else n.right) x
+
+
+let rec compareAux e1 e2  =
+    match e1,e2 with 
+    | h1::t1, h2::t2 ->
+        let (k1 : value) ,k2 = h1.N.value , h2.N.value  in 
+        if k1 = k2 then  
+          compareAux 
+            (N.stackAllLeft h1.right t1 ) 
+            (N.stackAllLeft h2.right t2)
+        else if k1  < k2 then -1    
+        else 1
+    | _, _ -> 0   
+
+
+let cmp s1 s2 =
+  let len1, len2 = N.size s1, N.size s2 in   
+  if len1 = len2 then 
+    compareAux (N.stackAllLeft s1 []) (N.stackAllLeft s2 [])
+  else if len1 < len2 then -1 else 1 
+
+let eq (s1 : t) s2 = 
+  cmp s1 s2 = 0
+
+
+
+
+
+(* This algorithm applies to BST, it does not need to be balanced tree *)  
+let rec subset (s1 : t) (s2 : t) =
+  match s1, s2 with
+    None, _ ->
+    true
+  | _, None ->
+    false
+  | Some t1, Some t2 (* Node (l1, v1, r1, _), (Node (l2, v2, r2, _) as t2) *) ->
+    let {N.left = l1; value = v1; right = r1 } = t1 in  
+    let {N.left = l2; value = v2; right = r2 } = t2 in 
+    if v1 = v2 then
+      subset l1 l2 && subset r1 r2
+    else if v1 < v2 then
+      subset (N.create l1 v1 None) l2 && subset r1 s2
+    else
+      subset (N.create None v1 r1 ) r2 && subset l1 s2
+
+
+let rec get (n :t) (x : value) = 
+  match n with 
+  | None -> None
+  | Some t  ->    
+    let v = t.value in     
+    if x = v then Some v
+    else get (if x < v then t.left else t.right) x
+
+
+
+let rec getUndefined (n :t) (x : value)   = 
+  match n with 
+  | None -> Js.undefined
+  | Some t  ->    
+    let v = t.value in     
+    if x = v then Js.Undefined.return v
+    else getUndefined  (if x < v then t.left else t.right) x
+
+let rec getExn  (n :t) (x : value) = 
+  match n with 
+  | None -> raise Not_found
+  | Some t  ->    
+    let v = t.value in     
+    if x = v then  v
+    else getExn (if x < v then t.left else t.right) x
+
+(****************************************************************************)
+let rec addMutate  t  (x : value)=   
+  match t with 
+  | None -> N.singleton x
+  | Some nt -> 
+    let k = nt.N.value in 
+    if x = k then t 
+    else
+      let {N.left = l;  right = r} = nt in 
+      (if x < k then                   
+         nt.left <- addMutate l x       
+       else   
+         nt.right <- addMutate r x;
+      );
+      Some (N.balMutate nt)
+
+
+
+let fromArray (xs : value array) =   
+  let len = A.length xs in 
+  if len = 0 then None
+  else
+    let next =  ref (S.strictlySortedLength xs ) in 
+    let result  = 
+        ref (
+          if next.contents >= 0 then 
+            N.fromSortedArrayAux xs 0 next.contents
+          else begin 
+            next .contents<- - next.contents ;  
+            N.fromSortedArrayRevAux xs (next.contents - 1) next.contents
+          end
+          ) in 
+    for i = next.contents to len - 1 do 
+      result .contents<- addMutate result.contents (A.getUnsafe xs i) 
+    done ;
+    result.contents 
+
+
+

package/lib/ocaml/js.ml

@@ -0,0 +1,313 @@
+(* Copyright (C) 2015-2016 Bloomberg Finance L.P.
+ *
+ * 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. *)
+
+[@@@bs.config { flags = [| "-unboxed-types"; "-w"; "-49" |] }]
+(* DESIGN:
+   - It does not have any code, all its code will be inlined so that
+       there will never be
+   {[ require('js')]}
+   - Its interface should be minimal
+*)
+
+(**
+  The Js module mostly contains ReScript bindings to _standard JavaScript APIs_
+  like [console.log](https://developer.mozilla.org/en-US/docs/Web/API/Console/log),
+  or the JavaScript
+  [String](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String),
+  [Date](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Date), and
+  [Promise](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Promise)
+  classes.
+
+  It is meant as a zero-abstraction interop layer and directly exposes JavaScript functions as they are. If you can find your API in this module, prefer this over an equivalent Belt helper. For example, prefer [Js.Array2](js/array-2) over [Belt.Array](belt/array)
+
+  ## Argument Order
+
+  For historical reasons, some APIs in the Js namespace (e.g. [Js.String](js/string)) are
+  using the data-last argument order whereas others (e.g. [Js.Date](js/date)) are using data-first.
+
+  For more information about these argument orders and the trade-offs between them, see
+  [this blog post](https://www.javierchavarri.com/data-first-and-data-last-a-comparison/).
+
+  _Eventually, all modules in the Js namespace are going to be migrated to data-first though._
+
+  In the meantime, there are several options for dealing with the data-last APIs:
+
+  ```res example
+  /* Js.String (data-last API used with pipe last operator) */
+  Js.log("2019-11-10" |> Js.String.split("-"))
+  Js.log("ReScript" |> Js.String.startsWith("Re"))
+
+  /* Js.String (data-last API used with pipe first operator) */
+  Js.log("2019-11-10"->Js.String.split("-", _))
+  Js.log("ReScript"->Js.String.startsWith("Re", _))
+
+  /* Js.String (data-last API used without any piping) */
+  Js.log(Js.String.split("-", "2019-11-10"))
+  Js.log(Js.String.startsWith("Re", "ReScript"))
+  ```
+  ## Js.Xxx2 Modules
+
+  Prefer `Js.Array2` over `Js.Array`, `Js.String2` over `Js.String`, etc. The latters are old modules.
+*)
+
+type 'a t = < .. > as 'a
+(** JS object type *)
+
+(**/**)
+
+(* internal types for FFI, these types are not used by normal users
+    Absent cmi file when looking up module alias.
+*)
+
+module Fn = struct
+  type 'a arity0 = { i0 : unit -> 'a [@internal] }
+  type 'a arity1 = { i1 : 'a [@internal] }
+  type 'a arity2 = { i2 : 'a [@internal] }
+  type 'a arity3 = { i3 : 'a [@internal] }
+  type 'a arity4 = { i4 : 'a [@internal] }
+  type 'a arity5 = { i5 : 'a [@internal] }
+  type 'a arity6 = { i6 : 'a [@internal] }
+  type 'a arity7 = { i7 : 'a [@internal] }
+  type 'a arity8 = { i8 : 'a [@internal] }
+  type 'a arity9 = { i9 : 'a [@internal] }
+  type 'a arity10 = { i10 : 'a [@internal] }
+  type 'a arity11 = { i11 : 'a [@internal] }
+  type 'a arity12 = { i12 : 'a [@internal] }
+  type 'a arity13 = { i13 : 'a [@internal] }
+  type 'a arity14 = { i14 : 'a [@internal] }
+  type 'a arity15 = { i15 : 'a [@internal] }
+  type 'a arity16 = { i16 : 'a [@internal] }
+  type 'a arity17 = { i17 : 'a [@internal] }
+  type 'a arity18 = { i18 : 'a [@internal] }
+  type 'a arity19 = { i19 : 'a [@internal] }
+  type 'a arity20 = { i20 : 'a [@internal] }
+  type 'a arity21 = { i21 : 'a [@internal] }
+  type 'a arity22 = { i22 : 'a [@internal] }
+end
+
+(**/**)
+
+module MapperRt = Js_mapperRt
+
+module Internal = struct
+  open Fn
+
+  external opaqueFullApply : 'a -> 'a = "%uncurried_apply"
+
+  (* Use opaque instead of [._n] to prevent some optimizations happening *)
+  external run : 'a arity0 -> 'a = "#run"
+  external opaque : 'a -> 'a = "%opaque"
+end
+
+(**/**)
+
+type +'a null
+(**
+  Nullable value of this type can be either null or 'a. This type is equivalent to Js.Null.t.
+*)
+
+type +'a undefined
+(**
+  A value of this type can be either undefined or 'a. This type is equivalent to Js.Undefined.t.
+*)
+
+type +'a nullable
+(**
+  A value of this type can be undefined, null or 'a. This type is equivalent to Js.Null_undefined.t.
+*)
+
+type +'a null_undefined = 'a nullable
+
+external toOption : 'a nullable -> 'a option = "#nullable_to_opt"
+external undefinedToOption : 'a undefined -> 'a option = "#undefined_to_opt"
+external nullToOption : 'a null -> 'a option = "#null_to_opt"
+external isNullable : 'a nullable -> bool = "#is_nullable"
+
+external testAny : 'a -> bool = "#is_nullable"
+(** The same as {!test} except that it is more permissive on the types of input *)
+
+type (+'a, +'e) promise
+(**
+  The promise type, defined here for interoperation across packages.
+  @deprecated please use `Js.Promise`.
+*)
+
+external null : 'a null = "#null"
+(**
+  The same as empty in `Js.Null`. Compiles to `null`.
+*)
+
+external undefined : 'a undefined = "#undefined"
+(**
+  The same as empty `Js.Undefined`. Compiles to `undefined`.
+*)
+
+external typeof : 'a -> string = "#typeof"
+(**
+`typeof x` will be compiled as `typeof x` in JS. Please consider functions in
+`Js.Types` for a type safe way of reflection.
+*)
+
+external log : 'a -> unit = "log"
+  [@@val] [@@scope "console"]
+(** Equivalent to console.log any value. *)
+
+external log2 : 'a -> 'b -> unit = "log" [@@bs.val] [@@bs.scope "console"]
+external log3 : 'a -> 'b -> 'c -> unit = "log" [@@bs.val] [@@bs.scope "console"]
+
+external log4 : 'a -> 'b -> 'c -> 'd -> unit = "log"
+  [@@bs.val] [@@bs.scope "console"]
+
+external logMany : 'a array -> unit = "log"
+  [@@bs.val] [@@bs.scope "console"] [@@bs.splice]
+(** A convenience function to console.log more than 4 arguments *)
+
+external eqNull : 'a -> 'a null -> bool = "%bs_equal_null"
+external eqUndefined : 'a -> 'a undefined -> bool = "%bs_equal_undefined"
+external eqNullable : 'a -> 'a nullable -> bool = "%bs_equal_nullable"
+
+(** ## Operators *)
+
+external unsafe_lt : 'a -> 'a -> bool = "#unsafe_lt"
+(**
+   `unsafe_lt(a, b)` will be compiled as `a < b`.
+    It is marked as unsafe, since it is impossible
+    to give a proper semantics for comparision which applies to any type
+*)
+
+external unsafe_le : 'a -> 'a -> bool = "#unsafe_le"
+(**
+   `unsafe_le(a, b) will be compiled as `a <= b`.
+   See also `Js.unsafe_lt`.
+*)
+
+external unsafe_gt : 'a -> 'a -> bool = "#unsafe_gt"
+(**
+   `unsafe_gt(a, b)` will be compiled as `a > b`.
+    See also `Js.unsafe_lt`.
+*)
+
+external unsafe_ge : 'a -> 'a -> bool = "#unsafe_ge"
+(**
+   `unsafe_ge(a, b)` will be compiled as `a >= b`.
+   See also `Js.unsafe_lt`.
+*)
+
+(** ## Nested Modules *)
+
+module Null = Js_null
+(** Provide utilities for `Js.null<'a>` *)
+
+module Undefined = Js_undefined
+(** Provide utilities for `Js.undefined<'a>` *)
+
+module Nullable = Js_null_undefined
+(** Provide utilities for `Js.null_undefined` *)
+
+module Null_undefined = Js_null_undefined
+(** @deprecated please use `Js.Nullable` *)
+
+module Exn = Js_exn
+(** Provide utilities for dealing with Js exceptions *)
+
+module Array = Js_array
+(** Provide bindings to JS array*)
+
+module Array2 = Js_array2
+(** Provide bindings to JS array*)
+
+module String = Js_string
+(** Provide bindings to JS string *)
+
+module String2 = Js_string2
+(** Provide bindings to JS string *)
+
+module Re = Js_re
+(** Provide bindings to JS regex expression *)
+
+module Promise = Js_promise
+(** Provide bindings to JS Promise *)
+
+module Date = Js_date
+(** Provide bindings for JS Date *)
+
+module Dict = Js_dict
+(** Provide utilities for JS dictionary object *)
+
+module Global = Js_global
+(** Provide bindings to JS global functions in global namespace*)
+
+module Json = Js_json
+(** Provide utilities for json *)
+
+module Math = Js_math
+(** Provide bindings for JS `Math` object *)
+
+module Obj = Js_obj
+(** Provide utilities for `Js.t` *)
+
+module Typed_array = Js_typed_array
+(** Provide bindings for JS typed array *)
+
+module TypedArray2 = Js_typed_array2
+(** Provide bindings for JS typed array *)
+
+module Types = Js_types
+(** Provide utilities for manipulating JS types  *)
+
+module Float = Js_float
+(** Provide utilities for JS float *)
+
+module Int = Js_int
+(** Provide utilities for int *)
+
+module Bigint = Js_bigint
+(** Provide utilities for bigint *)
+
+module Option = Js_option
+(** Provide utilities for option *)
+
+module Result = Js_result
+(** Define the interface for result *)
+
+module List = Js_list
+(** Provide utilities for list *)
+
+module Vector = Js_vector
+(** Provides bindings for JS Vector *)
+
+module Console = Js_console
+(** Provides bindings for console *)
+
+module Set = Js_set
+(** Provides bindings for ES6 Set *)
+
+module WeakSet = Js_weakset
+(** Provides bindings for ES6 WeakSet *)
+
+module Map = Js_map
+(** Provides bindings for ES6 Map *)
+
+module WeakMap = Js_weakmap
+(** Provides bindings for ES6 WeakMap *)

package/lib/ocaml/js_OO.ml

@@ -0,0 +1,180 @@
+(* Copyright (C) 2020- 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. *)
+
+[@@@bs.config {flags = [|"-unboxed-types"|]}]
+(**/**)
+external unsafe_to_method : 'a -> 'a =  "#fn_method"
+(**/**)
+module Callback = struct
+  type 'a arity1 = {
+    i1 : 'a [@internal]
+  }
+  type 'a arity2 = {
+    i2 : 'a [@internal]
+  }
+  type 'a arity3 = {
+    i3 : 'a [@internal]
+  }
+  type 'a arity4 = {
+    i4 : 'a [@internal]
+  }
+  type 'a arity5 = {
+    i5 : 'a [@internal]
+  }
+  type 'a arity6 = {
+    i6 : 'a [@internal]
+  }
+  type 'a arity7 = {
+    i7 : 'a [@internal]
+  }
+  type 'a arity8 = {
+    i8 : 'a [@internal]
+  }
+  type 'a arity9 = {
+    i9 : 'a [@internal]
+  }
+  type 'a arity10 = {
+    i10 : 'a [@internal]
+  }
+  type 'a arity11 = {
+    i11 : 'a [@internal]
+  }
+  type 'a arity12 = {
+    i12 : 'a [@internal]
+  }
+  type 'a arity13 = {
+    i13 : 'a [@internal]
+  }
+  type 'a arity14 = {
+    i14 : 'a [@internal]
+  }
+  type 'a arity15 = {
+    i15 : 'a [@internal]
+  }
+  type 'a arity16 = {
+    i16 : 'a [@internal]
+  }
+  type 'a arity17 = {
+    i17 : 'a [@internal]
+  }
+  type 'a arity18 = {
+    i18 : 'a [@internal]
+  }
+  type 'a arity19 = {
+    i19 : 'a [@internal]
+  }
+  type 'a arity20 = {
+    i20 : 'a [@internal]
+  }
+  type 'a arity21 = {
+    i21 : 'a [@internal]
+  }
+  type 'a arity22 = {
+    i22 : 'a [@internal]
+  }  
+end  
+module Meth = struct
+  type + 'a arity0 
+  type 'a arity1 = {
+    i1 : 'a [@internal]
+  }
+  type 'a arity2 = {
+    i2 : 'a [@internal]
+  }
+  type 'a arity3 = {
+    i3 : 'a [@internal]
+  }
+  type 'a arity4 = {
+    i4 : 'a [@internal]
+  }
+  type 'a arity5 = {
+    i5 : 'a [@internal]
+  }
+  type 'a arity6 = {
+    i6 : 'a [@internal]
+  }
+  type 'a arity7 = {
+    i7 : 'a [@internal]
+  }
+  type 'a arity8 = {
+    i8 : 'a [@internal]
+  }
+  type 'a arity9 = {
+    i9 : 'a [@internal]
+  }
+  type 'a arity10 = {
+    i10 : 'a [@internal]
+  }
+  type 'a arity11 = {
+    i11 : 'a [@internal]
+  }
+  type 'a arity12 = {
+    i12 : 'a [@internal]
+  }
+  type 'a arity13 = {
+    i13 : 'a [@internal]
+  }
+  type 'a arity14 = {
+    i14 : 'a [@internal]
+  }
+  type 'a arity15 = {
+    i15 : 'a [@internal]
+  }
+  type 'a arity16 = {
+    i16 : 'a [@internal]
+  }
+  type 'a arity17 = {
+    i17 : 'a [@internal]
+  }
+  type 'a arity18 = {
+    i18 : 'a [@internal]
+  }
+  type 'a arity19 = {
+    i19 : 'a [@internal]
+  }
+  type 'a arity20 = {
+    i20 : 'a [@internal]
+  }
+  type 'a arity21 = {
+    i21 : 'a [@internal]
+  }
+  type 'a arity22 = {
+    i22 : 'a [@internal]
+  }
+end
+
+(**/**)
+module Internal = struct
+  open Meth
+  (* Use opaque instead of `._n` to prevent some optimizations happening *)
+
+  external run : 'a arity0 -> 'a = "#run" "0"
+  (* FIXME: remove the need for native string
+    x##meth a b --> 
+    fullApppy (
+        (id (unsafe_downgrade x)#meth).I_2) 
+        a b)
+  *)  
+end  
+(**/**)