stau.space
Rope data structure implementation in Hare.
docs(repo): First commit.
- Simple README.md.
- Unlicense license
+30
+10
LICENSE
+10
LICENSE
···
1
+
This is free and unencumbered software released into the public domain.
2
+
3
+
Anyone is free to copy, modify, publish, use, compile, sell, or distribute this software, either in source code form or as a compiled binary, for any purpose, commercial or non-commercial, and by any means.
4
+
5
+
In jurisdictions that recognize copyright laws, the author or authors of this software dedicate any and all copyright interest in the software to the public domain. We make this dedication for the benefit of the public at large and to the detriment of our heirs and
6
+
successors. We intend this dedication to be an overt act of relinquishment in perpetuity of all present and future rights to this software under copyright law.
7
+
8
+
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
9
+
10
+
For more information, please refer to <http://unlicense.org/>
+20
README.md
+20
README.md
···
1
+
# Hare Rope Implementation.
2
+
A Rope is a data structure that manages an ordered set of characters. Just like
3
+
a string!
4
+
5
+
You can read more about it on its [Wikipedia article.](https://en.wikipedia.org/wiki/Rope_(data_structure))
6
+
7
+
Some of the key Big-O differences are the following:
8
+
| Operation | Rope | String |
9
+
| --- | --- | --- |
10
+
| Index | O(log n) | *O(1)* |
11
+
| Split | O(log n) | *O(1)* |
12
+
| Concatenate | *O(1) amortized*, *O(log n)* worst case | O(n) |
13
+
| Iterate over each character | O(n) | O(n) |
14
+
| Insert | *O(log n)* | O(n) |
15
+
| Append | *O(1) amortized*, *O(log n)* worst case | O(1) amortized, O(n) worst case |
16
+
| Delete | O(log n) | O(n) |
17
+
| Report | O(j + log n) | *O(j)* |
18
+
| Build | O(n) | O(n) |
19
+
20
+
*Table taken from [Comparison with monolithic arrays](https://en.wikipedia.org/wiki/Rope_(data_structure)#Comparison_with_monolithic_arrays)*