@types/collections - npm Package Compare versions

Comparing version 5.1.0 to 5.1.1

collections/index.d.ts

@@ -1,2 +0,2 @@
-// Type definitions for collections v5.1.12
+// Type definitions for collections 5.1
 // Project: http://www.collectionsjs.com/
@@ -6,2 +6,2 @@ // Definitions by: Scarabe Dore <https://github.com/scarabedore>
 
-export {}
+export {};

collections/package.json

 {
     "name": "@types/collections",
-    "version": "5.1.0",
+    "version": "5.1.1",
     "description": "TypeScript definitions for collections",
@@ -22,4 +22,4 @@ "license": "MIT",
     "dependencies": {},
-    "typesPublisherContentHash": "d4c7bbc5d42a9924dbbdadc50b4b9caa11b5631c422d674f0fb6fe94a19d6636",
-    "typeScriptVersion": "3.3"
+    "typesPublisherContentHash": "5c822413d3e6dcae24087c263a9477c54b4532b4c211a8d8423864bb01974727",
+    "typeScriptVersion": "3.5"
 }

collections/README.md

@@ -11,3 +11,3 @@ # Installation
 ### Additional Details
- * Last updated: Sat, 26 Dec 2020 11:20:55 GMT
+ * Last updated: Sat, 24 Apr 2021 14:01:18 GMT
  * Dependencies: none
@@ -14,0 +14,0 @@ * Global values: none

collections/sorted-set.d.ts

@@ -62,4 +62,10 @@ declare namespace internal {
 
-        reduce(cb: (result?: any, val?: any, key?: any, collection?: any) => any,
-               basis: any, index: number, thisp: any, tree: any, depth: number): any;
+        reduce(
+            cb: (result?: any, val?: any, key?: any, collection?: any) => any,
+            basis: any,
+            index: number,
+            thisp: any,
+            tree: any,
+            depth: number,
+        ): any;
         touch(...plus: any[]): void;
@@ -74,14 +80,9 @@ checkIntegrity(...plus: any[]): number;
     class Iterator<T> {
-        next(): {done: true, value: T | null | undefined};
+        next(): { done: true; value: T | null | undefined };
     }
 
-    export class SortedSet<T> extends AbstractSet {
+    class SortedSet<T> extends AbstractSet {
         length: number;
 
-        constructor(
-            values?: T[],
-            equals?:  (a: T, b: T) => boolean,
-            compare?: (a: T, b: T) => number,
-            getDefault?: any
-        );
+        constructor(values?: T[], equals?: (a: T, b: T) => boolean, compare?: (a: T, b: T) => number, getDefault?: any);
         constructClone(values?: T[]): SortedSet<T>;
@@ -91,9 +92,9 @@
         clear(): void;
-        ['delete'](value: T): boolean;
+        ["delete"](value: T): boolean;
 
         find(value: T): Node<T> | undefined;
-        findGreatest(n?: Node<T> | undefined): Node<T> | undefined;
+        findGreatest(n?: Node<T>): Node<T> | undefined;
         findGreatestLessThan(value: T): Node<T> | undefined;
         findGreatestLessThanOrEqual(value: T): Node<T> | undefined;
-        findLeast(n?: Node<T> | undefined): Node<T> | undefined;
+        findLeast(n?: Node<T>): Node<T> | undefined;
         findLeastGreaterThan(value: T): Node<T> | undefined;
@@ -122,7 +123,7 @@ findLeastGreaterThanOrEqual(value: T): Node<T> | undefined;
 
-        reduce(callback: (result?: any, val?: any, key?: any, collection?: any) => any,
-               basis?: any, thisp?: any): any;
+        reduce(callback: (result?: any, val?: any, key?: any, collection?: any) => any, basis?: any, thisp?: any): any;
         reduceRight(
             callback: (result?: any, val?: any, key?: any, collection?: any) => any,
-            basis?: any, thisp?: any
+            basis?: any,
+            thisp?: any,
         ): any;
@@ -129,0 +130,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

Lines of code

120

increased by0.84%

Worsened metrics

Total package byte prevSize

7397

decreased by-0.34%

No dependency changes