Re: Dynamic array allocation and STL equivalents?

["REH" <bogus@nowhere.net>]

"Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de> wrote in message
news:13r5d1sfsg55d$.1u0p9rdnt3zcy.dlg@40tude.net...
> On 11 Feb 2005 05:06:56 -0800, brian.b.mcguinness@lmco.com wrote:
> Index of a multi-dimensional array is a tuple. That won't work in C++ (you
> cannot override "," to support: A[i,j,k]). Neither works it in Ada.
>
Sure you can (though I don't avocate it).  Off the top of my head:

use enumeration type and operator overloading of ",".


enum I {i_first = 0, i_max = 10};
enum J {j_first = 0, j_max = 10};
enum K {k_first = 0, k_max = 10};
const size_t size = sizeof(int);

inline std::pair<size_t, size_t> operator, (I i, J j) {return
std::make_pair(size_t(i),  size_t(j));}
inline size_t operator, (const std::pair<size_t, size_t>& p, K k)
{
    size_t i = p.first * k_max * j_max * size;
    i += p.second * k_max * size;
    i += k;
    return i;
}

int* array = new int[i_max * j_max * k_max];

int* p = array[I(5), J(6), K(7)];

You can cleanup and "genericize" this more with templates.  My math may be
off, but the concept is the same.

As I said, I wouldn't do it, but it is possible.