data-structure-typed 1.32.0 → 1.32.2

package/coverage/coverage-summary.json

@@ -0,0 +1,68 @@
+{"total": {"lines":{"total":3132,"covered":1783,"skipped":0,"pct":56.92},"statements":{"total":3442,"covered":1904,"skipped":0,"pct":55.31},"functions":{"total":646,"covered":312,"skipped":0,"pct":48.29},"branches":{"total":1658,"covered":780,"skipped":0,"pct":47.04},"branchesTrue":{"total":0,"covered":0,"skipped":0,"pct":100}}
+,"/Users/revone/projects/data-structure-typed/src/index.ts": {"lines":{"total":4,"covered":4,"skipped":0,"pct":100},"functions":{"total":0,"covered":0,"skipped":0,"pct":100},"statements":{"total":4,"covered":4,"skipped":0,"pct":100},"branches":{"total":0,"covered":0,"skipped":0,"pct":100}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/index.ts": {"lines":{"total":11,"covered":11,"skipped":0,"pct":100},"functions":{"total":0,"covered":0,"skipped":0,"pct":100},"statements":{"total":11,"covered":11,"skipped":0,"pct":100},"branches":{"total":0,"covered":0,"skipped":0,"pct":100}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/binary-tree/aa-tree.ts": {"lines":{"total":1,"covered":1,"skipped":0,"pct":100},"functions":{"total":0,"covered":0,"skipped":0,"pct":100},"statements":{"total":1,"covered":1,"skipped":0,"pct":100},"branches":{"total":0,"covered":0,"skipped":0,"pct":100}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/binary-tree/abstract-binary-tree.ts": {"lines":{"total":559,"covered":229,"skipped":0,"pct":40.96},"functions":{"total":82,"covered":43,"skipped":0,"pct":52.43},"statements":{"total":613,"covered":240,"skipped":0,"pct":39.15},"branches":{"total":380,"covered":147,"skipped":0,"pct":38.68}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/binary-tree/avl-tree.ts": {"lines":{"total":126,"covered":95,"skipped":0,"pct":75.39},"functions":{"total":12,"covered":11,"skipped":0,"pct":91.66},"statements":{"total":145,"covered":110,"skipped":0,"pct":75.86},"branches":{"total":94,"covered":70,"skipped":0,"pct":74.46}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/binary-tree/b-tree.ts": {"lines":{"total":1,"covered":1,"skipped":0,"pct":100},"functions":{"total":0,"covered":0,"skipped":0,"pct":100},"statements":{"total":1,"covered":1,"skipped":0,"pct":100},"branches":{"total":0,"covered":0,"skipped":0,"pct":100}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/binary-tree/binary-indexed-tree.ts": {"lines":{"total":15,"covered":1,"skipped":0,"pct":6.66},"functions":{"total":7,"covered":0,"skipped":0,"pct":0},"statements":{"total":16,"covered":1,"skipped":0,"pct":6.25},"branches":{"total":4,"covered":0,"skipped":0,"pct":0}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/binary-tree/binary-tree.ts": {"lines":{"total":6,"covered":5,"skipped":0,"pct":83.33},"functions":{"total":3,"covered":2,"skipped":0,"pct":66.66},"statements":{"total":6,"covered":5,"skipped":0,"pct":83.33},"branches":{"total":0,"covered":0,"skipped":0,"pct":100}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/binary-tree/bst.ts": {"lines":{"total":256,"covered":131,"skipped":0,"pct":51.17},"functions":{"total":31,"covered":13,"skipped":0,"pct":41.93},"statements":{"total":308,"covered":144,"skipped":0,"pct":46.75},"branches":{"total":230,"covered":88,"skipped":0,"pct":38.26}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/binary-tree/index.ts": {"lines":{"total":12,"covered":12,"skipped":0,"pct":100},"functions":{"total":0,"covered":0,"skipped":0,"pct":100},"statements":{"total":12,"covered":12,"skipped":0,"pct":100},"branches":{"total":0,"covered":0,"skipped":0,"pct":100}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/binary-tree/rb-tree.ts": {"lines":{"total":10,"covered":4,"skipped":0,"pct":40},"functions":{"total":5,"covered":0,"skipped":0,"pct":0},"statements":{"total":10,"covered":4,"skipped":0,"pct":40},"branches":{"total":1,"covered":0,"skipped":0,"pct":0}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/binary-tree/segment-tree.ts": {"lines":{"total":84,"covered":2,"skipped":0,"pct":2.38},"functions":{"total":27,"covered":0,"skipped":0,"pct":0},"statements":{"total":86,"covered":2,"skipped":0,"pct":2.32},"branches":{"total":39,"covered":0,"skipped":0,"pct":0}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/binary-tree/splay-tree.ts": {"lines":{"total":1,"covered":1,"skipped":0,"pct":100},"functions":{"total":0,"covered":0,"skipped":0,"pct":100},"statements":{"total":1,"covered":1,"skipped":0,"pct":100},"branches":{"total":0,"covered":0,"skipped":0,"pct":100}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/binary-tree/tree-multiset.ts": {"lines":{"total":299,"covered":162,"skipped":0,"pct":54.18},"functions":{"total":39,"covered":17,"skipped":0,"pct":43.58},"statements":{"total":344,"covered":172,"skipped":0,"pct":50},"branches":{"total":194,"covered":79,"skipped":0,"pct":40.72}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/binary-tree/two-three-tree.ts": {"lines":{"total":1,"covered":1,"skipped":0,"pct":100},"functions":{"total":0,"covered":0,"skipped":0,"pct":100},"statements":{"total":1,"covered":1,"skipped":0,"pct":100},"branches":{"total":0,"covered":0,"skipped":0,"pct":100}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/graph/abstract-graph.ts": {"lines":{"total":412,"covered":281,"skipped":0,"pct":68.2},"functions":{"total":52,"covered":34,"skipped":0,"pct":65.38},"statements":{"total":456,"covered":307,"skipped":0,"pct":67.32},"branches":{"total":190,"covered":112,"skipped":0,"pct":58.94}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/graph/directed-graph.ts": {"lines":{"total":142,"covered":113,"skipped":0,"pct":79.57},"functions":{"total":39,"covered":26,"skipped":0,"pct":66.66},"statements":{"total":150,"covered":121,"skipped":0,"pct":80.66},"branches":{"total":78,"covered":57,"skipped":0,"pct":73.07}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/graph/index.ts": {"lines":{"total":4,"covered":4,"skipped":0,"pct":100},"functions":{"total":0,"covered":0,"skipped":0,"pct":100},"statements":{"total":4,"covered":4,"skipped":0,"pct":100},"branches":{"total":0,"covered":0,"skipped":0,"pct":100}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/graph/map-graph.ts": {"lines":{"total":22,"covered":13,"skipped":0,"pct":59.09},"functions":{"total":13,"covered":4,"skipped":0,"pct":30.76},"statements":{"total":22,"covered":13,"skipped":0,"pct":59.09},"branches":{"total":2,"covered":0,"skipped":0,"pct":0}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/graph/undirected-graph.ts": {"lines":{"total":74,"covered":53,"skipped":0,"pct":71.62},"functions":{"total":24,"covered":16,"skipped":0,"pct":66.66},"statements":{"total":79,"covered":57,"skipped":0,"pct":72.15},"branches":{"total":52,"covered":30,"skipped":0,"pct":57.69}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/hash/coordinate-map.ts": {"lines":{"total":10,"covered":1,"skipped":0,"pct":10},"functions":{"total":7,"covered":0,"skipped":0,"pct":0},"statements":{"total":11,"covered":1,"skipped":0,"pct":9.09},"branches":{"total":1,"covered":0,"skipped":0,"pct":0}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/hash/coordinate-set.ts": {"lines":{"total":9,"covered":1,"skipped":0,"pct":11.11},"functions":{"total":6,"covered":0,"skipped":0,"pct":0},"statements":{"total":10,"covered":1,"skipped":0,"pct":10},"branches":{"total":1,"covered":0,"skipped":0,"pct":0}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/hash/hash-table.ts": {"lines":{"total":1,"covered":1,"skipped":0,"pct":100},"functions":{"total":0,"covered":0,"skipped":0,"pct":100},"statements":{"total":1,"covered":1,"skipped":0,"pct":100},"branches":{"total":0,"covered":0,"skipped":0,"pct":100}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/hash/index.ts": {"lines":{"total":6,"covered":6,"skipped":0,"pct":100},"functions":{"total":0,"covered":0,"skipped":0,"pct":100},"statements":{"total":6,"covered":6,"skipped":0,"pct":100},"branches":{"total":0,"covered":0,"skipped":0,"pct":100}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/hash/pair.ts": {"lines":{"total":1,"covered":1,"skipped":0,"pct":100},"functions":{"total":0,"covered":0,"skipped":0,"pct":100},"statements":{"total":1,"covered":1,"skipped":0,"pct":100},"branches":{"total":0,"covered":0,"skipped":0,"pct":100}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/hash/tree-map.ts": {"lines":{"total":1,"covered":1,"skipped":0,"pct":100},"functions":{"total":0,"covered":0,"skipped":0,"pct":100},"statements":{"total":1,"covered":1,"skipped":0,"pct":100},"branches":{"total":0,"covered":0,"skipped":0,"pct":100}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/hash/tree-set.ts": {"lines":{"total":1,"covered":1,"skipped":0,"pct":100},"functions":{"total":0,"covered":0,"skipped":0,"pct":100},"statements":{"total":1,"covered":1,"skipped":0,"pct":100},"branches":{"total":0,"covered":0,"skipped":0,"pct":100}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/heap/heap.ts": {"lines":{"total":43,"covered":29,"skipped":0,"pct":67.44},"functions":{"total":23,"covered":15,"skipped":0,"pct":65.21},"statements":{"total":47,"covered":31,"skipped":0,"pct":65.95},"branches":{"total":52,"covered":29,"skipped":0,"pct":55.76}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/heap/index.ts": {"lines":{"total":3,"covered":3,"skipped":0,"pct":100},"functions":{"total":0,"covered":0,"skipped":0,"pct":100},"statements":{"total":3,"covered":3,"skipped":0,"pct":100},"branches":{"total":0,"covered":0,"skipped":0,"pct":100}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/heap/max-heap.ts": {"lines":{"total":6,"covered":6,"skipped":0,"pct":100},"functions":{"total":2,"covered":2,"skipped":0,"pct":100},"statements":{"total":6,"covered":6,"skipped":0,"pct":100},"branches":{"total":0,"covered":0,"skipped":0,"pct":100}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/heap/min-heap.ts": {"lines":{"total":6,"covered":6,"skipped":0,"pct":100},"functions":{"total":2,"covered":2,"skipped":0,"pct":100},"statements":{"total":6,"covered":6,"skipped":0,"pct":100},"branches":{"total":0,"covered":0,"skipped":0,"pct":100}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/linked-list/doubly-linked-list.ts": {"lines":{"total":210,"covered":185,"skipped":0,"pct":88.09},"functions":{"total":37,"covered":35,"skipped":0,"pct":94.59},"statements":{"total":220,"covered":189,"skipped":0,"pct":85.9},"branches":{"total":48,"covered":36,"skipped":0,"pct":75}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/linked-list/index.ts": {"lines":{"total":3,"covered":3,"skipped":0,"pct":100},"functions":{"total":0,"covered":0,"skipped":0,"pct":100},"statements":{"total":3,"covered":3,"skipped":0,"pct":100},"branches":{"total":0,"covered":0,"skipped":0,"pct":100}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/linked-list/singly-linked-list.ts": {"lines":{"total":184,"covered":165,"skipped":0,"pct":89.67},"functions":{"total":33,"covered":29,"skipped":0,"pct":87.87},"statements":{"total":195,"covered":174,"skipped":0,"pct":89.23},"branches":{"total":43,"covered":34,"skipped":0,"pct":79.06}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/linked-list/skip-linked-list.ts": {"lines":{"total":1,"covered":1,"skipped":0,"pct":100},"functions":{"total":0,"covered":0,"skipped":0,"pct":100},"statements":{"total":1,"covered":1,"skipped":0,"pct":100},"branches":{"total":0,"covered":0,"skipped":0,"pct":100}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/matrix/index.ts": {"lines":{"total":4,"covered":4,"skipped":0,"pct":100},"functions":{"total":0,"covered":0,"skipped":0,"pct":100},"statements":{"total":4,"covered":4,"skipped":0,"pct":100},"branches":{"total":0,"covered":0,"skipped":0,"pct":100}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/matrix/matrix.ts": {"lines":{"total":4,"covered":1,"skipped":0,"pct":25},"functions":{"total":3,"covered":0,"skipped":0,"pct":0},"statements":{"total":5,"covered":1,"skipped":0,"pct":20},"branches":{"total":2,"covered":0,"skipped":0,"pct":0}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/matrix/matrix2d.ts": {"lines":{"total":48,"covered":3,"skipped":0,"pct":6.25},"functions":{"total":14,"covered":0,"skipped":0,"pct":0},"statements":{"total":57,"covered":3,"skipped":0,"pct":5.26},"branches":{"total":4,"covered":0,"skipped":0,"pct":0}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/matrix/navigator.ts": {"lines":{"total":45,"covered":2,"skipped":0,"pct":4.44},"functions":{"total":6,"covered":0,"skipped":0,"pct":0},"statements":{"total":48,"covered":2,"skipped":0,"pct":4.16},"branches":{"total":21,"covered":0,"skipped":0,"pct":0}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/matrix/vector2d.ts": {"lines":{"total":47,"covered":2,"skipped":0,"pct":4.25},"functions":{"total":23,"covered":0,"skipped":0,"pct":0},"statements":{"total":47,"covered":2,"skipped":0,"pct":4.25},"branches":{"total":16,"covered":0,"skipped":0,"pct":0}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/priority-queue/index.ts": {"lines":{"total":3,"covered":3,"skipped":0,"pct":100},"functions":{"total":0,"covered":0,"skipped":0,"pct":100},"statements":{"total":3,"covered":3,"skipped":0,"pct":100},"branches":{"total":0,"covered":0,"skipped":0,"pct":100}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/priority-queue/max-priority-queue.ts": {"lines":{"total":12,"covered":12,"skipped":0,"pct":100},"functions":{"total":4,"covered":4,"skipped":0,"pct":100},"statements":{"total":12,"covered":12,"skipped":0,"pct":100},"branches":{"total":12,"covered":11,"skipped":0,"pct":91.66}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/priority-queue/min-priority-queue.ts": {"lines":{"total":12,"covered":6,"skipped":0,"pct":50},"functions":{"total":4,"covered":2,"skipped":0,"pct":50},"statements":{"total":12,"covered":6,"skipped":0,"pct":50},"branches":{"total":12,"covered":4,"skipped":0,"pct":33.33}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/priority-queue/priority-queue.ts": {"lines":{"total":94,"covered":90,"skipped":0,"pct":95.74},"functions":{"total":31,"covered":30,"skipped":0,"pct":96.77},"statements":{"total":98,"covered":94,"skipped":0,"pct":95.91},"branches":{"total":70,"covered":62,"skipped":0,"pct":88.57}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/queue/deque.ts": {"lines":{"total":63,"covered":4,"skipped":0,"pct":6.34},"functions":{"total":32,"covered":0,"skipped":0,"pct":0},"statements":{"total":68,"covered":4,"skipped":0,"pct":5.88},"branches":{"total":31,"covered":0,"skipped":0,"pct":0}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/queue/index.ts": {"lines":{"total":2,"covered":2,"skipped":0,"pct":100},"functions":{"total":0,"covered":0,"skipped":0,"pct":100},"statements":{"total":2,"covered":2,"skipped":0,"pct":100},"branches":{"total":0,"covered":0,"skipped":0,"pct":100}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/queue/queue.ts": {"lines":{"total":35,"covered":22,"skipped":0,"pct":62.85},"functions":{"total":22,"covered":11,"skipped":0,"pct":50},"statements":{"total":37,"covered":23,"skipped":0,"pct":62.16},"branches":{"total":12,"covered":4,"skipped":0,"pct":33.33}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/stack/index.ts": {"lines":{"total":1,"covered":1,"skipped":0,"pct":100},"functions":{"total":0,"covered":0,"skipped":0,"pct":100},"statements":{"total":1,"covered":1,"skipped":0,"pct":100},"branches":{"total":0,"covered":0,"skipped":0,"pct":100}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/stack/stack.ts": {"lines":{"total":14,"covered":1,"skipped":0,"pct":7.14},"functions":{"total":10,"covered":0,"skipped":0,"pct":0},"statements":{"total":16,"covered":1,"skipped":0,"pct":6.25},"branches":{"total":6,"covered":0,"skipped":0,"pct":0}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/tree/index.ts": {"lines":{"total":1,"covered":1,"skipped":0,"pct":100},"functions":{"total":0,"covered":0,"skipped":0,"pct":100},"statements":{"total":1,"covered":1,"skipped":0,"pct":100},"branches":{"total":0,"covered":0,"skipped":0,"pct":100}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/tree/tree.ts": {"lines":{"total":27,"covered":1,"skipped":0,"pct":3.7},"functions":{"total":10,"covered":0,"skipped":0,"pct":0},"statements":{"total":29,"covered":1,"skipped":0,"pct":3.44},"branches":{"total":10,"covered":0,"skipped":0,"pct":0}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/trie/index.ts": {"lines":{"total":1,"covered":1,"skipped":0,"pct":100},"functions":{"total":0,"covered":0,"skipped":0,"pct":100},"statements":{"total":1,"covered":1,"skipped":0,"pct":100},"branches":{"total":0,"covered":0,"skipped":0,"pct":100}}
+,"/Users/revone/projects/data-structure-typed/src/data-structures/trie/trie.ts": {"lines":{"total":96,"covered":2,"skipped":0,"pct":2.08},"functions":{"total":22,"covered":0,"skipped":0,"pct":0},"statements":{"total":105,"covered":2,"skipped":0,"pct":1.9},"branches":{"total":32,"covered":0,"skipped":0,"pct":0}}
+,"/Users/revone/projects/data-structure-typed/src/interfaces/index.ts": {"lines":{"total":15,"covered":15,"skipped":0,"pct":100},"functions":{"total":0,"covered":0,"skipped":0,"pct":100},"statements":{"total":15,"covered":15,"skipped":0,"pct":100},"branches":{"total":0,"covered":0,"skipped":0,"pct":100}}
+,"/Users/revone/projects/data-structure-typed/src/types/index.ts": {"lines":{"total":3,"covered":3,"skipped":0,"pct":100},"functions":{"total":0,"covered":0,"skipped":0,"pct":100},"statements":{"total":3,"covered":3,"skipped":0,"pct":100},"branches":{"total":0,"covered":0,"skipped":0,"pct":100}}
+,"/Users/revone/projects/data-structure-typed/src/types/data-structures/abstract-binary-tree.ts": {"lines":{"total":11,"covered":11,"skipped":0,"pct":100},"functions":{"total":2,"covered":2,"skipped":0,"pct":100},"statements":{"total":11,"covered":11,"skipped":0,"pct":100},"branches":{"total":4,"covered":4,"skipped":0,"pct":100}}
+,"/Users/revone/projects/data-structure-typed/src/types/data-structures/bst.ts": {"lines":{"total":1,"covered":1,"skipped":0,"pct":100},"functions":{"total":1,"covered":1,"skipped":0,"pct":100},"statements":{"total":4,"covered":4,"skipped":0,"pct":100},"branches":{"total":2,"covered":2,"skipped":0,"pct":100}}
+,"/Users/revone/projects/data-structure-typed/src/types/data-structures/directed-graph.ts": {"lines":{"total":4,"covered":4,"skipped":0,"pct":100},"functions":{"total":1,"covered":1,"skipped":0,"pct":100},"statements":{"total":4,"covered":4,"skipped":0,"pct":100},"branches":{"total":2,"covered":2,"skipped":0,"pct":100}}
+,"/Users/revone/projects/data-structure-typed/src/types/data-structures/index.ts": {"lines":{"total":15,"covered":15,"skipped":0,"pct":100},"functions":{"total":0,"covered":0,"skipped":0,"pct":100},"statements":{"total":15,"covered":15,"skipped":0,"pct":100},"branches":{"total":0,"covered":0,"skipped":0,"pct":100}}
+,"/Users/revone/projects/data-structure-typed/src/types/data-structures/rb-tree.ts": {"lines":{"total":1,"covered":1,"skipped":0,"pct":100},"functions":{"total":1,"covered":1,"skipped":0,"pct":100},"statements":{"total":3,"covered":3,"skipped":0,"pct":100},"branches":{"total":2,"covered":2,"skipped":0,"pct":100}}
+,"/Users/revone/projects/data-structure-typed/src/types/utils/index.ts": {"lines":{"total":2,"covered":2,"skipped":0,"pct":100},"functions":{"total":0,"covered":0,"skipped":0,"pct":100},"statements":{"total":2,"covered":2,"skipped":0,"pct":100},"branches":{"total":0,"covered":0,"skipped":0,"pct":100}}
+,"/Users/revone/projects/data-structure-typed/src/utils/index.ts": {"lines":{"total":1,"covered":1,"skipped":0,"pct":100},"functions":{"total":0,"covered":0,"skipped":0,"pct":100},"statements":{"total":1,"covered":1,"skipped":0,"pct":100},"branches":{"total":0,"covered":0,"skipped":0,"pct":100}}
+,"/Users/revone/projects/data-structure-typed/src/utils/utils.ts": {"lines":{"total":38,"covered":31,"skipped":0,"pct":81.57},"functions":{"total":15,"covered":10,"skipped":0,"pct":66.66},"statements":{"total":49,"covered":40,"skipped":0,"pct":81.63},"branches":{"total":11,"covered":7,"skipped":0,"pct":63.63}}
+,"/Users/revone/projects/data-structure-typed/test/utils/index.ts": {"lines":{"total":2,"covered":2,"skipped":0,"pct":100},"functions":{"total":0,"covered":0,"skipped":0,"pct":100},"statements":{"total":2,"covered":2,"skipped":0,"pct":100},"branches":{"total":0,"covered":0,"skipped":0,"pct":100}}
+,"/Users/revone/projects/data-structure-typed/test/utils/magnitude.ts": {"lines":{"total":3,"covered":3,"skipped":0,"pct":100},"functions":{"total":0,"covered":0,"skipped":0,"pct":100},"statements":{"total":3,"covered":3,"skipped":0,"pct":100},"branches":{"total":0,"covered":0,"skipped":0,"pct":100}}
+,"/Users/revone/projects/data-structure-typed/test/utils/number.ts": {"lines":{"total":2,"covered":2,"skipped":0,"pct":100},"functions":{"total":1,"covered":1,"skipped":0,"pct":100},"statements":{"total":2,"covered":2,"skipped":0,"pct":100},"branches":{"total":0,"covered":0,"skipped":0,"pct":100}}
+}

package/coverage/lcov-report/index.html

@@ -371,7 +371,7 @@
             <div class='footer quiet pad2 space-top1 center small'>
                 Code coverage generated by
                 <a href="https://istanbul.js.org/" target="_blank" rel="noopener noreferrer">istanbul</a>
-                at 2023-09-21T16:58:55.114Z
+                at 2023-09-22T03:26:43.997Z
             </div>
         <script src="prettify.js"></script>
         <script>

package/coverage/lcov-report/src/data-structures/binary-tree/aa-tree.ts.html

@@ -73,7 +73,7 @@
             <div class='footer quiet pad2 space-top1 center small'>
                 Code coverage generated by
                 <a href="https://istanbul.js.org/" target="_blank" rel="noopener noreferrer">istanbul</a>
-                at 2023-09-21T16:58:55.114Z
+                at 2023-09-22T03:26:43.997Z
             </div>
         <script src="../../../prettify.js"></script>
         <script>

package/coverage/lcov-report/src/data-structures/binary-tree/abstract-binary-tree.ts.html

@@ -1690,7 +1690,11 @@
 <a name='L1625'></a><a href='#L1625'>1625</a>
 <a name='L1626'></a><a href='#L1626'>1626</a>
 <a name='L1627'></a><a href='#L1627'>1627</a>
-<a name='L1628'></a><a href='#L1628'>1628</a></td><td class="line-coverage quiet"><span class="cline-any cline-neutral">&nbsp;</span>
+<a name='L1628'></a><a href='#L1628'>1628</a>
+<a name='L1629'></a><a href='#L1629'>1629</a>
+<a name='L1630'></a><a href='#L1630'>1630</a>
+<a name='L1631'></a><a href='#L1631'>1631</a>
+<a name='L1632'></a><a href='#L1632'>1632</a></td><td class="line-coverage quiet"><span class="cline-any cline-neutral">&nbsp;</span>
 <span class="cline-any cline-neutral">&nbsp;</span>
 <span class="cline-any cline-neutral">&nbsp;</span>
 <span class="cline-any cline-neutral">&nbsp;</span>
@@ -1722,6 +1726,9 @@
 <span class="cline-any cline-neutral">&nbsp;</span>
 <span class="cline-any cline-neutral">&nbsp;</span>
 <span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
 <span class="cline-any cline-yes">218x</span>
 <span class="cline-any cline-yes">218x</span>
 <span class="cline-any cline-neutral">&nbsp;</span>
@@ -1832,6 +1839,7 @@
 <span class="cline-any cline-neutral">&nbsp;</span>
 <span class="cline-any cline-neutral">&nbsp;</span>
 <span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
 <span class="cline-any cline-yes">8x</span>
 <span class="cline-any cline-yes">2x</span>
 <span class="cline-any cline-yes">2x</span>
@@ -3339,8 +3347,11 @@ import type {
 import {AbstractBinaryTreeOptions, FamilyPosition, LoopType} from '../../types';
 import {IAbstractBinaryTree, IAbstractBinaryTreeNode} from '../../interfaces';
 &nbsp;
-export abstract class AbstractBinaryTreeNode&lt;T = any,
-  NEIGHBOR extends AbstractBinaryTreeNode&lt;T, NEIGHBOR&gt; = AbstractBinaryTreeNodeNested&lt;T&gt;&gt; implements IAbstractBinaryTreeNode&lt;T, NEIGHBOR&gt; {
+export abstract class AbstractBinaryTreeNode&lt;
+  T = any,
+  NEIGHBOR extends AbstractBinaryTreeNode&lt;T, NEIGHBOR&gt; = AbstractBinaryTreeNodeNested&lt;T&gt;
+&gt; implements IAbstractBinaryTreeNode&lt;T, NEIGHBOR&gt;
+{
   /**
    * The constructor function initializes a BinaryTreeNode object with an id and an optional value.
    * @param {BinaryTreeNodeId} id - The `id` parameter is of type `BinaryTreeNodeId` and represents the unique identifier
@@ -3452,7 +3463,8 @@ export abstract class AbstractBinaryTreeNode&lt;T = any,
 }
 &nbsp;
 export abstract class AbstractBinaryTree&lt;N extends AbstractBinaryTreeNode&lt;N['val'], N&gt; = AbstractBinaryTreeNode&gt;
-  implements IAbstractBinaryTree&lt;N&gt; {
+  implements IAbstractBinaryTree&lt;N&gt;
+{
   /**
    * The protected constructor initializes the options for an abstract binary tree.
    * @param {AbstractBinaryTreeOptions} [options] - An optional object that contains configuration options for the binary
@@ -3762,7 +3774,7 @@ export abstract class AbstractBinaryTree&lt;N extends AbstractBinaryTreeNode&lt;
 <span class="cstat-no" title="statement not covered" >        return -1;</span>
       }
 &nbsp;
-      const stack: { node: N; depth: number }[] = [{node: beginRoot, depth: 0}];
+      const stack: {node: N; depth: number}[] = [{node: beginRoot, depth: 0}];
       let maxHeight = 0;
 &nbsp;
       while (stack.length &gt; 0) {
@@ -4401,7 +4413,7 @@ export abstract class AbstractBinaryTree&lt;N extends AbstractBinaryTreeNode&lt;
 <span class="cstat-no" title="statement not covered" >    this._clearResults();</span>
 <span class="cstat-no" title="statement not covered" >    <span class="missing-if-branch" title="if path not taken" >I</span>if (!this.root) <span class="cstat-no" title="statement not covered" >return this._getResultByPropertyName(nodeOrPropertyName);</span></span>
     // 0: visit, 1: print
-    const stack: { opt: 0 | 1; node: N | null | undefined }[] = <span class="cstat-no" title="statement not covered" >[{opt: 0, node: this.root}];</span>
+    const stack: {opt: 0 | 1; node: N | null | undefined}[] = <span class="cstat-no" title="statement not covered" >[{opt: 0, node: this.root}];</span>
 &nbsp;
 <span class="cstat-no" title="statement not covered" >    while (stack.length &gt; 0) {</span>
       const cur = <span class="cstat-no" title="statement not covered" >stack.pop();</span>
@@ -4951,7 +4963,7 @@ export abstract class AbstractBinaryTree&lt;N extends AbstractBinaryTreeNode&lt;
             <div class='footer quiet pad2 space-top1 center small'>
                 Code coverage generated by
                 <a href="https://istanbul.js.org/" target="_blank" rel="noopener noreferrer">istanbul</a>
-                at 2023-09-21T16:58:55.114Z
+                at 2023-09-22T03:26:43.997Z
             </div>
         <script src="../../../prettify.js"></script>
         <script>

package/coverage/lcov-report/src/data-structures/binary-tree/avl-tree.ts.html

@@ -690,9 +690,9 @@
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-import { BST, BSTNode } from './bst';
-import type { AVLTreeNodeNested, AVLTreeOptions, BinaryTreeDeletedResult, BinaryTreeNodeId } from '../../types';
-import { IAVLTree, IAVLTreeNode } from '../../interfaces';
+import {BST, BSTNode} from './bst';
+import type {AVLTreeNodeNested, AVLTreeOptions, BinaryTreeDeletedResult, BinaryTreeNodeId} from '../../types';
+import {IAVLTree, IAVLTreeNode} from '../../interfaces';
  
 export class AVLTreeNode<T = any, NEIGHBOR extends AVLTreeNode<T, NEIGHBOR> = AVLTreeNodeNested<T>>
   extends BSTNode<T, NEIGHBOR>
@@ -752,7 +752,7 @@ export class AVLTree<N extends AVLTreeNode<N['val'], N> = AVLTreeNode&g
    */
   override remove(id: BinaryTreeNodeId, isUpdateAllLeftSum?: boolean): BinaryTreeDeletedResult<N>[] {
     const deletedResults = super.remove(id, isUpdateAllLeftSum);
-    for (const { needBalanced } of deletedResults) {
+    for (const {needBalanced} of deletedResults) {
       if (needBalanced) {
         this._balancePath(needBalanced);
       }
@@ -1000,7 +1000,7 @@ export class AVLTree<N extends AVLTreeNode<N['val'], N> = AVLTreeNode&g
             <div class='footer quiet pad2 space-top1 center small'>
                 Code coverage generated by
                 <a href="https://istanbul.js.org/" target="_blank" rel="noopener noreferrer">istanbul</a>
-                at 2023-09-21T16:58:55.114Z
+                at 2023-09-22T03:26:43.997Z
             </div>
         <script src="../../../prettify.js"></script>
         <script>

package/coverage/lcov-report/src/data-structures/binary-tree/b-tree.ts.html

@@ -73,7 +73,7 @@
             <div class='footer quiet pad2 space-top1 center small'>
                 Code coverage generated by
                 <a href="https://istanbul.js.org/" target="_blank" rel="noopener noreferrer">istanbul</a>
-                at 2023-09-21T16:58:55.114Z
+                at 2023-09-22T03:26:43.997Z
             </div>
         <script src="../../../prettify.js"></script>
         <script>

package/coverage/lcov-report/src/data-structures/binary-tree/binary-indexed-tree.ts.html

@@ -298,7 +298,7 @@ export class BinaryIndexedTree {
             <div class='footer quiet pad2 space-top1 center small'>
                 Code coverage generated by
                 <a href="https://istanbul.js.org/" target="_blank" rel="noopener noreferrer">istanbul</a>
-                at 2023-09-21T16:58:55.114Z
+                at 2023-09-22T03:26:43.997Z
             </div>
         <script src="../../../prettify.js"></script>
         <script>

package/coverage/lcov-report/src/data-structures/binary-tree/binary-tree.ts.html

@@ -165,9 +165,9 @@
  * @license MIT License
  */
  
-import type { BinaryTreeNodeId, BinaryTreeNodeNested, BinaryTreeOptions } from '../../types';
-import { AbstractBinaryTree, AbstractBinaryTreeNode } from './abstract-binary-tree';
-import { IBinaryTree, IBinaryTreeNode } from '../../interfaces';
+import type {BinaryTreeNodeId, BinaryTreeNodeNested, BinaryTreeOptions} from '../../types';
+import {AbstractBinaryTree, AbstractBinaryTreeNode} from './abstract-binary-tree';
+import {IBinaryTree, IBinaryTreeNode} from '../../interfaces';
  
 export class BinaryTreeNode<T = any, NEIGHBOR extends BinaryTreeNode<T, NEIGHBOR> = BinaryTreeNodeNested<T>>
   extends AbstractBinaryTreeNode<T, NEIGHBOR>
@@ -211,7 +211,7 @@ export class BinaryTree<N extends BinaryTreeNode<N['val'], N> = BinaryT
             <div class='footer quiet pad2 space-top1 center small'>
                 Code coverage generated by
                 <a href="https://istanbul.js.org/" target="_blank" rel="noopener noreferrer">istanbul</a>
-                at 2023-09-21T16:58:55.114Z
+                at 2023-09-22T03:26:43.997Z
             </div>
         <script src="../../../prettify.js"></script>
         <script>

package/coverage/lcov-report/src/data-structures/binary-tree/bst.ts.html

@@ -600,19 +600,7 @@
 <a name='L535'></a><a href='#L535'>535</a>
 <a name='L536'></a><a href='#L536'>536</a>
 <a name='L537'></a><a href='#L537'>537</a>
-<a name='L538'></a><a href='#L538'>538</a>
-<a name='L539'></a><a href='#L539'>539</a>
-<a name='L540'></a><a href='#L540'>540</a>
-<a name='L541'></a><a href='#L541'>541</a>
-<a name='L542'></a><a href='#L542'>542</a>
-<a name='L543'></a><a href='#L543'>543</a>
-<a name='L544'></a><a href='#L544'>544</a></td><td class="line-coverage quiet"><span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
+<a name='L538'></a><a href='#L538'>538</a></td><td class="line-coverage quiet"><span class="cline-any cline-neutral">&nbsp;</span>
 <span class="cline-any cline-neutral">&nbsp;</span>
 <span class="cline-any cline-neutral">&nbsp;</span>
 <span class="cline-any cline-neutral">&nbsp;</span>
@@ -1156,16 +1144,10 @@
  * @copyright Copyright (c) 2022 Tyler Zeng &lt;zrwusa@gmail.com&gt;
  * @license MIT License
  */
-import type {
-  BinaryTreeNodeId,
-  BinaryTreeNodePropertyName,
-  BSTComparator,
-  BSTNodeNested,
-  BSTOptions
-} from '../../types';
-import { CP, LoopType } from '../../types';
-import { BinaryTree, BinaryTreeNode } from './binary-tree';
-import { IBST, IBSTNode } from '../../interfaces';
+import type {BinaryTreeNodeId, BinaryTreeNodePropertyName, BSTComparator, BSTNodeNested, BSTOptions} from '../../types';
+import {CP, LoopType} from '../../types';
+import {BinaryTree, BinaryTreeNode} from './binary-tree';
+import {IBST, IBSTNode} from '../../interfaces';
 &nbsp;
 export class BSTNode&lt;T = any, NEIGHBOR extends BSTNode&lt;T, NEIGHBOR&gt; = BSTNodeNested&lt;T&gt;&gt;
   extends BinaryTreeNode&lt;T, NEIGHBOR&gt;
@@ -1184,7 +1166,7 @@ export class BST&lt;N extends BSTNode&lt;N['val'], N&gt; = BSTNode&gt; extends B
   constructor(options?: BSTOptions) {
     super(options);
     if (options !== undefined) {
-      const { comparator } = options;
+      const {comparator} = options;
       <span class="missing-if-branch" title="if path not taken" >I</span>if (comparator !== undefined) {
 <span class="cstat-no" title="statement not covered" >        this._comparator = comparator;</span>
       }
@@ -1699,7 +1681,7 @@ export class BST&lt;N extends BSTNode&lt;N['val'], N&gt; = BSTNode&gt; extends B
             <div class='footer quiet pad2 space-top1 center small'>
                 Code coverage generated by
                 <a href="https://istanbul.js.org/" target="_blank" rel="noopener noreferrer">istanbul</a>
-                at 2023-09-21T16:58:55.114Z
+                at 2023-09-22T03:26:43.997Z
             </div>
         <script src="../../../prettify.js"></script>
         <script>

package/coverage/lcov-report/src/data-structures/binary-tree/index.html

@@ -281,7 +281,7 @@
             <div class='footer quiet pad2 space-top1 center small'>
                 Code coverage generated by
                 <a href="https://istanbul.js.org/" target="_blank" rel="noopener noreferrer">istanbul</a>
-                at 2023-09-21T16:58:55.114Z
+                at 2023-09-22T03:26:43.997Z
             </div>
         <script src="../../../prettify.js"></script>
         <script>

package/coverage/lcov-report/src/data-structures/binary-tree/index.ts.html

@@ -106,7 +106,7 @@ export * from './two-three-tree';
             <div class='footer quiet pad2 space-top1 center small'>
                 Code coverage generated by
                 <a href="https://istanbul.js.org/" target="_blank" rel="noopener noreferrer">istanbul</a>
-                at 2023-09-21T16:58:55.114Z
+                at 2023-09-22T03:26:43.997Z
             </div>
         <script src="../../../prettify.js"></script>
         <script>

package/coverage/lcov-report/src/data-structures/binary-tree/rb-tree.ts.html

@@ -265,9 +265,9 @@
 <span class="cline-any cline-neutral">&nbsp;</span>
 <span class="cline-any cline-neutral">&nbsp;</span>
 <span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span></td><td class="text"><pre class="prettyprint lang-js">import { BinaryTreeNodeId, RBColor, RBTreeNodeNested, RBTreeOptions } from '../../types';
-import { IRBTree, IRBTreeNode } from '../../interfaces/rb-tree';
-import { BST, BSTNode } from './bst';
+<span class="cline-any cline-neutral">&nbsp;</span></td><td class="text"><pre class="prettyprint lang-js">import {BinaryTreeNodeId, RBColor, RBTreeNodeNested, RBTreeOptions} from '../../types';
+import {IRBTree, IRBTreeNode} from '../../interfaces/rb-tree';
+import {BST, BSTNode} from './bst';
 &nbsp;
 export class RBTreeNode&lt;T = any, NEIGHBOR extends RBTreeNode&lt;T, NEIGHBOR&gt; = RBTreeNodeNested&lt;T&gt;&gt;
   extends BSTNode&lt;T, NEIGHBOR&gt;
@@ -373,7 +373,7 @@ export class RBTree&lt;N extends RBTreeNode&lt;N['val'], N&gt; = RBTreeNode&gt;
             <div class='footer quiet pad2 space-top1 center small'>
                 Code coverage generated by
                 <a href="https://istanbul.js.org/" target="_blank" rel="noopener noreferrer">istanbul</a>
-                at 2023-09-21T16:58:55.114Z
+                at 2023-09-22T03:26:43.997Z
             </div>
         <script src="../../../prettify.js"></script>
         <script>

package/coverage/lcov-report/src/data-structures/binary-tree/segment-tree.ts.html

@@ -555,7 +555,7 @@
  * @license MIT License
  */
  
-import type { SegmentTreeNodeVal } from '../../types';
+import type {SegmentTreeNodeVal} from '../../types';
  
 export class SegmentTreeNode {
 <span class="fstat-no" title="function not covered" >  constructor(s</span>tart: number, end: number, sum: number, val?: SegmentTreeNodeVal | null) {
@@ -796,7 +796,7 @@ export class SegmentTree {
             <div class='footer quiet pad2 space-top1 center small'>
                 Code coverage generated by
                 <a href="https://istanbul.js.org/" target="_blank" rel="noopener noreferrer">istanbul</a>
-                at 2023-09-21T16:58:55.114Z
+                at 2023-09-22T03:26:43.997Z
             </div>
         <script src="../../../prettify.js"></script>
         <script>

package/coverage/lcov-report/src/data-structures/binary-tree/splay-tree.ts.html

@@ -73,7 +73,7 @@
             <div class='footer quiet pad2 space-top1 center small'>
                 Code coverage generated by
                 <a href="https://istanbul.js.org/" target="_blank" rel="noopener noreferrer">istanbul</a>
-                at 2023-09-21T16:58:55.114Z
+                at 2023-09-22T03:26:43.997Z
             </div>
         <script src="../../../prettify.js"></script>
         <script>

package/coverage/lcov-report/src/data-structures/binary-tree/tree-multiset.ts.html

@@ -1470,10 +1470,10 @@
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-import type { BinaryTreeNodeId, TreeMultisetNodeNested, TreeMultisetOptions } from '../../types';
-import { BinaryTreeDeletedResult, CP, DFSOrderPattern, FamilyPosition, LoopType } from '../../types';
-import { ITreeMultiset, ITreeMultisetNode } from '../../interfaces';
-import { AVLTree, AVLTreeNode } from './avl-tree';
+import type {BinaryTreeNodeId, TreeMultisetNodeNested, TreeMultisetOptions} from '../../types';
+import {BinaryTreeDeletedResult, CP, DFSOrderPattern, FamilyPosition, LoopType} from '../../types';
+import {ITreeMultiset, ITreeMultisetNode} from '../../interfaces';
+import {AVLTree, AVLTreeNode} from './avl-tree';
  
 export class TreeMultisetNode<T = any, NEIGHBOR extends TreeMultisetNode<T, NEIGHBOR> = TreeMultisetNodeNested<T>>
   extends AVLTreeNode<T, NEIGHBOR>
@@ -1519,7 +1519,7 @@ export class TreeMultiset<N extends TreeMultisetNode<N['val'], N> = Tre
    * TreeMultiset.
    */
   constructor(options?: TreeMultisetOptions) {
-    super({ ...options });
+    super({...options});
   }
  
   private _count = 0;
@@ -1549,7 +1549,7 @@ export class TreeMultiset<N extends TreeMultisetNode<N['val'], N> = Tre
    * @returns the `destNode` after swapping its values with the `srcNode`.
    */
   override swapLocation(srcNode: N, destNode: N): N {
-    const { id, val, count, height } = destNode;
+    const {id, val, count, height} = destNode;
     const tempNode = this.createNode(id, val, count);
     if (tempNode) {
       tempNode.height = height;
@@ -1786,7 +1786,7 @@ export class TreeMultiset<N extends TreeMultisetNode<N['val'], N> = Tre
         <span class="missing-if-branch" title="if path not taken" >I</span>if (!parent) {
 <span class="cstat-no" title="statement not covered" >          <span class="missing-if-branch" title="if path not taken" >I</span>if (curr.right !== undefined) <span class="cstat-no" title="statement not covered" >this._setRoot(curr.right);</span></span>
         } else {
-          const { familyPosition: fp } = curr;
+          const {familyPosition: fp} = curr;
           if (fp === FamilyPosition.LEFT || fp === FamilyPosition.ROOT_LEFT) {
             parent.left = curr.right;
           } else if (fp === FamilyPosition.RIGHT || fp === FamilyPosition.ROOT_RIGHT) {
@@ -1814,7 +1814,7 @@ export class TreeMultiset&lt;N extends TreeMultisetNode&lt;N['val'], N&gt; = Tre
       this._setCount(this.count - orgCurrent.count);
     }
 &nbsp;
-    bstDeletedResult.push({ deleted: orgCurrent, needBalanced });
+    bstDeletedResult.push({deleted: orgCurrent, needBalanced});
 &nbsp;
     if (needBalanced) {
       this._balancePath(needBalanced);
@@ -2170,7 +2170,7 @@ export class TreeMultiset&lt;N extends TreeMultisetNode&lt;N['val'], N&gt; = Tre
             <div class='footer quiet pad2 space-top1 center small'>
                 Code coverage generated by
                 <a href="https://istanbul.js.org/" target="_blank" rel="noopener noreferrer">istanbul</a>
-                at 2023-09-21T16:58:55.114Z
+                at 2023-09-22T03:26:43.997Z
             </div>
         <script src="../../../prettify.js"></script>
         <script>

package/coverage/lcov-report/src/data-structures/binary-tree/two-three-tree.ts.html

@@ -73,7 +73,7 @@
             <div class='footer quiet pad2 space-top1 center small'>
                 Code coverage generated by
                 <a href="https://istanbul.js.org/" target="_blank" rel="noopener noreferrer">istanbul</a>
-                at 2023-09-21T16:58:55.114Z
+                at 2023-09-22T03:26:43.997Z
             </div>
         <script src="../../../prettify.js"></script>
         <script>