Remember our virtual template method problem, from the other time? (I know, I said the answer was scheduled for a week after that post, but then I just forgot about it). May be we could avoid the virtual part by keeping a list of all our caches... how would we know which one should we dispatch the message to? Easy, using templates.
Instead of a list let's keep two, for twice the fun. One for the rows cache, another for the PKs. We can use PK to know which ROW Cache should we choose. Let's try to write a pseudo code for it:
ROW get_row(PK id) {
pos <- Position of PK in pks_lst
return cache[ pos ].get_row( id )
}
Doesn't look too hard. Building on our previous toolbox, let's use Eq, Position and the definition of a list:
struct NIL {
typedef NIL head;
typedef NIL tail;
};
template < class H, class T=NIL> struct LST {
typedef H head;
typedef T tail;
};
template <class X, class Y> struct Eq { static const bool result = false; };
template <class X> struct Eq<X, X> { static const bool result = true; };
template <class Elm, class LST> struct Position {
private:
typedef typename LST::head H;
typedef typename LST::tail T;
static const bool found = Eq<H, Elm>::result;
public:
static const int result = found? 1 : 1 + Position<Elm, T>::result;
};
template <class Elm> struct Position<Elm, NIL> {
static const int result = 0;
};
class Facade {
typedef LST<int, LST<char, LST<float> > > Lst;
public:
template <class PK> int find(PK) {
return Position< PK, Lst >::result;
}
};
#include <iostream>
using std::cout;
int main() {
Facade f;
std::cout << f.find(1.0) << "\n";
return 0;
}
Great, now we can find an element on a list of types. The real virtual dispatch for the next entry :D