Base Classes for Trees
|Reported by:||dp_wiz||Owned by:||adrian|
|Has patch:||no||Needs documentation:||no|
|Needs tests:||no||Patch needs improvement:||no|
Base classes, what could efficiently handle large tree-like structures.
- Recursive handling (delete, move, rebuild, and so)
- Querying for children in some ways, with filters
- By path
- Level[s] slice
- Node data types handling. Mapping to other classes.
I think it would be 2 classes: one for handling tree structure and one base class for node items.