zkjson 0.8.4 → 0.8.6

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (67) hide show
  1. package/.babelrc-cjs +5 -0
  2. package/.babelrc-esm +5 -0
  3. package/README.md +32 -0
  4. package/make.js +17 -0
  5. package/package.json +8 -5
  6. package/cjs/circomlibjs/SMT.js +0 -481
  7. package/cjs/circomlibjs/SMTMemDb.js +0 -233
  8. package/cjs/circomlibjs/buildPoseidon.js +0 -164
  9. package/cjs/circomlibjs/buildPoseidonWasm.js +0 -124
  10. package/cjs/circomlibjs/getHashes.js +0 -220
  11. package/cjs/circomlibjs/poseidonConstants$1.js +0 -1
  12. package/cjs/circomlibjs.js +0 -149
  13. package/cjs/collection.js +0 -196
  14. package/cjs/collection_tree.js +0 -183
  15. package/cjs/db.js +0 -745
  16. package/cjs/db_tree.js +0 -560
  17. package/cjs/doc.js +0 -132
  18. package/cjs/doc_tree.js +0 -84
  19. package/cjs/encoder-v1_5.js +0 -1731
  20. package/cjs/encoder.js +0 -668
  21. package/cjs/index.js +0 -88
  22. package/cjs/json.js +0 -54
  23. package/cjs/newMemEmptyTrie.js +0 -45
  24. package/cjs/nft.js +0 -164
  25. package/cjs/parse.js +0 -256
  26. package/cjs/prover.js +0 -84
  27. package/cjs/uint.js +0 -580
  28. package/esm/package.json +0 -3
  29. /package/{esm → src}/circomlibjs/SMT.js +0 -0
  30. /package/{esm → src}/circomlibjs/SMTMemDb.js +0 -0
  31. /package/{esm → src}/circomlibjs/buildPoseidon.js +0 -0
  32. /package/{esm → src}/circomlibjs/buildPoseidonWasm.js +0 -0
  33. /package/{esm → src}/circomlibjs/getHashes.js +0 -0
  34. /package/{esm → src}/circomlibjs/poseidonConstants$1.js +0 -0
  35. /package/{esm → src}/circomlibjs.js +0 -0
  36. /package/{esm → src}/collection.js +0 -0
  37. /package/{esm → src}/collection_tree.js +0 -0
  38. /package/{esm → src}/contracts/NORollup.sol +0 -0
  39. /package/{esm → src}/contracts/OPRollup.sol +0 -0
  40. /package/{esm → src}/contracts/ZKIPFS.sol +0 -0
  41. /package/{esm → src}/contracts/ZKJson.sol +0 -0
  42. /package/{esm → src}/contracts/ZKQuery.sol +0 -0
  43. /package/{esm → src}/contracts/ZKRollup.sol +0 -0
  44. /package/{esm → src}/contracts/apps/SimpleJSON.sol +0 -0
  45. /package/{esm → src}/contracts/apps/SimpleOPRU.sol +0 -0
  46. /package/{esm → src}/contracts/apps/SimpleRU.sol +0 -0
  47. /package/{esm → src}/contracts/apps/Token.sol +0 -0
  48. /package/{esm → src}/contracts/apps/ZKArweave.sol +0 -0
  49. /package/{esm → src}/contracts/apps/ZKBridge.sol +0 -0
  50. /package/{esm → src}/contracts/apps/ZKNFT.sol +0 -0
  51. /package/{esm → src}/contracts/verifiers/verifier_db.sol +0 -0
  52. /package/{esm → src}/contracts/verifiers/verifier_ipfs.sol +0 -0
  53. /package/{esm → src}/contracts/verifiers/verifier_json.sol +0 -0
  54. /package/{esm → src}/contracts/verifiers/verifier_rollup.sol +0 -0
  55. /package/{esm → src}/db.js +0 -0
  56. /package/{esm → src}/db_tree.js +0 -0
  57. /package/{esm → src}/doc.js +0 -0
  58. /package/{esm → src}/doc_tree.js +0 -0
  59. /package/{esm → src}/encoder-v1_5.js +0 -0
  60. /package/{esm → src}/encoder.js +0 -0
  61. /package/{esm → src}/index.js +0 -0
  62. /package/{esm → src}/json.js +0 -0
  63. /package/{esm → src}/newMemEmptyTrie.js +0 -0
  64. /package/{esm → src}/nft.js +0 -0
  65. /package/{esm → src}/parse.js +0 -0
  66. /package/{esm → src}/prover.js +0 -0
  67. /package/{esm → src}/uint.js +0 -0
package/cjs/prover.js DELETED
@@ -1,84 +0,0 @@
1
- "use strict";
2
-
3
- Object.defineProperty(exports, "__esModule", {
4
- value: true
5
- });
6
- exports["default"] = void 0;
7
- var _snarkjs = require("snarkjs");
8
- var _encoder = require("./encoder.js");
9
- function _typeof(o) { "@babel/helpers - typeof"; return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (o) { return typeof o; } : function (o) { return o && "function" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? "symbol" : typeof o; }, _typeof(o); }
10
- function _regenerator() { /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/babel/babel/blob/main/packages/babel-helpers/LICENSE */ var e, t, r = "function" == typeof Symbol ? Symbol : {}, n = r.iterator || "@@iterator", o = r.toStringTag || "@@toStringTag"; function i(r, n, o, i) { var c = n && n.prototype instanceof Generator ? n : Generator, u = Object.create(c.prototype); return _regeneratorDefine2(u, "_invoke", function (r, n, o) { var i, c, u, f = 0, p = o || [], y = !1, G = { p: 0, n: 0, v: e, a: d, f: d.bind(e, 4), d: function d(t, r) { return i = t, c = 0, u = e, G.n = r, a; } }; function d(r, n) { for (c = r, u = n, t = 0; !y && f && !o && t < p.length; t++) { var o, i = p[t], d = G.p, l = i[2]; r > 3 ? (o = l === n) && (u = i[(c = i[4]) ? 5 : (c = 3, 3)], i[4] = i[5] = e) : i[0] <= d && ((o = r < 2 && d < i[1]) ? (c = 0, G.v = n, G.n = i[1]) : d < l && (o = r < 3 || i[0] > n || n > l) && (i[4] = r, i[5] = n, G.n = l, c = 0)); } if (o || r > 1) return a; throw y = !0, n; } return function (o, p, l) { if (f > 1) throw TypeError("Generator is already running"); for (y && 1 === p && d(p, l), c = p, u = l; (t = c < 2 ? e : u) || !y;) { i || (c ? c < 3 ? (c > 1 && (G.n = -1), d(c, u)) : G.n = u : G.v = u); try { if (f = 2, i) { if (c || (o = "next"), t = i[o]) { if (!(t = t.call(i, u))) throw TypeError("iterator result is not an object"); if (!t.done) return t; u = t.value, c < 2 && (c = 0); } else 1 === c && (t = i["return"]) && t.call(i), c < 2 && (u = TypeError("The iterator does not provide a '" + o + "' method"), c = 1); i = e; } else if ((t = (y = G.n < 0) ? u : r.call(n, G)) !== a) break; } catch (t) { i = e, c = 1, u = t; } finally { f = 1; } } return { value: t, done: y }; }; }(r, o, i), !0), u; } var a = {}; function Generator() {} function GeneratorFunction() {} function GeneratorFunctionPrototype() {} t = Object.getPrototypeOf; var c = [][n] ? t(t([][n]())) : (_regeneratorDefine2(t = {}, n, function () { return this; }), t), u = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(c); function f(e) { return Object.setPrototypeOf ? Object.setPrototypeOf(e, GeneratorFunctionPrototype) : (e.__proto__ = GeneratorFunctionPrototype, _regeneratorDefine2(e, o, "GeneratorFunction")), e.prototype = Object.create(u), e; } return GeneratorFunction.prototype = GeneratorFunctionPrototype, _regeneratorDefine2(u, "constructor", GeneratorFunctionPrototype), _regeneratorDefine2(GeneratorFunctionPrototype, "constructor", GeneratorFunction), GeneratorFunction.displayName = "GeneratorFunction", _regeneratorDefine2(GeneratorFunctionPrototype, o, "GeneratorFunction"), _regeneratorDefine2(u), _regeneratorDefine2(u, o, "Generator"), _regeneratorDefine2(u, n, function () { return this; }), _regeneratorDefine2(u, "toString", function () { return "[object Generator]"; }), (_regenerator = function _regenerator() { return { w: i, m: f }; })(); }
11
- function _regeneratorDefine2(e, r, n, t) { var i = Object.defineProperty; try { i({}, "", {}); } catch (e) { i = 0; } _regeneratorDefine2 = function _regeneratorDefine(e, r, n, t) { if (r) i ? i(e, r, { value: n, enumerable: !t, configurable: !t, writable: !t }) : e[r] = n;else { var o = function o(r, n) { _regeneratorDefine2(e, r, function (e) { return this._invoke(r, n, e); }); }; o("next", 0), o("throw", 1), o("return", 2); } }, _regeneratorDefine2(e, r, n, t); }
12
- function _toConsumableArray(r) { return _arrayWithoutHoles(r) || _iterableToArray(r) || _unsupportedIterableToArray(r) || _nonIterableSpread(); }
13
- function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
14
- function _iterableToArray(r) { if ("undefined" != typeof Symbol && null != r[Symbol.iterator] || null != r["@@iterator"]) return Array.from(r); }
15
- function _arrayWithoutHoles(r) { if (Array.isArray(r)) return _arrayLikeToArray(r); }
16
- function asyncGeneratorStep(n, t, e, r, o, a, c) { try { var i = n[a](c), u = i.value; } catch (n) { return void e(n); } i.done ? t(u) : Promise.resolve(u).then(r, o); }
17
- function _asyncToGenerator(n) { return function () { var t = this, e = arguments; return new Promise(function (r, o) { var a = n.apply(t, e); function _next(n) { asyncGeneratorStep(a, r, o, _next, _throw, "next", n); } function _throw(n) { asyncGeneratorStep(a, r, o, _next, _throw, "throw", n); } _next(void 0); }); }; }
18
- function _createForOfIteratorHelper(r, e) { var t = "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"]; if (!t) { if (Array.isArray(r) || (t = _unsupportedIterableToArray(r)) || e && r && "number" == typeof r.length) { t && (r = t); var _n = 0, F = function F() {}; return { s: F, n: function n() { return _n >= r.length ? { done: !0 } : { done: !1, value: r[_n++] }; }, e: function e(r) { throw r; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var o, a = !0, u = !1; return { s: function s() { t = t.call(r); }, n: function n() { var r = t.next(); return a = r.done, r; }, e: function e(r) { u = !0, o = r; }, f: function f() { try { a || null == t["return"] || t["return"](); } finally { if (u) throw o; } } }; }
19
- function _unsupportedIterableToArray(r, a) { if (r) { if ("string" == typeof r) return _arrayLikeToArray(r, a); var t = {}.toString.call(r).slice(8, -1); return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? Array.from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray(r, a) : void 0; } }
20
- function _arrayLikeToArray(r, a) { (null == a || a > r.length) && (a = r.length); for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e]; return n; }
21
- function _classCallCheck(a, n) { if (!(a instanceof n)) throw new TypeError("Cannot call a class as a function"); }
22
- function _defineProperties(e, r) { for (var t = 0; t < r.length; t++) { var o = r[t]; o.enumerable = o.enumerable || !1, o.configurable = !0, "value" in o && (o.writable = !0), Object.defineProperty(e, _toPropertyKey(o.key), o); } }
23
- function _createClass(e, r, t) { return r && _defineProperties(e.prototype, r), t && _defineProperties(e, t), Object.defineProperty(e, "prototype", { writable: !1 }), e; }
24
- function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == _typeof(i) ? i : i + ""; }
25
- function _toPrimitive(t, r) { if ("object" != _typeof(t) || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != _typeof(i)) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
26
- var Prover = exports["default"] = /*#__PURE__*/function () {
27
- function Prover(_ref) {
28
- var wasm = _ref.wasm,
29
- zkey = _ref.zkey;
30
- _classCallCheck(this, Prover);
31
- this.wasm = wasm;
32
- this.zkey = zkey;
33
- }
34
- return _createClass(Prover, [{
35
- key: "_getVal",
36
- value: function _getVal(j, p) {
37
- if (p.length === 0) return j;else {
38
- var sp = p[0].split("[");
39
- var _iterator = _createForOfIteratorHelper(sp),
40
- _step;
41
- try {
42
- for (_iterator.s(); !(_step = _iterator.n()).done;) {
43
- var v = _step.value;
44
- if (/]$/.test(v)) j = j[v.replace(/]$/, "") * 1];else j = j[v];
45
- }
46
- } catch (err) {
47
- _iterator.e(err);
48
- } finally {
49
- _iterator.f();
50
- }
51
- return this._getVal(j, p.slice(1));
52
- }
53
- }
54
- }, {
55
- key: "getVal",
56
- value: function getVal(j, p) {
57
- if (p === "") return j;
58
- return this._getVal(j, p.split("."));
59
- }
60
- }, {
61
- key: "genProof",
62
- value: function () {
63
- var _genProof = _asyncToGenerator(/*#__PURE__*/_regenerator().m(function _callee(inputs) {
64
- var _yield$groth16$fullPr, proof, publicSignals;
65
- return _regenerator().w(function (_context) {
66
- while (1) switch (_context.n) {
67
- case 0:
68
- _context.n = 1;
69
- return _snarkjs.groth16.fullProve(inputs, this.wasm, this.zkey);
70
- case 1:
71
- _yield$groth16$fullPr = _context.v;
72
- proof = _yield$groth16$fullPr.proof;
73
- publicSignals = _yield$groth16$fullPr.publicSignals;
74
- return _context.a(2, [].concat(_toConsumableArray(proof.pi_a.slice(0, 2)), _toConsumableArray(proof.pi_b[0].slice(0, 2).reverse()), _toConsumableArray(proof.pi_b[1].slice(0, 2).reverse()), _toConsumableArray(proof.pi_c.slice(0, 2)), _toConsumableArray(publicSignals)));
75
- }
76
- }, _callee, this);
77
- }));
78
- function genProof(_x) {
79
- return _genProof.apply(this, arguments);
80
- }
81
- return genProof;
82
- }()
83
- }]);
84
- }();
package/cjs/uint.js DELETED
@@ -1,580 +0,0 @@
1
- "use strict";
2
-
3
- Object.defineProperty(exports, "__esModule", {
4
- value: true
5
- });
6
- exports.arr = arr;
7
- exports.arrGet = arrGet;
8
- exports.arrPush = arrPush;
9
- exports.bn = bn;
10
- exports.concat = concat;
11
- exports.digits = digits;
12
- exports.get = get;
13
- exports.insert = insert;
14
- exports.last = last;
15
- exports.length = length;
16
- exports.mul = mul;
17
- exports.next = next;
18
- exports.pop = pop;
19
- exports.popArray = popArray;
20
- exports.push = push;
21
- exports.pushArray = pushArray;
22
- exports.remove = remove;
23
- exports.replace = replace;
24
- exports.shift = shift;
25
- exports.slice = slice;
26
- exports.str = str;
27
- exports.sum = sum;
28
- exports.toArray = toArray;
29
- exports.unshift = unshift;
30
- function digits(x) {
31
- if (x == 0) return 1n;
32
- var p = 0n;
33
- while (x > 0) {
34
- x = x / 10n >> 0n;
35
- p++;
36
- }
37
- return p;
38
- }
39
- function arr(row) {
40
- var _arr = [];
41
- for (var i = 0; i < row; i++) {
42
- _arr.push(0n);
43
- }
44
- return _arr;
45
- }
46
- function toArray(json, size) {
47
- json = bn(json);
48
- var j = [];
49
- var c = bn([0, size, 0, 0, 0, 0, 0, 0, 0]);
50
- while (c[5] == 0) {
51
- c = next(json, c);
52
- j.push(c[0]);
53
- }
54
- return j.map(function (n) {
55
- return Number(n);
56
- });
57
- }
58
- function arrPush(json, size, digit, index, val) {
59
- json = bn(json);
60
- index = bn(index);
61
- var len = get(json, size, 0);
62
- var _sum = sum(json, size, digit, 1, index + 2n);
63
- var at = _sum + 1n + len;
64
- json = insert(json, size, digit, at, val);
65
- var alen = get(json, size, index + 1n);
66
- json = replace(json, size, digit, index + 1n, alen + 1n);
67
- return json;
68
- }
69
- function arrGet(json, size, digit, index, index2) {
70
- json = bn(json);
71
- index = bn(index);
72
- index2 = bn(index2);
73
- var len = get(json, size, 0);
74
- var _sum = sum(json, size, digit, 1, index + 1n);
75
- var at = _sum + 1n + len + index2;
76
- return get(json, size, at);
77
- }
78
- function pushArray(json, size, digit, _arr, asize) {
79
- json = bn(json);
80
- var jlen = length(json, size);
81
- var alen = 0n;
82
- if (jlen == 0) {
83
- json = push(json, size, digit, 1);
84
- } else {
85
- alen = get(json, size, 0);
86
- json = replace(json, size, digit, 0, alen + 1n);
87
- }
88
- var len = length(_arr, size);
89
- json = insert(json, size, digit, alen + 1n, len);
90
- var c = bn([0, asize, 0, 0, 0, 0, 0, 0, 0]);
91
- while (c[5] == 0) {
92
- c = next(_arr, c);
93
- json = push(json, size, digit, c[0]);
94
- }
95
- return json;
96
- }
97
- function popArray(json, size, digit) {
98
- json = bn(json);
99
- var jlen = length(json, size);
100
- var alen = 0n;
101
- if (jlen == 0) {
102
- throw Error();
103
- } else {
104
- alen = get(json, size, 0);
105
- }
106
- if (alen == 1) return arr(size);
107
- var len = get(json, size, alen);
108
- json = replace(json, size, digit, 0, alen - 1n);
109
- var _sum = sum(json, size, digit, 1, alen);
110
- var start = alen + 1n + _sum;
111
- var end = start + len + 1n;
112
- json = remove(json, size, digit, start, end);
113
- json = remove(json, size, digit, alen, alen + 1n);
114
- return json;
115
- }
116
- function length(json, size) {
117
- json = bn(json);
118
- var _len = 0n;
119
- var c = bn([0, size, 0, 0, 0, 0, 0, 0, 0]);
120
- while (c[5] == 0) {
121
- c = next(json, c);
122
- _len++;
123
- }
124
- if (json[0] != 0) {
125
- return _len;
126
- } else {
127
- return 0;
128
- }
129
- }
130
- function sum(json, size, digit, start, end) {
131
- json = bn(json);
132
- var c = bn([0, size, 0, 0, 0, 0, 0, 0, 0]);
133
- var _sum = 0n;
134
- var i = 0;
135
- while (c[5] == 0) {
136
- c = next(json, c);
137
- if (i >= start && i < end) _sum += c[0];
138
- i++;
139
- }
140
- return _sum;
141
- }
142
- function mul(json, size, digit, start, end) {
143
- json = bn(json);
144
- var c = bn([0, size, 0, 0, 0, 0, 0, 0, 0]);
145
- var _mul = 0;
146
- var i = 0;
147
- while (c[5] == 0) {
148
- c = next(json, c);
149
- if (i >= start && i < end) _mul *= c[0];
150
- i++;
151
- }
152
- return _mul;
153
- }
154
- function remove(json, size, digit, start, end) {
155
- json = bn(json);
156
- var _arr = arr(size);
157
- var c = bn([0, size, 0, 0, 0, 0, 0, 0, 0]);
158
- var i = 0;
159
- while (c[5] == 0) {
160
- c = next(json, c);
161
- if (i < start || i >= end) {
162
- _arr = push(_arr, size, digit, c[0]);
163
- }
164
- i++;
165
- }
166
- return _arr;
167
- }
168
- function slice(json, size, digit, start, end) {
169
- json = bn(json);
170
- var _arr = arr(size);
171
- var c = bn([0, size, 0, 0, 0, 0, 0, 0, 0]);
172
- var i = 0;
173
- while (c[5] == 0) {
174
- c = next(json, c);
175
- if (i >= start && i < end) _arr = push(_arr, size, digit, c[0]);
176
- i++;
177
- }
178
- return _arr;
179
- }
180
- function get(json, size, index) {
181
- json = bn(json);
182
- var c = bn([0, size, 0, 0, 0, 0, 0, 0, 0]);
183
- var i = 0;
184
- while (c[5] == 0) {
185
- c = next(json, c);
186
- if (i == index) return c[0];
187
- i++;
188
- }
189
- throw Error();
190
- }
191
- function insert(json, size, digit, at, val) {
192
- json = bn(json);
193
- var _arr = arr(size);
194
- var c = bn([0, size, 0, 0, 0, 0, 0, 0, 0]);
195
- var i = 0;
196
- if (at == 0) {
197
- _arr = push(_arr, size, digit, val);
198
- }
199
- while (c[5] == 0) {
200
- c = next(json, c);
201
- _arr = push(_arr, size, digit, c[0]);
202
- i++;
203
- if (at == i) _arr = push(_arr, size, digit, val);
204
- }
205
- return _arr;
206
- }
207
- function replace(json, size, digit, at, val) {
208
- json = bn(json);
209
- var _arr = arr(size);
210
- var c = bn([0, size, 0, 0, 0, 0, 0, 0, 0]);
211
- var i = 0;
212
- while (c[5] == 0) {
213
- c = next(json, c);
214
- if (at == i) {
215
- _arr = push(_arr, size, digit, val);
216
- } else {
217
- _arr = push(_arr, size, digit, c[0]);
218
- }
219
- i++;
220
- }
221
- return _arr;
222
- }
223
- function last(json, size) {
224
- json = bn(json);
225
- var val = 0;
226
- var c = bn([0, size, 0, 0, 0, 0, 0, 0, 0]);
227
- while (c[5] == 0) {
228
- c = next(json, c);
229
- val = c[0];
230
- }
231
- return val;
232
- }
233
- function lastRow(json, size) {
234
- json = bn(json);
235
- var v = 0;
236
- for (var j = 0; j < size; j++) {
237
- if (json[j] != 0) v = j;
238
- }
239
- return v;
240
- }
241
- function shift(json, size, digit) {
242
- json = bn(json);
243
- var _arr = arr(size);
244
- var c = bn([0, size, 0, 0, 0, 0, 0, 0, 0]);
245
- var i = 0;
246
- while (c[5] == 0) {
247
- c = next(json, c);
248
- if (i > 0) _arr = push(_arr, size, digit, c[0]);
249
- i++;
250
- }
251
- return _arr;
252
- }
253
- function unshift(json, size, digit, num) {
254
- json = bn(json);
255
- var _arr = arr(size);
256
- _arr = push(_arr, size, digit, num);
257
- var c = bn([0, size, 0, 0, 0, 0, 0, 0, 0]);
258
- var i = 0;
259
- if (json[0] != 0) {
260
- while (c[5] == 0) {
261
- c = next(json, c);
262
- _arr = push(_arr, size, digit, c[0]);
263
- i++;
264
- }
265
- }
266
- return _arr;
267
- }
268
- function concat(json, json2, size, digit) {
269
- json = bn(json);
270
- var c = bn([0, size, 0, 0, 0, 0, 0, 0, 0]);
271
- var i = 0;
272
- if (json2[0] != 0) {
273
- while (c[5] == 0) {
274
- c = next(json2, c);
275
- json = push(json, size, digit, c[0]);
276
- i++;
277
- }
278
- }
279
- return json;
280
- }
281
- function pop(json, size) {
282
- var overflow = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 8;
283
- json = bn(json);
284
- overflow = bn(overflow);
285
- var l = 0n;
286
- var ll = 0n;
287
- var lnum = 0n;
288
- var series = 0n;
289
- var snum = 0n;
290
- var link = 0n;
291
- var _l = 0n;
292
- var _d = 0n;
293
- for (var l2 = 0n; l2 < size; l2++) {
294
- if (json[l2] != 0) {
295
- _l = l2;
296
- var x = json[l2];
297
- var d = digits(x);
298
- var p = d;
299
- var on = 0n;
300
- var i = 0n;
301
- while (x > 0) {
302
- var n = x / Math.pow(10n, p - 1n) >> 0n;
303
- x -= Math.pow(10n, p - 1n) * n;
304
- p--;
305
- i++;
306
- if (on == 0) {
307
- on = 1n;
308
- } else {
309
- var len = n;
310
- if (link == 0) {
311
- ll = i - 1n;
312
- l = l2;
313
- _d = d;
314
- }
315
- lnum = len;
316
- snum = 0n;
317
- if (len == 0) {
318
- var n = x / Math.pow(10n, p - 1n) >> 0n;
319
- var len2 = x / Math.pow(10n, p - 1n) >> 0n;
320
- series = len2;
321
- x -= Math.pow(10n, p - 1n) * n;
322
- p--;
323
- i++;
324
- for (var i2 = 0n; i2 < len2; i2++) {
325
- var n = x / Math.pow(10n, p - 1n) >> 0n;
326
- snum = snum * 10n + n;
327
- x -= Math.pow(10n, p - 1n) * n;
328
- p--;
329
- i++;
330
- }
331
- } else {
332
- var _len = len;
333
- if (len == overflow + 1n) {
334
- link = 2n;
335
- _len = overflow;
336
- } else if (link > 0) {
337
- link--;
338
- }
339
- series = 0n;
340
- for (var i2 = 0n; i2 < _len; i2++) {
341
- var n = x / Math.pow(10n, p - 1n) >> 0n;
342
- x -= Math.pow(10n, p - 1n) * n;
343
- p--;
344
- i++;
345
- }
346
- }
347
- }
348
- }
349
- }
350
- }
351
- if (link == 1) {
352
- for (var i = l + 1n; i <= _l; i++) {
353
- json[i] = 0n;
354
- }
355
- if (ll < 2) {
356
- json[l] = 0n;
357
- } else {
358
- json[l] = json[l] / Math.pow(10n, _d - ll) >> 0n;
359
- }
360
- } else if (series != 0) {
361
- if (series == 3) {
362
- json[l] = json[l] / Math.pow(10n, _d - ll) >> 0n;
363
- json[l] = json[l] * 10n + 1n;
364
- var n = snum / Math.pow(10n, 2n) >> 0n;
365
- json[l] = json[l] * 10n + n;
366
- json[l] = json[l] * 10n + 1n;
367
- var n2 = (snum / 10n >> 0n) - n * 10n;
368
- json[l] = json[l] * 10n + n2;
369
- } else {
370
- json[l] = json[l] / Math.pow(10n, _d - ll - 1n) >> 0n;
371
- json[l] = json[l] * 10n + (series - 1n);
372
- snum = snum / 10n >> 0n;
373
- json[l] = json[l] * Math.pow(10n, series - 1n) + snum;
374
- }
375
- } else if (ll < 2) {
376
- json[l] = 0n;
377
- } else {
378
- json[l] = json[l] / Math.pow(10n, d - ll) >> 0n;
379
- }
380
- return json;
381
- }
382
- function push(json, size, digit, c) {
383
- var overflow = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : 8;
384
- overflow = bn(overflow);
385
- json = bn(json);
386
- c = bn(c);
387
- var i4 = 0n;
388
- for (var i = i4; i < size; i++) {
389
- if (json[i] != 0) i4 = i;
390
- }
391
- var init = 0n;
392
- while (c > 0 || init == 0) {
393
- init = 1;
394
- var len = digits(c);
395
- var _len = len;
396
- var _len2 = len;
397
- var _c = c;
398
- if (overflow < len) {
399
- _len = overflow;
400
- _len2 = overflow + 1n;
401
- _c = c / Math.pow(10n, len - overflow) >> 0n;
402
- c -= _c * Math.pow(10n, len - overflow);
403
- } else {
404
- c = 0n;
405
- }
406
- var appended = 0;
407
- for (var i = i4; i < size; i++) {
408
- var d = digits(json[i]);
409
- var one = 0n;
410
- var ones = 0n;
411
- var nums = 0n;
412
- if (_len == 1 && digit > d) {
413
- var x = json[i] - Math.pow(10n, d - 1n);
414
- var i2 = 1n;
415
- while (i2 < d) {
416
- var len = 0n;
417
- len = x / Math.pow(10n, d - i2 - 1n) >> 0n;
418
- x = x - len * Math.pow(10n, d - i2 - 1n);
419
- if (len == 1) {
420
- if (ones == 0) one = i2;
421
- ones++;
422
- } else if (len != 0) {
423
- ones = 0n;
424
- nums = 0n;
425
- } else {
426
- one = i2;
427
- }
428
- i2++;
429
- if (len == 0) {
430
- var len3 = x / Math.pow(10n, d - i2 - 1n) >> 0n;
431
- x = x - len3 * Math.pow(10n, d - i2 - 1n);
432
- i2++;
433
- ones = len3;
434
- for (var i3 = 0n; i3 < len3; i3++) {
435
- var len2 = x / Math.pow(10n, d - i2 - 1n) >> 0n;
436
- x = x - len2 * Math.pow(10n, d - i2 - 1n);
437
- nums = nums * 10n + len2;
438
- i2++;
439
- }
440
- } else {
441
- for (var i3 = 0n; i3 < len; i3++) {
442
- var len2 = x / Math.pow(10n, d - i2 - 1n) >> 0n;
443
- x = x - len2 * Math.pow(10n, d - i2 - 1n);
444
- if (len == 1) nums = nums * 10n + len2;
445
- i2++;
446
- }
447
- }
448
- }
449
- if (ones == 2) nums = nums * 10n + _c;
450
- }
451
- if (ones > 2 && ones < 9) {
452
- var x = json[i] / Math.pow(10n, d - one - 1n) >> 0n;
453
- x = x * 10n + ones + 1n;
454
- x = x * Math.pow(10n, ones) + nums;
455
- x = x * 10n + _c;
456
- json[i] = x;
457
- i4 = i;
458
- appended = 1;
459
- } else if (ones == 2) {
460
- var x = json[i] / Math.pow(10n, d - one) >> 0n;
461
- x = x * 10n + 0n;
462
- x = x * 10n + ones + 1n;
463
- x = x * Math.pow(10n, ones + 1n) + nums;
464
- json[i] = x;
465
- i4 = i;
466
- appended = 1;
467
- } else if (digit > d + _len && appended == 0) {
468
- if (json[i] == 0) json[i] = 1n;
469
- json[i] = json[i] * 10n + _len2;
470
- json[i] = json[i] * Math.pow(10n, _len) + _c;
471
- i4 = i;
472
- appended = 1;
473
- }
474
- }
475
- }
476
- return json;
477
- }
478
- function str(arr) {
479
- return arr.map(function (n) {
480
- return n.toString();
481
- });
482
- }
483
- function bn(arr) {
484
- if (typeof arr == "number") return BigInt(arr);
485
- if (!Array.isArray(arr)) return arr;
486
- return arr.map(function (n) {
487
- return typeof n != "number" ? n : BigInt(n);
488
- });
489
- }
490
- function next(json, c) {
491
- json = bn(json);
492
- c = bn(c);
493
- if (c[5] == 1) {
494
- return bn([0, c[1], 0, 0, 0, 1, c[6], c[7], c[8]]);
495
- }
496
- var prev = 0n;
497
- for (var j = c[2]; j < c[1]; j++) {
498
- var d = digits(json[j]);
499
- if (json[j] > 0) {
500
- var p = c[4] == 0 ? digits(json[j]) : c[4];
501
- var x = c[4] == 0 ? json[j] : c[3];
502
- var cur = 0n;
503
- var num = 0n;
504
- var on = c[4] == 0 ? 0n : c[7];
505
- var len = c[4] == 0 ? 0n : c[8];
506
- while (p > 0) {
507
- var n = x / Math.pow(10n, p - 1n) >> 0n;
508
- if (on == 0) {
509
- on = 1n;
510
- } else if (on == 1) {
511
- if (n == 0) {
512
- on = 4n;
513
- } else {
514
- if (n == 9) {
515
- len = 8n;
516
- on = 3n;
517
- } else {
518
- on = 2n;
519
- len = n;
520
- }
521
- cur = 0n;
522
- }
523
- } else if (on == 4) {
524
- on = 5n;
525
- len = n;
526
- } else {
527
- num += n * Math.pow(10n, len - cur - 1n);
528
- cur++;
529
- if (on == 5) {
530
- num = n;
531
- len--;
532
- x -= Math.pow(10n, p - 1n) * n;
533
- p--;
534
- var done = 0n;
535
- if (p == 0) {
536
- j++;
537
- if (c[1] == j || json[j] == 0) {
538
- x = 0n;
539
- done = 1n;
540
- } else {
541
- x = json[j];
542
- }
543
- }
544
- if (len == 0) on = 1n;
545
- return bn([num, c[1], j, x, p, done, c[6], on, len]);
546
- } else if (cur == len) {
547
- prev *= Math.pow(10n, len);
548
- if (on == 3) {
549
- prev += num;
550
- } else {
551
- num += prev;
552
- x -= Math.pow(10n, p - 1n) * n;
553
- p--;
554
- var done = 0n;
555
- if (p == 0) {
556
- j++;
557
- if (c[1] == j || json[j] == 0) {
558
- x = 0n;
559
- done = 1n;
560
- } else {
561
- x = json[j];
562
- }
563
- }
564
- return bn([num, c[1], j, x, p, done, c[6], 1, len]);
565
- }
566
- cur = 0n;
567
- on = 1n;
568
- len = 0n;
569
- num = 0n;
570
- }
571
- }
572
- x -= Math.pow(10n, p - 1n) * n;
573
- p--;
574
- }
575
- } else {
576
- return bn([0, c[1], 0, 0, 0, 1, c[6], 0, 0]);
577
- }
578
- }
579
- return bn([0, c[1], 0, 0, 0, 1, c[6], 0, 0]);
580
- }
package/esm/package.json DELETED
@@ -1,3 +0,0 @@
1
- {
2
- "type": "module"
3
- }
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes