doubly-linked-list-typed 1.53.3 → 1.53.4

package/dist/data-structures/linked-list/doubly-linked-list.d.ts

@@ -326,8 +326,8 @@ export declare class DoublyLinkedListNode<E = any> {
  *     cache.set('c', 3);
  *     cache.set('d', 4); // This will eliminate 'a'
  *
- *     console.log(cache.get('a')).toBeUndefined();
- *     expect(cache.get('b')); // 2
+ *     console.log(cache.get('a')); // undefined
+ *     console.log(cache.get('b')); // 2
  *     console.log(cache.get('c')); // 3
  *     console.log(cache.get('d')); // 4
  *
@@ -341,8 +341,8 @@ export declare class DoublyLinkedListNode<E = any> {
  *     cache.set('d', 4); // This will eliminate 'b'
  *
  *     console.log(cache.get('a')); // 1
- *     console.log(cache.get('b')).toBeUndefined();
- *     expect(cache.get('c')); // 3
+ *     console.log(cache.get('b')); // undefined
+ *     console.log(cache.get('c')); // 3
  *     console.log(cache.get('d')); // 4
  *
  *     // Should support updating existing keys
@@ -358,8 +358,8 @@ export declare class DoublyLinkedListNode<E = any> {
  *     cache.set('b', 2);
  *
  *     console.log(cache.delete('a')); // true
- *     console.log(cache.get('a')).toBeUndefined();
- *     expect(cache.size); // 1
+ *     console.log(cache.get('a')); // undefined
+ *     console.log(cache.size); // 1
  *
  *     // Should support clearing cache
  *     cache.clear();
@@ -404,11 +404,11 @@ export declare class DoublyLinkedListNode<E = any> {
  *
  *     // 3. Find first lyric when timestamp is less than first entry
  *     const earlyTimeLyric = lyricsList.findBackward(lyric => lyric.time <= -1000);
- *     console.log(earlyTimeLyric).toBeUndefined();
+ *     console.log(earlyTimeLyric); // undefined
  *
  *     // 4. Find last lyric when timestamp is after last entry
  *     const lateTimeLyric = lyricsList.findBackward(lyric => lyric.time <= 50000);
- *     expect(lateTimeLyric?.text); // 'And I will try to fix you'
+ *     console.log(lateTimeLyric?.text); // 'And I will try to fix you'
  * @example
  * // cpu process schedules
  * class Process {

package/dist/data-structures/linked-list/doubly-linked-list.js

@@ -335,8 +335,8 @@ exports.DoublyLinkedListNode = DoublyLinkedListNode;
  *     cache.set('c', 3);
  *     cache.set('d', 4); // This will eliminate 'a'
  *
- *     console.log(cache.get('a')).toBeUndefined();
- *     expect(cache.get('b')); // 2
+ *     console.log(cache.get('a')); // undefined
+ *     console.log(cache.get('b')); // 2
  *     console.log(cache.get('c')); // 3
  *     console.log(cache.get('d')); // 4
  *
@@ -350,8 +350,8 @@ exports.DoublyLinkedListNode = DoublyLinkedListNode;
  *     cache.set('d', 4); // This will eliminate 'b'
  *
  *     console.log(cache.get('a')); // 1
- *     console.log(cache.get('b')).toBeUndefined();
- *     expect(cache.get('c')); // 3
+ *     console.log(cache.get('b')); // undefined
+ *     console.log(cache.get('c')); // 3
  *     console.log(cache.get('d')); // 4
  *
  *     // Should support updating existing keys
@@ -367,8 +367,8 @@ exports.DoublyLinkedListNode = DoublyLinkedListNode;
  *     cache.set('b', 2);
  *
  *     console.log(cache.delete('a')); // true
- *     console.log(cache.get('a')).toBeUndefined();
- *     expect(cache.size); // 1
+ *     console.log(cache.get('a')); // undefined
+ *     console.log(cache.size); // 1
  *
  *     // Should support clearing cache
  *     cache.clear();
@@ -413,11 +413,11 @@ exports.DoublyLinkedListNode = DoublyLinkedListNode;
  *
  *     // 3. Find first lyric when timestamp is less than first entry
  *     const earlyTimeLyric = lyricsList.findBackward(lyric => lyric.time <= -1000);
- *     console.log(earlyTimeLyric).toBeUndefined();
+ *     console.log(earlyTimeLyric); // undefined
  *
  *     // 4. Find last lyric when timestamp is after last entry
  *     const lateTimeLyric = lyricsList.findBackward(lyric => lyric.time <= 50000);
- *     expect(lateTimeLyric?.text); // 'And I will try to fix you'
+ *     console.log(lateTimeLyric?.text); // 'And I will try to fix you'
  * @example
  * // cpu process schedules
  * class Process {

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "doubly-linked-list-typed",
-  "version": "1.53.3",
+  "version": "1.53.4",
   "description": "Doubly Linked List. Javascript & Typescript Data Structure.",
   "main": "dist/index.js",
   "scripts": {
@@ -64,6 +64,6 @@
     "typescript": "^4.9.5"
   },
   "dependencies": {
-    "data-structure-typed": "^1.53.3"
+    "data-structure-typed": "^1.53.4"
   }
 }

package/src/data-structures/linked-list/doubly-linked-list.ts

@@ -353,8 +353,8 @@ export class DoublyLinkedListNode<E = any> {
  *     cache.set('c', 3);
  *     cache.set('d', 4); // This will eliminate 'a'
  * 
- *     console.log(cache.get('a')).toBeUndefined();
- *     expect(cache.get('b')); // 2
+ *     console.log(cache.get('a')); // undefined
+ *     console.log(cache.get('b')); // 2
  *     console.log(cache.get('c')); // 3
  *     console.log(cache.get('d')); // 4
  * 
@@ -368,8 +368,8 @@ export class DoublyLinkedListNode<E = any> {
  *     cache.set('d', 4); // This will eliminate 'b'
  * 
  *     console.log(cache.get('a')); // 1
- *     console.log(cache.get('b')).toBeUndefined();
- *     expect(cache.get('c')); // 3
+ *     console.log(cache.get('b')); // undefined
+ *     console.log(cache.get('c')); // 3
  *     console.log(cache.get('d')); // 4
  * 
  *     // Should support updating existing keys
@@ -385,8 +385,8 @@ export class DoublyLinkedListNode<E = any> {
  *     cache.set('b', 2);
  * 
  *     console.log(cache.delete('a')); // true
- *     console.log(cache.get('a')).toBeUndefined();
- *     expect(cache.size); // 1
+ *     console.log(cache.get('a')); // undefined
+ *     console.log(cache.size); // 1
  * 
  *     // Should support clearing cache
  *     cache.clear();
@@ -431,11 +431,11 @@ export class DoublyLinkedListNode<E = any> {
  * 
  *     // 3. Find first lyric when timestamp is less than first entry
  *     const earlyTimeLyric = lyricsList.findBackward(lyric => lyric.time <= -1000);
- *     console.log(earlyTimeLyric).toBeUndefined();
+ *     console.log(earlyTimeLyric); // undefined
  * 
  *     // 4. Find last lyric when timestamp is after last entry
  *     const lateTimeLyric = lyricsList.findBackward(lyric => lyric.time <= 50000);
- *     expect(lateTimeLyric?.text); // 'And I will try to fix you'
+ *     console.log(lateTimeLyric?.text); // 'And I will try to fix you'
  * @example 
  * // cpu process schedules 
  * class Process {