oakscriptjs 0.11.1 → 0.11.2

package/dist/cjs/ta/index.js

@@ -141,8 +141,7 @@ function rsi(source, length) {
       const y = length[i] ?? NaN;
       if ((0, import_compare.eq)(y, 0)) return 100;
       if ((0, import_compare.eq)(x, 0)) return 0;
-      const r = 100 - 100 / (1 + x / y);
-      return Number.isFinite(r) ? r : NaN;
+      return 100 - 100 / (1 + x / y);
     });
   }
   (0, import_limits.checkPositiveLength)("rsi", length, 0, "y");
@@ -201,7 +200,7 @@ function lastValues(source, i, length) {
   const values = [];
   for (let j = i; j >= 0 && values.length < length; j--) {
     const x = source[j];
-    if (!Number.isNaN(x)) values.push(x);
+    if (Number.isFinite(x)) values.push(x);
   }
   return values.length === length ? values : null;
 }
@@ -249,7 +248,7 @@ function keptValues(source) {
   const last = new Int32Array(source.length);
   for (let i = 0; i < source.length; i++) {
     const x = source[i];
-    if (!Number.isNaN(x)) {
+    if (Number.isFinite(x)) {
       values.push(x);
       bars.push(i);
     }
@@ -519,7 +518,7 @@ function monotonic(source, length, step) {
   for (let i = 0; i < source.length; i++) {
     const v = source[i];
     const prev = i > 0 ? source[i - 1] : NaN;
-    if (!Number.isNaN(v) && !Number.isNaN(prev)) count = step(v, prev) ? count + 1 : 0;
+    if (Number.isFinite(v) && Number.isFinite(prev)) count = step(v, prev) ? count + 1 : 0;
     result.push(count >= length);
   }
   return result;
@@ -611,7 +610,7 @@ function median(source, length) {
   const mid = Math.floor(len / 2);
   for (let i = 0; i < n; i++) {
     const x = source[i];
-    if (!Number.isNaN(x)) {
+    if (Number.isFinite(x)) {
       kept[count++] = x;
       sorted.splice(bound(x, false), 0, x);
       if (count > len) sorted.splice(bound(kept[count - 1 - len], true) - 1, 1);
@@ -743,10 +742,9 @@ function stoch(source, high, low, length) {
   const highestValues = highest(high, length);
   let previous = NaN;
   for (let i = 0; i < source.length; i++) {
-    const value = source[i];
     const lo = lowestValues[i];
-    const range2 = highestValues[i] - lo;
-    if (!Number.isNaN(value) && !Number.isNaN(range2) && range2 !== 0) previous = 100 * (value - lo) / range2;
+    const k = 100 * (source[i] - lo) / (highestValues[i] - lo);
+    if (!Number.isNaN(k)) previous = k;
     result.push(previous);
   }
   return result;
@@ -1132,14 +1130,14 @@ function lowestbars(source, length) {
 function max(source) {
   let best = NaN;
   return source.map((x) => {
-    if (!Number.isNaN(x) && !(x <= best)) best = x;
+    if (Number.isFinite(x) && !(x <= best)) best = x;
     return best;
   });
 }
 function min(source) {
   let best = NaN;
   return source.map((x) => {
-    if (!Number.isNaN(x) && !(x >= best)) best = x;
+    if (Number.isFinite(x) && !(x >= best)) best = x;
     return best;
   });
 }
@@ -1160,7 +1158,7 @@ function mode(source, length) {
   const seen = [];
   for (let i = 0; i < source.length; i++) {
     const v = source[i];
-    if (!Number.isNaN(v)) seen.push(v);
+    if (Number.isFinite(v)) seen.push(v);
     if (seen.length < len) {
       result.push(NaN);
       continue;