Merge pull request #4467 from BuckleScript/update

bump to 8.0.1

Author: bobzhang

jscomp/artifacts.json

@@ -46,7 +46,6 @@
   "lib": [
     "bstracing",
     "minisocket.js",
-    "jsconfig.json",
     "build.ninja",
     "prebuilt.ninja"
   ],
@@ -228,9 +227,7 @@
     "string.js",
     "stringLabels.js",
     "sys.js",
-    "uchar.js",
-    "unix.js",
-    "unixLabels.js"
+    "uchar.js"
   ],
   "lib/js": [
     "arg.js",
@@ -400,8 +397,7 @@
     "string.js",
     "stringLabels.js",
     "sys.js",
-    "uchar.js",
-    "unix.js",
+    "uchar.js"
   ],
   "lib/ocaml": [
     "arg.cmi",
@@ -441,7 +437,6 @@
     "belt_SortArrayInt.cmi",
     "belt_SortArrayString.cmi",
     "belt.cmi",
-    "bigarray.cmi",
     "buffer.cmi",
     "bytes.cmi",
     "bytesLabels.cmi",
@@ -458,7 +453,6 @@
     "dom_storage.cmi",
     "dom_storage2.cmi",
     "dom.cmi",
-    "ephemeron.cmi",
     "filename.cmi",
     "format.cmi",
     "gc.cmi",
@@ -512,7 +506,6 @@
     "node_process.cmi",
     "node.cmi",
     "obj.cmi",
-    "oo.cmi",
     "parsing.cmi",
     "pervasives.cmi",
     "printexc.cmi",
@@ -531,9 +524,6 @@
     "stringLabels.cmi",
     "sys.cmi",
     "uchar.cmi",
-    "unix.cmi",
-    "unixLabels.cmi",
-    "weak.cmi",
     "arg.cmt",
     "array.cmt",
     "arrayLabels.cmt",
@@ -580,7 +570,6 @@
     "belt_SortArrayInt.cmt",
     "belt_SortArrayString.cmt",
     "belt.cmt",
-    "bigarray.cmt",
     "buffer.cmt",
     "bytes.cmt",
     "bytesLabels.cmt",
@@ -597,7 +586,6 @@
     "dom_storage.cmt",
     "dom_storage2.cmt",
     "dom.cmt",
-    "ephemeron.cmt",
     "filename.cmt",
     "format.cmt",
     "gc.cmt",
@@ -651,7 +639,6 @@
     "node_process.cmt",
     "node.cmt",
     "obj.cmt",
-    "oo.cmt",
     "parsing.cmt",
     "pervasives.cmt",
     "printexc.cmt",
@@ -670,9 +657,6 @@
     "stringLabels.cmt",
     "sys.cmt",
     "uchar.cmt",
-    "unix.cmt",
-    "unixLabels.cmt",
-    "weak.cmt",
     "arg.cmti",
     "array.cmti",
     "arrayLabels.cmti",
@@ -714,7 +698,6 @@
     "belt_SortArray.cmti",
     "belt_SortArrayInt.cmti",
     "belt_SortArrayString.cmti",
-    "bigarray.cmti",
     "buffer.cmti",
     "bytes.cmti",
     "bytesLabels.cmti",
@@ -727,7 +710,6 @@
     "char.cmti",
     "complex.cmti",
     "digest.cmti",
-    "ephemeron.cmti",
     "filename.cmti",
     "format.cmti",
     "gc.cmti",
@@ -758,7 +740,6 @@
     "nativeint.cmti",
     "node_process.cmti",
     "obj.cmti",
-    "oo.cmti",
     "parsing.cmti",
     "pervasives.cmti",
     "printexc.cmti",
@@ -776,9 +757,6 @@
     "stringLabels.cmti",
     "sys.cmti",
     "uchar.cmti",
-    "unix.cmti",
-    "unixLabels.cmti",
-    "weak.cmti",
     "arg.ml",
     "array.ml",
     "arrayLabels.ml",
@@ -826,7 +804,6 @@
     "belt_SortArrayInt.ml",
     "belt_SortArrayString.ml",
     "belt.ml",
-    "bigarray.ml",
     "buffer.ml",
     "bytes.ml",
     "bytesLabels.ml",
@@ -843,7 +820,6 @@
     "dom_storage.ml",
     "dom_storage2.ml",
     "dom.ml",
-    "ephemeron.ml",
     "filename.ml",
     "format.ml",
     "gc.ml",
@@ -905,7 +881,6 @@
     "node_process.ml",
     "node.ml",
     "obj.ml",
-    "oo.ml",
     "parsing.ml",
     "pervasives.ml",
     "printexc.ml",
@@ -926,9 +901,6 @@
     "stringLabels.ml",
     "sys.ml",
     "uchar.ml",
-    "unix.ml",
-    "unixLabels.ml",
-    "weak.ml",
     "arg.mli",
     "array.mli",
     "arrayLabels.mli",
@@ -971,7 +943,6 @@
     "belt_SortArray.mli",
     "belt_SortArrayInt.mli",
     "belt_SortArrayString.mli",
-    "bigarray.mli",
     "buffer.mli",
     "bytes.mli",
     "bytesLabels.mli",
@@ -984,7 +955,6 @@
     "char.mli",
     "complex.mli",
     "digest.mli",
-    "ephemeron.mli",
     "filename.mli",
     "format.mli",
     "gc.mli",
@@ -1019,7 +989,6 @@
     "nativeint.mli",
     "node_process.mli",
     "obj.mli",
-    "oo.mli",
     "parsing.mli",
     "pervasives.mli",
     "printexc.mli",
@@ -1038,10 +1007,7 @@
     "string.mli",
     "stringLabels.mli",
     "sys.mli",
-    "uchar.mli",
-    "unix.mli",
-    "unixLabels.mli",
-    "weak.mli"
+    "uchar.mli"
   ],
   "linux": [
     "ninja.COPYING",
@@ -1063,6 +1029,7 @@
     "install.js",
     "installUtils.js",
     "js_internal_gen.js",
+    "littlecase.js",
     "ninja.js",
     "ninjaFactory.js",
     "prebuilt.js",
@@ -1072,6 +1039,7 @@
     "shake.js",
     "tasks.js",
     "tmp.js",
+    "validate.js",
     "jsconfig.json",
     "build_sorted.ml",
     "caml_oo_curry_gen.ml",

jscomp/common/bs_version.ml

@@ -22,7 +22,7 @@
  * 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. *)    
-let version = "8.0.0-dev.1"
+let version = "8.1.0-dev.1"
 let header = 
    "// Generated by BUCKLESCRIPT, PLEASE EDIT WITH CARE"  
 let package_name = "bs-platform"   

jscomp/others/belt_internalAVLtree.ml

@@ -169,14 +169,14 @@ let rec findFirstByU n p =
   match  n with
   | None -> None 
   | Some n ->
-    let left = n .left |. findFirstByU p in
+    let left =  findFirstByU n.left p in
     if left <> None then left
       else
         let  {key = v; value =  d} = n  in
         let pvd = p v d [@bs] in
         if pvd then Some(v, d)
           else 
-            let right = n.right|. findFirstByU  p in
+            let right =  findFirstByU n.right p in
             if right <> None then right else None
 
 let findFirstBy n p = findFirstByU n (fun [@bs] a b -> p a b)
@@ -185,9 +185,9 @@ let rec forEachU n f =
   match  n with
   | None -> ()
   | Some n ->
-    n .left |. forEachU  f ;
+    forEachU  n.left f ;
     f n.key n.value [@bs];
-    n.right|. forEachU  f
+    forEachU n.right f
 
 let forEach n f = forEachU n (fun [@bs] a b -> f a b)
 
@@ -196,9 +196,9 @@ let rec mapU n f =
     None  ->
     None
   | Some n  ->
-    let newLeft = n .left |. mapU  f in
+    let newLeft =  mapU n.left f in
     let newD = f n.value [@bs] in
-    let newRight = n.right|. mapU  f in
+    let newRight = mapU n.right f in
     Some { left = newLeft; key = n.key;  value = newD; right = newRight; height = n.height}
 
 let map n f = mapU n (fun[@bs] a -> f a)
@@ -209,9 +209,9 @@ let rec mapWithKeyU n f =
     None
   | Some n ->
     let key = n.key  in
-    let newLeft = n .left |. mapWithKeyU  f in
+    let newLeft =  mapWithKeyU n.left f in
     let newD = f key n.value [@bs] in
-    let newRight = n.right|. mapWithKeyU  f in
+    let newRight =  mapWithKeyU n.right f in
     Some { left = newLeft; key; value = newD; right = newRight; height = n.height}
 
 let mapWithKey n f = mapWithKeyU n (fun [@bs] a b -> f a b)
@@ -232,17 +232,17 @@ let rec everyU  n p =
     None -> true
   | Some n  ->
     p n.key n.value [@bs] &&
-    n .left  |. everyU  p &&
-    n.right|. everyU  p
+    everyU n.left  p &&
+    everyU n.right p
 let every n p = everyU n (fun [@bs] a b -> p a b)
 
 let rec someU n p =
   match  n with
     None -> false
   | Some n  ->
     p n.key n.value [@bs] ||
-    n .left  |. someU  p ||
-    n.right|. someU p
+    someU n.left p ||
+    someU n.right p
 let some n p  = someU n (fun[@bs] a b -> p a b)
 (* Beware: those two functions assume that the added k is *strictly*
    smaller (or bigger) than all the present keys in the tree; it
@@ -304,9 +304,9 @@ let rec keepSharedU n p =
   | Some n  ->
     (* call [p] in the expected left-to-right order *)
     let  {key = v; value = d} =  n   in
-    let newLeft = n .left |. keepSharedU  p in
+    let newLeft =  keepSharedU n.left p in
     let pvd = p v d [@bs] in
-    let newRight = n.right|. keepSharedU  p in
+    let newRight = keepSharedU n.right p in
     if pvd then join newLeft v d newRight else concat newLeft newRight
 
 let keepShared n p = keepSharedU n (fun [@bs] a b -> p a b)
@@ -317,9 +317,9 @@ let rec keepMapU n p =
   | Some n  ->
     (* call [p] in the expected left-to-right order *)
     let  {key = v; value = d} =  n  in
-    let newLeft = n .left |. keepMapU  p in
+    let newLeft = keepMapU n.left  p in
     let pvd = p v d [@bs] in
-    let newRight = n.right|. keepMapU  p in
+    let newRight = keepMapU n.right p in
     match pvd with
     | None -> concat newLeft newRight
     | Some d -> join newLeft v d newRight
@@ -332,9 +332,9 @@ let rec partitionSharedU n p =
   | Some n  ->
     let  {key; value } =  n  in
     (* call [p] in the expected left-to-right order *)
-    let (lt, lf) = n .left |. partitionSharedU  p in
+    let (lt, lf) =  partitionSharedU n.left p in
     let pvd = p key value [@bs] in
-    let (rt, rf) = n.right|. partitionSharedU  p in
+    let (rt, rf) = partitionSharedU n.right p in
     if pvd
     then (join lt key value rt, concat lf rf)
     else (concat lt rt, join lf key value rf)
@@ -365,7 +365,7 @@ let rec toListAux n accu =
   | None -> accu
   | Some n  ->
     let {left = l; right =  r ; key = k; value = v} = n in
-    l |. toListAux ((k, v) :: ( r |. toListAux accu ))
+    toListAux l ((k, v) :: (toListAux r accu ))
 
 let toList s =
   toListAux  s []

jscomp/syntax/ast_attributes.ml

@@ -307,6 +307,10 @@ let iter_process_bs_int_as  (attrs : t) =
       | _  -> ()
     ) ; !st
 
+type as_const_payload = 
+  | Int of int
+  | Str of string
+  | Json_str of string  
 
 let iter_process_bs_string_or_int_as (attrs : Parsetree.attributes) =
   let st = ref None in
@@ -322,15 +326,15 @@ let iter_process_bs_string_or_int_as (attrs : Parsetree.attributes) =
            | None ->
              begin match Ast_payload.is_single_string payload with
                | Some (s,None) ->
-                 st := Some (`Str (s))
+                 st := Some (Str (s))
                | Some (s, Some "json") ->
-                 st := Some (`Json_str s )
+                 st := Some (Json_str s )
                | None | Some (_, Some _) ->
                  Bs_syntaxerr.err loc Expect_int_or_string_or_json_literal
 
              end
            | Some   v->
-             st := (Some (`Int v))
+             st := (Some (Int v))
           )
         else
           Bs_syntaxerr.err loc Duplicated_bs_as

jscomp/syntax/ast_attributes.mli

@@ -81,12 +81,15 @@ val has_bs_optional :
 val iter_process_bs_int_as :
   t -> int option
 
+type as_const_payload = 
+  | Int of int
+  | Str of string
+  | Json_str of string  
+
 
 val iter_process_bs_string_or_int_as :
     t ->
-    [ `Int of int
-    | `Str of string
-    | `Json_str of string  ] option
+    as_const_payload option
 
 
 val process_derive_type :