We currently save all registered objects in one single tree, instead of this we could save them in separate trees and have a dictionary to look up the trees. This would solve the treelib id/tag mix and would make searching much easier.
Actually, after having a better look, this wouldn't help that much. The methods would still have to use tag. I think having a single tree might make it a bit simpler.
We currently save all registered objects in one single tree, instead of this we could save them in separate trees and have a dictionary to look up the trees. This would solve the treelib
id
/tag
mix and would make searching much easier.