remove vestigial code path

Author: wegry

jscomp/others/belt_internalAVLtree.ml

@@ -170,23 +170,16 @@ let rec stackAllLeft v s =
   | None -> s
   | Some x -> stackAllLeft (leftGet x) (x::s)
 
-let checkPredicate (candidate: ('k, 'v) node option) (p: 'k -> 'v -> bool [@bs]): ('k * 'v) option = 
-  Belt.Option.flatMap 
-    candidate
-    (fun x ->
-      let  v, d = x |. (keyGet, valueGet) in
-      let pvd = p v d [@bs] in
-      if pvd then Some(v, d) else None)
-
 let rec findFirstByU n p =
   match toOpt n with
   | None -> None 
   | Some n ->
     let left = n |. leftGet |. findFirstByU p in
     if Belt.Option.isSome(left) then left 
       else
-        let pvd = checkPredicate (Some(n)) p in
-        if Belt.Option.isSome(pvd) then pvd 
+        let  v, d = n |. (keyGet, valueGet) in
+        let pvd = p v d [@bs] in
+        if pvd then Some(v, d)
           else 
             let right = n |. rightGet |. findFirstByU  p in
             if Belt.Option.isSome(right) then right else None

lib/js/belt_internalAVLtree.js

@@ -1,7 +1,6 @@
 'use strict';
 
 var Curry = require("./curry.js");
-var Belt_Option = require("./belt_Option.js");
 var Js_primitive = require("./js_primitive.js");
 var Belt_SortArray = require("./belt_SortArray.js");
 
@@ -268,30 +267,20 @@ function stackAllLeft(_v, _s) {
   };
 }
 
-function checkPredicate(candidate, p) {
-  return Belt_Option.flatMap(candidate, (function (x) {
-                var v = x.key;
-                var d = x.value;
-                var pvd = p(v, d);
-                if (pvd) {
-                  return /* tuple */[
-                          v,
-                          d
-                        ];
-                }
-                
-              }));
-}
-
 function findFirstByU(n, p) {
   if (n !== null) {
     var left = findFirstByU(n.left, p);
     if (left !== undefined) {
       return left;
     } else {
-      var pvd = checkPredicate(Js_primitive.some(n), p);
-      if (pvd !== undefined) {
-        return pvd;
+      var v = n.key;
+      var d = n.value;
+      var pvd = p(v, d);
+      if (pvd) {
+        return /* tuple */[
+                v,
+                d
+              ];
       } else {
         var right = findFirstByU(n.right, p);
         if (right !== undefined) {
@@ -627,7 +616,7 @@ function checkInvariantInternal(_v) {
       var r = v.right;
       var diff = treeHeight(l) - treeHeight(r) | 0;
       if (!(diff <= 2 && diff >= -2)) {
-        throw new Error("File \"belt_internalAVLtree.ml\", line 392, characters 6-12");
+        throw new Error("File \"belt_internalAVLtree.ml\", line 385, characters 6-12");
       }
       checkInvariantInternal(l);
       _v = r;