Requests user input and performs tests of three different set implementations. ARGS is unused.

Requests user input and performs tests of three different set implementations. ARGS is unused.

Returns a random real number from the standard Pareto distribution. @return a random real number from the standard Pareto distribution

Returns a random real number from the standard Pareto distribution. @return a random real number from the standard Pareto distribution

Returns a uniformly random permutation of <em>n</em> elements. @param n number of elements @return an array of length {@code n} that is a uniformly r

Returns a uniformly random permutation of <em>n</em> elements. @param n number of elements @return an array of length {@code n} that is a uniformly r

Plays stage. Filler stages do nothing, but display their prompt, so this does nothing.

Gives prompt for number of bees and prints out 3 sets of bees that the user counts and inputs If wrong answer is given for number of bees, repeat with

Plays stage. Filler stages do nothing, but display their prompt, so this does nothing.

Gives prompt for number of bees and prints out 3 sets of bees that the user counts and inputs If wrong answer is given for number of bees, repeat with

Returns a random integer from a Poisson distribution with mean &lambda;. @param lambda the mean of the Poisson distribution @return a random integer

Returns a random integer from a Poisson distribution with mean &lambda;. @param lambda the mean of the Poisson distribution @return a random integer

Inserts the key-value pair of KEY and VALUE into this map, replacing the previous value associated to KEY, if any.

Associates the specified value with the specified key in this map. If the map already contains the specified key, replaces the key's mapping with th

Inserts the key-value pair of KEY and VALUE into this dictionary, replacing the previous value associated to KEY, if any.

Removes the mapping for the specified key from this map if present, or null if there is no such mapping. Not required for Lab 8. If you don't implemen

Remove and return the element at the front of the deque, if it exists. @return removed element, otherwise {@code null}.

Remove and return the element at the front of the deque, if it exists. @return removed element, otherwise {@code null}.

Remove and return the element at the front of the deque, if it exists. @return removed element, otherwise {@code null}.

Remove and return the element at the back of the deque, if it exists. @return removed element, otherwise {@code null}.

Remove and return the element at the back of the deque, if it exists. @return removed element, otherwise {@code null}.

Deletes item from back of the list and returns deleted item.

Remove and return the element at the back of the deque, if it exists. @return removed element, otherwise {@code null}.

Takes in a 2d array of TETile objects and renders the 2d array to the screen, starting from xOffset and yOffset. If the array is an NxM array, then t

Takes in a 2d array of TETile objects and renders the 2d array to the screen, starting from xOffset and yOffset. If the array is an NxM array, then t

Returns a new IntList with the contents of the original IntList in reverse order.

Sets random seed to L so that results of randomString are predictable.

Returns the size of the deque. Does not alter the deque. @return the number of items in the deque.

Returns the size of the deque. Does not alter the deque. @return the number of items in the deque.

Returns the number of key-value mappings in this map.

Returns the size of the list.

Returns the number of items in the list.