Golang red-black tree with uint index, not thread safe
| Method name | Time |
|---|---|
| Set | O(logn) |
| Del | O(logn) |
| Get | O(logn) |
| Exist | O(logn) |
| Count | O(1) |
| Move | O(2logn) |
| Range | O(logn + m) |
| Max | O(logn) |
| Min | O(logn) |
| Flush | O(1) |
O(n×node),
node = 3×ptr_size + uint_size + bool_size + data_size