NewMatrix creates a new Matrix based on the provided arguments.

New gives new set.

Add: adds new element to the set

Len: gives the length of the set (total no. of elements in set)

Find finds the root of the set to which the given element belongs. It performs path compression to make future Find operations faster.

Enqueue adds an item to the rear of the queue. Returns an error if the queue is full.

END TESTS

GetItems: gives the array( []T ) of elements of the set.

AddEdge will add a new edge between the provided vertices in the graph

NewFromElements creates a new Matrix from the given elements.

Int is a function which returns the minimum of all the integers provided as arguments.

AddAtBeg Add a node to the beginning of the linkedlist

Int is a function which returns the maximum of all the integers provided as arguments.

Remove zero, one or more words lazily from the Trie, no node is actually removed.

EnQueue it will be added new value into our list

GetTransition Returns ending state for transition σ(fromState,overChar), '-1' if there is none.

In: checks whether item is present in set or not.

String implements the fmt.Stringer interface for Matrix.

enqueue it will be added new value into queue

push add value to last index

SubMatrix extracts a submatrix from the current matrix.

--------------- helper functions --------------------------- verify if provided words are present

verify expected size and capacity

CheckEqual checks if the current matrix is equal to another matrix (m2). Two matrices are considered equal if they have the same dimensions and all th

Insert zero, one or more words at a Trie node.

IsEmpty function is check that the array has value or not

NewNode creates a new Trie node with initialized children map.

Bitwise computes using bitwise operator the maximum of all the integer input and returns it

Contains checks if the given key is stored in the hashmap

Count Number of nodes in the linkedlist

Dequeue removes and returns the item from the front of the queue. Returns an error if the queue is empty.

Subtract subtracts two matrices.

This function generate consistent testcase for benchmark test.

MatchDimensions checks if two matrices have the same dimensions.

Put cache with key and value to lru

Put the key in LFU cache

Union merges the sets, if not already merged, to which the given elements belong. It performs union by rank to keep the tree as flat as possible.

DeQueue it will be removed the first value that added into the list

Calculates the determinant of the matrix. This method only works for square matrices (e.i. matrices with equal rows and columns).

Find words at a Trie node.

IsBalanced returns true if provided input string is properly nested. Input is a sequence of brackets: '(', ')', '[', ']', '{', '}'. A sequence of br

MillerTestMultiple is like MillerTest but runs the test for multiple witnesses.

Multiply multiplies the current matrix (m1) with another matrix (m2) and returns the result as a new matrix.

pop remove last item as first output

isInQueue is a method that avoids duplicates in the tree

AddWeightedEdge will add a new weighted edge between the provided vertices in the graph

Capacity returns the number of nodes in the Trie

Empty check our stack has value or not

isEmpty to check our array is empty or not

Len it will return the length of list

Max function - possible duplicate

Put inserts a new key-value pair into the hashmap

dequeue it will be removed the first value into queue (First In First Out)

Add function is add new element to our array

AddEdge will add a new edge between the provided vertices in the graph

Dequeue will be removed the first value that input (First In First Out - FIFO)

Empty is check our list is empty or not

Encrypt encrypts by right shift of "key" each character of "input"

Enqueue will be added new value

Exponentiation returns base^exponent % mod

Get value from lru if not found, return nil

Get the key in cache by LFU

IsEmpty checks if the queue is empty.

IsValid checks if the input matrix has consistent row lengths.

Length return length of our stack

len use to return length of our stack

New returns a randomly generated global unique identifier.

NewPolybius returns a pointer to object of Polybius. If the size of "chars" is longer than "size", "chars" are truncated to "size".