In real life, we use containers all the time. Your breakfast cereal comes in a box, the pages in your book come inside a cover and binding, and you might store any number of items in containers in your garage. Without containers, it would be extremely inconvenient to work with many of these objects. Imagine trying to read a book that didn’t have any sort of binding, or eat cereal that didn’t come in a box without using a bowl. It would be a mess. The value the container provides is largely in it’s ability to help organize and store items that are put inside it.
Similarly, a container class is a class designed to hold and organize multiple instances of another class. There are many different kinds of container classes, each of which has various advantages, disadvantages, and restrictions in their use. By far the most commonly used container in programming is the array, which you have already seen many examples of. Although C++ has built-in array functionality, programmers will often use an array container class instead because of the additional benefits it provides. Unlike built-in arrays, array container classes generally provide dynamically resizing (when elements are added or removed) and do bounds-checking. This not only makes array container classes more convenient than normal arrays, but safer too.
Container classes typically implement a fairly standardized minimal set of functionality. Most well-defined containers will include functions that:
- Create an empty container (via a constructor)
- Insert a new object into the container
- Remove an object from the container
- Report the number of objects currently in the container
- Empty the container of all objects
- Provide access to the stored objects
- Sort the elements (optional)
Sometimes certain container classes will omit some of this functionality. For example, arrays container classes often omit the insert and delete functions because they are slow and the class designer does not want to encourage their use.
Container classes generally come in two different varieties. Value containers are compositions that store copies of the objects that they are holding (and thus are responsible for creating and destroying those copies). Reference containers are aggregations that store pointers or references to other objects (and thus are not responsible for creation or destruction of those objects).
Unlike in real life, where containers can hold whatever you put in them, in C++, containers typically only hold one type of data. For example, if you have an array of integers, it will only hold integers. Unlike some other languages, C++ generally does not allow you to mix types inside a container. If you want one container class that holds integers and another that holds doubles, you will have to write two separate containers to do this (or use templates, which is an advanced C++ feature). Despite the restrictions on their use, containers are immensely useful, and they make programming easier, safer, and faster.
An array container class
In this example, we are going to write an integer array class that implements most of the common functionality that containers should have. This array class is going to be a value container, which will hold copies of the elements its organizing.
First, let’s create the IntArray.h file:
|
1 2 3 4 5 6 7 8 |
#ifndef INTARRAY_H #define INTARRAY_H class IntArray { }; #endif |
Our IntArray is going to need to keep track of two values: the data itself, and the size of the array. Because we want our array to be able to change in size, we’ll have to do some dynamic allocation, which means we’ll have to use a pointer to store the data.
|
1 2 3 4 5 6 7 8 9 10 11 |
#ifndef INTARRAY_H #define INTARRAY_H class IntArray { private: int m_nLength; int *m_pnData; }; #endif |
Now we need to add some constructors that will allow us to create IntArrays. We are going to add two constructors: one that constructs an empty array, and one that will allow us to construct an array of a predetermined size.
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 |
#ifndef INTARRAY_H #define INTARRAY_H class IntArray { private: int m_nLength; int *m_pnData; public: IntArray() { m_nLength = 0; m_pnData = 0; } IntArray(int nLength) { m_pnData = new int[nLength]; m_nLength = nLength; } }; #endif |
We’ll also need some functions to help us clean up IntArrays. First, we’ll write a destructor, which simply deallocates any dynamically allocated data. Second, we’ll write a function called Erase(), which will erase the array and set the length to 0.
|
1 2 3 4 5 6 7 8 9 10 11 12 13 |
~IntArray() { delete[] m_pnData; } void Erase() { delete[] m_pnData; // We need to make sure we set m_pnData to 0 here, otherwise it will // be left pointing at deallocated memory! m_pnData = 0; m_nLength = 0; } |
Now let’s overload the [] operator so we can access the elements of the array. We should bounds check the index to make sure it’s valid, which is best done using the assert() function. We’ll also add an access function to return the length of the array.
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 |
#ifndef INTARRAY_H #define INTARRAY_H #include <assert.h> // for assert() class IntArray { private: int m_nLength; int *m_pnData; public: IntArray() { m_nLength = 0; m_pnData = 0; } IntArray(int nLength) { m_pnData = new int[nLength]; m_nLength = nLength; } ~IntArray() { delete[] m_pnData; } void Erase() { delete[] m_pnData; // We need to make sure we set m_pnData to 0 here, otherwise it will // be left pointing at deallocated memory! m_pnData = 0; m_nLength = 0; } int& operator[](int nIndex) { assert(nIndex >= 0 && nIndex < m_nLength); return m_pnData[nIndex]; } int GetLength() { return m_nLength; } }; #endif |
At this point, we already have an IntArray class that we can use. We can allocate IntArrays of a given size, and we can use the [] operator to retrieve or change the value of the elements.
However, there are still a few thing we can’t do with our IntArray. We still can’t change it’s size, still can’t insert or delete elements, and we still can’t sort it.
First, let’s write some code that will allow us to resize an array. We are going to write two different functions to do this. The first function, Reallocate(), will destroy any existing elements in the array when it is resized, but it will be fast. The second function, Resize(), will keep any existing elements in the array when it is resized, but it will be slow.
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 |
// Reallocate resizes the array. Any existing elements will be destroyed. // This function operates quickly. void Reallocate(int nNewLength) { // First we delete any existing elements Erase(); // If our array is going to be empty now, return here if (nNewLength<= 0) return; // Then we have to allocate new elements m_pnData = new int[nNewLength]; m_nLength = nNewLength; } // Resize resizes the array. Any existing elements will be kept. // This function operates slowly. void Resize(int nNewLength) { // If we are resizing to an empty array, do that and return if (nNewLength <= 0) { Erase(); return; } // Now we can assume nNewLength is at least 1 element. This algorithm // works as follows: First we are going to allocate a new array. Then we // are going to copy elements from the existing array to the new array. // Once that is done, we can destroy the old array, and make m_pnData // point to the new array. // First we have to allocate a new array int *pnData = new int[nNewLength]; // Then we have to figure out how many elements to copy from the existing // array to the new array. We want to copy as many elements as there are // in the smaller of the two arrays. if (m_nLength > 0) { int nElementsToCopy = (nNewLength > m_nLength) ? m_nLength : nNewLength; // Now copy the elements one by one for (int nIndex=0; nIndex < nElementsToCopy; nIndex++) pnData[nIndex] = m_pnData[nIndex]; } // Now we can delete the old array because we don't need it any more delete[] m_pnData; // And use the new array instead! Note that this simply makes m_pnData point // to the same address as the new array we dynamically allocated. Because // pnData was dynamically allocated, it won't be destroyed when it goes out of scope. m_pnData = pnData; m_nLength = nNewLength; } |
Whew! That was a little tricky!
Many array container classes would stop here. However, just in case you want to see how insert and delete functionality would be implemented we’ll go ahead and write those too. Both of these algorithms are very similar to Resize().
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 |
void InsertBefore(int nValue, int nIndex) { // Sanity check our nIndex value assert(nIndex >= 0 && nIndex <= m_nLength); // First create a new array one element larger than the old array int *pnData = new int[m_nLength+1]; // Copy all of the elements up to the index for (int nBefore=0; nBefore < nIndex; nBefore++) pnData[nBefore] = m_pnData[nBefore]; // Insert our new element into the new array pnData[nIndex] = nValue; // Copy all of the values after the inserted element for (int nAfter=nIndex; nAfter < m_nLength; nAfter++) pnData[nAfter+1] = m_pnData[nAfter]; // Finally, delete the old array, and use the new array instead delete[] m_pnData; m_pnData = pnData; m_nLength += 1; } void Remove(int nIndex) { // Sanity check our nIndex value assert(nIndex >= 0 && nIndex < m_nLength); // First create a new array one element smaller than the old array int *pnData = new int[m_nLength-1]; // Copy all of the elements up to the index for (int nBefore=0; nBefore < nIndex; nBefore++) pnData[nBefore] = m_pnData[nBefore]; // Copy all of the values after the inserted element for (int nAfter=nIndex+1; nAfter < m_nLength; nAfter++) pnData[nAfter-1] = m_pnData[nAfter]; // Finally, delete the old array, and use the new array instead delete[] m_pnData; m_pnData = pnData; m_nLength -= 1; } // A couple of additional functions just for convenience void InsertAtBeginning(int nValue) { InsertBefore(nValue, 0); } void InsertAtEnd(int nValue) { InsertBefore(nValue, m_nLength); } |
Here is our IntArray container class in it’s entirety:
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 |
#ifndef INTARRAY_H #define INTARRAY_H #include <assert.h> // for assert() class IntArray { private: int m_nLength; int *m_pnData; public: IntArray() { m_nLength = 0; m_pnData = 0; } IntArray(int nLength) { m_pnData = new int[nLength]; m_nLength = nLength; } ~IntArray() { delete[] m_pnData; } void Erase() { delete[] m_pnData; // We need to make sure we set m_pnData to 0 here, otherwise it will // be left pointing at deallocated memory! m_pnData = 0; m_nLength = 0; } int& operator[](int nIndex) { assert(nIndex >= 0 && nIndex < m_nLength); return m_pnData[nIndex]; } // Reallocate resizes the array. Any existing elements will be destroyed. // This function operates quickly. void Reallocate(int nNewLength) { // First we delete any existing elements Erase(); // If our array is going to be empty now, return here if (nNewLength<= 0) return; // Then we have to allocate new elements m_pnData = new int[nNewLength]; m_nLength = nNewLength; } // Resize resizes the array. Any existing elements will be kept. // This function operates slowly. void Resize(int nNewLength) { // If we are resizing to an empty array, do that and return if (nNewLength <= 0) { Erase(); return; } // Now we can assume nNewLength is at least 1 element. This algorithm // works as follows: First we are going to allocate a new array. Then we // are going to copy elements from the existing array to the new array. // Once that is done, we can destroy the old array, and make m_pnData // point to the new array. // First we have to allocate a new array int *pnData = new int[nNewLength]; // Then we have to figure out how many elements to copy from the existing // array to the new array. We want to copy as many elements as there are // in the smaller of the two arrays. if (m_nLength > 0) { int nElementsToCopy = (nNewLength > m_nLength) ? m_nLength : nNewLength; // Now copy the elements one by one for (int nIndex=0; nIndex < nElementsToCopy; nIndex++) pnData[nIndex] = m_pnData[nIndex]; } // Now we can delete the old array because we don't need it any more delete[] m_pnData; // And use the new array instead! Note that this simply makes m_pnData point // to the same address as the new array we dynamically allocated. Because // pnData was dynamically allocated, it won't be destroyed when it goes out of scope. m_pnData = pnData; m_nLength = nNewLength; } void InsertBefore(int nValue, int nIndex) { // Sanity check our nIndex value assert(nIndex >= 0 && nIndex <= m_nLength); // First create a new array one element larger than the old array int *pnData = new int[m_nLength+1]; // Copy all of the elements up to the index for (int nBefore=0; nBefore < nIndex; nBefore++) pnData[nBefore] = m_pnData[nBefore]; // insert our new element into the new array pnData[nIndex] = nValue; // Copy all of the values after the inserted element for (int nAfter=nIndex; nAfter < m_nLength; nAfter++) pnData[nAfter+1] = m_pnData[nAfter]; // Finally, delete the old array, and use the new array instead delete[] m_pnData; m_pnData = pnData; m_nLength += 1; } void Remove(int nIndex) { // Sanity check our nIndex value assert(nIndex >= 0 && nIndex < m_nLength); // First create a new array one element smaller than the old array int *pnData = new int[m_nLength-1]; // Copy all of the elements up to the index for (int nBefore=0; nBefore < nIndex; nBefore++) pnData[nBefore] = m_pnData[nBefore]; // Copy all of the values after the inserted element for (int nAfter=nIndex+1; nAfter < m_nLength; nAfter++) pnData[nAfter-1] = m_pnData[nAfter]; // Finally, delete the old array, and use the new array instead delete[] m_pnData; m_pnData = pnData; m_nLength -= 1; } // A couple of additional functions just for convenience void InsertAtBeginning(int nValue) { InsertBefore(nValue, 0); } void InsertAtEnd(int nValue) { InsertBefore(nValue, m_nLength); } int GetLength() { return m_nLength; } }; #endif |
Now, let’s test it just to prove it works:
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 |
#include <iostream> #include "IntArray.h" using namespace std; int main() { // Declare an array with 10 elements IntArray cArray(10); // Fill the array with numbers 1 through 10 for (int i=0; i<10; i++) cArray[i] = i+1; // Resize the array to 8 elements cArray.Resize(8); // Insert the number 20 before the 5th element cArray.InsertBefore(20, 5); // Remove the 3rd element cArray.Remove(3); // Add 30 and 40 to the end and beginning cArray.InsertAtEnd(30); cArray.InsertAtBeginning(40); // Print out all the numbers for (int j=0; j<cArray.GetLength(); j++) cout << cArray[j] << " "; return 0; } |
This produces the result:
40 1 2 3 5 20 6 7 8 30
Although writing container classes can be pretty complex, the good news is that you only have to write them once. Once the container class is working, you can use and reuse it as often as you like without any additional programming effort required.
It is also worth explicitly mentioning that even though our sample IntArray container class holds a built-in data type (int), we could have just as easily used a user-defined type (eg. a point class).
 11.1 -- Introduction to inheritance
|
 Index
|
 10.3 -- Aggregation
|
Hi there Alex.
Nice lengthy section here! But well worth it.
Just a couple things that confuse me here:
1.) Why didnt you use implicit assignment here for the constructors in the above example, as in the previous sections?
2.)Is there no need to overload the assignment operator here, as you use cArray[i] = i+1; clearly you dont because the program works fine, but im confused as to why that is?
Any help is appreciated.
Great tutorial!
Also, i noticed that you didnt cover sorting here, unless i missed something. Was that intentional?
To understand why cArray[i] = i+1; works, refer to section 9.8 - overloading the subscript operator. In particular, have a look at the sub-section 'Why operator[] returns a reference'.
"Here is our IntArray container class in it's entirety"
Shouldn't this be "in its entirety"?
Curious to know. Reply if possible.
For the excerpt below, why doesn't ~IntArray() does not include m_pnData = 0; m_nLength = 0; unlike Erase() does?
We’ll also need some functions to help us clean up IntArrays. First, we’ll write a destructor, which simply deallocates any dynamically allocated data. Second, we’ll write a function called Erase(), which will erase the array and set the length to 0.
~IntArray()
{
delete[] m_pnData;
}
void Erase()
{
delete[] m_pnData;
// We need to make sure we set m_pnData to 0 here, otherwise it will
// be left pointing at deallocated memory!
m_pnData = 0;
m_nLength = 0;
}
hey, really enjoying the tutorial, but I was wondering, in "
void Resize(int nNewLength)" what ever happens to pnData, it never gets deleted, so does it just remain filling up memory? or would it get deleted at the end of the function?pnData doesn't get deleted because m_pnData was made to point to that address after deleting the original m_pnData.
delete[] m_pnData;
m_pnData = pnData;