Re: Dynamic array allocation and STL equivalents?

["Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>]

On Fri, 11 Feb 2005 12:47:48 -0500, REH wrote:

> "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). 

OK

> 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)];

This is still static and also because there are explicit type
specifications.

Should we try

class IndexTuple
{
public :
   IndexTuple (int);
   IndexTuple operator, (int);

protected :
   // some unbounded index array implementation
};

Then I'm not sure if any C++ compiler would be able to resolve

"Array [1, 2]" to

   IndexTuple::operator, (IndexTuple::IndexTuple (1), 2)

keeping "SomethingUnrelated (1, 2)" resolved to

   SomethingUnrelated (1, 2) to

I have an impression that C++ resolution rules are strictly bottom-up, so
it wouldn't work without explicit type specifications here and there. So in
the end it would be even worse than my variant with Ada's aggregates.

I would really like Ada 2010 to respond to these issues.

-- 
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de