
1 Dec
2011
1 Dec
'11
10:42 a.m.
Den 30-11-2011 10:58, Vadim Stadnik skrev:
Hi all,
Advanced data structures (ADS) offer useful STL extensions that are not possible or not efficient with basic data structures, such as arrays, linked lists and red-black trees.
I'm interested. In particular, if the library can be integrated seamlessly with Boost.Accumulators and other libs, it seems very interesting. Are there variations of the trees that allow for other types of fast queries than just accumulate? If so, then there might be a generic way to incorporate them. -Thorsten