@ovalbee/reportifact 0.0.2 → 0.0.4

package/dist/utils/tfeventsParser.js

@@ -1,336 +1,307 @@
-import * as w from "fs";
-function I(t, e, s) {
-  const a = Buffer.isBuffer(t) ? t : w.readFileSync(t), r = /* @__PURE__ */ new Map(), i = /* @__PURE__ */ new Set();
-  if (e && s && s > 0) {
-    const l = b(a, e);
-    if (l === 0)
-      return { scalars: r, tags: [] };
-    const n = /* @__PURE__ */ new Set();
-    if (l <= s)
-      for (let d = 0; d < l; d++)
-        n.add(d);
-    else {
-      n.add(0), n.add(l - 1);
-      const d = Math.ceil((l - 2) / (s - 2));
-      for (let f = d; f < l - 1; f += d)
-        n.size < s && n.add(f);
-    }
-    let h = 0, c = 0;
-    for (; h < a.length && !(h + 12 > a.length); ) {
-      const d = Number(a.readBigUInt64LE(h));
-      if (d <= 0 || d > 10 * 1024 * 1024) break;
-      const f = h + 12, v = f + d, g = v + 4;
-      if (v > a.length) break;
-      try {
-        const u = a.subarray(f, v);
-        if (p(u) === e) {
-          if (n.has(c)) {
-            const k = y(u);
-            k && k.tag === e && k.value !== void 0 && k.step !== void 0 && (i.add(k.tag), r.has(k.tag) || r.set(k.tag, []), r.get(k.tag).push({
-              step: k.step,
-              wallTime: k.wallTime || 0,
-              value: k.value,
-              tag: k.tag
-            }));
-          }
-          c++;
-        }
-      } catch {
-      }
-      h = g;
-    }
-    const o = r.get(e);
-    o && o.sort((d, f) => d.step - f.step);
-  } else if (e) {
-    let l = 0;
-    const n = [];
-    for (; l < a.length && !(l + 12 > a.length); ) {
-      const h = Number(a.readBigUInt64LE(l));
-      if (h <= 0 || h > 10 * 1024 * 1024) break;
-      const c = l + 12, o = c + h, d = o + 4;
-      if (o > a.length) break;
-      try {
-        const f = a.subarray(c, o);
-        if (p(f) === e) {
-          const g = y(f);
-          g && g.tag === e && g.value !== void 0 && g.step !== void 0 && n.push({
-            step: g.step,
-            wallTime: g.wallTime || 0,
-            value: g.value,
-            tag: g.tag
-          });
-        }
-      } catch {
-      }
-      l = d;
-    }
-    n.length > 0 && (i.add(e), r.set(e, n));
-  } else {
-    let l = 0;
-    const n = /* @__PURE__ */ new Map(), h = /* @__PURE__ */ new Map();
-    for (; l < a.length && !(l + 12 > a.length); ) {
-      const c = Number(a.readBigUInt64LE(l));
-      if (c <= 0 || c > 10 * 1024 * 1024) break;
-      const o = l + 12, d = o + c, f = d + 4;
-      if (d > a.length) break;
-      try {
-        const v = a.subarray(o, d), g = y(v);
-        if (g && g.tag && g.value !== void 0 && g.step !== void 0) {
-          if (e && g.tag !== e) {
-            l = f;
-            continue;
-          }
-          i.add(g.tag), h.has(g.tag) || (h.set(g.tag, []), n.set(g.tag, 0)), h.get(g.tag).push({
-            step: g.step,
-            wallTime: g.wallTime || 0,
-            value: g.value,
-            tag: g.tag
-          }), n.set(g.tag, n.get(g.tag) + 1);
-        }
-      } catch {
-      }
-      l = f;
-    }
-    if (s && s > 0)
-      for (const [c, o] of h.entries()) {
-        const d = n.get(c);
-        if (d > s) {
-          const f = Math.ceil(d / s), v = [];
-          v.push(o[0]), o.length > 1 && v.push(o[o.length - 1]);
-          for (let g = f; g < o.length - 1; g += f)
-            v.length < s && v.push(o[g]);
-          v.sort((g, u) => g.step - u.step), r.set(c, v);
-        } else
-          r.set(c, o);
-      }
-    else
-      for (const [c, o] of h.entries())
-        r.set(c, o);
-  }
-  return {
-    scalars: r,
-    tags: Array.from(i)
-  };
+import * as e from "fs";
+//#region src/utils/tfeventsParser.ts
+function t(t, i, a) {
+	let s = Buffer.isBuffer(t) ? t : e.readFileSync(t), c = /* @__PURE__ */ new Map(), l = /* @__PURE__ */ new Set();
+	if (i && a && a > 0) {
+		let e = n(s, i);
+		if (e === 0) return {
+			scalars: c,
+			tags: []
+		};
+		let t = /* @__PURE__ */ new Set();
+		if (e <= a) for (let n = 0; n < e; n++) t.add(n);
+		else {
+			t.add(0), t.add(e - 1);
+			let n = Math.ceil((e - 2) / (a - 2));
+			for (let r = n; r < e - 1; r += n) t.size < a && t.add(r);
+		}
+		let u = 0, d = 0;
+		for (; u < s.length && !(u + 12 > s.length);) {
+			let e = Number(s.readBigUInt64LE(u));
+			if (e <= 0 || e > 10485760) break;
+			let n = u + 12, a = n + e, f = a + 4;
+			if (a > s.length) break;
+			try {
+				let e = s.subarray(n, a);
+				if (r(e) === i) {
+					if (t.has(d)) {
+						let t = o(e);
+						t && t.tag === i && t.value !== void 0 && t.step !== void 0 && (l.add(t.tag), c.has(t.tag) || c.set(t.tag, []), c.get(t.tag).push({
+							step: t.step,
+							wallTime: t.wallTime || 0,
+							value: t.value,
+							tag: t.tag
+						}));
+					}
+					d++;
+				}
+			} catch {}
+			u = f;
+		}
+		let f = c.get(i);
+		f && f.sort((e, t) => e.step - t.step);
+	} else if (i) {
+		let e = 0, t = [];
+		for (; e < s.length && !(e + 12 > s.length);) {
+			let n = Number(s.readBigUInt64LE(e));
+			if (n <= 0 || n > 10485760) break;
+			let a = e + 12, c = a + n, l = c + 4;
+			if (c > s.length) break;
+			try {
+				let e = s.subarray(a, c);
+				if (r(e) === i) {
+					let n = o(e);
+					n && n.tag === i && n.value !== void 0 && n.step !== void 0 && t.push({
+						step: n.step,
+						wallTime: n.wallTime || 0,
+						value: n.value,
+						tag: n.tag
+					});
+				}
+			} catch {}
+			e = l;
+		}
+		t.length > 0 && (l.add(i), c.set(i, t));
+	} else {
+		let e = 0, t = /* @__PURE__ */ new Map(), n = /* @__PURE__ */ new Map();
+		for (; e < s.length && !(e + 12 > s.length);) {
+			let r = Number(s.readBigUInt64LE(e));
+			if (r <= 0 || r > 10485760) break;
+			let a = e + 12, c = a + r, u = c + 4;
+			if (c > s.length) break;
+			try {
+				let r = o(s.subarray(a, c));
+				if (r && r.tag && r.value !== void 0 && r.step !== void 0) {
+					if (i && r.tag !== i) {
+						e = u;
+						continue;
+					}
+					l.add(r.tag), n.has(r.tag) || (n.set(r.tag, []), t.set(r.tag, 0)), n.get(r.tag).push({
+						step: r.step,
+						wallTime: r.wallTime || 0,
+						value: r.value,
+						tag: r.tag
+					}), t.set(r.tag, t.get(r.tag) + 1);
+				}
+			} catch {}
+			e = u;
+		}
+		if (a && a > 0) for (let [e, r] of n.entries()) {
+			let n = t.get(e);
+			if (n > a) {
+				let t = Math.ceil(n / a), i = [];
+				i.push(r[0]), r.length > 1 && i.push(r[r.length - 1]);
+				for (let e = t; e < r.length - 1; e += t) i.length < a && i.push(r[e]);
+				i.sort((e, t) => e.step - t.step), c.set(e, i);
+			} else c.set(e, r);
+		}
+		else for (let [e, t] of n.entries()) c.set(e, t);
+	}
+	return {
+		scalars: c,
+		tags: Array.from(l)
+	};
 }
-function b(t, e) {
-  let s = 0, a = 0;
-  for (; s < t.length && !(s + 12 > t.length); ) {
-    const r = Number(t.readBigUInt64LE(s));
-    if (r <= 0 || r > 10 * 1024 * 1024) break;
-    const i = s + 12, l = i + r, n = l + 4;
-    if (l > t.length) break;
-    try {
-      const h = t.subarray(i, l);
-      p(h) === e && a++;
-    } catch {
-    }
-    s = n;
-  }
-  return a;
+function n(e, t) {
+	let n = 0, i = 0;
+	for (; n < e.length && !(n + 12 > e.length);) {
+		let a = Number(e.readBigUInt64LE(n));
+		if (a <= 0 || a > 10485760) break;
+		let o = n + 12, s = o + a, c = s + 4;
+		if (s > e.length) break;
+		try {
+			r(e.subarray(o, s)) === t && i++;
+		} catch {}
+		n = c;
+	}
+	return i;
 }
-function p(t) {
-  let e = 0;
-  for (; e < t.length; ) {
-    const s = t[e];
-    if (!s) break;
-    const a = s >> 3, r = s & 7;
-    if (e++, r === 2) {
-      let i = 0, l = 0;
-      for (; e < t.length; ) {
-        const n = t[e++];
-        if (i |= (n & 127) << l, (n & 128) === 0 || (l += 7, l > 28)) break;
-      }
-      if (e + i <= t.length && i > 0) {
-        const n = t.subarray(e, e + i);
-        if (e += i, a === 3 || a === 5)
-          return m(n);
-      } else
-        break;
-    } else if (r === 1)
-      if (e + 8 <= t.length)
-        e += 8;
-      else
-        break;
-    else if (r === 0)
-      for (; e < t.length && (t[e++] & 128) !== 0; )
-        ;
-    else
-      break;
-  }
-  return null;
+function r(e) {
+	let t = 0;
+	for (; t < e.length;) {
+		let n = e[t];
+		if (!n) break;
+		let r = n >> 3, a = n & 7;
+		if (t++, a === 2) {
+			let n = 0, a = 0;
+			for (; t < e.length;) {
+				let r = e[t++];
+				if (n |= (r & 127) << a, !(r & 128) || (a += 7, a > 28)) break;
+			}
+			if (t + n <= e.length && n > 0) {
+				let a = e.subarray(t, t + n);
+				if (t += n, r === 3 || r === 5) return i(a);
+			} else break;
+		} else if (a === 1) {
+			if (t + 8 <= e.length) t += 8;
+			else break;
+		} else if (a === 0) for (; t < e.length && e[t++] & 128;);
+		else break;
+	}
+	return null;
 }
-function m(t) {
-  let e = 0;
-  for (; e < t.length; ) {
-    const s = t[e];
-    if (!s) break;
-    const a = s >> 3, r = s & 7;
-    if (e++, r === 2 && a === 1) {
-      let i = 0, l = 0;
-      for (; e < t.length; ) {
-        const n = t[e++];
-        if (i |= (n & 127) << l, (n & 128) === 0 || (l += 7, l > 28)) break;
-      }
-      if (e + i <= t.length && i > 0) {
-        const n = t.subarray(e, e + i);
-        return E(n);
-      } else
-        break;
-    } else
-      break;
-  }
-  return null;
+function i(e) {
+	let t = 0;
+	for (; t < e.length;) {
+		let n = e[t];
+		if (!n) break;
+		let r = n >> 3, i = n & 7;
+		if (t++, i === 2 && r === 1) {
+			let n = 0, r = 0;
+			for (; t < e.length;) {
+				let i = e[t++];
+				if (n |= (i & 127) << r, !(i & 128) || (r += 7, r > 28)) break;
+			}
+			if (t + n <= e.length && n > 0) return a(e.subarray(t, t + n));
+			break;
+		}
+		break;
+	}
+	return null;
 }
-function E(t) {
-  let e = 0;
-  if (e >= t.length) return null;
-  const s = t[e], a = s >> 3, r = s & 7;
-  if (e++, r === 2 && (a === 1 || a === 2)) {
-    let i = 0, l = 0;
-    for (; e < t.length; ) {
-      const n = t[e++];
-      if (i |= (n & 127) << l, (n & 128) === 0 || (l += 7, l > 28)) break;
-    }
-    if (e + i <= t.length && i > 0 && i < 1e3) {
-      const n = t.subarray(e, e + i);
-      try {
-        const h = n.toString("utf-8");
-        if (h.length > 0 && !h.includes("\0") && /^[\x20-\x7E\/]+$/.test(h))
-          return h;
-      } catch {
-      }
-    }
-  }
-  return null;
+function a(e) {
+	let t = 0;
+	if (t >= e.length) return null;
+	let n = e[t], r = n >> 3, i = n & 7;
+	if (t++, i === 2 && (r === 1 || r === 2)) {
+		let n = 0, r = 0;
+		for (; t < e.length;) {
+			let i = e[t++];
+			if (n |= (i & 127) << r, !(i & 128) || (r += 7, r > 28)) break;
+		}
+		if (t + n <= e.length && n > 0 && n < 1e3) {
+			let r = e.subarray(t, t + n);
+			try {
+				let e = r.toString("utf-8");
+				if (e.length > 0 && !e.includes("\0") && /^[\x20-\x7E\/]+$/.test(e)) return e;
+			} catch {}
+		}
+	}
+	return null;
 }
-function y(t) {
-  let e = 0, s, a, r, i;
-  for (; e < t.length; ) {
-    const l = t[e];
-    if (!l) break;
-    const n = l >> 3, h = l & 7;
-    if (e++, h === 0) {
-      let c = 0, o = 0;
-      for (; e < t.length; ) {
-        const d = t[e++];
-        if (c |= (d & 127) << o, (d & 128) === 0 || (o += 7, o > 63)) break;
-      }
-      n === 2 && (s = c);
-    } else if (h === 1) {
-      if (e + 8 <= t.length) {
-        const c = t.readDoubleLE(e);
-        e += 8, n === 1 && (a = c);
-      }
-    } else if (h === 2) {
-      let c = 0, o = 0;
-      for (; e < t.length; ) {
-        const d = t[e++];
-        if (c |= (d & 127) << o, (d & 128) === 0) break;
-        o += 7;
-      }
-      if (e + c <= t.length) {
-        const d = t.subarray(e, e + c);
-        if (e += c, n === 3 || n === 5) {
-          const f = B(d);
-          f.value !== void 0 && (r = f.value), f.tag && (i = f.tag);
-        }
-      }
-    } else
-      break;
-  }
-  return { step: s, wallTime: a, value: r, tag: i };
+function o(e) {
+	let t = 0, n, r, i, a;
+	for (; t < e.length;) {
+		let o = e[t];
+		if (!o) break;
+		let c = o >> 3, l = o & 7;
+		if (t++, l === 0) {
+			let r = 0, i = 0;
+			for (; t < e.length;) {
+				let n = e[t++];
+				if (r |= (n & 127) << i, !(n & 128) || (i += 7, i > 63)) break;
+			}
+			c === 2 && (n = r);
+		} else if (l === 1) {
+			if (t + 8 <= e.length) {
+				let n = e.readDoubleLE(t);
+				t += 8, c === 1 && (r = n);
+			}
+		} else if (l === 2) {
+			let n = 0, r = 0;
+			for (; t < e.length;) {
+				let i = e[t++];
+				if (n |= (i & 127) << r, !(i & 128)) break;
+				r += 7;
+			}
+			if (t + n <= e.length) {
+				let r = e.subarray(t, t + n);
+				if (t += n, c === 3 || c === 5) {
+					let e = s(r);
+					e.value !== void 0 && (i = e.value), e.tag && (a = e.tag);
+				}
+			}
+		} else break;
+	}
+	return {
+		step: n,
+		wallTime: r,
+		value: i,
+		tag: a
+	};
 }
-function B(t) {
-  let e = 0, s, a;
-  for (; e < t.length; ) {
-    const r = t[e];
-    if (!r) break;
-    const i = r >> 3, l = r & 7;
-    if (e++, l === 2 && i === 1) {
-      let n = 0, h = 0;
-      for (; e < t.length; ) {
-        const c = t[e++];
-        if (n |= (c & 127) << h, (c & 128) === 0 || (h += 7, h > 28)) break;
-      }
-      if (e + n <= t.length && n > 0) {
-        const c = t.subarray(e, e + n);
-        e += n;
-        const o = S(c);
-        o.value !== void 0 && s === void 0 && (s = o.value), o.tag && !a && (a = o.tag);
-      } else
-        break;
-    } else
-      break;
-  }
-  return { value: s, tag: a };
+function s(e) {
+	let t = 0, n, r;
+	for (; t < e.length;) {
+		let i = e[t];
+		if (!i) break;
+		let a = i >> 3, o = i & 7;
+		if (t++, o === 2 && a === 1) {
+			let i = 0, a = 0;
+			for (; t < e.length;) {
+				let n = e[t++];
+				if (i |= (n & 127) << a, !(n & 128) || (a += 7, a > 28)) break;
+			}
+			if (t + i <= e.length && i > 0) {
+				let a = e.subarray(t, t + i);
+				t += i;
+				let o = c(a);
+				o.value !== void 0 && n === void 0 && (n = o.value), o.tag && !r && (r = o.tag);
+			} else break;
+		} else break;
+	}
+	return {
+		value: n,
+		tag: r
+	};
 }
-function S(t) {
-  let e = 0, s, a;
-  for (; e < t.length; ) {
-    const r = t[e];
-    if (!r) break;
-    const i = r >> 3, l = r & 7;
-    if (e++, l === 2) {
-      let n = 0, h = 0;
-      for (; e < t.length; ) {
-        const c = t[e++];
-        if (n |= (c & 127) << h, (c & 128) === 0 || (h += 7, h > 28)) break;
-      }
-      if (e + n <= t.length && n > 0) {
-        const c = t.subarray(e, e + n);
-        if (e += n, i === 1 || i === 2)
-          try {
-            const o = c.toString("utf-8");
-            o.length > 0 && !o.includes("\0") && /^[\x20-\x7E\/]+$/.test(o) && (a = o);
-          } catch {
-            if (i === 1) {
-              const o = T(c);
-              o.value !== void 0 && (s = o.value);
-            }
-          }
-      } else
-        break;
-    } else if (l === 1)
-      if (e + 8 <= t.length)
-        i === 2 && (s = t.readDoubleLE(e)), e += 8;
-      else
-        break;
-    else if (l === 5)
-      if (e + 4 <= t.length && i === 2)
-        s = t.readFloatLE(e), e += 4;
-      else if (e + 4 <= t.length)
-        e += 4;
-      else
-        break;
-    else if (l === 0)
-      for (; e < t.length && (t[e++] & 128) !== 0; )
-        ;
-    else
-      break;
-  }
-  return { value: s, tag: a };
+function c(e) {
+	let t = 0, n, r;
+	for (; t < e.length;) {
+		let i = e[t];
+		if (!i) break;
+		let a = i >> 3, o = i & 7;
+		if (t++, o === 2) {
+			let i = 0, o = 0;
+			for (; t < e.length;) {
+				let n = e[t++];
+				if (i |= (n & 127) << o, !(n & 128) || (o += 7, o > 28)) break;
+			}
+			if (t + i <= e.length && i > 0) {
+				let o = e.subarray(t, t + i);
+				if (t += i, a === 1 || a === 2) try {
+					let e = o.toString("utf-8");
+					e.length > 0 && !e.includes("\0") && /^[\x20-\x7E\/]+$/.test(e) && (r = e);
+				} catch {
+					if (a === 1) {
+						let e = l(o);
+						e.value !== void 0 && (n = e.value);
+					}
+				}
+			} else break;
+		} else if (o === 1) {
+			if (t + 8 <= e.length) a === 2 && (n = e.readDoubleLE(t)), t += 8;
+			else break;
+		} else if (o === 5) {
+			if (t + 4 <= e.length && a === 2) n = e.readFloatLE(t), t += 4;
+			else if (t + 4 <= e.length) t += 4;
+			else break;
+		} else if (o === 0) for (; t < e.length && e[t++] & 128;);
+		else break;
+	}
+	return {
+		value: n,
+		tag: r
+	};
 }
-function T(t) {
-  let e = 0, s;
-  for (; e < t.length; ) {
-    const a = t[e];
-    if (!a) break;
-    const r = a & 7;
-    if (e++, r === 1)
-      e + 8 <= t.length && (s = t.readDoubleLE(e), e += 8);
-    else if (r === 2) {
-      let i = 0, l = 0;
-      for (; e < t.length; ) {
-        const n = t[e++];
-        if (i |= (n & 127) << l, (n & 128) === 0) break;
-        l += 7;
-      }
-      e += i;
-    } else
-      break;
-  }
-  return { value: s };
+function l(e) {
+	let t = 0, n;
+	for (; t < e.length;) {
+		let r = e[t];
+		if (!r) break;
+		let i = r & 7;
+		if (t++, i === 1) t + 8 <= e.length && (n = e.readDoubleLE(t), t += 8);
+		else if (i === 2) {
+			let n = 0, r = 0;
+			for (; t < e.length;) {
+				let i = e[t++];
+				if (n |= (i & 127) << r, !(i & 128)) break;
+				r += 7;
+			}
+			t += n;
+		} else break;
+	}
+	return { value: n };
 }
-export {
-  I as parseTensorBoardEvents
-};
+//#endregion
+export { t as parseTensorBoardEvents };