Socket
Socket
Sign inDemoInstall

@rimbu/sorted

Package Overview
Dependencies
Maintainers
1
Versions
59
Alerts
File Explorer

Advanced tools

Socket logo

Install Socket

Detect and block malicious and high-risk dependencies

Install

@rimbu/sorted - npm Package Compare versions

Comparing version 0.9.9 to 0.9.10

28

dist/main/common/base.js

@@ -11,3 +11,3 @@ "use strict";

var SortedEmpty = /** @class */ (function (_super) {
(0, tslib_1.__extends)(SortedEmpty, _super);
tslib_1.__extends(SortedEmpty, _super);
function SortedEmpty() {

@@ -38,3 +38,3 @@ return _super !== null && _super.apply(this, arguments) || this;

var SortedNonEmptyBase = /** @class */ (function (_super) {
(0, tslib_1.__extends)(SortedNonEmptyBase, _super);
tslib_1.__extends(SortedNonEmptyBase, _super);
function SortedNonEmptyBase() {

@@ -106,3 +106,3 @@ return _super !== null && _super.apply(this, arguments) || this;

function innerDeleteMin(source) {
var _a = (0, tslib_1.__read)(source.children[0].deleteMin(), 2), min = _a[0], newFirst = _a[1];
var _a = tslib_1.__read(source.children[0].deleteMin(), 2), min = _a[0], newFirst = _a[1];
var newSelf = source.normalizeIncreaseChild(0, newFirst, source.size - 1);

@@ -114,3 +114,3 @@ return [min, newSelf];

var lastChildIndex = source.children.length - 1;
var _a = (0, tslib_1.__read)(source.children[lastChildIndex].deleteMax(), 2), max = _a[0], newLast = _a[1];
var _a = tslib_1.__read(source.children[lastChildIndex].deleteMax(), 2), max = _a[0], newLast = _a[1];
var newSelf = source.normalizeIncreaseChild(lastChildIndex, newLast, source.size - 1);

@@ -193,3 +193,3 @@ return [max, newSelf];

// cannot shift
var _a = (0, tslib_1.__read)(newChild.mutateSplitRight(), 2), upEntry = _a[0], rightChild_1 = _a[1];
var _a = tslib_1.__read(newChild.mutateSplitRight(), 2), upEntry = _a[0], rightChild_1 = _a[1];
var newEntries_1 = base_1.Arr.insert(source.entries, childIndex, upEntry);

@@ -203,3 +203,3 @@ var newChildren_1 = base_1.Arr.splice(source.children, childIndex, 1, newChild, rightChild_1);

// shiftleft
var _b = (0, tslib_1.__read)(newChild.mutateGiveToLeft(leftChild, source.entries[childIndex - 1]), 2), newSep_1 = _b[0], newLeft = _b[1];
var _b = tslib_1.__read(newChild.mutateGiveToLeft(leftChild, source.entries[childIndex - 1]), 2), newSep_1 = _b[0], newLeft = _b[1];
var newEntries_2 = base_1.Arr.update(source.entries, childIndex - 1, newSep_1);

@@ -210,3 +210,3 @@ var newChildren_2 = base_1.Arr.splice(source.children, childIndex - 1, 2, newLeft, newChild);

// shiftright
var _c = (0, tslib_1.__read)(newChild.mutateGiveToRight(rightChild, source.entries[childIndex]), 2), newSep = _c[0], newRight = _c[1];
var _c = tslib_1.__read(newChild.mutateGiveToRight(rightChild, source.entries[childIndex]), 2), newSep = _c[0], newRight = _c[1];
var newEntries = base_1.Arr.update(source.entries, childIndex, newSep);

@@ -245,3 +245,3 @@ var newChildren = base_1.Arr.splice(source.children, childIndex, 2, newChild, newRight);

// get from left
var _a = (0, tslib_1.__read)(newChild.mutateGetFromLeft(leftChild, source.entries[childIndex - 1]), 2), newSep_2 = _a[0], newLeft = _a[1];
var _a = tslib_1.__read(newChild.mutateGetFromLeft(leftChild, source.entries[childIndex - 1]), 2), newSep_2 = _a[0], newLeft = _a[1];
var newEntries_5 = base_1.Arr.update(source.entries, childIndex - 1, newSep_2);

@@ -252,3 +252,3 @@ var newChildren_6 = base_1.Arr.splice(source.children, childIndex - 1, 2, newLeft, newChild);

// get from right
var _b = (0, tslib_1.__read)(newChild.mutateGetFromRight(rightChild, source.entries[childIndex]), 2), newSep = _b[0], newRight = _b[1];
var _b = tslib_1.__read(newChild.mutateGetFromRight(rightChild, source.entries[childIndex]), 2), newSep = _b[0], newRight = _b[1];
var newEntries = base_1.Arr.update(source.entries, childIndex, newSep);

@@ -300,3 +300,3 @@ var newChildren = base_1.Arr.splice(source.children, childIndex, 2, newChild, newRight);

if (Array.isArray(indexResult)) {
var _a = (0, tslib_1.__read)(indexResult, 2), childIndex = _a[0], inChildIndex = _a[1];
var _a = tslib_1.__read(indexResult, 2), childIndex = _a[0], inChildIndex = _a[1];
var untilChild = childIndex;

@@ -330,3 +330,3 @@ var entries_1 = source.entries.slice(0, untilChild);

if (Array.isArray(indexResult)) {
var _a = (0, tslib_1.__read)(indexResult, 2), childIndex = _a[0], inChildIndex = _a[1];
var _a = tslib_1.__read(indexResult, 2), childIndex = _a[0], inChildIndex = _a[1];
var fromChild = childIndex;

@@ -361,3 +361,3 @@ var entries_2 = source.entries.slice(fromChild);

return stream_1.Stream.empty();
var _a = (0, tslib_1.__read)(result, 2), startIndex = _a[0], endIndex = _a[1];
var _a = tslib_1.__read(result, 2), startIndex = _a[0], endIndex = _a[1];
var startSubIndex = innerGetSubIndex(source, startIndex);

@@ -572,3 +572,3 @@ var endSubIndex = innerGetSubIndex(source, endIndex);

// join left
var _a = (0, tslib_1.__read)(this.entries.splice(childIndex - 1, 1), 1), down_1 = _a[0];
var _a = tslib_1.__read(this.entries.splice(childIndex - 1, 1), 1), down_1 = _a[0];
leftChild.entries.push(down_1);

@@ -584,3 +584,3 @@ leftChild.entries = leftChild.entries.concat(child.entries);

// join right
var _b = (0, tslib_1.__read)(this.entries.splice(childIndex, 1), 1), down = _b[0];
var _b = tslib_1.__read(this.entries.splice(childIndex, 1), 1), down = _b[0];
rightChild.entries.unshift(down);

@@ -587,0 +587,0 @@ rightChild.entries = child.entries.concat(rightChild.entries);

"use strict";
Object.defineProperty(exports, "__esModule", { value: true });
var tslib_1 = require("tslib");
(0, tslib_1.__exportStar)(require("./sorted-index"), exports);
(0, tslib_1.__exportStar)(require("./base"), exports);
tslib_1.__exportStar(require("./sorted-index"), exports);
tslib_1.__exportStar(require("./base"), exports);
//# sourceMappingURL=index.js.map

@@ -15,4 +15,4 @@ "use strict";

var tslib_1 = require("tslib");
(0, tslib_1.__exportStar)(require("@rimbu/sorted/map"), exports);
(0, tslib_1.__exportStar)(require("@rimbu/sorted/set"), exports);
tslib_1.__exportStar(require("@rimbu/sorted/map"), exports);
tslib_1.__exportStar(require("@rimbu/sorted/set"), exports);
//# sourceMappingURL=index.js.map

@@ -11,7 +11,8 @@ "use strict";

var SortedMapBuilder = /** @class */ (function (_super) {
(0, tslib_1.__extends)(SortedMapBuilder, _super);
tslib_1.__extends(SortedMapBuilder, _super);
function SortedMapBuilder(context, source, _entries, _children, size) {
if (size === void 0) { size = (_a = source === null || source === void 0 ? void 0 : source.size) !== null && _a !== void 0 ? _a : 0; }
var _this = this;
var _a;
var _this = _super.call(this) || this;
_this = _super.call(this) || this;
_this.context = context;

@@ -18,0 +19,0 @@ _this.source = source;

@@ -9,3 +9,3 @@ "use strict";

var SortedMapContext = /** @class */ (function (_super) {
(0, tslib_1.__extends)(SortedMapContext, _super);
tslib_1.__extends(SortedMapContext, _super);
function SortedMapContext(blockSizeBits, comp) {

@@ -12,0 +12,0 @@ var _this = _super.call(this) || this;

@@ -11,3 +11,3 @@ "use strict";

var SortedMapEmpty = /** @class */ (function (_super) {
(0, tslib_1.__extends)(SortedMapEmpty, _super);
tslib_1.__extends(SortedMapEmpty, _super);
function SortedMapEmpty(context) {

@@ -106,3 +106,3 @@ var _this = _super.call(this) || this;

var SortedMapNode = /** @class */ (function (_super) {
(0, tslib_1.__extends)(SortedMapNode, _super);
tslib_1.__extends(SortedMapNode, _super);
function SortedMapNode() {

@@ -119,3 +119,3 @@ return _super !== null && _super.apply(this, arguments) || this;

if (undefined !== start) {
var _b = (0, tslib_1.__read)(start, 2), startValue = _b[0], startInclude = _b[1];
var _b = tslib_1.__read(start, 2), startValue = _b[0], startInclude = _b[1];
startIndex = this.getInsertIndexOf(startValue);

@@ -130,3 +130,3 @@ if (startIndex < 0) {

if (undefined !== end) {
var _c = (0, tslib_1.__read)(end, 2), endValue = _c[0], endInclude = _c[1];
var _c = tslib_1.__read(end, 2), endValue = _c[0], endInclude = _c[1];
endIndex = this.getInsertIndexOf(endValue);

@@ -267,3 +267,3 @@ if (endIndex < 0)

return this;
var _a = (0, tslib_1.__read)(indexRange, 2), start = _a[0], end = _a[1];
var _a = tslib_1.__read(indexRange, 2), start = _a[0], end = _a[1];
return this.drop(start).take(end - start + 1);

@@ -299,3 +299,3 @@ };

var SortedMapLeaf = /** @class */ (function (_super) {
(0, tslib_1.__extends)(SortedMapLeaf, _super);
tslib_1.__extends(SortedMapLeaf, _super);
function SortedMapLeaf(context, entries) {

@@ -450,3 +450,3 @@ var _this = _super.call(this) || this;

var size = this.size;
var _a = (0, tslib_1.__read)(this.mutateSplitRight(), 2), upEntry = _a[0], rightNode = _a[1];
var _a = tslib_1.__read(this.mutateSplitRight(), 2), upEntry = _a[0], rightNode = _a[1];
return this.context.inner([upEntry], [this, rightNode], size);

@@ -458,3 +458,3 @@ };

var SortedMapInner = /** @class */ (function (_super) {
(0, tslib_1.__extends)(SortedMapInner, _super);
tslib_1.__extends(SortedMapInner, _super);
function SortedMapInner(context, entries, children, size) {

@@ -488,3 +488,3 @@ var _this = _super.call(this) || this;

return stream_1.Stream.zipAll(token, stream_1.Stream.fromArray(this.children, undefined, reversed), stream_1.Stream.fromArray(this.entries, undefined, reversed)).flatMap(function (_a) {
var _b = (0, tslib_1.__read)(_a, 2), child = _b[0], e = _b[1];
var _b = tslib_1.__read(_a, 2), child = _b[0], e = _b[1];
if (token === child)

@@ -615,3 +615,3 @@ base_1.RimbuError.throwInvalidStateError();

if (leftChild.entries.length >= rightChild.entries.length) {
var _a = (0, tslib_1.__read)(leftChild.deleteMax(), 2), max = _a[0], newLeft = _a[1];
var _a = tslib_1.__read(leftChild.deleteMax(), 2), max = _a[0], newLeft = _a[1];
var newEntries_4 = base_1.Arr.update(this.entries, entryIndex, max);

@@ -621,3 +621,3 @@ var newSelf_1 = this.copy(newEntries_4);

}
var _b = (0, tslib_1.__read)(rightChild.deleteMin(), 2), min = _b[0], newRight = _b[1];
var _b = tslib_1.__read(rightChild.deleteMin(), 2), min = _b[0], newRight = _b[1];
var newEntries_5 = base_1.Arr.update(this.entries, entryIndex, min);

@@ -690,3 +690,3 @@ var newSelf = this.copy(newEntries_5);

var size = this.size;
var _a = (0, tslib_1.__read)(this.mutateSplitRight(), 2), upEntry = _a[0], rightNode = _a[1];
var _a = tslib_1.__read(this.mutateSplitRight(), 2), upEntry = _a[0], rightNode = _a[1];
return this.copy([upEntry], [this, rightNode], size);

@@ -693,0 +693,0 @@ };

"use strict";
Object.defineProperty(exports, "__esModule", { value: true });
var tslib_1 = require("tslib");
(0, tslib_1.__exportStar)(require("./creators"), exports);
(0, tslib_1.__exportStar)(require("./implementation/builder"), exports);
(0, tslib_1.__exportStar)(require("./implementation/immutable"), exports);
(0, tslib_1.__exportStar)(require("./implementation/context"), exports);
tslib_1.__exportStar(require("./creators"), exports);
tslib_1.__exportStar(require("./implementation/builder"), exports);
tslib_1.__exportStar(require("./implementation/immutable"), exports);
tslib_1.__exportStar(require("./implementation/context"), exports);
//# sourceMappingURL=index.js.map

@@ -11,3 +11,3 @@ "use strict";

var tslib_1 = require("tslib");
(0, tslib_1.__exportStar)(require("./interface"), exports);
tslib_1.__exportStar(require("./interface"), exports);
//# sourceMappingURL=index.js.map

@@ -7,5 +7,5 @@ "use strict";

var _defaultContext = (0, map_custom_1.createSortedMapContext)();
exports.SortedMap = (0, tslib_1.__assign)((0, tslib_1.__assign)({}, _defaultContext), { createContext: map_custom_1.createSortedMapContext, defaultContext: function () {
exports.SortedMap = tslib_1.__assign(tslib_1.__assign({}, _defaultContext), { createContext: map_custom_1.createSortedMapContext, defaultContext: function () {
return _defaultContext;
} });
//# sourceMappingURL=index.js.map

@@ -8,7 +8,8 @@ "use strict";

var SortedSetBuilder = /** @class */ (function (_super) {
(0, tslib_1.__extends)(SortedSetBuilder, _super);
tslib_1.__extends(SortedSetBuilder, _super);
function SortedSetBuilder(context, source, _entries, _children, size) {
if (size === void 0) { size = (_a = source === null || source === void 0 ? void 0 : source.size) !== null && _a !== void 0 ? _a : 0; }
var _this = this;
var _a;
var _this = _super.call(this) || this;
_this = _super.call(this) || this;
_this.context = context;

@@ -15,0 +16,0 @@ _this.source = source;

@@ -9,3 +9,3 @@ "use strict";

var SortedSetContext = /** @class */ (function (_super) {
(0, tslib_1.__extends)(SortedSetContext, _super);
tslib_1.__extends(SortedSetContext, _super);
function SortedSetContext(blockSizeBits, comp) {

@@ -12,0 +12,0 @@ var _this = _super.call(this) || this;

@@ -11,3 +11,3 @@ "use strict";

var SortedSetEmpty = /** @class */ (function (_super) {
(0, tslib_1.__extends)(SortedSetEmpty, _super);
tslib_1.__extends(SortedSetEmpty, _super);
function SortedSetEmpty(context) {

@@ -75,3 +75,3 @@ var _this = _super.call(this) || this;

var SortedSetNode = /** @class */ (function (_super) {
(0, tslib_1.__extends)(SortedSetNode, _super);
tslib_1.__extends(SortedSetNode, _super);
function SortedSetNode() {

@@ -88,3 +88,3 @@ return _super !== null && _super.apply(this, arguments) || this;

if (undefined !== start) {
var _b = (0, tslib_1.__read)(start, 2), startValue = _b[0], startInclude = _b[1];
var _b = tslib_1.__read(start, 2), startValue = _b[0], startInclude = _b[1];
startIndex = this.getInsertIndexOf(startValue);

@@ -97,3 +97,3 @@ if (startIndex < 0)

if (undefined !== end) {
var _c = (0, tslib_1.__read)(end, 2), endValue = _c[0], endInclude = _c[1];
var _c = tslib_1.__read(end, 2), endValue = _c[0], endInclude = _c[1];
endIndex = this.getInsertIndexOf(endValue);

@@ -168,3 +168,3 @@ if (endIndex < 0)

return this;
var _a = (0, tslib_1.__read)(indexRange, 2), start = _a[0], end = _a[1];
var _a = tslib_1.__read(indexRange, 2), start = _a[0], end = _a[1];
return this.drop(start).take(end - start + 1);

@@ -259,3 +259,3 @@ };

var SortedSetLeaf = /** @class */ (function (_super) {
(0, tslib_1.__extends)(SortedSetLeaf, _super);
tslib_1.__extends(SortedSetLeaf, _super);
function SortedSetLeaf(context, entries) {

@@ -379,3 +379,3 @@ var _this = _super.call(this) || this;

var size = this.size;
var _a = (0, tslib_1.__read)(this.mutateSplitRight(), 2), upEntry = _a[0], rightNode = _a[1];
var _a = tslib_1.__read(this.mutateSplitRight(), 2), upEntry = _a[0], rightNode = _a[1];
return this.context.inner([upEntry], [this, rightNode], size);

@@ -387,3 +387,3 @@ };

var SortedSetInner = /** @class */ (function (_super) {
(0, tslib_1.__extends)(SortedSetInner, _super);
tslib_1.__extends(SortedSetInner, _super);
function SortedSetInner(context, entries, children, size) {

@@ -418,3 +418,3 @@ var _this = _super.call(this) || this;

return stream_1.Stream.zipAll(token, stream_1.Stream.fromArray(this.children, undefined, reversed), stream_1.Stream.fromArray(this.entries, undefined, reversed)).flatMap(function (_a) {
var _b = (0, tslib_1.__read)(_a, 2), child = _b[0], e = _b[1];
var _b = tslib_1.__read(_a, 2), child = _b[0], e = _b[1];
if (token === child)

@@ -561,3 +561,3 @@ base_1.RimbuError.throwInvalidStateError();

if (leftChild.entries.length >= rightChild.entries.length) {
var _a = (0, tslib_1.__read)(leftChild.deleteMax(), 2), max = _a[0], newLeft = _a[1];
var _a = tslib_1.__read(leftChild.deleteMax(), 2), max = _a[0], newLeft = _a[1];
var newEntries_2 = base_1.Arr.update(this.entries, entryIndex, max);

@@ -567,3 +567,3 @@ var newSelf_1 = this.copy(newEntries_2);

}
var _b = (0, tslib_1.__read)(rightChild.deleteMin(), 2), min = _b[0], newRight = _b[1];
var _b = tslib_1.__read(rightChild.deleteMin(), 2), min = _b[0], newRight = _b[1];
var newEntries = base_1.Arr.update(this.entries, entryIndex, min);

@@ -598,3 +598,3 @@ var newSelf = this.copy(newEntries);

var size = this.size;
var _a = (0, tslib_1.__read)(this.mutateSplitRight(), 2), upEntry = _a[0], rightNode = _a[1];
var _a = tslib_1.__read(this.mutateSplitRight(), 2), upEntry = _a[0], rightNode = _a[1];
return this.copy([upEntry], [this, rightNode], size);

@@ -601,0 +601,0 @@ };

"use strict";
Object.defineProperty(exports, "__esModule", { value: true });
var tslib_1 = require("tslib");
(0, tslib_1.__exportStar)(require("./creators"), exports);
(0, tslib_1.__exportStar)(require("./implementation/builder"), exports);
(0, tslib_1.__exportStar)(require("./implementation/immutable"), exports);
(0, tslib_1.__exportStar)(require("./implementation/context"), exports);
tslib_1.__exportStar(require("./creators"), exports);
tslib_1.__exportStar(require("./implementation/builder"), exports);
tslib_1.__exportStar(require("./implementation/immutable"), exports);
tslib_1.__exportStar(require("./implementation/context"), exports);
//# sourceMappingURL=index.js.map

@@ -11,3 +11,3 @@ "use strict";

var tslib_1 = require("tslib");
(0, tslib_1.__exportStar)(require("./interface"), exports);
tslib_1.__exportStar(require("./interface"), exports);
//# sourceMappingURL=index.js.map

@@ -7,5 +7,5 @@ "use strict";

var _defaultContext = (0, set_custom_1.createSortedSetContext)();
exports.SortedSet = (0, tslib_1.__assign)((0, tslib_1.__assign)({}, _defaultContext), { createContext: set_custom_1.createSortedSetContext, defaultContext: function () {
exports.SortedSet = tslib_1.__assign(tslib_1.__assign({}, _defaultContext), { createContext: set_custom_1.createSortedSetContext, defaultContext: function () {
return _defaultContext;
} });
//# sourceMappingURL=index.js.map
{
"name": "@rimbu/sorted",
"version": "0.9.9",
"version": "0.9.10",
"description": "Immutable SortedMap and SortedSet implementations for TypeScript",

@@ -66,3 +66,3 @@ "keywords": [

"test": "jest",
"test:random": "jest --config jest-random.config.json",
"test:random": "jest --config jest-random.config.json --runInBand",
"test:types": "tsd",

@@ -73,7 +73,7 @@ "typecheck": "tsc"

"dependencies": {
"@rimbu/base": "^0.8.1",
"@rimbu/collection-types": "^0.9.9",
"@rimbu/common": "^0.9.1",
"@rimbu/stream": "^0.10.9",
"tslib": "^2.3.1"
"@rimbu/base": "^0.8.2",
"@rimbu/collection-types": "^0.9.10",
"@rimbu/common": "^0.9.2",
"@rimbu/stream": "^0.10.10",
"tslib": "^2.4.0"
},

@@ -87,3 +87,3 @@ "publishConfig": {

},
"gitHead": "f44e1b43f07ac973555270806bbdde5f06400941"
"gitHead": "33dd7ca935f19f513586834a2ce1b1f886352ae7"
}

@@ -16,3 +16,3 @@ <p align="center">

For complete documentation please visit the [Map](https://rimbu.org/docs/collections/map) or [Se](https://rimbu.org/docs/collections/set) page in the _[Rimbu Docs](https://rimbu.org)_.
For complete documentation please visit the [Map](https://rimbu.org/docs/collections/map) or [Se](https://rimbu.org/docs/collections/set) page in the _[Rimbu Docs](https://rimbu.org)_, or directly see the _[Rimbu Sorted API Docs](https://rimbu.org/api/rimbu/sorted)_.

@@ -23,3 +23,3 @@ Or [Try Out Rimbu](https://codesandbox.io/s/github/vitoke/rimbu-sandbox/tree/main?previewwindow=console&view=split&editorsize=65&moduleview=1&module=/src/index.ts) in CodeSandBox.

All types are exported through [`@rimbu/core`](../core). It is recommended to use that package.
For convenience, all main types are also exported through [`@rimbu/core`](../core).

@@ -38,26 +38,37 @@ To install separately:

Create a file called `rimbu.ts` and add the following:
For Deno, the following approach is recommended:
> ```ts
> export * from 'https://deno.land/x/rimbu/sorted/mod.ts';
> ```
In the root folder of your project, create or edit a file called `import_map.json` with the following contents (where you should replace `x.y.z` with the desired version of Rimbu):
Or using a pinned version (`x.y.z`):
```json
{
"imports": {
"@rimbu/": "https://deno.land/x/rimbu@x.y.z/"
}
}
```
> ```ts
> export * from 'https://deno.land/x/rimbu/sorted@x.y.z/mod.ts';
> ```
**Note: The trailing slashes are important!**
Then import what you need from `rimbu.ts`:
In this way you can use relative imports from Rimbu in your code, like so:
```ts
import { SortedMap } from './rimbu.ts';
import { List } from '@rimbu/core/mod.ts';
import { HashMap } from '@rimbu/hashed/mod.ts';
```
Because Rimbu uses complex types, it's recommended to use the `--no-check` flag (your editor should already have checked your code) and to specify a `tsconfig.json` file with the settings described below.
Note that for sub-packages, due to conversion limitations it is needed to import the `index.ts` instead of `mod.ts`, like so:
Running your script then becomes:
```ts
import { HashMap } from '@rimbu/hashed/map/index.ts';
```
> `deno run --no-check --config tsconfig.json <your-script>.ts`
To run your script (let's assume the entry point is in `src/main.ts`):
`deno run --import-map import_map.json src/main.ts`
Because Rimbu uses advanced types, this may slow down the type checking part when running your code. If you're able to rely on your code editor to provide type errors, you can skip the Deno type check using the `--no-check` flag:
`deno run --import-map import_map.json --no-check src/main.ts`
## Usage

@@ -81,3 +92,3 @@

<img src = "https://contrib.rocks/image?repo=vitoke/iternal"/>
<img src = "https://contrib.rocks/image?repo=rimbu-org/rimbu"/>

@@ -84,0 +95,0 @@ Made with [contributors-img](https://contrib.rocks).

Sorry, the diff of this file is not supported yet

Sorry, the diff of this file is not supported yet

Sorry, the diff of this file is not supported yet

Sorry, the diff of this file is not supported yet

Sorry, the diff of this file is not supported yet

Sorry, the diff of this file is not supported yet

Sorry, the diff of this file is not supported yet

Sorry, the diff of this file is not supported yet

Sorry, the diff of this file is not supported yet

Sorry, the diff of this file is not supported yet

Sorry, the diff of this file is not supported yet

Sorry, the diff of this file is not supported yet

Sorry, the diff of this file is not supported yet

Sorry, the diff of this file is not supported yet

Sorry, the diff of this file is not supported yet

SocketSocket SOC 2 Logo

Product

  • Package Alerts
  • Integrations
  • Docs
  • Pricing
  • FAQ
  • Roadmap
  • Changelog

Packages

npm

Stay in touch

Get open source security insights delivered straight into your inbox.


  • Terms
  • Privacy
  • Security

Made with ⚡️ by Socket Inc