Returns the sum of the element-wise max of a and b. For example if a = {1, -10, 3} and b = {0, 20, 5}, the elementwise max is {1, 20, 5}, which sums t

Provides the summed relative frequency per year of all words in WORDS between STARTYEAR and ENDYEAR, inclusive of both ends. If a word does not exist

Test that the conflict in hello.txt has been resolved according to the Lab 05 Gradescope assignment instructions.

Attempts to insert N in-order strings of length L into HashMap, Prints time of the N insert calls, otherwise Prints a nice message about the error

Attempts to insert N in-order strings of length L into HashMap, Prints time of the N insert calls, otherwise Prints a nice message about the error

Attempts to insert N in-order strings of length L into TreeMap, Prints time of the N insert calls, otherwise Prints a nice message about the error

Attempts to insert N random strings of length L into a HashMap Prints time of the N insert calls, otherwise Prints a nice message about the error

Attempts to insert N random strings of length L into a HashMap Prints time of the N insert calls, otherwise Prints a nice message about the

Attempts to insert N random strings of length L into map, Prints time of the N insert calls, otherwise Prints a nice message about the error

Attempts to insert N random strings of length L into a TreeMap Prints time of the N insert calls, otherwise Prints a nice message about the

Converts the given 2D array to a String. Handy for debugging. Note that since y = 0 is actually the bottom of your world when drawn using the tile ren

Converts the given 2D array to a String. Handy for debugging. Note that since y = 0 is actually the bottom of your world when drawn using the tile ren

Return all captured output to {@code System.out} and {@code System.err} as a single string.

Returns a defensive copy of the total number of words recorded per year in all volumes.

Creates an empty list.

Stores KEY as the key in this key-value pair, VAL as the value, and NEXT as the next node in the linked list.

Constructor for filler stage at end of game (No responses). @param prompt Prompt for fillerStage.

Constructor for filler stage at end of game (No responses). @param prompt Prompt for fillerStage.

Constructors

Constructs an NGramMap from WORDSFILENAME and COUNTSFILENAME.

Stores KEY as the key in this key-value pair, VAL as the value, and NEXT as the next node in the linked list.

Creates an empty timingtest.SLList.

Full constructor for TETile objects. @param character The character displayed on the screen. @param textColor The color of the character itself. @para

Full constructor for TETile objects. @param character The character displayed on the screen. @param textColor The color of the character itself. @para

Full constructor for TETile objects. @param character The character displayed on the screen. @param textColor The color of the character itself. @para

Constructs a new empty TimeSeries.

Create a new ULLMapIter by setting cur to the first node in the linked list that stores the key-value pairs.

Create a new ULLMapIter by setting cur to the first node in the linked list that stores the key-value pairs.

Add {@code x} to the front of the deque. Assumes {@code x} is never null. @param x item to add

Add {@code x} to the front of the deque. Assumes {@code x} is never null. @param x item to add

Adds x to the front of the list.

Add {@code x} to the front of the deque. Assumes {@code x} is never null. @param x item to add

Add {@code x} to the back of the deque. Assumes {@code x} is never null. @param x item to add

Add {@code x} to the back of the deque. Assumes {@code x} is never null. @param x item to add

Adds x to the end of the list.

Inserts X into the back of the list.

Add {@code x} to the back of the deque. Assumes {@code x} is never null. @param x item to add

This method checks whether iterating through a list forwards and backwards returns the same values. @param deque the deque you want to check @param <

This method performs a node check on every internal class. @param clazz the class you want to check @param doublyLinked whether or not the lis