Battlefront3.net

Code: Select all

cout << "\n\nreturn_array() Test: newVec length: " << newVec.len() << "\newArray: ";
    char *newArray = new char[newVec.len()]; //Here you allocate memory for a char array of a certain length. newArray us a pointer to this memory
    newArray = newVec.return_array(); //Now you simply assign the array in the vector class to the pointer. The memory it did point to wasn't freed and has therefore been leaked.
    for (int i = 0; i < myVec.len()+1; i++)
        cout << newArray[i] << ", ";

Code: Select all

cout << "\n\nreturn_array() Test: newVec length: " << newVec.len() << "\nnewArray: ";
char *newArray = newVec.return_array();

Code: Select all

T* return_array() //Returns an array if you want local data
        {
            T *tempArray = new T[itsLength];
            for (int i = 0; i < itsLength; i++)
                tempArray[i] = pVector[i];
            return tempArray;
        }

Code: Select all

void inc_arr(int * arr,int len){ //Pass integer pointer to first element of array
    for(int x = 0;x < len;x++){
        arr[x]++; //Arrays are pointers to a number of elements of data in memory and the braket notation simply accesses an element so far from where it currently points. The braket notation doesn't modify pointers like pointer arithmetic does. You could instead use pointer arithmetic and dereferencing in this case but the square brakets are easier to understand.
    }
}
int main(){
    int integers[] = {1,2,3,4,5,6}; //integers is a pointer to the first element in this 6 integer array.
    inc_arr(integers,6); //Passing the size is crucial as there is no other method of knowing the size unless you use null terminated arrays instead.
    for(int x = 0;x < 6;x++){
        printf("%i, ",integers[x]);
    }
    return 0;
}

Code: Select all

cout << "\n\nreturn_array(ptr) Test: newVec length: " << newVec.len() << "\nnewArray: ";
    char *newArray = new char[newVec.len()];
    newVec.return_array(newArray);
    for (int i = 0; i < newVec.len(); i++)
        cout << newArray[i] << ", ";
    cout << "\nnewVec: ";
    for (int i = 0; i < newVec.len(); i++)
        cout << newVec[i] << ", ";
    cout << "\nmyVec: ";
    for (int i = 0; i < myVec.len(); i++)
        cout << myVec[i] << ", ";

Code: Select all

void return_array(T *outside_array) //Returns an array if you want local data
        {
            delete outside_array;
            outside_array = new T[itsLength];
            for (int i = 0; i < itsLength; i++)
                outside_array[i] = pVector[i];
        }

Code: Select all

char ** ptr_arr;

Code: Select all

char * ptr_arr[10];

Code: Select all

char ** ptr_ptr;
char * ptr_arr[10];
ptr_ptr = ptr_arr;

Code: Select all

chamber <typename> identifier;

Code: Select all

void reverse() //reverses order of the container
        {
            tempChamber = new T[itsLength];

            for (int i = itsLength-1, j = 0; i > -1; i--, j++)
                tempChamber[j] = pChamber[i];

            delete pChamber;
            pChamber = new T[itsLength];

            for (int i = 0; i < itsLength; i++)
                pChamber[i] = tempChamber[i];

            delete tempChamber;
        }
        int search(T term) //returns 1 if term exists
        {
            for (int i = 0; i < itsLength; i++)
            {
                if (pChamber[i] == term)
                    return 1;
            }
            return 0;
        }
        void search_results(T term, chamber<int>& otherChamber) //returns locations of the different terms into a chamber
        {
            for (int i = 0; i < itsLength; i++)
            {
                if (pChamber[i] == term)
                    otherChamber.add_on(i);
            }
        }
        int amount_found(T term) //returns the number of terms found
        {
            int num = 0;

            for (int i = 0; i < itsLength; i++)
            {
                if (pChamber[i] == term)
                    num++;
            }
            return num;
        }

Code: Select all

/*TO-DO: sort(), multi_search(T, T) - several terms, search!(T) - this finds all matches, if_alloted(T) - this returns true if term is there*/

Code: Select all

void sort()
        {
            int pivot = itsLength/2;
            chamber <T> LESS;
            chamber <T> GREAT;
            std::cout << "\nAfter Declarations\n";

            for (int i = 0; i < itsLength; i++)
            {
                if (pChamber[i] > pChamber[pivot] || pChamber[i] == pChamber[pivot])
                    GREAT.add_on(pChamber[i]);
                else
                    LESS.add_on(pChamber[i]);
            }
            std::cout << "\nAfter for-loop\n";
            while (GREAT.len() > 1 || LESS.len() > 1)
            {
                if (GREAT.len() > 1)
                    GREAT.sort();
                if (LESS.len() > 1)
                    LESS.sort();
            }
            std::cout << "\nAfter while-loop\n";

            if (GREAT.len() == 1 && LESS.len() == 1)
            {
                    add_on(LESS);
                    add_on(GREAT);
            }
            std::cout << "\nAfter add_on(chamber)\n";
        }