design problem...

Hello everybody,
I didn't have a response in the comp.lang.c++ newsgroup so I'm posting
my proglem here. I appreciate your taking the time to take a look at
this example. I
need some help to start the design of an application. To that purpose
I'm using policy-based design. The idea is to have a Class that stores
elements of Class2 in different ways (arrays in stack memory, arrays in
heap memory, using the std::vector and so on). I would like the user
to customize the creation of a class with Class2 and StoragePolicy like
this

     typedef Class<Class2,HeapStorage> class_;

A way to accomplish this may be

template <
    class T,
    class Class2,
    template <class> class StoragePolicy = Storage2 >
class Population : public StoragePolicy<Class2>
{
   T* pointee_; // points to actual storage
   ...

};

However, in this way the user cannot customize in the way given before
but it has to introduce the type that pointee_ points to (and this is
not good because the design should know what pointee_ points to from
the StoragePolicy). Therefore, take 2 becomes:

template <class T>
class StoragePolicy
{
    void create(size_t s);

};

template <class T>
struct Storage1
{
        void create(size_t s) { storage_ = std::vector<T>(s);}
    protected:
       std::vector<T> storage_;
       ~StdVectorStorage() {}

};

<
    class Class2,
    template <class> class StoragePolicy = Storage1 >
class Class : public StoragePolicy<Class2>
{
    // this->storage_ (the storage_ is inherited from one of the
StoragePolicy classes)
   ...

};

This is the way I thought it better to solve this problem. Now, the
questions I have are:
1. Is there a better solution for this? More elegant? Maybe with
better performance?
2. In this way, I can't declare the function create() static because I
have a variable in the PolicyClass, right? I tried but I have a
linkage error in the compilation.
3. Now the key issue. Once I have many of these storage policy
classes, I don't know what to do to traverse the containers. It would
be nice to have a random access iterator that traverses the container
as with the standard library. How do I accomplish this?

Once again, thanks for taking the time to read this. I appreciate it.
Best regards,

Alejandro A.

      [ See http://www.gotw.ca/resources/clcm.htm for info about ]
      [ comp.lang.c++.moderated. First time posters: Do this! ]