Because C++ views arrays as no more than special cases of pointers, you can skip the
second pointer and simply use standard array indexing:
for (int Index = 0; Index < SizeOfFamily; Index++)
{
pFamily[Index].SetAge(Index);
};
The use of the subscript brackets automatically dereferences the resulting pointer and the
compiler causes the appropriate pointer arithmetic to be performed.
A further advantage is that you can use a similar technique to resize an array at runtime
when you run out of room. Listing 13.9 illustrates this reallocation.LISTING13.9 Reallocating an Array at Runtime
0: //Listing 13.9
1:
2: #include <iostream>
3: using namespace std;
4: int main()
5: {
6: int AllocationSize = 5;
7: int *pArrayOfNumbers = new int[AllocationSize];
8: int ElementsUsedSoFar = 0;
9: int MaximumElementsAllowed = AllocationSize;
10: int InputNumber = -1;
11:
12: cout << endl << “Next number = “;
13: cin >> InputNumber;
14:
15: while ( InputNumber > 0 )
16: {
17: pArrayOfNumbers[ElementsUsedSoFar++] = InputNumber;
18:
19: if ( ElementsUsedSoFar == MaximumElementsAllowed )
20: {
21: int *pLargerArray =
22: new int[MaximumElementsAllowed+AllocationSize];
23:
24: for ( int CopyIndex = 0;
25: CopyIndex < MaximumElementsAllowed;
26: CopyIndex++ )
27 : {
28: pLargerArray[CopyIndex] = pArrayOfNumbers[CopyIndex];
29: };
30:
31: delete [] pArrayOfNumbers;
32: pArrayOfNumbers = pLargerArray;
33: MaximumElementsAllowed+= AllocationSize;430 Day 13