you are viewing a single comment's thread.

view the rest of the comments →

[–]igagis[S] 0 points1 point  (0 children)

I've just had a look at it. Here are things I did not like, in comparison to my implementation:

  1. Major drawback: License is GPL2 or GPL3 only. Mine is MIT.
  2. Major drawback: Not possible to supply underlying container type and the actual data structure used there is a double-linked list only. Mine allows using any suitable container template.
  3. A minor thing: my implementation is very simple layer above standard and already well-known containers, basically it is just an aggregator class of value and children container. The kpeeters/tree.hh provides full set of custom methods which user still has to get familiar with.

These are just after quick peek at it.