I have created a new project but I still cannot make it to see the list

This is the part that gives the error message:

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
  #include "listType.h"
#include "arrayListType.h"
#include "orderedArrayListType.h"
template<class elemType>
int orderedArrayListType<elemType>::minLocation(int first, int last)
{
	int loc, minIndex;
	minIndex = first;
	
	for(loc = first + 1; loc <= last; loc++)
		if(list[loc] < list[minIndex])
			minIndex = loc;
		
	return minIndex;
} //end minLocation
template<class elemType>
void orderedArrayListType<elemType>::swap(int first, int second)
{
	elemType temp;

	temp = list[first];
     list[first] = list[second];
	list[second] = temp;
}   //end swap

template<class elemType>
void orderedArrayListType<elemType>::selectionSort()
{
	int loc, minIndex;
	
	for(loc = 0; loc < length - 1; loc++)
	{
		minIndex = minLocation(loc, length - 1);
		swap(loc, minIndex);
	}
}
template<class elemType>
	orderedArrayListType<elemType>::orderedArrayListType(int size)
{
}

here is the error message:
C:\Dev-Cpp\SelectionSort\orderedArrayListType.cpp In member function 'int orderedArrayListType<elemType>::minLocation(int, int)':
11 6 C:\Dev-Cpp\SelectionSort\orderedArrayListType.cpp [Error] 'list' was not declared in this scope
C:\Dev-Cpp\SelectionSort\orderedArrayListType.cpp In member function 'void orderedArrayListType<elemType>::swap(int, int)':
21 9 C:\Dev-Cpp\SelectionSort\orderedArrayListType.cpp [Error] 'list' was not declared in this scope
C:\Dev-Cpp\SelectionSort\orderedArrayListType.cpp In member function 'void orderedArrayListType<elemType>::selectionSort()':
31 21 C:\Dev-Cpp\SelectionSort\orderedArrayListType.cpp [Error] 'length' was not declared in this scope
37 C:\Dev-Cpp\SelectionSort\Makefile.win recipe for target 'orderedArrayListType.o' failed

Now I really do not know what to do for the program to see the list and the length.

The other files will follow:
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

#include "arrayListType.h"
#ifndef H_OrderedListType
#define H_OrderedListType

#include <iostream>
//#include "listType.h"

using namespace std;

template<class elemType>

class orderedArrayListType : public arrayListType<elemType>
{
public:
	void insertOrd(const elemType&);
	int binarySearch(const elemType& item) const;
	void selectionSort();

	orderedArrayListType(int size = 100);
		//constructor
private:
	int minLocation(int first, int last);
	void swap(int first, int second);
};
 #endif 

The arrayListType:
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

#ifndef ARRAYLISTTYPE_H
#define ARRAYLISTTYPE_H

#include "listType.h"

#include <iostream>
#include <cassert>

using namespace std;

template <class elemType>
class arrayListType : public listType<elemType>
{
public:
    const arrayListType<elemType>& operator=(const arrayListType<elemType>&);
		//Overload the assignment operator

    bool isEmpty();
		//Function to determine whether the list is empty
		//Postcondition: Returns true if the list is empty; 
 		//        	    otherwise, returns false.
    bool isFull();
		//Function to determine whether the list is full
		//Postcondition: Returns true if the list is full; 
 		//               otherwise, returns false.
    int listSize();
		//Function to determine the number of elements in the list
		//Postcondition: Returns the value of length.
    int maxListSize();
		//Function to determine the size of the list
 		//Postcondition: Returns the value of maxSize.
    void print() const;
		//Function to output the elements of the list
		//Postcondition: Elements of the list are output on the 
 		//               standard output device.
    bool isItemAtEqual(int location, const elemType& item);
		//Function to determine whether the item is the same 
 		//as the item in the list at the position specified by
		//Postcondition: Returns true if the list[location] 
		//               is the same as the item; otherwise, 
		//		     returns false.
   void insertAt(int location, const elemType& insertItem);
		//Function to insert an item in the list at the 
		//position specified by location. The item to be inserted 
		//is passed as a parameter to the function.
		//Postcondition: Starting at location, the elements 
 		//               of the list are shifted down, 
 		//               list[location] = insertItem;, and
 		//               length++;    
 		//       If the list is full or location is out of
		//	   range, an appropriate message is displayed.    
   void insertEnd(const elemType& insertItem);
		//Function to insert an item at the end of the list 
		//The parameter insertItem specifies the item to be 
		//inserted.
		//Postcondition: list[length] = insertItem; and length++;
 		//               If the list is full, an appropriate 
		//               message is displayed.
    void removeAt(int location);
		//Function to remove the item from the list at the 
		//position specified by location 
		//Postcondition: The list element at list[location] is 
		//               removed and length is decremented by 1.
		//       If location is out of range, an appropriate message
		//       is displayed.
    void retrieveAt(int location, elemType& retItem);
		//Function to retrieve the element from the list at the  
		//position specified by location 
		//Postcondition: retItem = list[location] 
		//      If location is out of range, an appropriate 
		//      message is displayed.
    void replaceAt(int location, const elemType& repItem);
		//Function to replace the elements in the list at the 
		//position specified by location. The item to be replaced 
		//is specified by the parameter repItem.
		//Postcondition: list[location] = repItem 
		//      If location is out of range, an appropriate 
		//      message is displayed.
    void clearList();
		//Function to remove all the elements from the list 
		//After this operation, the size of the list is zero.
 		//Postcondition: length = 0;
    int seqSearch(const elemType& item);
  		//Function to search the list for a given item. 
		//Postcondition: If the item is found, returns the location 
		//               in the array where the item is found; 
   		//               otherwise, returns -1.
    void insert(const elemType& insertItem);
		//Function to insert the item specified by the parameter 
		//insertItem at the end of the list. However, first the
		//list is searched to see whether the item to be inserted 
		//is already in the list. 
		//Postcondition: list[length] = insertItem and length++
		//     If the item is already in the list or the list
		//     is full, an appropriate message is displayed.
    void remove(const elemType& removeItem);
		//Function to remove an item from the list. The parameter 
		//removeItem specifies the item to be removed.
		//Postcondition: If removeItem is found in the list,
		//      it is removed from the list and length is 
		//      decremented by one.

    arrayListType(int size = 100);
		//constructor
		//Creates an array of the size specified by the 
		//parameter size. The default array size is 100.
		//Postcondition: The list points to the array, length = 0, 
		//               and maxSize = size

    arrayListType(const arrayListType<elemType>& otherList); 
		//copy constructor

  //  ~arrayListType();
		//destructor
		//Deallocates the memory occupied by the array.

protected:
    elemType *list; 	//array to hold the list elements
    int length;		//to store the length of the list
    int maxSize;		//to store the maximum size of the list
};
#endif




the arrayListType.cpp
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
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227

#include "arrayListType.h"

#include<iostream> 

using namespace std;

template<class elemType>
bool arrayListType<elemType>::isEmpty()
{
	return (length == 0);
}

template<class elemType>
bool arrayListType<elemType>::isFull()
{
	return (length == maxSize);
}

template<class elemType>
int arrayListType<elemType>::listSize()
{
	return length; 
}

template<class elemType>
int arrayListType<elemType>::maxListSize()
{
	return maxSize;
}

template<class elemType>
void arrayListType<elemType>::print() const
{
	for (int i = 0; i < length; i++)
	cout << list[i] <<" ";
	cout << endl;
}

template<class elemType>
bool arrayListType<elemType>::isItemAtEqual
							(int location, const elemType& item)
{
	return (list[location] == item);
}

template<class elemType>
void arrayListType<elemType>::insertAt
				(int location, const elemType& insertItem)
{
	if(location < 0 || location >= maxSize)
		cerr<<"The position of the item to be inserted "
		    <<"is out of range." << endl;
	else
		if(length >= maxSize)    //list is full
			cout<<"Cannot insert in a full list."<<endl;
	else
	{
		for(int i = length; i > location; i--)
		list[i] = list[i - 1];         //move the elements down
		
		list[location] = insertItem;       //insert the item at the specified location
		
		length++;
	}
}   //end insertAt
template<class elemType>
void arrayListType<elemType>::insertEnd(const elemType& insertItem)
{
	if(length >= maxSize)       //the list is full
		cerr<<"Cannot insert in a full list."<<endl;
	else
	{
		list[length] = insertItem;    // insert the item at the end
		
		length++;                    //increment the length
	}
}   //end insertEnd
template<class elemType>
void arrayListType<elemType>::removeAt(int location)
{
	if(location < 0 || location >= length)
		cerr<<"The location of the item to be removed "
		    <<"is out of range." <<endl;
	else
	{
		for(int i = location; i < length - 1; i++)
			list[i] = list[i + 1];
			
		length--;
	}
} // end removeAt
template<class elemType>
void arrayListType<elemType>::retrieveAt
						(int location, elemType& retItem)
{
	if(location < 0 || location >= length)
		cerr<<"The location of the item to be retrieved is "
		    <<"out of range."<<endl;
	else
		retItem = list[location];
}  // end retrieveAt
template<class elemType>
void arrayListType<elemType>::replaceAt
						(int location, const elemType& repItem)
{
	if(location < 0 || location >= length)
		cerr<<"The location of the item to be replaced is "
		    <<" out of range." <<endl;
	else
		list[location] = repItem;
}   // end replaceAT
template<class elemType>
void arrayListType<elemType>::clearList()
{
	length = 0;
}   //end clearList
template<class elemType>
arrayListType<elemType>::arrayListType(int size)
{
	if(size < 0)
	{
		cerr<<"The array size must be positive. Creating "
		    <<"an array of size 100." <<endl;
		maxSize = 100;
	}
	else
		maxSize = size;
		
	length = 0;
	
	list = new elemType[maxSize];
	assert(list != NULL);
}

//template<class elemType>
//arrayListType<elemType>::~arrayListType
//{
//	delete [] list;
//}
template<class elemType>
arrayListType<elemType>::arrayListType
				(const arrayListType<elemType>& otherList)
{
	maxSize = otherList.maxSize;
	length = otherList.length;
	list = new elemType[maxSize];      //create the array
	assert(list != NULL);              //terminate if unable to allocate memort space
	
	for(int j = 0; j < length; j++)       //copy otherList
		list [j] = otherList.list[j];
}   //end copy constructor
template<class elemType>
const arrayListType<elemType>&
					arrayListType<elemType>::operator=
					(const arrayListType<elemType>& otherList)
{
	if(this != &otherList)        //avoid self=assigment
	{
		delete [] list;
		maxSize = otherList.maxSize;
		length = otherList.length;
		
		list = new elemType[maxSize];        //create the array
		assert(list != NULL);                //if unable to allocate memory space,
											 //terminate the program
		for(int i = 0; i < length; i++)
			list[i] = otherList.list[i];
	}
	return *this;
}
template<class elemType>
void arrayListType<elemType>::insert(const elemType& insertItem)
{
	int loc;
	
	if(length == 0)                      //the list is empty
		list[length++] = insertItem;     //insert the item and increment the length
	else
		if(length == maxSize)
			cerr<<"Cannot insert in a full list." <<endl;
		else
		{
			loc = seqSearch(insertItem);
			
			if(loc == -1)               //the item to be inserted
			                            //does not exist in the list
				list[length++] = insertItem;
			else
				cerr<<"The item to be inserted is already in "
				    <<"the list. No duplicates are allowed."  <<endl;
	}
}   //end insert
template<class elemType>
void arrayListType<elemType>::remove(const elemType& removeItem)
{
	int loc;
	
	if(length == 0)
		cerr<<"Cannot delete from an empty list." <<endl;
	else
	{
		loc = seqSearch(removeItem);
		
		if(loc != -1)
			removeAt(loc);
		else
			cout<<"The item to be deleted is not in the list." <<endl;
	}
}   // end remove
template<class elemType>
int arrayListType<elemType>::seqSearch(const elemType& item)
{
	int loc;
	bool found = false;
	
	for(loc = 0; loc < length; loc++)
		if(list[loc] == item)
		{
			found = true;
			break;
		}
	if(found)
		return loc;
	else
		return -1;
}   //end seqSearch 
the list.h
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
#ifndef LISTTYPE_H
#define LISTTYPE_H

//	protected:
#include<iostream>
using namespace std;

template<class elemType>
class listType
{
public:
	bool isEmpty();
		//Function to determine whether the list is empty.
		//Postcondition: Returns true if the list is empty;
		//               otherwise returns false.
	
	bool isFull();
		//Function to determine whether the list is full.
		//Postcondition: Returns true if the list is full;
		//               otherwise, returns false.
		
	void search(const elemType& searchItem, bool& found);
		//Function to search the list for searchItem.
		//Postcondition: found is set to true if the
		//     searchIem is found in the list; otherwise,
		//     found is set to false.
	void insert(const elemType& newElement);
		// Function to insert newElement in the list.
		//Precondition: Prior to insertion, the list must not be full.
		//Postconditon: The list is the old list plus the newElement.
	void remove(const elemType& removeElement);
		//Function to remove an element from the list.
		//Postconditon: If the element is empty, outputs the message,
		// "Cannot delete from the empty list" .
		// If the list is nonempty, then if removeElement is found, the list is
		// the old list minus removeElement; otherwise, the list is the same as the old list.
		
	void destroyList();
		//Function to destroy the list.
		//Postcondition: length = 0;
	void printList();
		//Function to output the elements of the list.
		
	listType();
		//default constructor
		//sets the length of the list to 0.
		//Postcondition: length = 0;
		
private:
	elemType list[100];    //array to hold the list elements
	int length;            //variable to store the number
							//of elements in the list.	
};
#endif   

the main program:
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
#include <iostream>
#include "arrayListType.h"
#include "orderedArrayListType.h"
using namespace std;

int main() {
	
		orderedArrayListType<int> list;
	
	int num; 
		
	cout<<"Line 3: Enter numbers ending with -999" <<endl;
	
	cin >> num;
		
	while(num != -999)
	{
		list.insert(num);
		cin >> num;
	}
		
	cout<<"Line 8: The list before sorting:"<<endl;
	list.print();
	
	cout<<endl;
	
	list.selectionSort();
	
	cout<<"Line 12: The list after sorting:"<<endl;
	list.print();
	cout<<endl;
	
	return 0;
}
I think I have posted everything.

Please help
Registered users can post here. Sign in or register to post.