QuackFun Namespace Reference

Namespace to contain the stack and queue functions for this lab. More...

Functions
template<typename T >
T	sum (stack< T > &s)
	Sums items in a stack. More...
template<typename T >
void	scramble (queue< T > &q)
	Reverses even sized blocks of items in the queue. More...
template<typename T >
bool	verifySame (stack< T > &s, queue< T > &q)

Detailed Description

Namespace to contain the stack and queue functions for this lab.

Function Documentation

sum()

template<typename T >

T QuackFun::sum

(

stack< T > &

s

)

Sums items in a stack.

Parameters

s	A stack holding values to sum.

Returns

The sum of all the elements in the stack, leaving the original stack in the same state (unchanged).

Note

You may modify the stack as long as you restore it to its original values.

You may use only two local variables of type T in your function. Note that this function is templatized on the stack's type, so stacks of objects overloading the + operator can be summed.

We are using the Standard Template Library (STL) stack in this problem. Its pop function works a bit differently from the stack we built. Try searching for "stl stack" to learn how to use it. Think recursively!

scramble()

template<typename T >

void QuackFun::scramble

(

queue< T > &

q

)

Reverses even sized blocks of items in the queue.

Blocks start at size one and increase for each subsequent block.

Parameters

q	A queue of items to be scrambled

Note

Any "leftover" numbers should be handled as if their block was complete.

We are using the Standard Template Library (STL) queue in this problem. Its pop function works a bit differently from the stack we built. Try searching for "stl stack" to learn how to use it. You'll want to make a local stack variable.

verifySame()

template<typename T >

bool QuackFun::verifySame	(	stack< T > &	s,
		queue< T > &	q
	)

Returns

true if the parameter stack and queue contain only elements of exactly the same values in exactly the same order; false, otherwise.

Note

You may assume the stack and queue contain the same number of items!

There are restrictions for writing this function.

• Your function may not use any loops
• In your function you may only declare ONE local boolean variable to use in your return statement, and you may only declare TWO local variables of parametrized type T to use however you wish.
• No other local variables can be used.
• After execution of verifySame, the stack and queue must be unchanged. Be sure to comment your code VERY well.