data-structure-typed 1.54.1 → 1.54.3

package/test/unit/data-structures/binary-tree/red-black-tree.test.ts

@@ -504,11 +504,11 @@ describe('RedBlackTree 2', () => {
     expect(rbTree.isBST()).toBe(true);
     expect(rbTree.isBST(rbTree.root, 'RECURSIVE')).toBe(true);
 
-    expect(rbTree.dfs(n => n.key, 'IN', rbTree.root, 'ITERATIVE')).toEqual([
+    expect(rbTree.dfs(n => n.key, 'IN', false, rbTree.root, 'ITERATIVE')).toEqual([
       49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76,
       77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99
     ]);
-    expect(rbTree.dfs(n => n.key, 'IN', rbTree.root, 'RECURSIVE')).toEqual([
+    expect(rbTree.dfs(n => n.key, 'IN', false, rbTree.root, 'RECURSIVE')).toEqual([
       49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76,
       77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99
     ]);
@@ -524,7 +524,7 @@ describe('RedBlackTree 2', () => {
 
     expect(rbTree.size).toBe(0);
     expect(rbTree.isBST()).toBe(true);
-    expect(rbTree.dfs(n => n.key, 'IN', rbTree.root, 'ITERATIVE')).toEqual([]);
+    expect(rbTree.dfs(n => n.key, 'IN', false, rbTree.root, 'ITERATIVE')).toEqual([]);
 
     rbTree.clear();
     for (let i = 0; i < 1000; i++) {
@@ -838,14 +838,6 @@ describe('real world data', () => {
 });
 
 describe('classic use', () => {
-  // Test case for finding elements in a given range
-  it('@example Find elements in a range', () => {
-    const bst = new RedBlackTree<number>([10, 5, 15, 3, 7, 12, 18]);
-    expect(bst.search(new Range(5, 10))).toEqual([5, 10, 7]);
-    expect(bst.search(new Range(4, 12))).toEqual([5, 10, 12, 7]);
-    expect(bst.search(new Range(15, 20))).toEqual([15, 18]);
-  });
-
   it('@example using Red-Black Tree as a price-based index for stock data', () => {
     // Define the structure of individual stock records
     interface StockRecord {
@@ -887,6 +879,6 @@ describe('classic use', () => {
       [200, 400], // Price range
       node => priceIndex.get(node)?.symbol // Extract stock symbols for the result
     );
-    expect(stocksInRange).toEqual(['GOOGL', 'MSFT', 'META']); // Verify stocks in the range
+    expect(stocksInRange).toEqual(['GOOGL', 'META', 'MSFT']); // Verify stocks in the range
   });
 });

package/test/unit/data-structures/binary-tree/tree-counter.test.ts

@@ -149,7 +149,7 @@ describe('TreeCounter operations test1', () => {
     expect(minNodeBySpecificNode?.key).toBe(14);
 
     let subTreeSum = 0;
-    if (node15) treeCounter.dfs(node => (subTreeSum += node.key), 'PRE', 15);
+    if (node15) treeCounter.dfs(node => (subTreeSum += node.key), 'PRE', false, 15);
     expect(subTreeSum).toBe(45);
     let lesserSum = 0;
     treeCounter.lesserOrGreaterTraverse(node => (lesserSum += node.key), -1, 10);
@@ -157,7 +157,7 @@ describe('TreeCounter operations test1', () => {
 
     expect(node15 instanceof TreeCounterNode);
     if (node15 instanceof TreeCounterNode) {
-      const subTreeAdd = treeCounter.dfs(node => (node.count += 1), 'PRE', 15);
+      const subTreeAdd = treeCounter.dfs(node => (node.count += 1), 'PRE', false, 15);
       expect(subTreeAdd);
     }
     const node11 = treeCounter.getNode(11);
@@ -407,7 +407,7 @@ describe('TreeCounter operations test recursively1', () => {
     expect(minNodeBySpecificNode?.key).toBe(14);
 
     let subTreeSum = 0;
-    if (node15) treeCounter.dfs(node => (subTreeSum += node.key), 'PRE', 15);
+    if (node15) treeCounter.dfs(node => (subTreeSum += node.key), 'PRE', false, 15);
     expect(subTreeSum).toBe(45);
     let lesserSum = 0;
     expect(treeCounter.has(9)).toBe(true);
@@ -423,7 +423,7 @@ describe('TreeCounter operations test recursively1', () => {
 
     expect(node15 instanceof TreeCounterNode);
     if (node15 instanceof TreeCounterNode) {
-      const subTreeAdd = treeCounter.dfs(node => (node.count += 1), 'PRE', 15);
+      const subTreeAdd = treeCounter.dfs(node => (node.count += 1), 'PRE', false, 15);
       expect(subTreeAdd);
     }
     const node11 = treeCounter.getNode(11);

package/test/unit/data-structures/binary-tree/tree-multi-map.test.ts

@@ -519,11 +519,11 @@ describe('TreeMultiMap 2', () => {
     expect(tmm.isBST()).toBe(true);
     expect(tmm.isBST(tmm.root, 'RECURSIVE')).toBe(true);
 
-    expect(tmm.dfs(n => n.key, 'IN', tmm.root, 'ITERATIVE')).toEqual([
+    expect(tmm.dfs(n => n.key, 'IN', false, tmm.root, 'ITERATIVE')).toEqual([
       49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76,
       77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99
     ]);
-    expect(tmm.dfs(n => n.key, 'IN', tmm.root, 'RECURSIVE')).toEqual([
+    expect(tmm.dfs(n => n.key, 'IN', false, tmm.root, 'RECURSIVE')).toEqual([
       49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76,
       77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99
     ]);
@@ -539,7 +539,7 @@ describe('TreeMultiMap 2', () => {
 
     expect(tmm.size).toBe(0);
     expect(tmm.isBST()).toBe(true);
-    expect(tmm.dfs(n => n.key, 'IN', tmm.root, 'ITERATIVE')).toEqual([]);
+    expect(tmm.dfs(n => n.key, 'IN', false, tmm.root, 'ITERATIVE')).toEqual([]);
 
     tmm.clear();
     for (let i = 0; i < 1000; i++) {
@@ -664,7 +664,7 @@ describe('TreeMultiMap 2', () => {
     });
 
     it('map should return a new tmm with modified elements', () => {
-      const tmmMapped = tmm.map((key, value) => [(key * 2).toString(), value ? value :[]]);
+      const tmmMapped = tmm.map((key, value) => [(key * 2).toString(), value ? value : []]);
       expect(tmmMapped.size).toBe(3);
       expect([...tmmMapped]).toEqual([
         ['2', ['a']],
@@ -840,8 +840,8 @@ describe('classic use', () => {
   // Test case for finding elements in a given range
   it('@example Find elements in a range', () => {
     const tmm = new TreeMultiMap<number>([10, 5, 15, 3, 7, 12, 18]);
-    expect(tmm.search(new Range(5, 10))).toEqual([5, 10, 7]);
-    expect(tmm.search(new Range(4, 12))).toEqual([5, 10, 12, 7]);
+    expect(tmm.search(new Range(5, 10))).toEqual([5, 7, 10]);
+    expect(tmm.search(new Range(4, 12))).toEqual([5, 7, 10, 12]);
     expect(tmm.search(new Range(15, 20))).toEqual([15, 18]);
   });
 });

package/test/utils/json2html.ts

@@ -160,159 +160,5 @@ function _render(name: string, data: any, options: Json2htmlOptions, level: numb
 }
 
 export function render(name: string, json: any, options: Json2htmlOptions): string {
-  // return `${head}${_render('', json, options, 0, 0)}`;
   return `${_render(name, json, options, 0, 0)}`;
 }
-
-// const head = `<style>
-// #json-to-html table {
-//   border-collapse: collapse;
-// }
-// #json-to-html th {
-//   color: #888;
-// }
-// #json-to-html table,th, td {
-//   border: 1px solid #DDD;
-//   padding: 10px 5px;
-// }
-// #json-to-html th, td {
-//   text-align: center;
-// }
-// #json-to-html .content {
-//   padding-left: 30px;
-//   font-family: Arial;
-// }
-//
-// #json-to-html .index {
-//   font-size: 100%;
-//   color: #999;
-//   float: left;
-// }
-// #json-to-html  .clearfix:after {
-//   content: ".";
-//   display: block;
-//   height: 0;
-//   clear: both;
-//   visibility: hidden;
-// }
-// #json-to-html  .json-to-html-label {
-//   font-family: Helvetica Neue;
-//   color: #333;
-// }
-// #json-to-html  .json-to-html-value {
-//   font-family: Arial;
-//   color: #777;
-// }
-// #json-to-html .collapsible > .json-to-html-label:hover {
-//   text-decoration: underline;
-// }
-// #json-to-html .collapsible > .json-to-html-label {
-//   color: #15C;
-// }
-// #json-to-html  .json-to-html-collapse > div.content {
-//   display: none;
-// }
-// #json-to-html  .json-to-html-collapse > .json-to-html-label {
-//   font-weight: bold;
-// }
-//
-// #json-to-html .json-to-html-expand  > div > .json-to-html-label, #json-to-html .json-to-html-collapse  > div > .json-to-html-label {
-//   background-repeat: no-repeat;
-//   background-position: left;
-//   padding-left: 25px;
-//   margin: 5px 0px 5px 15px;
-//   display: inline-block;
-// }
-//
-// #json-to-html .json-to-html-expand  > div > .json-to-html-label {
-//     width: 30px;
-//   height: 30px;
-//   background-image: url('data:image/svg+xml;utf8,<svg xmlns="http://www.w3.org/2000/svg" width="100" height="100"><polygon points="50,10 10,90 90,90" fill="blue" /></svg>');
-//   background-size: cover;
-//   background-position: center;
-// }
-//
-// #json-to-html .json-to-html-collapse > div > .json-to-html-label {
-//       width: 30px;
-//   height: 30px;
-//   background-image: url('data:image/svg+xml;utf8,<svg xmlns="http://www.w3.org/2000/svg" width="100" height="100"><polygon points="50,10 10,90 90,90" fill="blue" /></svg>');
-//   background-size: cover;
-//   background-position: center;
-// }
-//
-// #json-to-html .json-to-html-collapse > span.collapsible:before {
-//   border-radius: 2px;
-//   border-color: #A44;
-//   border-style: solid;
-//   border-width: 1px;
-//   color: #A44;
-//   content: '+';
-//   display: inline-block;
-//   line-height: 7px;
-//   margin: 0 2px;
-//   overflow: hidden;
-//   padding: 1px;
-//   font-size: 11px;
-// }
-//
-// #json-to-html .json-to-html-expand > span.collapsible:before {
-//   border: none;
-//   color: #A44;
-//   content: '-';
-//   display: inline-block;
-//   line-height: 7px;
-//   margin: 4px;
-//   overflow: hidden;
-//   padding: 1px;
-//   font-size: 11px;
-// }
-//
-// #json-to-html.level0 {
-//   font-size: 25px;
-// }
-// #json-to-html  .level1 {
-//   font-size: 22px;
-// }
-//
-// #json-to-html .leaf {
-//   color: #666;
-//   display: inline;
-// }
-//
-// #json-to-html .altRows:nth-child(odd)    { background-color:#ddd; }
-// #json-to-html .altRows:nth-child(even)    { background-color:#fff; }
-//
-// #json-to-html tr:nth-child(odd)    { background-color:#eee; }
-// #json-to-html tr:nth-child(even)    { background-color:#fff; }
-// </style>
-// <script type="text/javascript">
-//   json-to-html = {
-//     toggleVisibility: function(el, name) {
-//       json-to-html.toggleClass(el.parentElement,'json-to-html-collapse json-to-html-expand');
-//     },
-//     classRe: function(name) {
-//       return new RegExp('(?:^|\\s)'+name+'(?!\\S)');
-//     },
-//     addClass: function(el, name) {
-//       el.className += " "+name;
-//     },
-//     removeClass: function(el, name) {
-//       var re = json-to-html.classRe(name);
-//       el.className  = el.className.replace(json-to-html.classRe(name) , '' )
-//     },
-//     hasClass: function(el, name) {
-//       var re = json-to-html.classRe(name);
-//       return json-to-html.classRe(name).exec(el.className);
-//     },
-//     toggleClass: function(el, name) {
-//       var names = name.split(/\s+/);
-//       for (n in names) {
-//         if (json-to-html.hasClass(el, names[n])) {
-//           json-to-html.removeClass(el, names[n]);
-//         } else {
-//           json-to-html.addClass(el, names[n]);
-//         }
-//       }
-//     }
-//   };
-// </script>`;

package/dist/cjs/types/data-structures/binary-tree/rb-tree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"rb-tree.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/binary-tree/rb-tree.ts"],"names":[],"mappings":""}

package/dist/esm/types/data-structures/binary-tree/rb-tree.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=rb-tree.js.map

package/dist/esm/types/data-structures/binary-tree/rb-tree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"rb-tree.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/binary-tree/rb-tree.ts"],"names":[],"mappings":""}