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...
bool	isBalanced (queue< char > input)
	Checks whether the given string (stored in a queue) has balanced brackets. More...
template<typename T >
void	scramble (queue< T > &q)
	Reverses even sized blocks of items in the queue. More...

Detailed Description

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

Function Documentation

isBalanced()

bool QuackFun::isBalanced

(

queue< char >

input

)

Checks whether the given string (stored in a queue) has balanced brackets.

A string will consist of square bracket characters, [, ], and other characters. This function will return true if and only if the square bracket characters in the given string are balanced. For this to be true, all brackets must be matched up correctly, with no extra, hanging, or unmatched brackets. For example, the string "[hello][]" is balanced, "[[][[]a]]" is balanced, "[]]" is unbalanced, "][" is unbalanced, and "))))[cs225]" is balanced.

For this function, you may only create a single local variable of type stack<char>! No other stack or queue local objects may be declared. Note that you may still declare and use other local variables of primitive types.

Parameters

input

The queue representation of a string to check for balanced brackets in

Returns

Whether the input string had balanced brackets

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.

Hint: You'll want to make a local stack variable.

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.

Parameters

q	A queue of items to be scrambled

sum()

template<typename T >

T QuackFun::sum

(

stack< T > &

s

)

Sums items in a stack.

Hint: think recursively!

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.

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).