On 08/18/13 18:49, Santiago Tapia wrote: [snip]
Date: Fri, 16 Aug 2013 19:20:36 -0500 From: Larry Evans
Yes, that is the idea. Actually, whether the implementation uses a collection of vectors or other mechanism is an implementation detail. I use a map of vectors in the classifier container, but I will try other implementations. Is the map key something like the type_info:
Yes, actually a wrapper of typeinfo because of a problem with typeinfo I could not workaround. But that is an implementation detail, I mean, that will be an inner detail of the library and I might find a better solution without changing the interface of the classifier container.
If there is a separate vector for each type, then the storage for a container containing more than one type can't be contiguous, since the vectors for the containers for the types cannot be contiguous, or am I missing something? I think what Thorsten was aiming at in this post:
I could not follow the link... ?
Sorry. It should have been: http://lists.boost.org/Archives/boost/2013/08/205811.php [snip]
Date: Sat, 17 Aug 2013 09:20:14 -0500 From: Larry Evans
The attached demonstrates, I believe, what Thorsten was aiming at an shows the storage of *different* types in contiguous storage.
HTH.
-regards, Larry