Am 29.08.2016 um 19:10 hat Pavel Butsykin geschrieben: > Why don't we use rbtree from glib? We need pointer to the parent node. > For optimal implementation storing of cached chunks in the rbtree > need to get next and previous nodes and content of parent node > is very useful for effective implementation of these functions. In this > implementation of rbtree (unlike rbtree of glib) the node contains a pointer > to parent node. Moreover, this rbtree allows more flexibility to > work with an algorithm because to use rbtrees you'll have to implement > your own insert and search cores. This will avoid us to use callbacks and > to drop drammatically performances. > > Signed-off-by: Pavel Butsykin <pbutsy...@virtuozzo.com>
General note (only having looked at the diffstat): We need to make sure that new files that this series adds are covered by MAINTAINERS entries. Kevin
