mol_jsx_lib 0.0.1518 → 0.0.1520
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.
- package/node.d.ts +4 -0
- package/node.d.ts.map +1 -1
- package/node.deps.json +1 -1
- package/node.js +27 -1
- package/node.js.map +1 -1
- package/node.mjs +27 -1
- package/node.test.js +51 -2
- package/node.test.js.map +1 -1
- package/package.json +3 -1
package/node.mjs
CHANGED
|
@@ -1739,6 +1739,30 @@ var $;
|
|
|
1739
1739
|
$.$mol_tree2_from_string = $mol_tree2_from_string;
|
|
1740
1740
|
})($ || ($ = {}));
|
|
1741
1741
|
|
|
1742
|
+
;
|
|
1743
|
+
"use strict";
|
|
1744
|
+
var $;
|
|
1745
|
+
(function ($) {
|
|
1746
|
+
function $mol_array_chunks(array, rule) {
|
|
1747
|
+
const br = typeof rule === 'number' ? (_, i) => i % rule === 0 : rule;
|
|
1748
|
+
let chunk = [];
|
|
1749
|
+
const chunks = [];
|
|
1750
|
+
for (let i = 0; i < array.length; ++i) {
|
|
1751
|
+
const item = array[i];
|
|
1752
|
+
if (br(item, i)) {
|
|
1753
|
+
if (chunk.length)
|
|
1754
|
+
chunks.push(chunk);
|
|
1755
|
+
chunk = [];
|
|
1756
|
+
}
|
|
1757
|
+
chunk.push(item);
|
|
1758
|
+
}
|
|
1759
|
+
if (chunk.length)
|
|
1760
|
+
chunks.push(chunk);
|
|
1761
|
+
return chunks;
|
|
1762
|
+
}
|
|
1763
|
+
$.$mol_array_chunks = $mol_array_chunks;
|
|
1764
|
+
})($ || ($ = {}));
|
|
1765
|
+
|
|
1742
1766
|
;
|
|
1743
1767
|
"use strict";
|
|
1744
1768
|
var $;
|
|
@@ -1759,7 +1783,9 @@ var $;
|
|
|
1759
1783
|
}
|
|
1760
1784
|
if (ArrayBuffer.isView(json)) {
|
|
1761
1785
|
const buf = new Uint8Array(json.buffer, json.byteOffset, json.byteLength);
|
|
1762
|
-
|
|
1786
|
+
const codes = [...buf].map(b => b.toString(16).toUpperCase().padStart(2, '0'));
|
|
1787
|
+
const str = $mol_array_chunks(codes, 8).map(c => c.join(' ')).join('\n');
|
|
1788
|
+
return $mol_tree2.data(str, [], span);
|
|
1763
1789
|
}
|
|
1764
1790
|
if (json instanceof Date) {
|
|
1765
1791
|
return new $mol_tree2('', json.toISOString(), [], span);
|
package/node.test.js
CHANGED
|
@@ -1730,6 +1730,30 @@ var $;
|
|
|
1730
1730
|
$.$mol_tree2_from_string = $mol_tree2_from_string;
|
|
1731
1731
|
})($ || ($ = {}));
|
|
1732
1732
|
|
|
1733
|
+
;
|
|
1734
|
+
"use strict";
|
|
1735
|
+
var $;
|
|
1736
|
+
(function ($) {
|
|
1737
|
+
function $mol_array_chunks(array, rule) {
|
|
1738
|
+
const br = typeof rule === 'number' ? (_, i) => i % rule === 0 : rule;
|
|
1739
|
+
let chunk = [];
|
|
1740
|
+
const chunks = [];
|
|
1741
|
+
for (let i = 0; i < array.length; ++i) {
|
|
1742
|
+
const item = array[i];
|
|
1743
|
+
if (br(item, i)) {
|
|
1744
|
+
if (chunk.length)
|
|
1745
|
+
chunks.push(chunk);
|
|
1746
|
+
chunk = [];
|
|
1747
|
+
}
|
|
1748
|
+
chunk.push(item);
|
|
1749
|
+
}
|
|
1750
|
+
if (chunk.length)
|
|
1751
|
+
chunks.push(chunk);
|
|
1752
|
+
return chunks;
|
|
1753
|
+
}
|
|
1754
|
+
$.$mol_array_chunks = $mol_array_chunks;
|
|
1755
|
+
})($ || ($ = {}));
|
|
1756
|
+
|
|
1733
1757
|
;
|
|
1734
1758
|
"use strict";
|
|
1735
1759
|
var $;
|
|
@@ -1750,7 +1774,9 @@ var $;
|
|
|
1750
1774
|
}
|
|
1751
1775
|
if (ArrayBuffer.isView(json)) {
|
|
1752
1776
|
const buf = new Uint8Array(json.buffer, json.byteOffset, json.byteLength);
|
|
1753
|
-
|
|
1777
|
+
const codes = [...buf].map(b => b.toString(16).toUpperCase().padStart(2, '0'));
|
|
1778
|
+
const str = $mol_array_chunks(codes, 8).map(c => c.join(' ')).join('\n');
|
|
1779
|
+
return $mol_tree2.data(str, [], span);
|
|
1754
1780
|
}
|
|
1755
1781
|
if (json instanceof Date) {
|
|
1756
1782
|
return new $mol_tree2('', json.toISOString(), [], span);
|
|
@@ -3738,6 +3764,29 @@ var $;
|
|
|
3738
3764
|
});
|
|
3739
3765
|
})($ || ($ = {}));
|
|
3740
3766
|
|
|
3767
|
+
;
|
|
3768
|
+
"use strict";
|
|
3769
|
+
var $;
|
|
3770
|
+
(function ($) {
|
|
3771
|
+
$mol_test({
|
|
3772
|
+
'empty array'() {
|
|
3773
|
+
$mol_assert_equal($mol_array_chunks([], () => true), []);
|
|
3774
|
+
},
|
|
3775
|
+
'one chunk'() {
|
|
3776
|
+
$mol_assert_equal($mol_array_chunks([1, 2, 3, 4, 5], () => false), [[1, 2, 3, 4, 5]]);
|
|
3777
|
+
},
|
|
3778
|
+
'fixed size chunk'() {
|
|
3779
|
+
$mol_assert_equal($mol_array_chunks([1, 2, 3, 4, 5], 3), [[1, 2, 3], [4, 5]]);
|
|
3780
|
+
},
|
|
3781
|
+
'first empty chunk'() {
|
|
3782
|
+
$mol_assert_equal($mol_array_chunks([1, 2, 3, 4, 5], (_, i) => i === 0), [[1, 2, 3, 4, 5]]);
|
|
3783
|
+
},
|
|
3784
|
+
'chunk for every item'() {
|
|
3785
|
+
$mol_assert_equal($mol_array_chunks([1, 2, 3, 4, 5], () => true), [[1], [2], [3], [4], [5]]);
|
|
3786
|
+
},
|
|
3787
|
+
});
|
|
3788
|
+
})($ || ($ = {}));
|
|
3789
|
+
|
|
3741
3790
|
;
|
|
3742
3791
|
"use strict";
|
|
3743
3792
|
var $;
|
|
@@ -3817,7 +3866,7 @@ var $;
|
|
|
3817
3866
|
$mol_assert_equal($mol_tree2_from_json([]).toString(), '/\n');
|
|
3818
3867
|
$mol_assert_equal($mol_tree2_from_json([false, true]).toString(), '/\n\tfalse\n\ttrue\n');
|
|
3819
3868
|
$mol_assert_equal($mol_tree2_from_json([0, 1, 2.3]).toString(), '/\n\t0\n\t1\n\t2.3\n');
|
|
3820
|
-
$mol_assert_equal($mol_tree2_from_json(new Uint16Array([1, 10, 256])).toString(), '
|
|
3869
|
+
$mol_assert_equal($mol_tree2_from_json(new Uint16Array([1, 10, 255, 256, 65535])).toString(), '\\01 00 0A 00 FF 00 00 01\n\\FF FF\n');
|
|
3821
3870
|
$mol_assert_equal($mol_tree2_from_json(['', 'foo', 'bar\nbaz']).toString(), '/\n\t\\\n\t\\foo\n\t\\\n\t\t\\bar\n\t\t\\baz\n');
|
|
3822
3871
|
$mol_assert_equal($mol_tree2_from_json({ 'foo': false, 'bar\nbaz': 'lol' }).toString(), '*\n\tfoo false\n\t\\\n\t\t\\bar\n\t\t\\baz\n\t\t\\lol\n');
|
|
3823
3872
|
},
|