@rimbu/sorted - npm Package Compare versions

Comparing version 0.6.4 to 0.6.5

dist/main/base.js

@@ -88,5 +88,5 @@ "use strict";
     var toUp = right.entries[0];
-    var newLeft = right.copy(base_1.Arr.tail(right.entries));
+    var newRight = right.copy(base_1.Arr.tail(right.entries));
     source.mutateEntries.push(toMe);
-    return [toUp, newLeft];
+    return [toUp, newRight];
 }
@@ -93,0 +93,0 @@ exports.leafMutateGetFromRight = leafMutateGetFromRight;

dist/main/map/immutable.js

@@ -158,6 +158,8 @@ "use strict";
             startIndex = this.getInsertIndexOf(startValue);
-            if (startIndex < 0)
+            if (startIndex < 0) {
                 startIndex = internal_1.SortedIndex.next(startIndex);
-            else if (!startInclude)
+            }
+            else if (!startInclude) {
                 startIndex++;
+            }
         }
@@ -640,3 +642,3 @@ if (undefined !== end) {
             if (comp === 0)
-                return index;
+                return index - 1;
         }
@@ -643,0 +645,0 @@ var insertIndex = base_1.Arr.last(this.children).getInsertIndexOf(key);

dist/main/set/immutable.js

@@ -479,3 +479,3 @@ "use strict";
             if (comp === 0)
-                return index;
+                return index - 1;
         }
@@ -482,0 +482,0 @@ var insertIndex = base_1.Arr.last(this.children).getInsertIndexOf(value);

dist/module/base.js

@@ -61,5 +61,5 @@ import { Arr, RimbuError } from '@rimbu/base';
     const toUp = right.entries[0];
-    const newLeft = right.copy(Arr.tail(right.entries));
+    const newRight = right.copy(Arr.tail(right.entries));
     source.mutateEntries.push(toMe);
-    return [toUp, newLeft];
+    return [toUp, newRight];
 }
@@ -66,0 +66,0 @@ export function leafMutateJoinLeft(source, left, entry) {

dist/module/map/immutable.js

@@ -122,6 +122,8 @@ import { Arr, Entry, RimbuError, Token } from '@rimbu/base';
             startIndex = this.getInsertIndexOf(startValue);
-            if (startIndex < 0)
+            if (startIndex < 0) {
                 startIndex = SortedIndex.next(startIndex);
-            else if (!startInclude)
+            }
+            else if (!startInclude) {
                 startIndex++;
+            }
         }
@@ -558,3 +560,3 @@ if (undefined !== end) {
             if (comp === 0)
-                return index;
+                return index - 1;
         }
@@ -561,0 +563,0 @@ const insertIndex = Arr.last(this.children).getInsertIndexOf(key);

dist/module/set/immutable.js

@@ -445,3 +445,3 @@ import { Arr, RimbuError } from '@rimbu/base';
             if (comp === 0)
-                return index;
+                return index - 1;
         }
@@ -448,0 +448,0 @@ const insertIndex = Arr.last(this.children).getInsertIndexOf(value);

dist/types/base.d.ts

@@ -28,3 +28,3 @@ import { CustomBase } from '@rimbu/collection-types';
 }
-interface LeafMutateSource<TS extends LeafMutateSource<TS, E>, E> {
+export interface LeafMutateSource<TS extends LeafMutateSource<TS, E>, E> {
     mutateEntries: E[];
@@ -43,3 +43,3 @@ entries: readonly E[];
 export declare function leafMutateJoinRight<S extends LeafMutateSource<S, E>, E>(source: S, right: S, entry: E): void;
-interface InnerChild<E> {
+export interface InnerChild<E> {
     readonly size: number;
@@ -62,3 +62,3 @@ getAtIndex<O>(index: number, otherwise?: OptLazy<O>): E | O;
 }
-interface InnerMutateSource<TS extends InnerMutateSource<TS, E>, E> {
+export interface InnerMutateSource<TS extends InnerMutateSource<TS, E>, E> {
     readonly context: {
@@ -135,2 +135,1 @@ readonly minEntries: number;
 }
-export {};

package.json

 {
   "name": "@rimbu/sorted",
-  "version": "0.6.4",
+  "version": "0.6.5",
   "description": "Immutable SortedMap and SortedSet implementations for TypeScript",
@@ -62,6 +62,6 @@ "keywords": [
   "dependencies": {
-    "@rimbu/base": "^0.6.4",
-    "@rimbu/collection-types": "^0.7.2",
-    "@rimbu/common": "^0.7.2",
-    "@rimbu/stream": "^0.7.2",
+    "@rimbu/base": "^0.6.5",
+    "@rimbu/collection-types": "^0.7.3",
+    "@rimbu/common": "^0.7.3",
+    "@rimbu/stream": "^0.7.3",
     "tslib": "^2.3.0"
@@ -75,3 +75,3 @@ },
   },
-  "gitHead": "e2149b819688b221312eac54bed5e560d676db85"
+  "gitHead": "f6fad673f48ce3d44d6b0f931c0182c8231526ca"
 }

src/base.ts

@@ -60,3 +60,3 @@ import { Arr, RimbuError } from '@rimbu/base';
 
-interface LeafMutateSource<TS extends LeafMutateSource<TS, E>, E> {
+export interface LeafMutateSource<TS extends LeafMutateSource<TS, E>, E> {
   mutateEntries: E[];
@@ -126,5 +126,5 @@ entries: readonly E[];
   const toUp = right.entries[0];
-  const newLeft = right.copy(Arr.tail(right.entries));
+  const newRight = right.copy(Arr.tail(right.entries));
   source.mutateEntries.push(toMe);
-  return [toUp, newLeft];
+  return [toUp, newRight];
 }
@@ -150,3 +150,3 @@
 
-interface InnerChild<E> {
+export interface InnerChild<E> {
   readonly size: number;
@@ -170,3 +170,3 @@ getAtIndex<O>(index: number, otherwise?: OptLazy<O>): E | O;
 
-interface InnerMutateSource<TS extends InnerMutateSource<TS, E>, E> {
+export interface InnerMutateSource<TS extends InnerMutateSource<TS, E>, E> {
   readonly context: {
@@ -173,0 +173,0 @@ readonly minEntries: number;

src/map/immutable.ts

@@ -265,4 +265,7 @@ import { Arr, Entry, RimbuError, Token } from '@rimbu/base';
 
-      if (startIndex < 0) startIndex = SortedIndex.next(startIndex);
-      else if (!startInclude) startIndex++;
+      if (startIndex < 0) {
+        startIndex = SortedIndex.next(startIndex);
+      } else if (!startInclude) {
+        startIndex++;
+      }
     }
@@ -862,3 +865,3 @@ if (undefined !== end) {
 
-      if (comp === 0) return index;
+      if (comp === 0) return index - 1;
     }
@@ -865,0 +868,0 @@

src/set/immutable.ts

@@ -603,3 +603,3 @@ import { Arr, RimbuError } from '@rimbu/base';
 
-      if (comp === 0) return index;
+      if (comp === 0) return index - 1;
     }
@@ -606,0 +606,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

579239

increased by0.04%

Lines of code

10004

increased by0.06%

Dependency changes

• Updated@rimbu/base@^0.6.5

• Updated@rimbu/collection-types@^0.7.3

• Updated@rimbu/common@^0.7.3

• Updated@rimbu/stream@^0.7.3