feat: add Rope data structure

src/data_structures/mod.rs

@@ -9,28 +9,30 @@ mod heap;
 mod linked_list;
 mod queue;
 mod rb_tree;
+mod rope;
 mod segment_tree;
 mod stack;
 mod stack_using_singly_linked_list;
 mod trie;
 mod union_find;
 
-pub use self::bloom_filter::BloomFilter;
-pub use self::hashtable::HashTable;
-pub use self::heap::MaxHeap;
-pub use self::heap::MinHeap;
-pub use self::linked_list::LinkedList;
-pub use self::queue::Queue;
-pub use self::stack::Stack;
+pub use bloom_filter::BloomFilter;
+pub use hashtable::HashTable;
+pub use heap::MaxHeap;
+pub use heap::MinHeap;
+pub use linked_list::LinkedList;
+pub use queue::Queue;
+pub use rope::Rope;
+pub use stack::Stack;
 
 // REVIEW: Some of these might actually belong in src/graph
-pub use self::avl_tree::AVLTree;
-pub use self::b_tree::BTree;
-pub use self::binary_search_tree::BinarySearchTree;
-pub use self::fenwick_tree::FenwickTree;
-pub use self::graph::{DirectedGraph, Graph, UndirectedGraph};
-pub use self::rb_tree::RBTree;
-pub use self::segment_tree::SegmentTree;
-pub use self::stack_using_singly_linked_list::Stack as SllStack;
-pub use self::trie::Trie;
-pub use self::union_find::UnionFind;
+pub use avl_tree::AVLTree;
+pub use b_tree::BTree;
+pub use binary_search_tree::BinarySearchTree;
+pub use fenwick_tree::FenwickTree;
+pub use graph::{DirectedGraph, Graph, UndirectedGraph};
+pub use rb_tree::RBTree;
+pub use segment_tree::SegmentTree;
+pub use stack_using_singly_linked_list::Stack as SllStack;
+pub use trie::Trie;
+pub use union_find::UnionFind;