@rimbu/graph - npm Package Compare versions

Comparing version 0.7.4 to 0.7.5

dist/main/common/base.js

@@ -8,3 +8,3 @@ "use strict";
 var GraphEmptyBase = /** @class */ (function (_super) {
-    tslib_1.__extends(GraphEmptyBase, _super);
+    (0, tslib_1.__extends)(GraphEmptyBase, _super);
     function GraphEmptyBase() {
@@ -11,0 +11,0 @@ return _super !== null && _super.apply(this, arguments) || this;

dist/main/common/link.js

@@ -58,3 +58,3 @@ "use strict";
             return e[0];
-        return common_1.OptLazy(otherwise);
+        return (0, common_1.OptLazy)(otherwise);
     }
@@ -76,3 +76,3 @@ GraphElement.getSingleNode = getSingleNode;
             return e[key];
-        return common_1.OptLazy(otherwise);
+        return (0, common_1.OptLazy)(otherwise);
     }
@@ -79,0 +79,0 @@ GraphElement.getLinkElement = getLinkElement;

dist/main/common/valued-link.js

@@ -35,3 +35,3 @@ "use strict";
             return e[0];
-        return common_1.OptLazy(otherwise);
+        return (0, common_1.OptLazy)(otherwise);
     }
@@ -53,3 +53,3 @@ ValuedGraphElement.getSingleNode = getSingleNode;
             return e[key];
-        return common_1.OptLazy(otherwise);
+        return (0, common_1.OptLazy)(otherwise);
     }
@@ -56,0 +56,0 @@ ValuedGraphElement.getLinkElement = getLinkElement;

dist/main/gen-graph-custom.js

@@ -5,4 +5,4 @@ "use strict";
 // no circular dependencies
-tslib_1.__exportStar(require("./common/base"), exports);
-tslib_1.__exportStar(require("./traverse/traverse-base"), exports);
+(0, tslib_1.__exportStar)(require("./common/base"), exports);
+(0, tslib_1.__exportStar)(require("./traverse/traverse-base"), exports);
 //# sourceMappingURL=gen-graph-custom.js.map

dist/main/graph/arrow/arrow-graph-hashed.js

@@ -29,3 +29,3 @@ "use strict";
 };
-exports.ArrowGraphHashed = tslib_1.__assign(tslib_1.__assign({}, _defaultContext), _contextHelpers);
+exports.ArrowGraphHashed = (0, tslib_1.__assign)((0, tslib_1.__assign)({}, _defaultContext), _contextHelpers);
 //# sourceMappingURL=arrow-graph-hashed.js.map

dist/main/graph/arrow/arrow-graph-sorted.js

@@ -29,3 +29,3 @@ "use strict";
 };
-exports.ArrowGraphSorted = tslib_1.__assign(tslib_1.__assign({}, _defaultContext), _contextHelpers);
+exports.ArrowGraphSorted = (0, tslib_1.__assign)((0, tslib_1.__assign)({}, _defaultContext), _contextHelpers);
 //# sourceMappingURL=arrow-graph-sorted.js.map

dist/main/graph/edge/edge-graph-hashed.js

@@ -29,3 +29,3 @@ "use strict";
 };
-exports.EdgeGraphHashed = tslib_1.__assign(tslib_1.__assign({}, _defaultContext), _contextHelpers);
+exports.EdgeGraphHashed = (0, tslib_1.__assign)((0, tslib_1.__assign)({}, _defaultContext), _contextHelpers);
 //# sourceMappingURL=edge-graph-hashed.js.map

dist/main/graph/edge/edge-graph-sorted.js

@@ -29,3 +29,3 @@ "use strict";
 };
-exports.EdgeGraphSorted = tslib_1.__assign(tslib_1.__assign({}, _defaultContext), _contextHelpers);
+exports.EdgeGraphSorted = (0, tslib_1.__assign)((0, tslib_1.__assign)({}, _defaultContext), _contextHelpers);
 //# sourceMappingURL=edge-graph-sorted.js.map

dist/main/graph/graph-custom.js

@@ -5,11 +5,11 @@ "use strict";
 // no circular dependencies
-tslib_1.__exportStar(require("./variant-graph-base"), exports);
-tslib_1.__exportStar(require("./graph-base"), exports);
-tslib_1.__exportStar(require("./arrow/arrow-graph-base"), exports);
-tslib_1.__exportStar(require("./edge/edge-graph-base"), exports);
-tslib_1.__exportStar(require("./impl/non-empty"), exports);
+(0, tslib_1.__exportStar)(require("./variant-graph-base"), exports);
+(0, tslib_1.__exportStar)(require("./graph-base"), exports);
+(0, tslib_1.__exportStar)(require("./arrow/arrow-graph-base"), exports);
+(0, tslib_1.__exportStar)(require("./edge/edge-graph-base"), exports);
+(0, tslib_1.__exportStar)(require("./impl/non-empty"), exports);
 // circular dependencies
-tslib_1.__exportStar(require("./impl/builder"), exports);
-tslib_1.__exportStar(require("./impl/empty"), exports);
-tslib_1.__exportStar(require("./impl/context"), exports);
+(0, tslib_1.__exportStar)(require("./impl/builder"), exports);
+(0, tslib_1.__exportStar)(require("./impl/empty"), exports);
+(0, tslib_1.__exportStar)(require("./impl/context"), exports);
 //# sourceMappingURL=graph-custom.js.map

dist/main/graph/impl/builder.js

@@ -51,3 +51,3 @@ "use strict";
                 _this.linkMap.forEach(function (_a) {
-                    var _b = tslib_1.__read(_a, 2), sourceNode = _b[0], targets = _b[1];
+                    var _b = (0, tslib_1.__read)(_a, 2), sourceNode = _b[0], targets = _b[1];
                     if (targets.remove(node)) {
@@ -54,0 +54,0 @@ if (sourceNode !== node)

dist/main/graph/impl/empty.js

@@ -8,3 +8,3 @@ "use strict";
 var GraphEmpty = /** @class */ (function (_super) {
-    tslib_1.__extends(GraphEmpty, _super);
+    (0, tslib_1.__extends)(GraphEmpty, _super);
     function GraphEmpty(isDirected, context) {
@@ -11,0 +11,0 @@ var _this = _super.call(this) || this;

dist/main/graph/impl/non-empty.js

@@ -8,3 +8,3 @@ "use strict";
 var GraphNonEmpty = /** @class */ (function (_super) {
-    tslib_1.__extends(GraphNonEmpty, _super);
+    (0, tslib_1.__extends)(GraphNonEmpty, _super);
     function GraphNonEmpty(isDirected, context, linkMap, connectionSize) {
@@ -39,3 +39,3 @@ var _this = _super.call(this) || this;
         return this.linkMap.stream().flatMap(function (_a) {
-            var _b = tslib_1.__read(_a, 2), node = _b[0], targets = _b[1];
+            var _b = (0, tslib_1.__read)(_a, 2), node = _b[0], targets = _b[1];
             if (!targets.nonEmpty())
@@ -62,3 +62,3 @@ return [[node]];
             .flatMap(function (_a) {
-            var _b = tslib_1.__read(_a, 2), node1 = _b[0], targets = _b[1];
+            var _b = (0, tslib_1.__read)(_a, 2), node1 = _b[0], targets = _b[1];
             return targets.stream().map(function (node2) { return [node1, node2]; });
@@ -84,3 +84,3 @@ });
             return this.linkMap.stream().collect(function (_a, _, skip) {
-                var _b = tslib_1.__read(_a, 2), source = _b[0], targets = _b[1];
+                var _b = (0, tslib_1.__read)(_a, 2), source = _b[0], targets = _b[1];
                 if (!(targets === null || targets === void 0 ? void 0 : targets.has(node)))
@@ -183,3 +183,3 @@ return skip;
             var newLinkMap = this.linkMap.filter(function (_a) {
-                var _b = tslib_1.__read(_a, 2), _ = _b[0], targets = _b[1];
+                var _b = (0, tslib_1.__read)(_a, 2), _ = _b[0], targets = _b[1];
                 return targets.nonEmpty();
@@ -192,3 +192,3 @@ });
             .collect(function (_a, _, skip) {
-            var _b = tslib_1.__read(_a, 2), source = _b[0], targets = _b[1];
+            var _b = (0, tslib_1.__read)(_a, 2), source = _b[0], targets = _b[1];
             if (targets.isEmpty &&
@@ -209,3 +209,3 @@ !_this.linkMap.streamValues().some(function (t) { return t.has(source); })) {
             valueToString: function (_a) {
-                var _b = tslib_1.__read(_a, 2), node = _b[0], targets = _b[1];
+                var _b = (0, tslib_1.__read)(_a, 2), node = _b[0], targets = _b[1];
                 return node + " " + connector + " " + targets
@@ -212,0 +212,0 @@ .stream()

dist/main/index.js

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

dist/main/internal.js

@@ -6,21 +6,21 @@ "use strict";
 // no circular dependencies
-tslib_1.__exportStar(require("./common/link"), exports);
-tslib_1.__exportStar(require("./common/valued-link"), exports);
-tslib_1.__exportStar(require("./graph/variant-graph"), exports);
-tslib_1.__exportStar(require("./graph/graph"), exports);
-tslib_1.__exportStar(require("./valued-graph/variant-valued-graph"), exports);
-tslib_1.__exportStar(require("./valued-graph/valued-graph"), exports);
-tslib_1.__exportStar(require("./traverse/traverse-breadth-first"), exports);
-tslib_1.__exportStar(require("./traverse/traverse-depth-first"), exports);
+(0, tslib_1.__exportStar)(require("./common/link"), exports);
+(0, tslib_1.__exportStar)(require("./common/valued-link"), exports);
+(0, tslib_1.__exportStar)(require("./graph/variant-graph"), exports);
+(0, tslib_1.__exportStar)(require("./graph/graph"), exports);
+(0, tslib_1.__exportStar)(require("./valued-graph/variant-valued-graph"), exports);
+(0, tslib_1.__exportStar)(require("./valued-graph/valued-graph"), exports);
+(0, tslib_1.__exportStar)(require("./traverse/traverse-breadth-first"), exports);
+(0, tslib_1.__exportStar)(require("./traverse/traverse-depth-first"), exports);
 // circular dependencies
-tslib_1.__exportStar(require("./graph/arrow/arrow-graph"), exports);
-tslib_1.__exportStar(require("./graph/edge/edge-graph"), exports);
-tslib_1.__exportStar(require("./graph/arrow/arrow-graph-hashed"), exports);
-tslib_1.__exportStar(require("./graph/arrow/arrow-graph-sorted"), exports);
-tslib_1.__exportStar(require("./graph/edge/edge-graph-hashed"), exports);
-tslib_1.__exportStar(require("./graph/edge/edge-graph-sorted"), exports);
+(0, tslib_1.__exportStar)(require("./graph/arrow/arrow-graph"), exports);
+(0, tslib_1.__exportStar)(require("./graph/edge/edge-graph"), exports);
+(0, tslib_1.__exportStar)(require("./graph/arrow/arrow-graph-hashed"), exports);
+(0, tslib_1.__exportStar)(require("./graph/arrow/arrow-graph-sorted"), exports);
+(0, tslib_1.__exportStar)(require("./graph/edge/edge-graph-hashed"), exports);
+(0, tslib_1.__exportStar)(require("./graph/edge/edge-graph-sorted"), exports);
 // custom
-exports.GenGraphCustom = tslib_1.__importStar(require("./gen-graph-custom"));
-exports.GraphCustom = tslib_1.__importStar(require("./graph/graph-custom"));
-exports.ValuedGraphCustom = tslib_1.__importStar(require("./valued-graph/valued-graph-custom"));
+exports.GenGraphCustom = (0, tslib_1.__importStar)(require("./gen-graph-custom"));
+exports.GraphCustom = (0, tslib_1.__importStar)(require("./graph/graph-custom"));
+exports.ValuedGraphCustom = (0, tslib_1.__importStar)(require("./valued-graph/valued-graph-custom"));
 //# sourceMappingURL=internal.js.map

dist/main/traverse/traverse-breadth-first.js

@@ -10,3 +10,3 @@ "use strict";
 var GraphBreadthFirstStream = /** @class */ (function (_super) {
-    tslib_1.__extends(GraphBreadthFirstStream, _super);
+    (0, tslib_1.__extends)(GraphBreadthFirstStream, _super);
     function GraphBreadthFirstStream(node, graph, addVisitedNode) {
@@ -25,3 +25,3 @@ var _this = _super.call(this) || this;
 var DirectedGraphBreadthFirstIterable = /** @class */ (function (_super) {
-    tslib_1.__extends(DirectedGraphBreadthFirstIterable, _super);
+    (0, tslib_1.__extends)(DirectedGraphBreadthFirstIterable, _super);
     function DirectedGraphBreadthFirstIterable(node, graph, addVisitedNode) {
@@ -51,3 +51,3 @@ var _this = _super.call(this) || this;
         if (undefined === nextIterator)
-            return common_1.OptLazy(otherwise);
+            return (0, common_1.OptLazy)(otherwise);
         this.currentIterator = nextIterator;
@@ -54,0 +54,0 @@ return this.fastNext(otherwise);

dist/main/traverse/traverse-depth-first.js

@@ -10,3 +10,3 @@ "use strict";
 var GraphDepthFirstStream = /** @class */ (function (_super) {
-    tslib_1.__extends(GraphDepthFirstStream, _super);
+    (0, tslib_1.__extends)(GraphDepthFirstStream, _super);
     function GraphDepthFirstStream(node, graph, addVisitedNode) {
@@ -25,3 +25,3 @@ var _this = _super.call(this) || this;
 var GraphDepthFirstIterable = /** @class */ (function (_super) {
-    tslib_1.__extends(GraphDepthFirstIterable, _super);
+    (0, tslib_1.__extends)(GraphDepthFirstIterable, _super);
     function GraphDepthFirstIterable(node, graph, addVisitedNode, isRoot) {
@@ -54,3 +54,3 @@ if (isRoot === void 0) { isRoot = true; }
         }
-        return common_1.OptLazy(otherwise);
+        return (0, common_1.OptLazy)(otherwise);
     };
@@ -57,0 +57,0 @@ return GraphDepthFirstIterable;

dist/main/valued-graph/impl/builder.js

@@ -35,3 +35,3 @@ "use strict";
             if (undefined === targets)
-                return common_1.OptLazy(otherwise);
+                return (0, common_1.OptLazy)(otherwise);
             return targets.get(node2, otherwise);
@@ -62,3 +62,3 @@ };
                 _this.linkMap.forEach(function (_a) {
-                    var _b = tslib_1.__read(_a, 2), sourceNode = _b[0], targets = _b[1];
+                    var _b = (0, tslib_1.__read)(_a, 2), sourceNode = _b[0], targets = _b[1];
                     if (targets.removeKey(node)) {
@@ -73,3 +73,3 @@ if (sourceNode !== node)
                 targets.forEach(function (_a) {
-                    var _b = tslib_1.__read(_a, 1), target = _b[0];
+                    var _b = (0, tslib_1.__read)(_a, 1), target = _b[0];
                     return _this.linkMap.updateAt(target, function (values) {
@@ -156,3 +156,3 @@ values.removeKey(node);
                         return none;
-                    var newValue = common_1.OptLazyOr(options.ifNew, none);
+                    var newValue = (0, common_1.OptLazyOr)(options.ifNew, none);
                     if (none === newValue)
@@ -175,3 +175,3 @@ return none;
                                 return none;
-                            var newValue = common_1.OptLazyOr(options.ifNew, none);
+                            var newValue = (0, common_1.OptLazyOr)(options.ifNew, none);
                             if (none === newValue)
@@ -178,0 +178,0 @@ return none;

dist/main/valued-graph/impl/empty.js

@@ -10,3 +10,3 @@ "use strict";
 var ValuedGraphEmpty = /** @class */ (function (_super) {
-    tslib_1.__extends(ValuedGraphEmpty, _super);
+    (0, tslib_1.__extends)(ValuedGraphEmpty, _super);
     function ValuedGraphEmpty(isDirected, context) {
@@ -26,3 +26,3 @@ var _this = _super.call(this) || this;
     ValuedGraphEmpty.prototype.getValue = function (node1, node2, otherwise) {
-        return common_1.OptLazy(otherwise);
+        return (0, common_1.OptLazy)(otherwise);
     };
@@ -63,3 +63,3 @@ ValuedGraphEmpty.prototype.getConnectionsFrom = function () {
             return this;
-        var newValue = common_1.OptLazyOr(options.ifNew, base_1.Token);
+        var newValue = (0, common_1.OptLazyOr)(options.ifNew, base_1.Token);
         if (base_1.Token === newValue)
@@ -66,0 +66,0 @@ return this;

dist/main/valued-graph/impl/non-empty.js

@@ -9,3 +9,3 @@ "use strict";
 var ValuedGraphNonEmpty = /** @class */ (function (_super) {
-    tslib_1.__extends(ValuedGraphNonEmpty, _super);
+    (0, tslib_1.__extends)(ValuedGraphNonEmpty, _super);
     function ValuedGraphNonEmpty(isDirected, context, linkMap, connectionSize) {
@@ -42,3 +42,3 @@ var _this = _super.call(this) || this;
         return this.linkMap.stream().flatMap(function (_a) {
-            var _b = tslib_1.__read(_a, 2), node = _b[0], targets = _b[1];
+            var _b = (0, tslib_1.__read)(_a, 2), node = _b[0], targets = _b[1];
             if (!targets.nonEmpty())
@@ -49,3 +49,3 @@ return [[node]];
                 .map(function (_a) {
-                var _b = tslib_1.__read(_a, 2), target = _b[0], value = _b[1];
+                var _b = (0, tslib_1.__read)(_a, 2), target = _b[0], value = _b[1];
                 return [node, target, value];
@@ -69,7 +69,7 @@ });
             .flatMap(function (_a) {
-            var _b = tslib_1.__read(_a, 2), node1 = _b[0], targets = _b[1];
+            var _b = (0, tslib_1.__read)(_a, 2), node1 = _b[0], targets = _b[1];
             return targets
                 .stream()
                 .map(function (_a) {
-                var _b = tslib_1.__read(_a, 2), node2 = _b[0], value = _b[1];
+                var _b = (0, tslib_1.__read)(_a, 2), node2 = _b[0], value = _b[1];
                 return [node1, node2, value];
@@ -90,3 +90,3 @@ });
         if (undefined === targets)
-            return common_1.OptLazy(otherwise);
+            return (0, common_1.OptLazy)(otherwise);
         return targets.get(node2, otherwise);
@@ -101,3 +101,3 @@ };
             .map(function (_a) {
-            var _b = tslib_1.__read(_a, 2), node2 = _b[0], value = _b[1];
+            var _b = (0, tslib_1.__read)(_a, 2), node2 = _b[0], value = _b[1];
             return [node1, node2, value];
@@ -109,3 +109,3 @@ });
             return this.streamConnections().filter(function (_a) {
-                var _b = tslib_1.__read(_a, 2), _ = _b[0], node2 = _b[1];
+                var _b = (0, tslib_1.__read)(_a, 2), _ = _b[0], node2 = _b[1];
                 return node2 === node;
@@ -120,3 +120,3 @@ });
             .map(function (_a) {
-            var _b = tslib_1.__read(_a, 2), node1 = _b[0], value = _b[1];
+            var _b = (0, tslib_1.__read)(_a, 2), node1 = _b[0], value = _b[1];
             return [node1, node, value];
@@ -193,3 +193,3 @@ });
                     return none;
-                var newValue = common_1.OptLazyOr(options.ifNew, none);
+                var newValue = (0, common_1.OptLazyOr)(options.ifNew, none);
                 if (none === newValue)
@@ -209,3 +209,3 @@ return none;
                             return none;
-                        var newValue = common_1.OptLazyOr(options.ifNew, none);
+                        var newValue = (0, common_1.OptLazyOr)(options.ifNew, none);
                         if (none === newValue)
@@ -285,3 +285,3 @@ return none;
             var newLinkMap = this.linkMap.filter(function (_a) {
-                var _b = tslib_1.__read(_a, 2), _ = _b[0], targets = _b[1];
+                var _b = (0, tslib_1.__read)(_a, 2), _ = _b[0], targets = _b[1];
                 return targets.nonEmpty();
@@ -294,3 +294,3 @@ });
             .collect(function (_a, _, skip) {
-            var _b = tslib_1.__read(_a, 2), source = _b[0], targets = _b[1];
+            var _b = (0, tslib_1.__read)(_a, 2), source = _b[0], targets = _b[1];
             if (targets.isEmpty &&
@@ -317,3 +317,3 @@ !_this.linkMap.streamValues().some(function (t) { return t.hasKey(source); })) {
             valueToString: function (_a) {
-                var _b = tslib_1.__read(_a, 2), node = _b[0], targets = _b[1];
+                var _b = (0, tslib_1.__read)(_a, 2), node = _b[0], targets = _b[1];
                 return node + " " + connector + " " + targets.stream().join({
@@ -324,3 +324,3 @@ start: '[',
                     valueToString: function (_a) {
-                        var _b = tslib_1.__read(_a, 2), node2 = _b[0], value = _b[1];
+                        var _b = (0, tslib_1.__read)(_a, 2), node2 = _b[0], value = _b[1];
                         return "{" + node2 + ": " + value + "}";
@@ -327,0 +327,0 @@ },

dist/main/valued-graph/valued-graph-custom.js

@@ -5,9 +5,9 @@ "use strict";
 // no circular dependencies
-tslib_1.__exportStar(require("./variant-valued-graph-base"), exports);
-tslib_1.__exportStar(require("./valued-graph-base"), exports);
-tslib_1.__exportStar(require("./impl/non-empty"), exports);
+(0, tslib_1.__exportStar)(require("./variant-valued-graph-base"), exports);
+(0, tslib_1.__exportStar)(require("./valued-graph-base"), exports);
+(0, tslib_1.__exportStar)(require("./impl/non-empty"), exports);
 // circular dependencies
-tslib_1.__exportStar(require("./impl/builder"), exports);
-tslib_1.__exportStar(require("./impl/empty"), exports);
-tslib_1.__exportStar(require("./impl/context"), exports);
+(0, tslib_1.__exportStar)(require("./impl/builder"), exports);
+(0, tslib_1.__exportStar)(require("./impl/empty"), exports);
+(0, tslib_1.__exportStar)(require("./impl/context"), exports);
 //# sourceMappingURL=valued-graph-custom.js.map

package.json

 {
   "name": "@rimbu/graph",
-  "version": "0.7.4",
+  "version": "0.7.5",
   "description": "Immutable Graph data structures for TypeScript",
@@ -64,8 +64,8 @@ "keywords": [
   "dependencies": {
-    "@rimbu/collection-types": "^0.7.3",
-    "@rimbu/common": "^0.7.3",
-    "@rimbu/hashed": "^0.6.6",
-    "@rimbu/sorted": "^0.7.0",
-    "@rimbu/stream": "^0.7.3",
-    "tslib": "^2.3.0"
+    "@rimbu/collection-types": "^0.7.4",
+    "@rimbu/common": "^0.7.4",
+    "@rimbu/hashed": "^0.6.7",
+    "@rimbu/sorted": "^0.7.1",
+    "@rimbu/stream": "^0.7.4",
+    "tslib": "^2.3.1"
   },
@@ -78,3 +78,3 @@ "publishConfig": {
   },
-  "gitHead": "435cbcb64b0c17a52c2af41d0c599c1a895da424"
+  "gitHead": "e509f9938fad6253702f6b78eb9f8e3b3a8f92ac"
 }

README.md

@@ -30,6 +30,8 @@ <p align="center">
 
-All types are exported through [`@rimbu/core`](../core). It is recommended to use this package.
+All types are exported through [`@rimbu/core`](../core). It is recommended to use that package.
 
 To install separately:
 
+### Yarn/NPM
+
 > `yarn add @rimbu/graph`
@@ -41,4 +43,30 @@
 
-### recommended tsconfig settings
+### Deno
 
+Create a file called `rimbu.ts` and add the following:
+
+> ```ts
+> export * from 'https://deno.land/x/rimbu/graph/mod.ts';
+> ```
+
+Or using a pinned version (`x.y.z`):
+
+> ```ts
+> export * from 'https://deno.land/x/rimbu/graph@x.y.z/mod.ts';
+> ```
+
+Then import what you need from `rimbu.ts`:
+
+```ts
+import { Graph } from './rimbu.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.
+
+Running your script then becomes:
+
+> `deno run --no-check --config tsconfig.json <your-script>.ts`
+
+## Recommended `tsconfig.json` settings
+
 Rimbu uses advanced and recursive typing, potentially making the TypeScript compiler quite slow in some cases, or causing infinite recursion. It is recommended to set the following values in the `tsconfig.json` file of your project:
@@ -45,0 +73,0 @@

New alerts

License Policy Violation

License

This package is not allowed per your license policy. Review the package's license to ensure compliance.

Found 1 instance in 1 package

Fixed alerts

License Policy Violation

License

This package is not allowed per your license policy. Review the package's license to ensure compliance.

Found 1 instance in 1 package

Improved metrics

Total package byte prevSize

553544

increased by0.21%

Number of lines in readme file

108

increased by35%

Dependency changes

• Updated@rimbu/collection-types@^0.7.4

• Updated@rimbu/common@^0.7.4

• Updated@rimbu/hashed@^0.6.7

• Updated@rimbu/sorted@^0.7.1

• Updated@rimbu/stream@^0.7.4

• Updatedtslib@^2.3.1