Growable String Array - Getting Seg Fault

[leo255]

Hi all,

As stated in the title, I'm just trying to write a class with a growable string array. I'm not worried about overwriting old words, and the unused indexes of the new string arrays are fine just being empty strings.

The seg. fault is happening in the set function (on line 113, to be exact), and I'm not sure why. Let me know if you guys see anything!!

Thanks.

#include <iostream>
#include <string>
#include <stdlib.h>

using namespace std;

class GA
{

public:

    GA();
    GA(const GA & other);
    ~GA();
    GA & operator=(const GA & rhs);

    string get(unsigned index) const;
    GA & set(unsigned index, const string & s);

private:

    string * word;
    int size;

};

void die(const string & msg);

int main()
{

GA w;

w.set(2, "Index Two");
w.set(6, "Index Six");

cout << w.get(2);
cout << endl;
cout << w.get(3);

}

GA::GA()
{
    word = NULL;
    size = 0;
}

GA::GA(const GA & other)
{
    try
    {
        word = new string[other.size];
    }
    catch(const bad_alloc &){ die("Alloc. Failure");
    }
    size = other.size;

    for (int i = 0; i < other.size; i++)
        word[i] = other.word[i];
}

GA::~GA()
{
    delete [] word;
}

GA & GA::operator=(const GA & rhs)
{

    if (this != &rhs)
    {
        delete [] word;

        try
        {
            word = new string[rhs.size];
        }
        catch(const bad_alloc &)
        {
            die("Alloc. Failure");
        }

        for (int i = 0; i < rhs.size; i++)
            word[i] = rhs.word[i];
    }
    return *this;
}

string GA::get(unsigned index) const
{
    return word[index];
}
GA & GA::set(unsigned index, const string & s)
{
    if (index >= size)   // need more memory, creating another string array.
    {

        int newSize = index + 1;
        string * newWord = NULL;

        try
        {
            newWord = new string[newSize];
        }
        catch(const bad_alloc &)
        {
            die("Alloc. Failure");
        }

        for (int i = 0; i < newSize; i++)
        {
            newWord[i] = word[i];
        }

        delete [] word;
        word = newWord;
        size = newSize;

    }
    word[index] = s;
    return *this;
}

void die(const string & msg)
{
    cerr << "Fatal Error: " << msg << endl;
    exit(EXIT_FAILURE);
}

[shadowCODE]

 for (int i = 0; i < newSize; i++)
{
    newWord[i] = word[i];
//size of "newWord" is "newSize"  >   size of "word" (size)
//so when i is "newSize - 1" === "index",
//word[index] is classifiied.. :)
}

[leo255]

Thanks!!!