Array Member Syntax

[CrazyNorman]

While going over my friend's code, I noticed he had

class A
{
  public:
   ...
  private:
    int counts[];
};

Having no idea what empty array brackets at the end of declaration like that do (it looks like it should statically allocate like counts[10] or counts[20], but the lack of number implies dynamic allocation), or even why it compiled, I messed around.

Yet, if I attempt

int main()
{
  int counts[];
}

I get a compile error, because a size is not specified. On the other hand, putting this is a member of a class appears to yield an array of size zero.

What exactly is the point of this syntax, why allow the creation of arrays of size zero in a class, but not nomrally, etc. etc.?

[twomers]

Was it assigned in the constructor?I believe

int counts[] = { 2, 3, 4, 5, ... };

should compile. But not without without assignment.

Edit: To explain further. You can create an array without a size parameter but it must be assigned appropriate values straight away. I believe that the size parameter is 'added' by the compiler as it goes through the code and the size of the array, as in number of elements not sizeof, is the count of the number of elements between the curly braces.

[anon]

Actually this should not be allowed in standard C++, so your compiler may support it as an extension.

The idea (in C99?) might be that if the last member of a struct is a zero-sized array (not legal elsewhere), you should be able to overallocate memory for the struct, and index into this extra memory using the array member. Or something like that - Google might tell you more.

[master5001]

You can do the same thing by using a zero sized array (which anon also made mention of) though either way issues warnings or errors on all the compilers I use.

The idea is (and I use this a lot, so don't think its useless or stupid)...

Example:

struct my_bstr
{
private:
  size_t length, capacity;
  char data[]; // it has to be the last member for this to work.

public:
  explicit my_bstr(const char *literal) : length(0), capacity(0)
  {
    for(register const char *i = literal; *i; ++i,++length)
      ;

    capacity = length * 2; // this is a stupid algo, but I am just trying to demonstrate a point.
  }

  virtual ~my_bstr() { }
  operator const char *() const
  {
    return data;
  }
};

The string doesn't require a null terminator or anything like that since that is not how it is stored internally. This is more like how PASCAL's string objects are stored. Though, not exactly the same.

[anon]

I really can't understand (without getting a massive headache) the string implementation of MingW (where sizeof(string) == 4), but a comment says this:

   *  A string looks like this:
   *
   *  @code
   *                                        [_Rep]
   *                                        _M_length
   *   [basic_string<char_type>]            _M_capacity
   *   _M_dataplus                          _M_refcount
   *   _M_p ---------------->               unnamed array of char_type
   *  @endcode

And later:

   *  This approach has the enormous advantage that a string object
   *  requires only one allocation.

Which looks like a similar technique might be in use? (Overallocation, but I can't find a zero-sized array. _M_p just points beyond the end of the class?)