67
67
* The keypoint in this class is that it has to be non-blocking in manipulating the tree:
68
68
* fill, cleanup and update operations are performed in timed chunks. Perfect non-blocking
69
69
* behaviour is not possible since there are some small operations that basically can't be
73
73
* The data for building the tree is obtained from a subclass of StorageModel. The
74
74
* StorageModel must offer a consistent rappresentation of a "flat" folder containing