* @brief Trailing zeroes in binary * @details Calculates leading zeros in 128-bit integer * @returns Integer denoting Trailing zeroes *

* @brief Trailing zeroes in binary * @details Calculates leading zeros in 256-bit integer * @returns Integer denoting Trailing zeroes *

Defines activation function as Heaviside's step function. * \f[ * f(x) = \begin{cases} * -1 & \forall x \le 0\\ * 1 & \forall x >

* Default constructor * \param[in] num_features number of features present * \param[in] eta learning rate (optional, default=0.1) * \pa

Add an edge in the graph. * * @param edge that needs to be added. */

Add vertices in the graph. * * @param num is the number of vertices to be added. It adds 1 vertex by * default. * */

* Function to get prediction of model on batch * @param X array of feature vectors * @return returns predicted values as vector */

* @brief This function checks for the possibility of augmented path availability * @returns `true` if there is an augmenting path available * @retu

Iterative function to calculate exponent in \f$O(\log(n))\f$ using binary exponent.

* @brief Construct a new Binary Search Tree object. * */

* Constructor for bst_node, used to simplify node construction and * smart pointer construction. * @param _value The value of the cons

* @brief Utility function to break down a path query into two chain queries * @param a node where the path starts * @param b node where the

* @brief Set the root for the tree * @param new_root the new root * @returns void */

* @brief Convert a character to integer for indexing * * @param ch character to index * @return unsigned integer index */

* convenient function to check if input feature vector size matches the * model weights size * \param[in] x fecture vector to check * \

* @brief removes all elements from the queue */

Constructor */

* @brief Convenience function to perform block cipher operations. The * operations are identical for both encryption and decryption. *

* @brief Any associative function that combines x and y * @param x The first operand * @param y The second operand * @return Some as

* @brief Function that specifies the type of operation involved when * segments are combined * @param lhs the left segment * @param rhs

* @brief A function used by library function qsort() to sort an array of * points with respect to the first point * @param vp1 Co-ordinates of Point

* @brief computes the array of values of factorials reduced modulo mod * @param max_arg_val argument of the last factorial stored in the result

* @brief Decrypt a given text using a given key * * @param text string to decrypt * @param decrypt_key key for decryption * @retu

* Deletes an element by key and prints if has been removed successfully * @param key is number that is used for comparision. */

* removes the string if it is not a prefix of any other * string, if it is then just sets the ::data_structure::trie::isEndofWord * to fals

* @brief calls delete operator on every node in the represented list */

* @brief This functions checks whether an augmenting path is available exists beginning with free vertex u * @param u represents position of vertex

* @brief Utility function to assign heavy child to each node (-1 for a leaf * node) * @param u current dfs node * @param p the parent o

* @brief Utility function to lable the nodes so that heavy chains have a * contigous lable * @param u current dfs node * @param p the p

* @brief Utility function to populate the t_par vector * @param u current dfs node * @param p the parent of node u * @returns void

* @brief Utility function to assign highest parent that can be reached * though heavy chains * @param u current dfs node * @param p the

* @brief Utility function to compute sub-tree sizes * @param u current dfs node * @param p the parent of node @param u * @returns void

* @brief The main function that finds the shortest path from a given source * to all other vertices using Dijkstra's Algorithm. * @note This doesn't

* We will find direction of line here respect to @first_point. * Here @second_point and @third_point is first and second points * of the lin

Show stack */

* @brief prints the queue into the std::cout */

* @brief divide function for uint128_t and other integer types. * @details divide this value and * @param p 128-bit unsigned integer *

* @brief divide function for uint256_t and other integer types. * @details divide this value and * @param p 256-bit unsigned integer *

* Derivative of relu function * @param X Value * @returns derivative of relu(x) */

* Derivative of sigmoid function * @param X Value * @return Returns derivative of sigmoid(x) */

* @brief contructor for initialising all data members. * @param n number of elements */

* @brief constructor for initialising all data members * @param n number of elements */

* Derivative of Sigmoid function * @param X Value * @return Returns derivative of tanh(x) */

* @brief Encrypt a given text using a given key * * @param text string to encrypt * @param encrypt_key key for encryption * @retu

* @brief throws an exception if queue is empty * @exception std::invalid_argument if queue is empty */

* @brief Erases a value from a sorted multi-value BST * @param value Value to insert */

* Function to evaluate model on data stored in csv file * @param file_name csv file name * @param last_label flag for whether label is in fi

* @brief A function f(x) that will be used to test the method * @param x The independent variable xi * @returns the value of the dependent variable

* @brief Method to find the representative of the set to which i belongs * to, T(n) = O(1) * @param i element of some set * @returns re

* @brief Method to find the representative of the set to which i belongs * to, T(n) = O(logN) * @param i element of some set * @returns

* @brief The main function implements find single number * @param nums vector of integers * @returns returns the integer that occurs only once */

A helper array to evaluate the next state from current state; * @brief Finds an empty space in puzzle (in this case; a zero) * @returns a pair in

This function when called will delete the node with * the index presented as an argument, and will put * back that node into the array. */

* @brief A function g(x) that will be used to test the method * @param x The independent variable xi * @returns the value of the dependent variable

@brief Another test function */

* @brief Generate decryption matrix from an encryption matrix key. * * @param encrypt_key encryption key for which to create a decrypt key

* @brief Generate encryption matrix of a given size. Larger size matrices * are difficult to generate but provide more security. Important condit

* @brief Generate encryption and decryption key pair * * @param size size of matrix key (typically \f$\text{size}\le10\f$) * @param lim

* @brief Constructor for the geometric distribution * @param p The success probability */

* @brief helper function to predict/recommend words that starts with a * given prefix from the end of prefix's node iterate through all the child

* @brief Get the index of a character in the ::STRKEY * * @param ch character to search * @return index of character */

* @brief Get the character at a given index in the ::STRKEY * * @param idx index value * @return character at the index */

* @brief A utility function that returns the max element of the set to * which i belongs to * @param i element of some set * @returns m

* @brief A utility function that returns the min element of the set to * which i belongs to * @param i element of some set * @returns m

Get total element in list */

* Function to check if a node has some children which can form words. * @param node whose character array of pointers need to be checked for

* @brief [Function djb2](http://www.cse.yorku.ca/~oz/hash.html) * to get hash for the given string. * * @param s string to get hash from * @return

* @brief [Hash function for * test](https://stackoverflow.com/questions/664014/what-integer-hash-function-are-good-that-accepts-an-integer-hash-key)

* @brief [Hash function for * test](https://stackoverflow.com/questions/664014/what-integer-hash-function-are-good-that-accepts-an-integer-hash-key)

* @brief [Hash * function](https://stackoverflow.com/questions/8317508/hash-function-for-a-string), * to get hash for the given string. * * @param

* @brief Construct a new chain object * * @param mod modulus of the chain */

* Identity function * @param X Value * @return Returns x */

* @brief check whether the index value is bounded within the puzzle area * @param value index for the current board * @returns `true` if ind

* @brief increase the frequency of node and push it in the respective list. * @param p_node the node to be updated */

* @brief This function must be called after the tree adjacency list and * node values are populated The function initializes the required *

< Pointer to root node of Binary Tree * @brief inserts a node in the Binary Tree, with the behaviouur of * a Binary Search Tree. * @details

* @brief Inserts a value to a sorted multi-value BST * @param value Value to insert */

Check if a graph has cycle or not. * * This function uses BFS to check if a graph is cyclic or not. * * @param graph which needs t

Driver function to check if a graph has a cycle. * * This function uses DFS to check for cycle in the graph. * * @param graph whic

Helper function of "isCyclicDFS". * * @param adjList is the adjacency list representation of some graph. * @param state is the state of

* function checks if list is empty * @returns true if list is empty * @returns false if list is not empty */