Re: std::map of differente std::vectors
"Andre Casteliano" <andre@xptech.com.br> wrote in message
news:Oia20wQnIHA.1212@TK2MSFTNGP05.phx.gbl
In our application we?ve some vectors of business objects that
remains in memory during the execution of the program. They are
stored in std::vectors, for simplicity. Now, the number of vectors is
increasing and it?s becoming a pain to write lots of code that are
almost identical. Something like:
std::vector<Customer> m_vecCustomers;
std::vector<Supplier> m_vecSupplier;
std::vector<Product> m_vecProduct;
...
What I want to do is create some kind of container of vectors, but it
must allow different vectors ... like (pseudo-code):
std::map <int, std::vector<void*> > m_BusinessObjects;
m_BusinessObjects[CUSTOMER_VECTOR] =
function_that_returns_vector_of_customers();
vector<Customer> vec = m_BusinessObjects[CUSTOMER_VECTOR];
How is this any shorter than, say,
vector<Customer> vec = m_BusinessObjects.customer_vector();
Where is the improvement? What's the point of the exercise?
--
With best wishes,
Igor Tandetnik
With sufficient thrust, pigs fly just fine. However, this is not
necessarily a good idea. It is hard to be sure where they are going to
land, and it could be dangerous sitting under them as they fly
overhead. -- RFC 1925