From 9140567d73eeed67fdb551bc42a93975666171f2 Mon Sep 17 00:00:00 2001 From: Revone Date: Tue, 26 Sep 2023 17:09:28 +0800 Subject: [PATCH] [pkg] ready to publish v1.33.2 --- README.md | 373 +++++++++++++++++++++++++++--------------------------- 1 file changed, 187 insertions(+), 186 deletions(-) diff --git a/README.md b/README.md index 455c87f..3fd388b 100644 --- a/README.md +++ b/README.md @@ -410,6 +410,193 @@ Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.id) // ['A', 'B', 'D + + +### Standard library data structure comparison + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Data StructureC++ stdData Structure Typedjava.utilPython collections
Dynamic Arraystd::vector<T>Array<E>ArrayList<E>list
Linked Liststd::list<T>DoublyLinkedList<E>LinkedList<E>deque
Setstd::set<T>SetHashSet<E>set
Mapstd::map<K, V>MapHashMap<K, V>dict
Unordered Mapstd::unordered_map<K, V>N/AHashMap<K, V>defaultdict
Unordered Setstd::unordered_set<T>N/AHashSet<E>N/A
Queuestd::queue<T>QueueQueue<E>N/A
Priority Queuestd::priority_queue<T>PriorityQueuePriorityQueue<E>N/A
Stackstd::stack<T>StackStack<E>N/A
Bitsetstd::bitset<N>N/AN/AN/A
Dequestd::deque<T>DequeN/AN/A
Multisetstd::multiset<T>N/AN/AN/A
Multimapstd::multimap<K, V>N/AN/AN/A
Unordered Multisetstd::unordered_multisetN/ACounterN/A
Ordered DictionaryN/AMapN/AOrderedDict
Double-Ended Queue (Deque)std::deque<T>DequeN/AN/A
Linked Hash SetN/AN/ALinkedHashSet<E>N/A
Linked Hash MapN/AN/ALinkedHashMap<K, V>N/A
Sorted SetN/AAVLTree, RBTreeTreeSet<E>N/A
Sorted MapN/AAVLTree, RBTreeTreeMap<K, V>N/A
Tree Setstd::setAVLTree, RBTreeTreeSet<E>N/A
Persistent CollectionsN/AN/AN/AN/A
unordered multisetunordered multiset<T>N/AN/AN/A
Unordered Multimapstd::unordered_multimap<K, V>N/AN/AN/A
+ + ## Code design By strictly adhering to object-oriented design (BinaryTree -> BST -> AVLTree -> TreeMultiset), you can seamlessly @@ -678,189 +865,3 @@ optimal approach to data structure design. - - -### Standard library data structure comparison - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Data StructureC++ stdData Structure Typedjava.utilPython collections
Dynamic Arraystd::vector<T>Array<E>ArrayList<E>list
Linked Liststd::list<T>DoublyLinkedList<E>LinkedList<E>deque
Setstd::set<T>SetHashSet<E>set
Mapstd::map<K, V>MapHashMap<K, V>dict
Unordered Mapstd::unordered_map<K, V>N/AHashMap<K, V>defaultdict
Unordered Setstd::unordered_set<T>N/AHashSet<E>N/A
Queuestd::queue<T>QueueQueue<E>N/A
Priority Queuestd::priority_queue<T>PriorityQueuePriorityQueue<E>N/A
Stackstd::stack<T>StackStack<E>N/A
Bitsetstd::bitset<N>N/AN/AN/A
Dequestd::deque<T>DequeN/AN/A
Multisetstd::multiset<T>N/AN/AN/A
Multimapstd::multimap<K, V>N/AN/AN/A
Unordered Multisetstd::unordered_multisetN/ACounterN/A
Ordered DictionaryN/AMapN/AOrderedDict
Double-Ended Queue (Deque)std::deque<T>DequeN/AN/A
Linked Hash SetN/AN/ALinkedHashSet<E>N/A
Linked Hash MapN/AN/ALinkedHashMap<K, V>N/A
Sorted SetN/AAVLTree, RBTreeTreeSet<E>N/A
Sorted MapN/AAVLTree, RBTreeTreeMap<K, V>N/A
Tree Setstd::setAVLTree, RBTreeTreeSet<E>N/A
Persistent CollectionsN/AN/AN/AN/A
unordered multisetunordered multiset<T>N/AN/AN/A
Unordered Multimapstd::unordered_multimap<K, V>N/AN/AN/A
-