First snapshot of the to-be proposed Fast_lookup library is available for download at the vault. Direct link (watch for line breaks!): http://boost-sandbox.sourceforge.net/vault/index.php?&order= &directory=fast_lookup Sorry, no documentation as of yet. Fast_lookup provides "sorted vector"-based versions of standard associative containers, thus embracing the common practice. Highlights of this release: * map and set have been implemented * Two different storage policies - 'default' and KeepKeysSeparate, which is usually faster, but takes more memory * Out-of-the-box support for Boost.Serialization I haven't done any significant optimizations yet, but the performance tests are in, and they show that we are in pretty good shape(compared to Loki::AssocVector). Fast_lookup currently does not work on vc6 though I've made some initial stabs at this problem. Since I'm going on vacation starting from this Friday, the next snapshot will likely be posted in August. Planned features include multiset and multimap + indirect storage(some parts of pointer_containers library will be probably reused) Any suggestions, comments, feature requests or critique are welcome.