#include <list>
#include <algorithm>
+
+namespace lyx {
+
#define USE_OLD_ITERATOR 1
/// Random Access List.
typedef RandomAccessList<some_class> MyContainer;
-Then you can use MyContainer as if it was a standard
+Then you can use MyContainer as if it was a standard
std::vector<some_class> for operator[] access and as if it was a
standard std::list for iterator access. The main difference with
std::vector is that insertion of elements is much less costly. Compared
IterCont iterCont_;
};
+
+} // namespace lyx
+
#endif