Important: This documentation covers Yarn 1 (Classic).
For Yarn 2+ docs and migration guide, see yarnpkg.com.

Package detail

tree-multimap-typed

zrwusa401MIT2.0.4TypeScript support: included

Tree Multimap

Tree Multiset, tree multiset, treemultimap, tree-multimap, duplicate elements, duplicate, node, nodes, element, elements, count, Count, order statistics, self balancing, selfbalancing, self-balancing, Multiset operations, efficient search, frequency, ordered traversal, dynamic resizing, element uniqueness, set operations, multiset, balanced, Balanced, avl, AVL, tree, Tree, avl tree, avl-tree, avltree, AVL Tree, self-balancing, selfbalancing, selfbalance, self balance, self, auto, height, balance, balancing, balanced, constraint, factor, auto balance, Adelson, Velsky, Landis, Adelson-Velsky and Landis Tree, height-balanced, rotations, tree rotations, balancing factor, balanced binary search tree, Adelson-Velsky-Landis tree, binary, bianry tree, Binary Tree, binary-tree, javascript, java script, JavaScript, js, typescript, type script, TypeScript, ts, complete, sorted, sorting, sort, ordered, trees, complete binary tree, bst tree, balanced binary tree, balanced bst, full binary tree, full binary trees, data, structure, structures, data structure, datastructure, data-structure, data structures, datastructures, data-structures, in data structures, in data structure, DataStructure, DataStructures, traversal, inorder, preorder, postorder, pre, in, post, order, pre-order, pre order, in-order, in order, post-order, post order, dfs, DFS, bfs, BFS, recursive, iterative, leaf, root, parent, child, depth, height, Node.js, CommonJS, ES6, UMD, esmodule, java.util, c++ stl, c++ std, Python collections, System.Collections.Generic, STL, stl, util, collection, Collection, collections, Collections

readme

NPM GitHub top language npm eslint npm bundle size npm bundle size npm

What

Brief

This is a standalone Tree Multiset data structure from the data-structure-typed collection. If you wish to access more data structures or advanced features, you can transition to directly installing the complete data-structure-typed package

How

install

npm

npm i tree-multimap-typed --save

yarn

yarn add tree-multimap-typed

snippet

API docs & Examples

API Docs

Live Examples

Examples Repository

Data Structures

Data Structure Unit Test Performance Test API Docs
Tree Multimap TreeMultimap

Standard library data structure comparison

Data Structure Typed C++ STL java.util Python collections
TreeMultimap<K, V> multimap<K, V> - -

Benchmark

rb-tree
test nametime taken (ms)executions per secsample deviation
100,000 add85.8511.650.00
100,000 add & delete randomly211.544.730.00
100,000 getNode37.9226.371.65e-4

Built-in classic algorithms

Algorithm Function Description Iteration Type
Binary Tree DFS Traverse a binary tree in a depth-first manner, starting from the root node, first visiting the left subtree, and then the right subtree, using recursion. Recursion + Iteration
Binary Tree BFS Traverse a binary tree in a breadth-first manner, starting from the root node, visiting nodes level by level from left to right. Iteration
Binary Tree Morris Morris traversal is an in-order traversal algorithm for binary trees with O(1) space complexity. It allows tree traversal without additional stack or recursion. Iteration

Software Engineering Design Standards

Principle Description
Practicality Follows ES6 and ESNext standards, offering unified and considerate optional parameters, and simplifies method names.
Extensibility Adheres to OOP (Object-Oriented Programming) principles, allowing inheritance for all data structures.
Modularization Includes data structure modularization and independent NPM packages.
Efficiency All methods provide time and space complexity, comparable to native JS performance.
Maintainability Follows open-source community development standards, complete documentation, continuous integration, and adheres to TDD (Test-Driven Development) patterns.
Testability Automated and customized unit testing, performance testing, and integration testing.
Portability Plans for porting to Java, Python, and C++, currently achieved to 80%.
Reusability Fully decoupled, minimized side effects, and adheres to OOP.
Security Carefully designed security for member variables and methods. Read-write separation. Data structure software does not need to consider other security aspects.
Scalability Data structure software does not involve load issues.