On Mon, 2 Aug 2004 05:09:01 -0700, "milkman"
The simplest version would be to write a discriminated union type that
could take on any one of the types in question, and then use a
vector<vector<yourdiscriminateduniontype> >. Another name for a
discriminated union type is a "variant". You can find articles on
writing them via google.
Actually, thinking about it you'd do:
since that would make insertions somewhat cheaper. But maybe what
you'd really do is use a linked list of rows (i.e. stable in memory)
and then have multiple indices (which would be either vectors, sparse
vectors or maps I think).