Building More Flexible Types with Mixins
By Christopher Diggins, January 01, 2006
The Curiously Recurring Template Pattern doesn't have to be exotic. Christopher uses it to make some flexible data types.
January, 2006: Building More Flexible Types With Mixins
Listing 6
template<typename IterableConcept>
struct IterableExtension : IterableConcept {
typedef typename IterableConcept::Iterator Iterator;
typedef typename IterableConcept::Item Item;
template<typename FunctionT>
void ForEach(FunctionT f) {
Iterator first = IterableConcept::Begin(), last =
IterableConcept::End();
while (first != last) f(*first++);
}
bool IsEmpty() {
return IterableConcept::Begin() == IterableConcept::End();
}
int Count() {
int ret = 0;
Iterator first = IterableConcept::Begin(), last =
IterableConcept::End();
while (first != last) ++first, ++ret;
return ret;
}
};
