Open danthegoodman1 opened 2 years ago
Specifically the .Map
version with key and value separates. The key is the Task ID and the value is the Task itself, we can remove the InTreeTask
struct because of this.
Maybe https://github.com/tidwall/tinybtree since it seems to perform more evently between insert and delete
https://github.com/tidwall/btree Has generics support, key value based rather than item compare based (so we don't have to ascend before trying to delete)