mnemonist - npm Package Compare versions

Comparing version 0.25.0 to 0.25.1

bi-map.js

@@ -153,2 +153,5 @@ /**
 
+if (typeof Symbol !== 'undefined')
+  BiMap.prototype[Symbol.for('nodejs.util.inspect.custom')] = BiMap.prototype.inspect;
+
 InverseMap.prototype.inspect = function() {
@@ -169,3 +172,6 @@ var dummy = {
 
+if (typeof Symbol !== 'undefined')
+  InverseMap.prototype[Symbol.for('nodejs.util.inspect.custom')] = InverseMap.prototype.inspect;
 
+
 /**
@@ -172,0 +178,0 @@ * Static @.from function taking an abitrary iterable & converting it into

bit-set.js

@@ -352,2 +352,5 @@ /**
 
+if (typeof Symbol !== 'undefined')
+  BitSet.prototype[Symbol.for('nodejs.util.inspect.custom')] = BitSet.prototype.inspect;
+
 BitSet.prototype.toJSON = function() {
@@ -354,0 +357,0 @@ return Array.from(this.array);

bit-vector.js

@@ -526,2 +526,5 @@ /**
 
+if (typeof Symbol !== 'undefined')
+  BitVector.prototype[Symbol.for('nodejs.util.inspect.custom')] = BitVector.prototype.inspect;
+
 BitVector.prototype.toJSON = function() {
@@ -528,0 +531,0 @@ return Array.from(this.array.slice(0, (this.length >> 5) + 1));

bk-tree.js

@@ -156,2 +156,5 @@ /* eslint no-constant-condition: 0 */
 
+if (typeof Symbol !== 'undefined')
+  BKTree.prototype[Symbol.for('nodejs.util.inspect.custom')] = BKTree.prototype.inspect;
+
 /**
@@ -158,0 +161,0 @@ * Static @.from function taking an abitrary iterable & converting it into

CHANGELOG.md

 # Changelog
 
+## 0.25.1
+
+* Fixing custom inspect methods for node >= 10.
+
 ## 0.25.0
@@ -4,0 +8,0 @@

circular-buffer.js

@@ -277,2 +277,5 @@ /**
 
+if (typeof Symbol !== 'undefined')
+  CircularBuffer.prototype[Symbol.for('nodejs.util.inspect.custom')] = CircularBuffer.prototype.inspect;
+
 /**
@@ -279,0 +282,0 @@ * Static @.from function taking an abitrary iterable & converting it into

default-map.js

@@ -134,2 +134,5 @@ /**
 
+if (typeof Symbol !== 'undefined')
+  DefaultMap.prototype[Symbol.for('nodejs.util.inspect.custom')] = DefaultMap.prototype.inspect;
+
 /**
@@ -136,0 +139,0 @@ * Exporting.

fibonacci-heap.js

@@ -267,2 +267,5 @@ /* eslint no-constant-condition: 0 */
 
+if (typeof Symbol !== 'undefined')
+  FibonacciHeap.prototype[Symbol.for('nodejs.util.inspect.custom')] = FibonacciHeap.prototype.inspect;
+
 /**
@@ -269,0 +272,0 @@ * Fibonacci Maximum Heap.

fixed-reverse-heap.js

@@ -194,2 +194,5 @@ /**
 
+if (typeof Symbol !== 'undefined')
+  FixedReverseHeap.prototype[Symbol.for('nodejs.util.inspect.custom')] = FixedReverseHeap.prototype.inspect;
+
 /**
@@ -196,0 +199,0 @@ * Exporting.

fixed-stack.js

@@ -198,2 +198,5 @@ /**
 
+if (typeof Symbol !== 'undefined')
+  FixedStack.prototype[Symbol.for('nodejs.util.inspect.custom')] = FixedStack.prototype.inspect;
+
 /**
@@ -200,0 +203,0 @@ * Static @.from function taking an abitrary iterable & converting it into

fuzzy-map.js

@@ -157,2 +157,5 @@ /**
 
+if (typeof Symbol !== 'undefined')
+  FuzzyMap.prototype[Symbol.for('nodejs.util.inspect.custom')] = FuzzyMap.prototype.inspect;
+
 /**
@@ -159,0 +162,0 @@ * Static @.from function taking an abitrary iterable & converting it into

fuzzy-multi-map.js

@@ -160,2 +160,5 @@ /**
 
+if (typeof Symbol !== 'undefined')
+  FuzzyMultiMap.prototype[Symbol.for('nodejs.util.inspect.custom')] = FuzzyMultiMap.prototype.inspect;
+
 /**
@@ -162,0 +165,0 @@ * Static @.from function taking an abitrary iterable & converting it into

hashed-array-tree.js

@@ -203,2 +203,5 @@ /**
 
+if (typeof Symbol !== 'undefined')
+  HashedArrayTree.prototype[Symbol.for('nodejs.util.inspect.custom')] = HashedArrayTree.prototype.inspect;
+
 /**
@@ -205,0 +208,0 @@ * Exporting.

heap.js

@@ -493,2 +493,5 @@ /**
 
+if (typeof Symbol !== 'undefined')
+  Heap.prototype[Symbol.for('nodejs.util.inspect.custom')] = Heap.prototype.inspect;
+
 /**
@@ -495,0 +498,0 @@ * Binary Maximum Heap.

incremental-map.js

@@ -131,2 +131,5 @@ /**
 
+if (typeof Symbol !== 'undefined')
+  IncrementalMap.prototype[Symbol.for('nodejs.util.inspect.custom')] = IncrementalMap.prototype.inspect;
+
 /**
@@ -133,0 +136,0 @@ * Static @.from function taking an abitrary iterable & converting it into

inverted-index.js

@@ -225,2 +225,5 @@ /**
 
+if (typeof Symbol !== 'undefined')
+  InvertedIndex.prototype[Symbol.for('nodejs.util.inspect.custom')] = InvertedIndex.prototype.inspect;
+
 /**
@@ -227,0 +230,0 @@ * Static @.from function taking an abitrary iterable & converting it into

linked-list.js

@@ -238,2 +238,5 @@ /**
 
+if (typeof Symbol !== 'undefined')
+  LinkedList.prototype[Symbol.for('nodejs.util.inspect.custom')] = LinkedList.prototype.inspect;
+
 /**
@@ -240,0 +243,0 @@ * Static @.from function taking an abitrary iterable & converting it into

lru-cache.js

@@ -324,2 +324,5 @@ /**
 
+if (typeof Symbol !== 'undefined')
+  LRUCache.prototype[Symbol.for('nodejs.util.inspect.custom')] = LRUCache.prototype.inspect;
+
 /**
@@ -326,0 +329,0 @@ * Static @.from function taking an abitrary iterable & converting it into

multi-array.js

@@ -439,2 +439,5 @@ /**
 
+if (typeof Symbol !== 'undefined')
+  MultiArray.prototype[Symbol.for('nodejs.util.inspect.custom')] = MultiArray.prototype.inspect;
+
 // TODO: .from
@@ -441,0 +444,0 @@

multi-map.js

@@ -380,2 +380,5 @@ /**
 };
+
+if (typeof Symbol !== 'undefined')
+  MultiMap.prototype[Symbol.for('nodejs.util.inspect.custom')] = MultiMap.prototype.inspect;
 MultiMap.prototype.toJSON = function() {
@@ -382,0 +385,0 @@ return this.items;

multi-set.js

@@ -371,2 +371,5 @@ /**
 };
+
+if (typeof Symbol !== 'undefined')
+  MultiSet.prototype[Symbol.for('nodejs.util.inspect.custom')] = MultiSet.prototype.inspect;
 MultiSet.prototype.toJSON = function() {
@@ -373,0 +376,0 @@ return this.items;

package.json

 {
   "name": "mnemonist",
-  "version": "0.25.0",
+  "version": "0.25.1",
   "description": "Curated collection of data structures for the JavaScript language.",
@@ -5,0 +5,0 @@ "scripts": {

queue.js

@@ -181,2 +181,5 @@ /**
 
+if (typeof Symbol !== 'undefined')
+  Queue.prototype[Symbol.for('nodejs.util.inspect.custom')] = Queue.prototype.inspect;
+
 /**
@@ -183,0 +186,0 @@ * Static @.from function taking an abitrary iterable & converting it into

sparse-set.js

@@ -156,2 +156,5 @@ /**
 
+if (typeof Symbol !== 'undefined')
+  SparseSet.prototype[Symbol.for('nodejs.util.inspect.custom')] = SparseSet.prototype.inspect;
+
 /**
@@ -158,0 +161,0 @@ * Exporting.

stack.js

@@ -176,2 +176,5 @@ /**
 
+if (typeof Symbol !== 'undefined')
+  Stack.prototype[Symbol.for('nodejs.util.inspect.custom')] = Stack.prototype.inspect;
+
 /**
@@ -178,0 +181,0 @@ * Static @.from function taking an abitrary iterable & converting it into

static-disjoint-set.js

@@ -188,3 +188,6 @@ /* eslint no-constant-condition: 0 */
 
+if (typeof Symbol !== 'undefined')
+  StaticDisjointSet.prototype[Symbol.for('nodejs.util.inspect.custom')] = StaticDisjointSet.prototype.inspect;
 
+
 /**
@@ -191,0 +194,0 @@ * Exporting.

static-interval-tree.js

@@ -367,2 +367,5 @@ /*
 
+if (typeof Symbol !== 'undefined')
+  StaticIntervalTree.prototype[Symbol.for('nodejs.util.inspect.custom')] = StaticIntervalTree.prototype.inspect;
+
 /**
@@ -369,0 +372,0 @@ * Static @.from function taking an abitrary iterable & converting it into

suffix-array.js

@@ -242,2 +242,5 @@ /**
 
+if (typeof Symbol !== 'undefined')
+  SuffixArray.prototype[Symbol.for('nodejs.util.inspect.custom')] = SuffixArray.prototype.inspect;
+
 /**
@@ -343,2 +346,5 @@ * Generalized Suffix Array.
 
+if (typeof Symbol !== 'undefined')
+  GeneralizedSuffixArray.prototype[Symbol.for('nodejs.util.inspect.custom')] = GeneralizedSuffixArray.prototype.inspect;
+
 /**
@@ -345,0 +351,0 @@ * Exporting.

symspell.js

@@ -524,2 +524,5 @@ /* eslint no-loop-func: 0 */
 
+if (typeof Symbol !== 'undefined')
+  SymSpell.prototype[Symbol.for('nodejs.util.inspect.custom')] = SymSpell.prototype.inspect;
+
 /**
@@ -526,0 +529,0 @@ * Static @.from function taking an abitrary iterable & converting it into

trie-map.js

@@ -423,2 +423,5 @@ /**
 
+if (typeof Symbol !== 'undefined')
+  TrieMap.prototype[Symbol.for('nodejs.util.inspect.custom')] = TrieMap.prototype.inspect;
+
 TrieMap.prototype.toJSON = function() {
@@ -425,0 +428,0 @@ return this.root;

trie.js

@@ -139,2 +139,5 @@ /**
 
+if (typeof Symbol !== 'undefined')
+  Trie.prototype[Symbol.for('nodejs.util.inspect.custom')] = Trie.prototype.inspect;
+
 Trie.prototype.toJSON = function() {
@@ -141,0 +144,0 @@ return this.root;

vector.js

@@ -307,2 +307,5 @@ /**
 
+if (typeof Symbol !== 'undefined')
+  Vector.prototype[Symbol.for('nodejs.util.inspect.custom')] = Vector.prototype.inspect;
+
 /**
@@ -309,0 +312,0 @@ * Static @.from function taking an abitrary iterable & converting it into

vp-tree.js

@@ -311,2 +311,5 @@ /**
 
+if (typeof Symbol !== 'undefined')
+  VPTree.prototype[Symbol.for('nodejs.util.inspect.custom')] = VPTree.prototype.inspect;
+
 /**
@@ -313,0 +316,0 @@ * Static @.from function taking an abitrary iterable & converting it into

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

288800

increased by1.56%

Lines of code

10378

increased by0.64%

No dependency changes