mergeRun uses merge sort to sort adjacent data runs.

mergeRuns merge sorts all the data runs into a single sorted data slice.

pad pads the input message so that its length is congruent to 448 modulo 512

pad pads the input message so that its length is congruent to 448 modulo 512

pad returns a padded version of the input message, such as the padded message's length is a multiple of 512 bits. The padding methodology is as follow

randomPrime returns two random prime numbers

remove lazily a word from the Trie node, no node is actually removed.

resize doubles the capacity of the hashmap and rehashes all existing entries

search the element which index is idx

Helper function to sum the frequencies

Helper function to convert hash output to hex string for comparison

Helper function to convert hash output to hex string for comparison

Helper function to create a transposed (reversed) graph.

AccessNodesByLayer accesses nodes layer by layer (2-D array), instead of printing the results as 1-D array.

AccessNodesByLayer accesses nodes layer by layer (2-D array), instead of printing the results as 1-D array.

AccessNodesByLayer accesses nodes layer by layer (2-D array), instead of printing the results as 1-D array.

Inserting the first node is a special case. It will point to itself. For other cases, the node will be added to the end of the list. End of the list i

Add adds two matrices.

AddAtBeg adds a new snode with given value at the beginning of the list.

AddAtEnd adds a new snode with given value at the end of the list.

Advanced Function performing the Advanced Aho-Corasick algorithm. Finds and prints occurrences of each pattern.

BEGIN BENCHMARKS

BenchmarkCircularQueue benchmarks the CircularQueue implementation.

BenchmarkColumns benchmarks the Columns method.

* ------------------- BENCHMARKS ------------------- */

BenchmarkGet benchmarks the Get method.