@adviser/cement 0.2.27 → 0.2.29

package/src/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/src/README.md

@@ -0,0 +1,39 @@
+# cement
+
+An Agnostic Platform Wrapper
+
+which Provides:
+
+- SysAbstraction
+```typescript
+export interface SysAbstraction {
+  Time(): Time;
+  Stdout(): WritableStream<Uint8Array>;
+  Stderr(): WritableStream<Uint8Array>;
+  NextId(): string;
+  Random0ToValue(value: number): number;
+  System(): SystemService;
+  FileSystem(): FileService;
+}
+```
+- Logger inspired from golang zlogger
+```typescript
+export interface LoggerInterface<R> {
+  Module(key: string): R;
+  SetDebug(...modules: (string | string[])[]): R;
+
+  Str(key: string, value: string): R;
+  Error(): R;
+  Warn(): R;
+  Debug(): R;
+  Log(): R;
+  WithLevel(level: Level): R;
+
+  Err(err: unknown): R; // could be Error, or something which coerces to string
+  Info(): R;
+  Timestamp(): R;
+  Any(key: string, value: unknown): R;
+  Dur(key: string, nsec: number): R;
+  Uint64(key: string, value: number): R;
+}
+```

package/src/base-sys-abstraction.test.ts

@@ -0,0 +1,95 @@
+import { runtimeFn, IDMode, TimeMode, RandomMode } from "@adviser/cement";
+import { DenoSysAbstraction, NodeSysAbstraction } from "@adviser/cement/node";
+import { WebSysAbstraction } from "@adviser/cement/web";
+
+const abstractions = [];
+
+if (runtimeFn().isNodeIsh) {
+  abstractions.push({ name: "NodeSysAbstraction", fn: NodeSysAbstraction });
+}
+
+if (runtimeFn().isDeno) {
+  abstractions.push({ name: "DenoSysAbstraction", fn: DenoSysAbstraction });
+}
+
+if (runtimeFn().isBrowser) {
+  abstractions.push({ name: "WebSysAbstraction", fn: WebSysAbstraction });
+}
+
+for (const abstraction of abstractions) {
+  describe(abstraction.name, () => {
+    it("IdService UUID", () => {
+      const sys = abstraction.fn();
+      const id1 = sys.NextId();
+      const id2 = sys.NextId();
+      expect(id1).not.toEqual(id2);
+    });
+
+    it("IdService explict UUID", () => {
+      const sys = abstraction.fn({ IdMode: IDMode.UUID });
+      const id1 = sys.NextId();
+      const id2 = sys.NextId();
+      expect(id1).not.toEqual(id2);
+    });
+
+    it("IdService const", () => {
+      const sys = abstraction.fn({ IdMode: IDMode.CONST });
+      const id1 = sys.NextId();
+      const id2 = sys.NextId();
+      expect(id1).toEqual(id2);
+    });
+
+    it("IdService set", () => {
+      for (let i = 0; i < 10; i++) {
+        const sys = abstraction.fn({ IdMode: IDMode.STEP });
+        const id1 = sys.NextId();
+        const id2 = sys.NextId();
+        expect(id1).toEqual("STEPId-0");
+        expect(id2).toEqual("STEPId-1");
+      }
+    });
+
+    it("time sleep", async () => {
+      const sys = abstraction.fn();
+      const start = sys.Time().Now();
+      await sys.Time().Sleep(100);
+      expect(sys.Time().TimeSince(start)).toBeGreaterThan(90);
+    });
+
+    it("time sleep const", async () => {
+      const sys = abstraction.fn({ TimeMode: TimeMode.REAL });
+      const start = new Date();
+      await sys.Time().Sleep(100);
+      const end = new Date();
+      expect(end.getTime() - start.getTime()).toBeGreaterThan(90);
+    });
+
+    it("time sleep step", async () => {
+      const sys = abstraction.fn({ TimeMode: TimeMode.STEP });
+      const start = sys.Time().Now();
+      await sys.Time().Sleep(86400500);
+      expect(sys.Time().Now().getTime() - start.getTime()).toEqual(86401500);
+    });
+
+    it("const random", () => {
+      const sys = abstraction.fn({ RandomMode: RandomMode.CONST });
+      expect(sys.Random0ToValue(10)).toEqual(5);
+      expect(sys.Random0ToValue(10)).toEqual(5);
+    });
+
+    it("step random", () => {
+      const sys = abstraction.fn({ RandomMode: RandomMode.STEP });
+      expect(sys.Random0ToValue(10000)).toEqual(1);
+      expect(sys.Random0ToValue(10000)).toEqual(2);
+    });
+
+    it("random", () => {
+      const sys = abstraction.fn({});
+      for (let i = 0; i < 100; i++) {
+        const val = sys.Random0ToValue(10);
+        expect(val).toBeGreaterThanOrEqual(0);
+        expect(val).toBeLessThanOrEqual(10);
+      }
+    });
+  });
+}

package/src/base-sys-abstraction.ts

@@ -0,0 +1,242 @@
+import { FileService } from "./file-service.js";
+import { TimeMode, RandomMode, IDMode, SystemService, VoidFunc, SysAbstraction } from "./sys-abstraction.js";
+import { Time } from "./time.js";
+import { TxtEnDecoder } from "./txt-en-decoder.js";
+
+export class SysTime extends Time {
+  Now(): Date {
+    return new Date();
+  }
+  Sleep(duration: number): Promise<void> {
+    return new Promise((resolve) => {
+      setTimeout(() => {
+        resolve();
+      }, duration);
+    });
+  }
+}
+
+export class ConstTime extends Time {
+  Now(): Date {
+    return new Date(2021, 1, 1, 0, 0, 0, 0);
+  }
+  // eslint-disable-next-line @typescript-eslint/no-unused-vars
+  Sleep(duration: number): Promise<void> {
+    return Promise.resolve();
+  }
+}
+
+export class StepTime extends Time {
+  _step: Date;
+  readonly _start: Date;
+  constructor() {
+    super();
+    this._step = new ConstTime().Now();
+    this._start = this._step;
+  }
+  Now(steps = 1): Date {
+    // if (this._step.getTime() === 0) {
+    //   this._step = new ConstTime().Now();
+    //   return this._step;
+    // }
+    for (let i = 0; steps > 0 && i < steps; i++) {
+      this._step = new Date(this._step.getTime() + 1000);
+    }
+    if (steps < 1) {
+      this._step = new Date(this._start.getTime() + steps * -1000);
+    }
+    // this._step = new Date(this._step.getTime() + 1000);
+    return this._step;
+  }
+  Sleep(duration: number): Promise<void> {
+    this._step = new Date(this._step.getTime() + duration);
+    return Promise.resolve();
+  }
+}
+
+export function TimeFactory(timeMode: TimeMode): Time {
+  switch (timeMode) {
+    case TimeMode.REAL:
+      return new SysTime();
+    case TimeMode.CONST:
+      return new ConstTime();
+    case TimeMode.STEP:
+      return new StepTime();
+  }
+  return new SysTime();
+}
+
+export class RandomService {
+  readonly _mode: RandomMode;
+  _step = 0;
+  constructor(mode: RandomMode) {
+    this._mode = mode;
+  }
+  Random0ToValue(value: number): number {
+    switch (this._mode) {
+      case RandomMode.CONST:
+        return 0.5 * value;
+      case RandomMode.STEP:
+        this._step += 0.0001;
+        return this._step * value;
+      case RandomMode.RANDOM:
+        return Math.random() * value;
+      default:
+        throw new Error("Unknown RandomMode");
+    }
+  }
+}
+
+export class IdService {
+  readonly _mode: IDMode;
+  _step = 0;
+  constructor(mode?: IDMode) {
+    if (!mode) {
+      mode = IDMode.UUID;
+    }
+    this._mode = mode;
+  }
+  NextId(): string {
+    switch (this._mode) {
+      case IDMode.UUID:
+        return crypto.randomUUID();
+      case IDMode.CONST:
+        return "VeryUniqueID";
+      case IDMode.STEP:
+        return `STEPId-${this._step++}`;
+      default:
+        throw new Error("Unknown IDMode");
+    }
+  }
+}
+
+export interface BaseSysAbstractionParams {
+  readonly TxtEnDecoder: TxtEnDecoder;
+  readonly FileSystem: FileService;
+  readonly SystemService: SystemService;
+}
+
+export interface ExitHandler {
+  readonly hdl: VoidFunc;
+  readonly id: string;
+}
+
+export interface ExitService {
+  injectExitHandlers(hdls: ExitHandler[]): void;
+  exit(code: number): void;
+}
+
+export class BaseSysAbstraction {
+  readonly _time: SysTime = new SysTime();
+  readonly _stdout: WritableStream;
+  readonly _stderr: WritableStream;
+
+  readonly _idService: IdService = new IdService();
+  readonly _randomService: RandomService = new RandomService(RandomMode.RANDOM);
+  readonly _fileSystem: FileService;
+  readonly _systemService: SystemService;
+  readonly _txtEnDe: TxtEnDecoder;
+
+  constructor(params: BaseSysAbstractionParams) {
+    this._fileSystem = params.FileSystem;
+    this._systemService = params.SystemService;
+    this._txtEnDe = params.TxtEnDecoder;
+    const decoder = this._txtEnDe;
+    this._stdout = new WritableStream({
+      write(chunk): Promise<void> {
+        return new Promise((resolve) => {
+          const decoded = decoder.decode(chunk);
+          // eslint-disable-next-line no-console
+          console.log(decoded.trimEnd());
+          resolve();
+        });
+      },
+    });
+    this._stderr = new WritableStream({
+      write(chunk): Promise<void> {
+        return new Promise((resolve) => {
+          const decoded = decoder.decode(chunk);
+          // eslint-disable-next-line no-console
+          console.error(decoded.trimEnd());
+          resolve();
+        });
+      },
+    });
+  }
+}
+
+export interface WrapperSysAbstractionParams {
+  readonly TimeMode?: TimeMode;
+  readonly IdMode?: IDMode;
+  readonly Stdout?: WritableStream<Uint8Array>;
+  readonly Stderr?: WritableStream<Uint8Array>;
+  readonly RandomMode?: RandomMode;
+  readonly FileSystem?: FileService;
+  readonly SystemService?: SystemService;
+  readonly TxtEnDecoder?: TxtEnDecoder;
+}
+
+export class WrapperSysAbstraction implements SysAbstraction {
+  readonly _time: Time;
+  readonly _stdout: WritableStream<Uint8Array>;
+  readonly _stderr: WritableStream<Uint8Array>;
+  readonly _idService: IdService;
+  readonly _randomService: RandomService;
+  readonly _fileSystem: FileService;
+  readonly _systemService: SystemService;
+  constructor(base: BaseSysAbstraction, params?: WrapperSysAbstractionParams) {
+    this._time = base._time;
+    this._stdout = base._stdout;
+    this._stderr = base._stderr;
+    this._idService = base._idService;
+    this._randomService = base._randomService;
+    this._fileSystem = base._fileSystem;
+    this._systemService = base._systemService;
+    if (params) {
+      if (params.TimeMode) {
+        this._time = TimeFactory(params.TimeMode);
+      }
+      if (params.Stdout) {
+        this._stdout = params.Stdout;
+      }
+      if (params.Stderr) {
+        this._stderr = params.Stderr;
+      }
+      if (params.IdMode) {
+        this._idService = new IdService(params.IdMode);
+      }
+      if (params.RandomMode) {
+        this._randomService = new RandomService(params.RandomMode);
+      }
+      if (params.FileSystem) {
+        this._fileSystem = params.FileSystem;
+      }
+      if (params.SystemService) {
+        this._systemService = params.SystemService;
+      }
+    }
+  }
+  Time(): Time {
+    return this._time;
+  }
+  NextId(): string {
+    return this._idService.NextId();
+  }
+  Random0ToValue(value: number): number {
+    return this._randomService.Random0ToValue(value);
+  }
+  Stdout(): WritableStream {
+    return this._stdout;
+  }
+  Stderr(): WritableStream {
+    return this._stderr;
+  }
+
+  System(): SystemService {
+    return this._systemService;
+  }
+  FileSystem(): FileService {
+    return this._fileSystem;
+  }
+}
+// export const BaseSysAbstraction = new BaseSysAbstractionImpl()

package/src/bin2text.test.ts

@@ -0,0 +1,59 @@
+import { bin2string, bin2text } from "./bin2text.js";
+
+it("bin2hex empty", () => {
+  expect(bin2string(new Uint8Array())).toEqual("");
+});
+
+it("bin2hex one", () => {
+  expect(bin2string(new Uint8Array([64]))).toBe("0000  40                                              @");
+});
+
+it("bin2hex 12", () => {
+  const collector: string[] = [];
+  bin2text(new Uint8Array([1, 2, 3, 4, 4, 5, 6, 7, 8, 9, 0xa, 0xb, 0xc]), (line) => {
+    collector.push(line);
+  });
+  expect(collector).toEqual(["0000  01 02 03 04 04 05 06 07 08 09 0a 0b 0c          ............."]);
+});
+
+it("bin2hex cut", () => {
+  const collector: string[] = [];
+  bin2text(
+    new Uint8Array(new Array(255).fill(1).map((_, i) => i)),
+    (line) => {
+      collector.push(line);
+    },
+    52,
+  );
+  expect(collector).toEqual([
+    "0000  00 01 02 03 04 05 06 07 08 09 0a 0b 0c 0d 0e 0f ................",
+    "0010  10 11 12 13 14 15 16 17 18 19 1a 1b 1c 1d 1e 1f ................",
+    "0020  20 21 22 23 24 25 26 27 28 29 2a 2b 2c 2d 2e 2f  !\"#$%&'()*+,-./",
+    "00f0>>f0 f1 f2 f3 f4 f5 f6 f7 f8 f9 fa fb fc fd fe    ...............",
+  ]);
+});
+
+it("bin2hex long", () => {
+  const collector: string[] = [];
+  bin2text(new Uint8Array(new Array(256).fill(1).map((_, i) => i % 0xff)), (line) => {
+    collector.push(line);
+  });
+  expect(collector).toEqual([
+    "0000  00 01 02 03 04 05 06 07 08 09 0a 0b 0c 0d 0e 0f ................",
+    "0010  10 11 12 13 14 15 16 17 18 19 1a 1b 1c 1d 1e 1f ................",
+    "0020  20 21 22 23 24 25 26 27 28 29 2a 2b 2c 2d 2e 2f  !\"#$%&'()*+,-./",
+    "0030  30 31 32 33 34 35 36 37 38 39 3a 3b 3c 3d 3e 3f 0123456789:;<=>?",
+    "0040  40 41 42 43 44 45 46 47 48 49 4a 4b 4c 4d 4e 4f @ABCDEFGHIJKLMNO",
+    "0050  50 51 52 53 54 55 56 57 58 59 5a 5b 5c 5d 5e 5f PQRSTUVWXYZ[\\]^_",
+    "0060  60 61 62 63 64 65 66 67 68 69 6a 6b 6c 6d 6e 6f `abcdefghijklmno",
+    "0070  70 71 72 73 74 75 76 77 78 79 7a 7b 7c 7d 7e 7f pqrstuvwxyz{|}~.",
+    "0080  80 81 82 83 84 85 86 87 88 89 8a 8b 8c 8d 8e 8f ................",
+    "0090  90 91 92 93 94 95 96 97 98 99 9a 9b 9c 9d 9e 9f ................",
+    "00a0  a0 a1 a2 a3 a4 a5 a6 a7 a8 a9 aa ab ac ad ae af ................",
+    "00b0  b0 b1 b2 b3 b4 b5 b6 b7 b8 b9 ba bb bc bd be bf ................",
+    "00c0  c0 c1 c2 c3 c4 c5 c6 c7 c8 c9 ca cb cc cd ce cf ................",
+    "00d0  d0 d1 d2 d3 d4 d5 d6 d7 d8 d9 da db dc dd de df ................",
+    "00e0  e0 e1 e2 e3 e4 e5 e6 e7 e8 e9 ea eb ec ed ee ef ................",
+    "00f0  f0 f1 f2 f3 f4 f5 f6 f7 f8 f9 fa fb fc fd fe 00 ................",
+  ]);
+});

package/src/bin2text.ts

@@ -0,0 +1,47 @@
+export function bin2text(hex: ArrayBufferView, lineFn: (line: string) => void, size = 0): void {
+  const arr = new Uint8Array(hex.buffer, hex.byteOffset, hex.byteLength);
+  let cutted = "  ";
+  if (size == 0) {
+    size = arr.length;
+  }
+  size = Math.min(size, arr.length);
+  const cols = 16;
+  for (let line = 0; line < size; line += cols) {
+    if (line + cols <= size || arr.length == size) {
+      // normal line
+    } else {
+      line = arr.length - (arr.length % cols);
+      size = arr.length;
+      cutted = ">>";
+    }
+    const l: string[] = [line.toString(16).padStart(4, "0"), cutted];
+    for (let col = 0; col < cols; col++) {
+      if (line + col < size) {
+        l.push(arr[line + col].toString(16).padStart(2, "0"));
+      } else {
+        l.push("  ");
+      }
+      // l.push((col > 0 && col % 4 === 3) ? " " : " ");
+      l.push(" ");
+    }
+    for (let col = 0; col < cols; col++) {
+      if (line + col < size) {
+        const ch = arr[line + col];
+        l.push(ch >= 32 && ch < 127 ? String.fromCharCode(ch) : ".");
+      }
+    }
+    lineFn(l.join(""));
+  }
+}
+
+export function bin2string(hex: ArrayBufferView, size = 0): string {
+  const collector: string[] = [];
+  bin2text(
+    hex,
+    (line) => {
+      collector.push(line);
+    },
+    size,
+  );
+  return collector.join("\n");
+}