What do these Methods do? Take a look please

[gqchynaboy]

Can anyone help me and tell me what Method1, Method2, Method3, Method4, Method5 do?


template <class T>
bool List<T> ::Method1 (const T & value)
{
if (used == capacity)
if(Method5 (capacity + CHUNK) ==false)
return false;
if (first == -1)
first = last = 0;
else if (first == 0)
first = capacity -1;
else
first --;
data[first] = value;
used++;
return true;
}

template <class T>
bool List<T> ::Method2 (const T & value)
{
if (used == capacity)
if(Method5 (capacity + CHUNK) ==false)
return false;
if (last == -1)
first = last = 0;
else
last = (last +1) % capacity;
data[first] = value;
used++;
return true;
}

template <class T>
bool List<T> ::Method3 ( T & value)
{
if (used ==0)
return false;
value = data[first];
if(capacity - used >= 1.5 * CHUNK)
if(Method5 (capacity + CHUNK) ==false)
return false;
used--;
if (used ==0)
first = last = -1;
else
first = (first +1) % capacity;
return true;
}

template <class T>
bool List<T> ::Method4 ( T & value)
{
if (used ==0)
return false;
value = data[first];
if(capacity - used >= 1.5 * CHUNK)
if(Method5 (capacity + CHUNK) ==false)
return false;
used--;
if (used ==0)
first = last = -1;
else if (last ==0)
last = capacity -1;
else
last --;

return true;
}



template <class T>
bool List<T> ::Method5 (const size_t & new_capacity)
{
T * temp = data;
data = new T[new_capacity];
if(data == NULL)
{
data = temp;
return false;
}
if (used >0)
{
int j =first;
int k = (new_capacity - used) /2;
first =k;
last = first + used -1;
for (int i =0; i <used ; i++)
{
data[k] = temp[j];
j = (j+1) % capacity;
k++;
}
}
capacity = new_capacity;
delete []temp;
return true;
}

[joe_bruin]

the only people who name their functions "Method1", "Method2", etc. are idiots and teachers/professors.

no, we will not do your homework for you.

[Moral_Hazard]

LMAO!!!!! :th:

[carrja99]

Any idiot off the street could figure those out (although they may have trouble reading it without code tags).

As stated previosuly... no, we will not do your homework for you.

[redhead]

hmmm.. I actualy started reading them, then I realised I couldn't keep up with where I was at, without the proper indentation and just left it as it was.... btw, what value is capacity and new_capacity initialised as??

I think I have that problem noticed in one of my C++ books as an exersize for the reader...

[sde]

hehe, i was gonna put the code tags in, but i saw that the original post wasn't indented .. oh well.

[gqchynaboy]

template <class T>
bool List<T> ::Method1 (const T & value)
{
	if (used == capacity)
			if(Method5 (capacity + CHUNK) ==false)
				return false;
	if (first == -1)
			first = last = 0;
	else if (first == 0)
		first = capacity -1;
	else
		first --;
	data[first] = value;
	used++;
	return true;
}

template <class T>
bool List<T> ::Method2 (const T & value)
{
	if (used == capacity)
			if(Method5 (capacity + CHUNK) ==false)
				return false;
	if (last == -1)
			first = last = 0;
	else 
		last = (last +1) % capacity;
	data[first] = value;
	used++;
	return true;
}

template <class T>
bool List<T> ::Method3 ( T & value)
{
		if (used ==0)
			return false;
		value = data[first];
		if(capacity - used >= 1.5 * CHUNK)
				if(Method5 (capacity + CHUNK) ==false)
					return false;
		used--;
		if (used ==0)
			first = last = -1;
		else
			first = (first +1) % capacity;
			return true;
}

template <class T>
bool List<T> ::Method4 ( T & value)
{
	if (used ==0)
			return false;
		value = data[first];
		if(capacity - used >= 1.5 * CHUNK)
				if(Method5 (capacity + CHUNK) ==false)
					return false;
	used--;
		if (used ==0)
			first = last = -1;
		else if (last ==0)
			last = capacity -1;
		else 
			last --;

		return true;
}



template <class T>
bool List<T> ::Method5 (const size_t & new_capacity)
{
	T * temp = data;
	data = new T[new_capacity];
	if(data == NULL)
	{
		data = temp;
		return false;
	}
	if (used >0)
	{
			int j =first;
			int k = (new_capacity - used) /2;
			first =k;
			last = first + used -1;
			for (int i =0; i <used ; i++)
			{
				data[k] = temp[j];
				j = (j+1) % capacity;
				k++;
			}
	}
	capacity = new_capacity;
	delete []temp;
	return true;
}

[gqchynaboy]

Method 1 “InsertFirst”
If there is no space, Method 5 is called to create new space.
In addition, Method 1 adds integers to the beginning of the list.

Method 2 “InsertLast”
If there is no space, Method 5 is called to create new space.
In addition, Method 2 adds integers to the end beginning of the list.

Method 3 “RemoveFirst”
If there is no space, Method 5 is called to create new space.
In addition, Method 3 removes the integers from the beginning of the list.

Method 4 “RemoveLast”
If there is no space, Method 5 is called to create new space.
In addition, Method 4 removes the last integers of the list

Method 5 “AddSpace”

Am i right??

[joe_bruin]

you're right about everything except about the word "integers". this template can work on whatever datatype you declare it as.

[gqchynaboy]

oh yea
When Method 5 is called, it allocates more memory.