SYMBOL INDEX (1609 symbols across 406 files)

FILE: audio/alaw.c
  function encode (line 46) | void encode(uint8_t *out, int16_t *in, size_t len)
  function decode (line 107) | void decode(int16_t *out, uint8_t *in, size_t len)
  function test (line 148) | static void test(int16_t *pcm, uint8_t *coded, int16_t *decoded, size_t ...
  function main (line 175) | int main(int argc, char *argv[])

FILE: cipher/affine.c
  type affine_key_t (line 33) | typedef struct
  function modular_multiplicative_inverse (line 47) | int modular_multiplicative_inverse(unsigned int a, unsigned int m)
  function affine_key_t (line 87) | affine_key_t inverse_key(affine_key_t key)
  function affine_encrypt (line 110) | void affine_encrypt(char *s, affine_key_t key)
  function affine_decrypt (line 132) | void affine_decrypt(char *s, affine_key_t key)
  function test_string (line 157) | void test_string(const char *s, const char *ciphertext, int a, int b)
  function tests (line 179) | static void tests()
  function main (line 203) | int main()

FILE: cipher/rot13.c
  function rot13 (line 23) | void rot13(char *s) {
  function test (line 37) | static void test() {
  function main (line 57) | int main() {

FILE: client_server/bool.h
  type BOOL (line 33) | typedef enum
  type BOOL (line 43) | typedef int BOOL;

FILE: client_server/client.c
  function func (line 37) | void func(int sockfd)
  function cleanup (line 64) | void cleanup() { WSACleanup(); }
  function main (line 70) | int main()

FILE: client_server/fork.h
  type LONG (line 39) | typedef LONG NTSTATUS;
  type SYSTEM_HANDLE_INFORMATION (line 41) | typedef struct _SYSTEM_HANDLE_INFORMATION
  type OBJECT_ATTRIBUTES (line 51) | typedef struct _OBJECT_ATTRIBUTES
  type MEMORY_INFORMATION_CLASS (line 61) | typedef enum _MEMORY_INFORMATION_
  type CLIENT_ID (line 69) | typedef struct _CLIENT_ID
  type USER_STACK (line 75) | typedef struct _USER_STACK
  type LONG (line 84) | typedef LONG KPRIORITY;
  type ULONG_PTR (line 85) | typedef ULONG_PTR KAFFINITY;
  type KAFFINITY (line 86) | typedef KAFFINITY *PKAFFINITY;
  type THREAD_BASIC_INFORMATION (line 88) | typedef struct _THREAD_BASIC_INFORMATION
  type SYSTEM_INFORMATION_CLASS (line 98) | typedef enum _SYSTEM_INFORMATION_CLASS
  function child_entry (line 160) | static int child_entry(void)
  function BOOL (line 166) | static BOOL haveLoadedFunctionsForFork(void)
  function fork (line 218) | int fork(void)

FILE: client_server/remote_command_exec_udp_client.c
  function error (line 46) | void error()
  function main (line 56) | int main()

FILE: client_server/remote_command_exec_udp_server.c
  function error (line 46) | void error()
  function main (line 56) | int main()

FILE: client_server/server.c
  function cleanup (line 39) | void cleanup() { WSACleanup(); }
  function func (line 47) | void func(int sockfd)
  function main (line 81) | int main()

FILE: client_server/tcp_full_duplex_client.c
  function error (line 52) | void error()
  function main (line 62) | int main()

FILE: client_server/tcp_full_duplex_server.c
  function error (line 52) | void error()
  function main (line 62) | int main()

FILE: client_server/tcp_half_duplex_client.c
  function error (line 45) | void error()
  function main (line 55) | int main()

FILE: client_server/tcp_half_duplex_server.c
  function error (line 45) | void error()
  function main (line 55) | int main()

FILE: client_server/udp_client.c
  function cleanup (line 31) | void cleanup() { WSACleanup(); }
  function main (line 35) | int main()

FILE: client_server/udp_server.c
  function cleanup (line 31) | void cleanup() { WSACleanup(); }
  function main (line 35) | int main()

FILE: conversions/binary_to_decimal.c
  function convert_to_decimal (line 29) | int convert_to_decimal(uint64_t number) {
  function tests (line 45) | static void tests() {
  function main (line 64) | int main()

FILE: conversions/binary_to_hexadecimal.c
  function main (line 6) | int main()

FILE: conversions/binary_to_octal.c
  function three_digits (line 5) | int three_digits(int n)
  function main (line 19) | int main(void)

FILE: conversions/c_atoi_str_to_integer.c
  function c_atoi (line 16) | int c_atoi(const char *str)
  function test_c_atoi (line 62) | void test_c_atoi()
  function main (line 78) | int main(int argc, char **argv)

FILE: conversions/celsius_to_fahrenheit.c
  function celcius_to_fahrenheit (line 17) | double celcius_to_fahrenheit(double celsius) {
  function test (line 25) | static void test() {
  function main (line 71) | int main() {

FILE: conversions/decimal_to_any_base.c
  function isbad_alphabet (line 20) | bool isbad_alphabet(const char* alphabet) {
  function converted_len (line 42) | uint64_t converted_len(uint64_t nb, short base) {
  function convertion (line 58) | void convertion(uint64_t nb, const char* alphabet, short base, char* con...
  function test (line 94) | static void test()
  function main (line 165) | int main()

FILE: conversions/decimal_to_binary.c
  function main (line 6) | int main()

FILE: conversions/decimal_to_binary_recursion.c
  function decimal_to_binary (line 14) | int decimal_to_binary(unsigned int number)
  function test (line 20) | void test()
  function main (line 34) | int main()

FILE: conversions/decimal_to_hexa.c
  function main (line 5) | int main()
  function decimal2Hexadecimal (line 19) | void decimal2Hexadecimal(long num)

FILE: conversions/decimal_to_octal.c
  function main (line 5) | int main()
  function decimal2Octal (line 18) | void decimal2Octal(long decimalnum)

FILE: conversions/decimal_to_octal_recursion.c
  function decimal_to_octal (line 6) | int decimal_to_octal(int decimal)
  function main (line 21) | int main()

FILE: conversions/hexadecimal_to_octal.c
  function main (line 5) | int main()

FILE: conversions/hexadecimal_to_octal2.c
  function main (line 104) | int main()

FILE: conversions/infix_to_postfix.c
  type Stack (line 17) | struct Stack
  type Stack (line 24) | struct Stack
  type Stack (line 25) | struct Stack
  type Stack (line 27) | struct Stack
  function main (line 36) | int main()
  function push (line 55) | void push(struct Stack *p, char x)
  function pop (line 72) | char pop(struct Stack *p)
  function isOprnd (line 93) | int isOprnd(char ch)
  function isEmpty (line 112) | int isEmpty(struct Stack s)
  function convert (line 130) | void convert(char infix[], char postfix[])
  function getPrecedence (line 201) | int getPrecedence (char op1, char op2)

FILE: conversions/infix_to_postfix2.c
  type Stack (line 21) | struct Stack {
  type Stack (line 25) | struct Stack
  function push (line 32) | void push(char opd) {
  function pop (line 45) | char pop() {
  function isEmpty (line 61) | uint16_t isEmpty() {
  function Top (line 72) | char Top() {
  function priority (line 83) | int16_t priority(char opr) {
  function test (line 139) | static void test() {
  function main (line 156) | int main() {

FILE: conversions/int_to_string.c
  function test (line 51) | static void test()
  function main (line 77) | int main()

FILE: conversions/octal_to_binary.c
  function octalToBinary (line 16) | long octalToBinary(int octalnum)
  function main (line 52) | int main()

FILE: conversions/octal_to_decimal.c
  function convertValue (line 5) | int convertValue(int num, int i) { return num * pow(8, i); }
  function toDecimal (line 7) | long long toDecimal(int octal_value)
  function main (line 23) | int main()

FILE: conversions/octal_to_hexadecimal.c
  function octalToDecimal (line 20) | long octalToDecimal(long octalValue){
  function test (line 48) | static void test() {
  function main (line 60) | int main()

FILE: conversions/roman_numerals_to_decimal.c
  function symbol (line 18) | int symbol(char symbol) {
  function roman_to_decimal (line 51) | int roman_to_decimal(char input[]) {
  function test (line 73) | static void test() {
  function main (line 118) | int main() {

FILE: conversions/to_decimal.c
  function main (line 8) | int main(void)

FILE: data_structures/array/carray.c
  function CArray (line 36) | CArray *getCArray(int size)
  function insertValueCArray (line 49) | int insertValueCArray(CArray *array, int position, int value)
  function removeValueCArray (line 64) | int removeValueCArray(CArray *array, int position)
  function pushValueCArray (line 78) | int pushValueCArray(CArray *array, int value)
  function updateValueCArray (line 97) | int updateValueCArray(CArray *array, int position, int value)
  function eraseCArray (line 113) | int eraseCArray(CArray *array)
  function switchValuesCArray (line 123) | int switchValuesCArray(CArray *array, int position1, int position2)
  function reverseCArray (line 136) | int reverseCArray(CArray *array)
  function displayCArray (line 146) | int displayCArray(CArray *array)
  function blenderCArray (line 158) | int blenderCArray(CArray *array)
  function CArray (line 170) | CArray *getCopyCArray(CArray *arr)
  function swap (line 183) | void swap(CArray *array, int position1, int position2)
  function bubbleSortCArray (line 190) | int bubbleSortCArray(CArray *array)
  function selectionSortCArray (line 206) | int selectionSortCArray(CArray *array)
  function insertionSortCArray (line 220) | int insertionSortCArray(CArray *array)
  function valueOcurranceCArray (line 237) | int valueOcurranceCArray(CArray *array, int value)
  function CArray (line 248) | CArray *valuePositionsCArray(CArray *array, int value)
  function findMinCArray (line 265) | int findMinCArray(CArray *array)
  function findMaxCArray (line 279) | int findMaxCArray(CArray *array)

FILE: data_structures/array/carray.h
  type CArray (line 31) | typedef struct CArray

FILE: data_structures/array/carray_tests.c
  function CArrayTests (line 21) | int CArrayTests()

FILE: data_structures/binary_trees/avl_tree.c
  type AVLnode (line 4) | struct AVLnode
  type avlNode (line 11) | typedef struct AVLnode avlNode;
  function max (line 13) | int max(int a, int b) { return (a > b) ? a : b; }
  function avlNode (line 15) | avlNode *newNode(int key)
  function nodeHeight (line 32) | int nodeHeight(avlNode *node)
  function heightDiff (line 40) | int heightDiff(avlNode *node)
  function avlNode (line 49) | avlNode *minNode(avlNode *node)
  function printAVL (line 58) | void printAVL(avlNode *node, int level)
  function avlNode (line 74) | avlNode *rightRotate(avlNode *z)
  function avlNode (line 88) | avlNode *leftRotate(avlNode *z)
  function avlNode (line 102) | avlNode *LeftRightRotate(avlNode *z)
  function avlNode (line 109) | avlNode *RightLeftRotate(avlNode *z)
  function avlNode (line 116) | avlNode *insert(avlNode *node, int key)
  function avlNode (line 159) | avlNode *delete (avlNode *node, int queryNum)
  function avlNode (line 233) | avlNode *findNode(avlNode *node, int queryNum)
  function printPreOrder (line 246) | void printPreOrder(avlNode *node)
  function printInOrder (line 256) | void printInOrder(avlNode *node)
  function printPostOrder (line 265) | void printPostOrder(avlNode *node)
  function main (line 274) | int main()

FILE: data_structures/binary_trees/binary_search_tree.c
  type node (line 14) | typedef struct node
  function node (line 28) | node *newNode(int data)
  function node (line 46) | node *insert(node *root, int data)
  function node (line 72) | node *getMax(node *root)
  function node (line 88) | node *delete (node *root, int data)
  function find (line 152) | int find(node *root, int data)
  function height (line 187) | int height(node *root)
  function purge (line 217) | void purge(node *root)
  function inOrder (line 238) | void inOrder(node *root)
  function main (line 249) | int main()

FILE: data_structures/binary_trees/create_node.c
  type node (line 10) | struct node
  type node (line 17) | struct node
  type node (line 19) | struct node
  type node (line 19) | struct node
  type node (line 19) | struct node
  function main (line 28) | int main(void)

FILE: data_structures/binary_trees/recursive_traversals.c
  function inOrderTraversal (line 8) | void inOrderTraversal(struct node *node)
  function preOrderTraversal (line 18) | void preOrderTraversal(struct node *node)
  function postOrderTraversal (line 28) | void postOrderTraversal(struct node *node)
  function main (line 38) | int main(void)

FILE: data_structures/binary_trees/red_black_tree.c
  type Node (line 5) | typedef struct node
  function Node (line 15) | Node *newNode(int val, Node *par)
  function isLeaf (line 26) | int isLeaf(Node *n)
  function Node (line 36) | Node *leftRotate(Node *node)
  function Node (line 64) | Node *rightRotate(Node *node)
  function checkNode (line 92) | void checkNode(Node *node)
  function insertNode (line 284) | void insertNode(int val, Node **root)
  function checkForCase2 (line 343) | void checkForCase2(Node *toDelete, int delete, int fromDirection, Node *...
  function deleteNode (line 605) | void deleteNode(int val, Node **root)
  function printInorder (line 720) | void printInorder(Node *root)
  function checkBlack (line 730) | void checkBlack(Node *temp, int c)
  function main (line 745) | int main()

FILE: data_structures/binary_trees/segment_tree.c
  type segment_tree (line 38) | typedef struct segment_tree
  function segment_tree_build (line 55) | void segment_tree_build(segment_tree *tree)
  function segment_tree_update (line 79) | void segment_tree_update(segment_tree *tree, size_t index, void *val)
  function segment_tree_query (line 105) | void segment_tree_query(segment_tree *tree, long long l, long long r, vo...
  function segment_tree (line 140) | segment_tree *segment_tree_init(void *arr, size_t elem_size, size_t len,
  function segment_tree_dispose (line 162) | void segment_tree_dispose(segment_tree *tree)
  function segment_tree_print_int (line 175) | void segment_tree_print_int(segment_tree *tree)
  function minimum (line 194) | void minimum(const void *a, const void *b, void *c)
  function test (line 205) | static void test()
  function main (line 231) | int main()

FILE: data_structures/binary_trees/threaded_binary_trees.c
  type node (line 26) | typedef struct Node
  function node (line 38) | node *create_node(int data)
  function insert_bt (line 51) | void insert_bt(node **root, int data)
  function search (line 98) | void search(node *root, int ele)
  function inorder_display (line 129) | void inorder_display(node *curr)
  function postorder_display (line 143) | void postorder_display(node *curr)
  function preorder_display (line 157) | void preorder_display(node *curr)
  function delete_bt (line 173) | void delete_bt(node **root, int ele)
  function main (line 255) | int main()

FILE: data_structures/binary_trees/words_alphabetical.c
  type Node (line 28) | struct Node
  function endProgramAbruptly (line 41) | void endProgramAbruptly(char *errorMessage)
  function freeTreeMemory (line 52) | void freeTreeMemory(struct Node *node)
  function closeFile (line 90) | void closeFile(FILE *file)
  type Node (line 102) | struct Node
  type Node (line 104) | struct Node
  type Node (line 105) | struct Node
  type Node (line 105) | struct Node
  function writeContentOfTreeToFile (line 121) | void writeContentOfTreeToFile(struct Node *node, FILE *file)
  type Node (line 144) | struct Node
  type Node (line 144) | struct Node
  type Node (line 148) | struct Node
  type Node (line 182) | struct Node
  type Node (line 182) | struct Node
  function test (line 244) | static void test()
  function main (line 312) | int main()

FILE: data_structures/dictionary/dict.c
  function Dictionary (line 6) | Dictionary *create_dict(void)
  function get_hash (line 33) | int get_hash(char s[])
  function add_item_label (line 49) | int add_item_label(Dictionary *dic, char label[], void *item)
  function add_item_index (line 64) | int add_item_index(Dictionary *dic, int index, void *item)
  function destroy (line 100) | void destroy(Dictionary *dict) { free(dict); }

FILE: data_structures/dictionary/dict.h
  type Dictionary (line 17) | typedef struct Dict

FILE: data_structures/dictionary/test_program.c
  function main (line 11) | int main(void)

FILE: data_structures/dynamic_array/dynamic_array.c
  function dynamic_array_t (line 6) | dynamic_array_t *init_dynamic_array()
  function delete (line 51) | void delete (dynamic_array_t *da, const unsigned index)
  function contains (line 66) | unsigned contains(const unsigned size, const unsigned index)

FILE: data_structures/dynamic_array/dynamic_array.h
  type dynamic_array_t (line 6) | typedef struct dynamic_array

FILE: data_structures/dynamic_array/main.c
  function main (line 5) | int main()

FILE: data_structures/graphs/bellman_ford.c
  type Edge (line 7) | struct Edge
  type Graph (line 13) | struct Graph
  function createGraph (line 21) | void createGraph(struct Graph *G, int V, int E)
  function addEdge (line 29) | void addEdge(struct Graph *G, int src, int dst, int weight)
  function minDistance (line 40) | int minDistance(int mdist[], int vset[], int V)
  function print (line 54) | void print(int dist[], int V)
  function BellmanFord (line 69) | void BellmanFord(struct Graph *graph, int src)
  function main (line 115) | int main()

FILE: data_structures/graphs/bfs.c
  type queue (line 5) | struct queue
  type queue (line 13) | struct queue
  type queue (line 14) | struct queue
  type queue (line 15) | struct queue
  type queue (line 16) | struct queue
  type queue (line 17) | struct queue
  type queue (line 18) | struct queue
  type node (line 21) | struct node
  type node (line 27) | struct node
  type Graph (line 30) | struct Graph
  type Graph (line 36) | struct Graph
  type Graph (line 37) | struct Graph
  type Graph (line 38) | struct Graph
  type Graph (line 39) | struct Graph
  function main (line 41) | int main()
  function bfs (line 74) | void bfs(struct Graph *graph, int startVertex)
  type node (line 106) | struct node
  type node (line 108) | struct node
  type node (line 108) | struct node
  type Graph (line 114) | struct Graph
  type Graph (line 116) | struct Graph
  type Graph (line 116) | struct Graph
  type node (line 119) | struct node
  function addEdge (line 132) | void addEdge(struct Graph *graph, int src, int dest)
  type queue (line 145) | struct queue
  type queue (line 147) | struct queue
  type queue (line 147) | struct queue
  function isEmpty (line 153) | int isEmpty(struct queue *q)
  function enqueue (line 161) | void enqueue(struct queue *q, int value)
  function dequeue (line 174) | int dequeue(struct queue *q)
  function pollQueue (line 195) | int pollQueue(struct queue *q) { return q->items[q->front]; }

FILE: data_structures/graphs/bfs_queue.c
  function findPathBFS (line 11) | bool findPathBFS(Graph g, int nV, Vertex src, Vertex dest)
  function main (line 36) | int main(void)

FILE: data_structures/graphs/dfs.c
  type node (line 5) | struct node
  type node (line 11) | struct node
  type Graph (line 12) | struct Graph
  type Graph (line 20) | struct Graph
  type Graph (line 21) | struct Graph
  type Graph (line 22) | struct Graph
  type Graph (line 23) | struct Graph
  function main (line 25) | int main()
  function dfs (line 60) | void dfs(struct Graph *graph, int vertex)
  type node (line 81) | struct node
  type node (line 83) | struct node
  type node (line 83) | struct node
  type Graph (line 89) | struct Graph
  type Graph (line 91) | struct Graph
  type Graph (line 91) | struct Graph
  type node (line 94) | struct node
  function addEdge (line 107) | void addEdge(struct Graph *graph, int src, int dest)
  function printGraph (line 120) | void printGraph(struct Graph *graph)

FILE: data_structures/graphs/dfs_recursive.c
  function dfsPathCheck (line 10) | bool dfsPathCheck(Graph g, int nV, Vertex v, Vertex dest)
  function findPathDFS (line 25) | bool findPathDFS(Graph g, int nV, Vertex src, Vertex dest)
  function main (line 33) | int main(void)

FILE: data_structures/graphs/dijkstra.c
  type Graph (line 7) | struct Graph
  function createGraph (line 14) | void createGraph(struct Graph *G, int V)
  function addEdge (line 27) | void addEdge(struct Graph *G, int src, int dst, int weight)
  function minDistance (line 33) | int minDistance(int mdist[], int vset[], int V)
  function print (line 48) | void print(int dist[], int V)
  function Dijkstra (line 63) | void Dijkstra(struct Graph *graph, int src)
  function main (line 95) | int main()

FILE: data_structures/graphs/euler.c
  function degree (line 7) | int degree(Graph g, int nV, Vertex v)
  function hasEulerPath (line 19) | bool hasEulerPath(Graph g, int nV, Vertex v, Vertex w)
  function main (line 37) | int main(void)

FILE: data_structures/graphs/floyd_warshall.c
  type Graph (line 7) | struct Graph
  function createGraph (line 14) | void createGraph(struct Graph *G, int V)
  function addEdge (line 27) | void addEdge(struct Graph *G, int src, int dst, int weight)
  function print (line 33) | void print(int dist[], int V)
  function FloydWarshall (line 51) | void FloydWarshall(struct Graph *graph)
  function main (line 85) | int main()

FILE: data_structures/graphs/graph.c
  type GraphRep (line 8) | typedef struct GraphRep
  function Graph (line 15) | Graph newGraph(int V)
  function validV (line 39) | bool validV(Graph g, Vertex v) { return (g != NULL && v >= 0 && v < g->n...
  function insertEdge (line 41) | void insertEdge(Graph g, Edge e)
  function removeEdge (line 53) | void removeEdge(Graph g, Edge e)
  function adjacent (line 65) | bool adjacent(Graph g, Vertex v, Vertex w)
  function showGraph (line 72) | void showGraph(Graph g)
  function freeGraph (line 85) | void freeGraph(Graph g)

FILE: data_structures/graphs/graph.h
  type GraphRep (line 4) | struct GraphRep
  type Vertex (line 7) | typedef int Vertex;
  type Edge (line 10) | typedef struct Edge

FILE: data_structures/graphs/hamiltonian.c
  function hamiltonR (line 9) | bool hamiltonR(Graph g, int nV, Vertex v, Vertex dest, int d)
  function hasHamiltonianPath (line 38) | bool hasHamiltonianPath(Graph g, int nV, Vertex src, Vertex dest)
  function main (line 45) | int main(void)

FILE: data_structures/graphs/kruskal.c
  type Edge (line 8) | struct Edge
  type Graph (line 15) | struct Graph
  type Graph (line 28) | struct Graph
  type Graph (line 30) | struct Graph
  type Graph (line 30) | struct Graph
  type Graph (line 30) | struct Graph
  type Edge (line 34) | struct Edge
  type Edge (line 34) | struct Edge
  type subset (line 40) | struct subset
  function find (line 48) | int find(struct subset subsets[], int i)
  function Union (line 60) | void Union(struct subset subsets[], int x, int y)
  function myComp (line 83) | int myComp(const void *a, const void *b)
  function KruskalMST (line 91) | void KruskalMST(struct Graph *graph)
  function main (line 145) | int main()

FILE: data_structures/graphs/queue.c
  type NodeT (line 7) | typedef struct node
  type QueueRep (line 13) | typedef struct QueueRep
  function queue (line 21) | queue newQueue()
  function dropQueue (line 31) | void dropQueue(queue Q)
  function QueueIsEmpty (line 44) | int QueueIsEmpty(queue Q) { return (Q->length == 0); }
  function QueueEnqueue (line 47) | void QueueEnqueue(queue Q, int v)
  function QueueDequeue (line 67) | int QueueDequeue(queue Q)

FILE: data_structures/graphs/queue.h
  type QueueRep (line 3) | struct QueueRep

FILE: data_structures/graphs/strongly_connected_components.c
  type node (line 6) | struct node
  type node (line 12) | struct node
  type Graph (line 13) | struct Graph
  type Stack (line 22) | struct Stack
  type Graph (line 27) | struct Graph
  type Graph (line 28) | struct Graph
  type Graph (line 29) | struct Graph
  type Graph (line 30) | struct Graph
  type Graph (line 30) | struct Graph
  type Graph (line 31) | struct Graph
  type Stack (line 31) | struct Stack
  type Graph (line 32) | struct Graph
  type Graph (line 33) | struct Graph
  type Stack (line 34) | struct Stack
  type Stack (line 35) | struct Stack
  type Stack (line 36) | struct Stack
  function main (line 38) | int main()
  function fillOrder (line 70) | void fillOrder(int vertex, struct Graph *graph, struct Stack *stack)
  type Graph (line 89) | struct Graph
  type Graph (line 89) | struct Graph
  type Graph (line 91) | struct Graph
  type node (line 96) | struct node
  function dfs (line 106) | void dfs(struct Graph *graph, int vertex)
  function scc (line 128) | void scc(struct Graph *graph)
  type node (line 156) | struct node
  type node (line 158) | struct node
  type node (line 158) | struct node
  type Graph (line 164) | struct Graph
  type Graph (line 166) | struct Graph
  type Graph (line 166) | struct Graph
  type node (line 168) | struct node
  function addEdge (line 180) | void addEdge(struct Graph *graph, int src, int dest)
  function printGraph (line 188) | void printGraph(struct Graph *graph)
  type Stack (line 204) | struct Stack
  type Stack (line 206) | struct Stack
  type Stack (line 206) | struct Stack
  function push (line 211) | void push(struct Stack *stack, int element)
  function pop (line 217) | int pop(struct Stack *stack)

FILE: data_structures/graphs/topological_sort.c
  type node (line 6) | struct node
  type node (line 12) | struct node
  type Graph (line 13) | struct Graph
  type Stack (line 22) | struct Stack
  type Graph (line 27) | struct Graph
  type Graph (line 28) | struct Graph
  type Graph (line 29) | struct Graph
  type Graph (line 30) | struct Graph
  type Stack (line 30) | struct Stack
  type Graph (line 31) | struct Graph
  type Stack (line 32) | struct Stack
  type Stack (line 33) | struct Stack
  type Stack (line 34) | struct Stack
  function main (line 36) | int main()
  function topologicalSortHelper (line 68) | void topologicalSortHelper(int vertex, struct Graph *graph, struct Stack...
  function topologicalSort (line 88) | void topologicalSort(struct Graph *graph)
  type node (line 103) | struct node
  type node (line 105) | struct node
  type node (line 105) | struct node
  type Graph (line 111) | struct Graph
  type Graph (line 113) | struct Graph
  type Graph (line 113) | struct Graph
  type node (line 115) | struct node
  function addEdge (line 127) | void addEdge(struct Graph *graph, int src, int dest)
  function printGraph (line 135) | void printGraph(struct Graph *graph)
  type Stack (line 151) | struct Stack
  type Stack (line 153) | struct Stack
  type Stack (line 153) | struct Stack
  function push (line 158) | void push(struct Stack *stack, int element)
  function pop (line 164) | int pop(struct Stack *stack)

FILE: data_structures/graphs/transitive_closure.c
  function warshall (line 10) | void warshall()
  function main (line 23) | int main(void)

FILE: data_structures/hash_set/hash_set.c
  function hash_set_t (line 6) | extern hash_set_t *init_hash_set()
  function add (line 17) | unsigned add(hash_set_t *set, void *value)
  function put (line 22) | unsigned put(hash_set_t *set, long long hash, void *value)
  function contains (line 43) | int contains(hash_set_t *set, void *value)
  function contains_hash (line 51) | int contains_hash(hash_set_t *set, long long hash)
  function delete (line 56) | void delete (hash_set_t *set, void *value)
  function hash (line 62) | long long hash(void *value)
  function retrieve_index_from_hash (line 79) | unsigned retrieve_index_from_hash(const long long hash, const unsigned c...
  function resize (line 84) | void resize(hash_set_t *set)

FILE: data_structures/hash_set/hash_set.h
  type hash_set_t (line 6) | typedef struct

FILE: data_structures/hash_set/main.c
  function main (line 5) | int main()

FILE: data_structures/heap/max_heap.c
  type Heap (line 5) | typedef struct max_heap
  function main (line 25) | int main()
  function Heap (line 51) | Heap *create_heap(Heap *heap)
  function down_heapify (line 60) | void down_heapify(Heap *heap, int index)
  function up_heapify (line 93) | void up_heapify(Heap *heap, int index)
  function push (line 107) | void push(Heap *heap, int x)
  function pop (line 120) | void pop(Heap *heap)
  function top (line 135) | int top(Heap *heap)
  function empty (line 142) | int empty(Heap *heap)
  function size (line 149) | int size(Heap *heap) { return heap->count; }

FILE: data_structures/heap/min_heap.c
  type Heap (line 4) | typedef struct min_heap
  function main (line 24) | int main()
  function Heap (line 50) | Heap *create_heap(Heap *heap)
  function down_heapify (line 59) | void down_heapify(Heap *heap, int index)
  function up_heapify (line 92) | void up_heapify(Heap *heap, int index)
  function push (line 106) | void push(Heap *heap, int x)
  function pop (line 119) | void pop(Heap *heap)
  function top (line 134) | int top(Heap *heap)
  function empty (line 141) | int empty(Heap *heap)
  function size (line 148) | int size(Heap *heap) { return heap->count; }

FILE: data_structures/linked_list/ascending_priority_queue.c
  type node (line 29) | struct node
  type node (line 35) | struct node
  function createqueue (line 39) | void createqueue() { front = rear = NULL; }
  function empty (line 41) | int empty()
  function insert (line 49) | void insert(int x)
  function removes (line 72) | int removes()
  function show (line 119) | void show()
  function destroyqueue (line 140) | void destroyqueue() { front = rear = NULL; }
  function main (line 142) | int main()

FILE: data_structures/linked_list/circular_doubly_linked_list.c
  type ListNode (line 28) | typedef struct node
  function ListNode (line 39) | ListNode *create_node(uint64_t data)
  function ListNode (line 55) | ListNode *insert_at_head(ListNode *head, uint64_t data)
  function ListNode (line 84) | ListNode *insert_at_tail(ListNode *head, uint64_t data)
  function ListNode (line 111) | ListNode *delete_from_head(ListNode *head)
  function ListNode (line 140) | ListNode *delete_from_tail(ListNode *head)
  function getsize (line 169) | int getsize(ListNode *head)
  function display_list (line 191) | void display_list(ListNode *head)
  function get (line 223) | uint64_t get(ListNode *list, const int index)
  function test (line 241) | static void test()
  function main (line 300) | int main()

FILE: data_structures/linked_list/circular_linked_list.c
  type node (line 9) | struct  node
  type node (line 15) | struct  node
  type node (line 16) | struct  node
  function create (line 20) | void  create()
  function deletenode (line 53) | void  deletenode(int  k)
  function traverse (line 92) | void  traverse()
  function main (line 114) | void main()

FILE: data_structures/linked_list/doubly_linked_list.c
  type List (line 23) | typedef struct list
  function main (line 79) | int main()
  function List (line 92) | List *create(double value)
  function List (line 108) | List *insert(List *list, double value, int pos)
  function List (line 179) | List *delete(List *list, int pos)
  function search (line 242) | int search(List *list, double value)
  function print (line 256) | void print(List *list)
  function example (line 269) | void example()

FILE: data_structures/linked_list/merge_linked_lists.c
  type node (line 3) | struct node
  type node (line 9) | struct node
  type node (line 10) | struct node
  function merge (line 14) | void merge()
  function printlist (line 46) | void printlist(struct node *temp)
  function main (line 58) | int main()

FILE: data_structures/linked_list/middle_element_in_list.c
  type Node (line 5) | struct Node
  function printMiddle (line 12) | void printMiddle(struct Node *head)
  function push (line 28) | void push(struct Node **head_ref, int new_data)
  function printList (line 44) | void printList(struct Node *ptr)
  function main (line 55) | int main()

FILE: data_structures/linked_list/queue_linked_list.c
  type node (line 12) | struct node
  type queue (line 18) | struct queue
  type queue (line 23) | struct queue
  function createqueue (line 27) | void createqueue() { q.front = q.rear = NULL; }
  function empty (line 29) | int empty()
  function insert (line 37) | void insert(int x)
  function removes (line 60) | int removes()
  function show (line 80) | void show()
  function destroyqueue (line 101) | void destroyqueue() { q.front = q.rear = NULL; }
  function main (line 103) | int main()

FILE: data_structures/linked_list/singly_link_list_deletion.c
  type node (line 9) | struct node
  type node (line 14) | struct node
  type node (line 16) | struct node
  type node (line 18) | struct node
  type node (line 19) | struct node
  type node (line 19) | struct node
  function insert (line 23) | int insert(int pos, int d)
  function deletion (line 64) | int deletion(int pos) // function to delete from any position
  function viewlist (line 100) | void viewlist() // function to display values
  function test (line 118) | static void test()
  function main (line 130) | int main()

FILE: data_structures/linked_list/stack_using_linked_lists.c
  type node (line 3) | struct node
  type node (line 8) | struct node
  type node (line 9) | struct node
  type node (line 10) | struct node
  type node (line 11) | struct node
  function main (line 13) | int main()
  function push (line 39) | void push(struct node *p)
  function pop (line 53) | void pop(struct node *p)
  function display (line 70) | void display(struct node *p)

FILE: data_structures/list/list.c
  function L (line 11) | L List_init(void)
  function L (line 20) | L List_push(L list, void *val)
  function List_length (line 29) | int List_length(L list)
  function L (line 52) | L List_list(L list, void *val, ...)
  function L (line 70) | L List_append(L list, L tail)

FILE: data_structures/list/list.h
  type L (line 5) | struct L
  type L (line 7) | struct L

FILE: data_structures/list/main.c
  function print_list (line 7) | void print_list(char **array)
  function main (line 14) | int main()

FILE: data_structures/queue/include.h
  type node (line 13) | struct node

FILE: data_structures/queue/queue.c
  function main (line 12) | int main(int argc, char const *argv[])
  function create (line 20) | void create()
  function enque (line 29) | void enque(int x)
  function deque (line 50) | int deque()
  function size (line 73) | int size() { return count; }

FILE: data_structures/stack.c
  type node (line 19) | struct node
  function main (line 42) | int main(int argc, char const *argv[])
  function create (line 77) | void create() { head = NULL; }
  function push (line 82) | void push(int x)
  function pop (line 106) | int pop()
  function peek (line 136) | int peek()
  function size (line 150) | int size() { return count; }
  function isEmpty (line 155) | int isEmpty()

FILE: data_structures/stack/dynamic_stack.c
  type DArrayStack (line 24) | typedef struct DArrayStack
  function DArrayStack (line 36) | DArrayStack *create_stack(int cap)
  function DArrayStack (line 55) | DArrayStack *double_array(DArrayStack *ptr, int cap)
  function DArrayStack (line 79) | DArrayStack *shrink_array(DArrayStack *ptr, int cap)
  function push (line 101) | int push(DArrayStack *ptr, int data)
  function pop (line 124) | int pop(DArrayStack *ptr)
  function peek (line 152) | int peek(DArrayStack *ptr)
  function show_capacity (line 168) | int show_capacity(DArrayStack *ptr) { return ptr->capacity; }
  function isempty (line 177) | int isempty(DArrayStack *ptr)
  function stack_size (line 193) | int stack_size(DArrayStack *ptr) { return ptr->top + 1; }
  function test (line 199) | static void test()
  function main (line 246) | int main()

FILE: data_structures/stack/main.c
  function main (line 12) | int main()
  function push (line 52) | void push()
  function pop (line 62) | void pop()
  function peek (line 78) | void peek()
  function update (line 87) | void update()
  function display (line 104) | void display()

FILE: data_structures/stack/parenthesis.c
  type node (line 8) | struct node
  type node (line 15) | struct node
  function push (line 17) | void push(char x)  // function for pushing
  function pop (line 39) | char pop(void)  // function for pop
  function isBalanced (line 50) | int isBalanced(char *s)
  function destroyStack (line 82) | void destroyStack(void)
  function main (line 98) | int main(void)

FILE: data_structures/stack/stack.c
  function initStack (line 34) | void initStack()
  function grow (line 44) | void grow()
  function push (line 62) | void push(void *object)
  function size (line 112) | int size() { return counter; }
  function isEmpty (line 117) | int isEmpty() { return counter == 0; }

FILE: data_structures/stack/stack_linked_list/main.c
  function main (line 6) | int main()

FILE: data_structures/stack/stack_linked_list/stack.c
  type elem_t (line 9) | typedef struct elem
  type T (line 15) | struct T
  function T (line 22) | T Stack_init(void)
  function Stack_empty (line 32) | int Stack_empty(T stack)
  function Stack_size (line 39) | int Stack_size(T stack)
  function Stack_push (line 46) | void Stack_push(T stack, void *val)
  function Stack_print (line 75) | void Stack_print(Stack_T stack)

FILE: data_structures/stack/stack_linked_list/stack.h
  type T (line 5) | struct T

FILE: data_structures/trie/trie.c
  type trie (line 17) | struct trie {
  function trie_new (line 24) | int trie_new (
  function trie_insert (line 38) | int trie_insert (
  function trie_search (line 85) | int trie_search(
  function trie_print (line 123) | void trie_print (
  function main (line 157) | int main() {

FILE: data_structures/vector.c
  type Vector (line 12) | typedef struct {
  function init (line 25) | void init(Vector* vec, int val) {
  function delete (line 37) | void delete(Vector* vec) {
  function clear (line 46) | void clear(Vector* vec) {
  function len (line 56) | int len(Vector* vec) {
  function push (line 66) | void push(Vector* vec, int val) {
  function get (line 78) | int get(Vector* vec, int index) {
  function set (line 91) | void set(Vector* vec, int index, int val) {
  function next (line 102) | int next(Vector* vec) {
  function print (line 125) | void print(Vector* vec) {
  function test (line 138) | static void test() {
  function main (line 156) | int main() {

FILE: developer_tools/malloc_dbg.c
  type mem_info (line 20) | typedef struct MEMORY_INFORMATION
  function mem_info (line 51) | mem_info* addMemInfo(mem_info* memoryInfo, void* ptrToReturn, size_t byt...
  function inList (line 79) | int inList(const char* filename, int line)
  function editInfo (line 107) | void editInfo(int elemPos, size_t bytes)
  function free_dbg (line 208) | void free_dbg(void* ptrToFree)
  function printLeaks (line 264) | void printLeaks()

FILE: developer_tools/min_printf.h
  type Buffer (line 35) | typedef struct buffer {
  function power_of_ten (line 48) | int power_of_ten(int a)
  function is_number (line 62) | int is_number(char *c)
  function get_ch (line 74) | char get_ch(char *p, Buffer *buffer)
  function unget_ch (line 88) | void unget_ch(char *c, Buffer *buffer)
  function get_number_of_digits (line 100) | int get_number_of_digits(int n)
  function put_char (line 114) | void put_char(char s)
  function reverse_str (line 128) | void reverse_str(char *p)
  function print_int_value (line 158) | void print_int_value(int n, int width, int precision)
  function print_double_value (line 210) | void print_double_value(double dval, int width, int precision)
  function print_string (line 238) | void print_string(char *p, int width, int precision)
  function min_printf (line 299) | void min_printf(char *fmt, ...)

FILE: developer_tools/test_malloc_dbg.c
  function main (line 22) | int main(int argc, char* argv[])

FILE: developer_tools/test_min_printf.c
  function main (line 24) | int main()

FILE: dynamic_programming/lcs.c
  function lcslen (line 30) | void lcslen(const char *s1, const char *s2, int l1, int l2, int **L, int...
  function test (line 100) | static void test() {
  function main (line 162) | int main(int argc, char *argv[]) {

FILE: dynamic_programming/matrix_chain_order.c
  function matrixChainOrder (line 26) | int matrixChainOrder(int l, const int *p, int *s)
  function printSolution (line 79) | void printSolution(int l, int *s, int i, int j)
  function test (line 96) | static void test()
  function main (line 115) | int main()

FILE: exercism/isogram/isogram.c
  function is_isogram (line 7) | bool is_isogram(const char phrase[])

FILE: exercism/word_count/word_count.c
  function word_count (line 14) | int word_count(const char *input_text, word_count_word_t *words)

FILE: exercism/word_count/word_count.h
  type word_count_word_t (line 8) | typedef struct word_count_word

FILE: games/hangman.c
  type game_instance (line 19) | struct game_instance{
  type game_instance (line 31) | struct game_instance
  function main (line 41) | int main() {
  function new_guess (line 99) | int new_guess(char new_guess, const char guesses[], int size) {
  function in_word (line 119) | int in_word(char letter, const char word[], unsigned int size) {
  function new_game (line 134) | struct game_instance new_game() {
  function won (line 192) | void won(const char word[], int score) {
  function picture (line 206) | void picture(int score) {

FILE: games/naval_battle.c
  function validEntryLineColumn (line 25) | int validEntryLineColumn(int line, char column)
  function validatePosition (line 43) | int validatePosition(int mat[10][10], int boat, int line, int column,
  function canShoot (line 107) | int canShoot(int mat[10][10], int line, int column)
  function positionBoat (line 124) | void positionBoat(int mat[10][10], int boat)
  function printMessage (line 266) | void printMessage(char *msg)
  function printMessageScore (line 280) | void printMessageScore(int pts1, int pts2)
  function printTable (line 296) | char printTable(int logic, int stage)
  function printsTray (line 355) | void printsTray(int mat[10][10], int stage)
  function shoot (line 411) | void shoot(int mat[10][10], int line, int column)
  function calculateScore (line 442) | int calculateScore(int mat[10][10], int line, int column)
  function printPositioning (line 652) | void printPositioning(int Player, int boat, int nm)
  function main (line 813) | int main()

FILE: games/tic_tac_toe.c
  function main (line 37) | int main()
  function singlemode (line 85) | void singlemode()
  function doublemode (line 156) | void doublemode()
  function check_placex (line 223) | int check_placex(){
  function placex (line 255) | void placex(int m)
  function place (line 281) | void place()
  function placey (line 306) | void placey(int e1)
  function checkwin (line 334) | int checkwin()

FILE: geometry/geometry_datatypes.h
  type vec_3d (line 21) | typedef struct vec_3d_
  type mat_3x3 (line 34) | typedef struct mat_3x3_
  type quaternion (line 60) | typedef struct quaternion_
  type euler (line 80) | typedef struct euler_
  type dual_quat (line 105) | typedef struct dual_quat_

FILE: geometry/quaternions.c
  function quaternion (line 47) | quaternion quat_from_euler(const euler *in_euler)
  function euler (line 88) | euler euler_from_quat(const quaternion *in_quat)
  function quaternion (line 129) | quaternion quaternion_multiply(const quaternion *in_quat1,
  function test (line 153) | static void test()
  function main (line 169) | int main()

FILE: geometry/vectors_3d.c
  function vec_3d (line 31) | vec_3d vector_sub(const vec_3d *a, const vec_3d *b)
  function vec_3d (line 53) | vec_3d vector_add(const vec_3d *a, const vec_3d *b)
  function dot_prod (line 76) | float dot_prod(const vec_3d *a, const vec_3d *b)
  function vec_3d (line 105) | vec_3d vector_prod(const vec_3d *a, const vec_3d *b)
  function vector_norm (line 138) | float vector_norm(const vec_3d *a)
  function vec_3d (line 156) | vec_3d unit_vec(const vec_3d *a)
  function mat_3x3 (line 188) | mat_3x3 get_cross_matrix(const vec_3d *a)
  function get_angle (line 202) | double get_angle(const vec_3d *a, const vec_3d *b)
  function test (line 223) | static void test()
  function main (line 260) | int main(void)

FILE: graphics/spirograph.c
  function spirograph (line 57) | void spirograph(double *x, double *y, double l, double k, size_t N, doub...
  function test (line 74) | void test(void)
  function glutBitmapString (line 124) | static inline void glutBitmapString(void *font, char *string)
  function display_graph (line 136) | void display_graph(const double *x, const double *y, size_t N, double l,
  function test2 (line 172) | void test2(void)
  function timer_cb (line 228) | void timer_cb(int id)
  function keyboard_cb (line 241) | void keyboard_cb(unsigned char key, int x, int y)
  function main (line 271) | int main(int argc, char **argv)

FILE: greedy_approach/dijkstra.c
  function enqueue (line 15) | void enqueue(int v) { q[qp++] = v; }
  function cf (line 17) | int cf(void *a, void *b)
  function dequeue (line 24) | int dequeue()
  function queue_has_something (line 30) | int queue_has_something() { return (qp > 0); }
  function dijkstra (line 35) | void dijkstra(int s)
  function main (line 64) | int main(int argc, char const *argv[])

FILE: greedy_approach/prim.c
  function minimum (line 45) | uint16_t minimum(uint16_t arr[], uint16_t N)
  function prim (line 65) | void prim(uint16_t G[][MAX], uint16_t MST[][MAX], uint16_t V)
  function test (line 113) | static void test(uint16_t G[][MAX], uint16_t MST[][MAX], uint16_t V)
  function user_graph (line 145) | void user_graph(uint16_t G[][MAX], uint16_t MST[][MAX], uint16_t V)
  function main (line 185) | int main(int argc, char const *argv[])

FILE: hash/hash_adler32.c
  function adler32 (line 18) | uint32_t adler32(const char* s)
  function test_adler32 (line 38) | void test_adler32()
  function main (line 50) | int main()

FILE: hash/hash_blake2b.c
  function u128_fill (line 120) | static inline void u128_fill(u128 dest, size_t n)
  function u128_increment (line 147) | static inline void u128_increment(u128 dest, uint64_t n)
  function G (line 175) | static void G(block_t v, uint8_t a, uint8_t b, uint8_t c, uint8_t d, uin...
  function F (line 203) | static void F(uint64_t h[8], block_t m, u128 t, int f)
  function BLAKE2B (line 286) | static int BLAKE2B(uint8_t *dest, block_t *d, size_t dd, u128 ll, uint8_...
  function assert_bytes (line 432) | static void assert_bytes(const uint8_t *expected, const uint8_t *actual,
  function test (line 452) | static void test()
  function main (line 547) | int main()

FILE: hash/hash_crc32.c
  function crc32 (line 20) | uint32_t crc32(const char* s)
  function test_crc32 (line 42) | void test_crc32()
  function main (line 54) | int main()

FILE: hash/hash_djb2.c
  function djb2 (line 18) | uint64_t djb2(const char* s)
  function test_djb2 (line 34) | void test_djb2(void)
  function main (line 46) | int main()

FILE: hash/hash_sdbm.c
  function sdbm (line 18) | uint64_t sdbm(const char* s)
  function test_sdbm (line 34) | void test_sdbm()
  function main (line 46) | int main()

FILE: hash/hash_xor8.c
  function xor8 (line 19) | uint8_t xor8(const char* s)
  function test_xor8 (line 35) | void test_xor8()
  function main (line 47) | int main()

FILE: leetcode/src/10.c
  function matchStar (line 38) | bool matchStar(char ch, char* s, char* p) {
  function isMatch (line 47) | bool isMatch(char* s, char* p) {

FILE: leetcode/src/1008.c
  type TreeNode (line 10) | struct TreeNode
  type TreeNode (line 12) | struct TreeNode
  type TreeNode (line 15) | struct TreeNode

FILE: leetcode/src/1009.c
  function bitwiseComplement (line 8) | int bitwiseComplement(int n){

FILE: leetcode/src/101.c
  function checkSymmetric (line 10) | bool checkSymmetric(struct TreeNode *left, struct TreeNode *right)
  function isSymmetric (line 20) | bool isSymmetric(struct TreeNode *root)

FILE: leetcode/src/1019.c
  type ListNode (line 9) | struct ListNode
  type ListNode (line 12) | struct ListNode

FILE: leetcode/src/1026.c
  function recursiveSolve (line 13) | void recursiveSolve(struct TreeNode* node, int* result, int minVal, int ...
  function maxAncestorDiff (line 32) | int maxAncestorDiff(struct TreeNode* root){

FILE: leetcode/src/104.c
  function maxval (line 10) | int maxval(int a, int b)
  function maxDepth (line 17) | int maxDepth(struct TreeNode *root)

FILE: leetcode/src/108.c
  type TreeNode (line 10) | struct TreeNode
  type TreeNode (line 17) | struct TreeNode
  type TreeNode (line 17) | struct TreeNode
  type TreeNode (line 25) | struct TreeNode

FILE: leetcode/src/1089.c
  function duplicateZeros (line 1) | void duplicateZeros(int *arr, int arrSize)

FILE: leetcode/src/109.c
  type TreeNode (line 1) | struct TreeNode
  type ListNode (line 1) | struct ListNode
  type ListNode (line 1) | struct ListNode
  type ListNode (line 5) | struct ListNode
  type TreeNode (line 11) | struct TreeNode
  type TreeNode (line 11) | struct TreeNode
  type TreeNode (line 17) | struct TreeNode
  type ListNode (line 17) | struct ListNode

FILE: leetcode/src/11.c
  function min (line 2) | int min(int a, int b) { return ((a < b) ? a : b); }
  function maxArea (line 5) | int maxArea(int *height, int heightSize)

FILE: leetcode/src/110.c
  function max (line 1) | int max(int a, int b) { return a >= b ? a : b; }
  function height (line 3) | int height(struct TreeNode *root)
  function isBalanced (line 11) | bool isBalanced(struct TreeNode *root)

FILE: leetcode/src/112.c
  function hasPathSum (line 1) | bool hasPathSum(struct TreeNode *root, int sum)

FILE: leetcode/src/1137.c
  function tribonacci (line 4) | int tribonacci(int n){

FILE: leetcode/src/1147.c
  function equalSubstrings (line 3) | bool equalSubstrings(char* text, int firstIndex, int secondIndex, int le...
  function longestDecompositionDpCached (line 13) | int longestDecompositionDpCached(char* text, int textLen, int index, int...
  function longestDecompositionDp (line 25) | int longestDecompositionDp(char* text, int textLen, int index, int* dp){
  function longestDecomposition (line 42) | int longestDecomposition(char * text){

FILE: leetcode/src/1184.c
  function distanceBetweenBusStops (line 1) | int distanceBetweenBusStops(int *distance, int distanceSize, int start,

FILE: leetcode/src/1189.c
  function maxNumberOfBalloons (line 1) | int maxNumberOfBalloons(char *text)

FILE: leetcode/src/1207.c
  function cmpvalue (line 3) | int cmpvalue(const void *a, const void *b) { return *(int *)b - *(int *)...
  function uniqueOccurrences (line 4) | bool uniqueOccurrences(int *arr, int arrSize)

FILE: leetcode/src/121.c
  function maxcmp (line 1) | int maxcmp(int a, int b) { return (a >= b) ? a : b; }
  function maxProfit (line 5) | int maxProfit(int *prices, int pricesSize)

FILE: leetcode/src/124.c
  function recursiveSolve (line 12) | int recursiveSolve(struct TreeNode* node, int* result){
  function maxPathSum (line 31) | int maxPathSum(struct TreeNode* root){

FILE: leetcode/src/125.c
  function isPalindrome (line 1) | bool isPalindrome(char *s)

FILE: leetcode/src/1283.c
  function getSum (line 3) | long getSum(int* nums, int numsSize, int divizor){
  function smallestDivisor (line 20) | int smallestDivisor(int* nums, int numsSize, int threshold){

FILE: leetcode/src/13.c
  function romanToInt (line 1) | int romanToInt(char *s)

FILE: leetcode/src/136.c
  function singleNumber (line 1) | int singleNumber(int *nums, int numsSize)

FILE: leetcode/src/14.c
  function findMaxConsecutiveOnes (line 1) | int findMaxConsecutiveOnes(int* nums, int numsSize){

FILE: leetcode/src/141.c
  function hasCycle (line 8) | bool hasCycle(struct ListNode *head)

FILE: leetcode/src/142.c
  type ListNode (line 1) | struct ListNode
  type ListNode (line 1) | struct ListNode
  type ListNode (line 5) | struct ListNode
  type ListNode (line 13) | struct ListNode

FILE: leetcode/src/1524.c
  function numOfSubarrays (line 4) | int numOfSubarrays(int* arr, int arrSize){

FILE: leetcode/src/153.c
  function findMin (line 1) | int findMin(int *nums, int numsSize)

FILE: leetcode/src/16.c
  function cmp (line 3) | int cmp(const void* a, const void* b) {
  function threeSumClosest (line 8) | int threeSumClosest(int* nums, int nums_size, int target) {

FILE: leetcode/src/160.c
  type ListNode (line 1) | struct ListNode
  type ListNode (line 1) | struct ListNode
  type ListNode (line 2) | struct ListNode
  type ListNode (line 4) | struct ListNode

FILE: leetcode/src/1653.c
  function minimumDeletions (line 6) | int minimumDeletions(char * s){

FILE: leetcode/src/1657.c
  function diff (line 13) | int diff(const int *i, const int *j)
  function closeStrings (line 21) | bool closeStrings(char * word1, char * word2){

FILE: leetcode/src/169.c
  function majorityElement (line 3) | int majorityElement(int *nums, int numsSize)

FILE: leetcode/src/1695.c
  function maximumUniqueSubarray (line 2) | int maximumUniqueSubarray(int* nums, int numsSize){

FILE: leetcode/src/1704.c
  function isVowel (line 1) | bool isVowel(char chr){
  function halvesAreAlike (line 22) | bool halvesAreAlike(char * s){

FILE: leetcode/src/173.c
  type BSTIterator (line 12) | typedef struct
  function TraverseAndAssign (line 19) | void TraverseAndAssign(struct TreeNode *root, BSTIterator *obj)
  function TotalNodes (line 31) | int TotalNodes(struct TreeNode *root)
  function BSTIterator (line 40) | BSTIterator *bSTIteratorCreate(struct TreeNode *root)
  function bSTIteratorNext (line 56) | int bSTIteratorNext(BSTIterator *obj)
  function bSTIteratorHasNext (line 64) | bool bSTIteratorHasNext(BSTIterator *obj)
  function bSTIteratorFree (line 74) | void bSTIteratorFree(BSTIterator *obj)

FILE: leetcode/src/1752.c
  function check (line 1) | bool check(int* nums, int numsSize){

FILE: leetcode/src/1833.c
  function compare (line 1) | int compare(const void* i, const void* j)
  function maxIceCream (line 9) | int maxIceCream(int* costs, int costsSize, int coins){

FILE: leetcode/src/1838.c
  function compare (line 3) | int compare(const int* i, const int* j)
  function maxFrequency (line 11) | int maxFrequency(int* nums, int numsSize, int k){

FILE: leetcode/src/189.c
  function rotate (line 1) | void rotate(int *nums, int numsSize, int k)

FILE: leetcode/src/19.c
  type ListNode (line 9) | struct ListNode
  type ListNode (line 9) | struct ListNode
  type ListNode (line 10) | struct ListNode

FILE: leetcode/src/190.c
  function reverseBits (line 1) | uint32_t reverseBits(uint32_t n)

FILE: leetcode/src/191.c
  function hammingWeight (line 1) | int hammingWeight(uint32_t n)

FILE: leetcode/src/2.c
  type ListNode (line 9) | struct ListNode
  type ListNode (line 9) | struct ListNode
  type ListNode (line 9) | struct ListNode
  type ListNode (line 11) | struct ListNode
  type ListNode (line 12) | struct ListNode
  type ListNode (line 13) | struct ListNode
  type ListNode (line 41) | struct ListNode

FILE: leetcode/src/20.c
  function isValid (line 1) | bool isValid(char *s)

FILE: leetcode/src/201.c
  function rangeBitwiseAnd (line 1) | int rangeBitwiseAnd(int m, int n)

FILE: leetcode/src/2024.c
  function maximizeTarget (line 3) | int maximizeTarget(char * answerKey, char targetChar, int k){
  function maxConsecutiveAnswers (line 31) | int maxConsecutiveAnswers(char * answerKey, int k){

FILE: leetcode/src/203.c
  type ListNode (line 1) | struct ListNode
  type ListNode (line 1) | struct ListNode

FILE: leetcode/src/206.c
  type ListNode (line 9) | struct ListNode
  type ListNode (line 9) | struct ListNode
  type ListNode (line 11) | struct ListNode
  type ListNode (line 14) | struct ListNode

FILE: leetcode/src/2095.c
  type ListNode (line 9) | struct ListNode
  type ListNode (line 9) | struct ListNode
  type ListNode (line 13) | struct ListNode

FILE: leetcode/src/21.c
  type ListNode (line 4) | struct ListNode
  type ListNode (line 4) | struct ListNode
  type ListNode (line 4) | struct ListNode
  type ListNode (line 6) | struct ListNode
  type ListNode (line 7) | struct ListNode
  type ListNode (line 56) | struct ListNode
  type ListNode (line 56) | struct ListNode
  type ListNode (line 56) | struct ListNode

FILE: leetcode/src/2125.c
  function coundDevices (line 1) | int coundDevices(char* bankRow){
  function numberOfBeams (line 16) | int numberOfBeams(char ** bank, int bankSize){

FILE: leetcode/src/2130.c
  function pairSum (line 9) | int pairSum(struct ListNode* head)

FILE: leetcode/src/215.c
  function findKthLargest (line 3) | int findKthLargest(int *nums, int numsSize, int k)

FILE: leetcode/src/217.c
  function numcmp (line 1) | int numcmp(const void *a, const void *b) { return *(int *)a - *(int *)b; }
  function containsDuplicate (line 3) | bool containsDuplicate(int *nums, int numsSize)

FILE: leetcode/src/2222.c
  function numberOfWaysForChar (line 1) | long numberOfWaysForChar(char * s, char c){
  function numberOfWays (line 28) | long long numberOfWays(char * s){

FILE: leetcode/src/223.c
  function intersectionSize (line 3) | int intersectionSize(int p11, int p12, int p21, int p22){
  function computeArea (line 18) | int computeArea(int ax1, int ay1, int ax2, int ay2, int bx1, int by1, in...

FILE: leetcode/src/2256.c
  function minimumAverageDifference (line 8) | int minimumAverageDifference(int* nums, int numsSize){

FILE: leetcode/src/226.c
  type TreeNode (line 1) | struct TreeNode
  type TreeNode (line 1) | struct TreeNode
  type TreeNode (line 3) | struct TreeNode

FILE: leetcode/src/2270.c
  function waysToSplitArray (line 5) | int waysToSplitArray(int* nums, int numsSize){

FILE: leetcode/src/2279.c
  function compare (line 1) | int compare(const int* i, const int* j)
  function maximumBags (line 9) | int maximumBags(int* capacity, int capacitySize, int* rocks, int rocksSi...

FILE: leetcode/src/230.c
  type TreeNode (line 10) | struct TreeNode
  type TreeNode (line 10) | struct TreeNode
  type TreeNode (line 15) | struct TreeNode
  function kthSmallest (line 33) | int kthSmallest(struct TreeNode* root, int k){

FILE: leetcode/src/2304.c
  function minPathCost (line 7) | int minPathCost(int** grid, int gridSize, int* gridColSize, int** moveCo...

FILE: leetcode/src/231.c
  function isPowerOfTwo (line 4) | bool isPowerOfTwo(int n){

FILE: leetcode/src/234.c
  type ListNode (line 9) | struct ListNode
  type ListNode (line 9) | struct ListNode
  type ListNode (line 11) | struct ListNode
  type ListNode (line 14) | struct ListNode
  function isPalindrome (line 21) | bool isPalindrome(struct ListNode *head)

FILE: leetcode/src/236.c
  type ListItem (line 11) | struct ListItem {
  function findTargetPath (line 16) | bool findTargetPath(struct TreeNode* node, struct TreeNode* target, stru...
  function freeList (line 43) | void freeList(struct ListItem* target){
  type TreeNode (line 57) | struct TreeNode
  type TreeNode (line 57) | struct TreeNode
  type TreeNode (line 57) | struct TreeNode
  type TreeNode (line 57) | struct TreeNode
  type ListItem (line 58) | struct ListItem
  type ListItem (line 58) | struct ListItem
  type ListItem (line 59) | struct ListItem
  type ListItem (line 59) | struct ListItem
  type TreeNode (line 64) | struct TreeNode
  type ListItem (line 65) | struct ListItem
  type ListItem (line 66) | struct ListItem

FILE: leetcode/src/24.c
  type ListNode (line 1) | struct ListNode
  type ListNode (line 1) | struct ListNode
  type ListNode (line 5) | struct ListNode

FILE: leetcode/src/242.c
  function isAnagram (line 1) | bool isAnagram(char *s, char *t)

FILE: leetcode/src/2501.c
  function longestSquareStreakDp (line 3) | int longestSquareStreakDp(int* numsSet, int numsSetSize, int* dp, long n...
  function longestSquareStreak (line 21) | int longestSquareStreak(int* nums, int numsSize){

FILE: leetcode/src/26.c
  function removeDuplicates (line 1) | int removeDuplicates(int *nums, int numsSize)

FILE: leetcode/src/268.c
  function missingNumber (line 1) | int missingNumber(int *nums, int numsSize)

FILE: leetcode/src/27.c
  function removeElement (line 1) | int removeElement(int *nums, int numsSize, int val)

FILE: leetcode/src/274.c
  function diff (line 1) | int diff(const int* i, const int* j)
  function hIndex (line 11) | int hIndex(int* citations, int citationsSize){

FILE: leetcode/src/278.c
  function firstBadVersion (line 4) | int firstBadVersion(int n)

FILE: leetcode/src/28.c
  function strStr (line 5) | int strStr(char *haystack, char *needle)
  function fill_overlap (line 57) | void fill_overlap(char *needle, int len_needle, int *overlap)
  function strStr (line 81) | int strStr(char *haystack, char *needle)

FILE: leetcode/src/283.c
  function moveZeroes (line 1) | void moveZeroes(int *nums, int numsSize)

FILE: leetcode/src/287.c
  function cmpval (line 1) | int cmpval(const void *a, const void *b) { return *(int *)a - *(int *)b; }
  function findDuplicate (line 2) | int findDuplicate(int *nums, int numsSize)

FILE: leetcode/src/29.c
  function divide (line 1) | int divide(int dividend, int divisor)

FILE: leetcode/src/3.c
  function lengthOfLongestSubstring (line 1) | int lengthOfLongestSubstring(char *str)
  function lengthOfLongestSubstring (line 37) | int lengthOfLongestSubstring(char *s)

FILE: leetcode/src/32.c
  function getEndValidIndexFromDp (line 6) | int getEndValidIndexFromDp(int* dp, char* s, int index, int lenS){
  function getEndValidIndex (line 18) | int getEndValidIndex(int* dp, char* s, int index, int lenS){
  function longestValidParentheses (line 42) | int longestValidParentheses(char * s){

FILE: leetcode/src/344.c
  function reverseString (line 1) | void reverseString(char *s, int sSize)

FILE: leetcode/src/35.c
  function searchInsert (line 1) | int searchInsert(int *nums, int numsSize, int target)
  function searchInsert (line 18) | int searchInsert(int *nums, int numsSize, int target)

FILE: leetcode/src/367.c
  function isPerfectSquare (line 1) | bool isPerfectSquare(int num)

FILE: leetcode/src/37.c
  function getTripletId (line 11) | int getTripletId(int i, int j){
  function sudokuSolver (line 16) | bool sudokuSolver(int startI, int startJ, char** board, int boardSize, i...
  function solveSudoku (line 61) | void solveSudoku(char** board, int boardSize, int* boardColSize){

FILE: leetcode/src/387.c
  function firstUniqChar (line 1) | int firstUniqChar(char *s)

FILE: leetcode/src/389.c
  function findTheDifference (line 1) | char findTheDifference(char *s, char *t)

FILE: leetcode/src/4.c
  function findMedianSortedArrays (line 3) | double findMedianSortedArrays(int *nums1, int nums1Size, int *nums2,

FILE: leetcode/src/404.c
  function isleaf (line 1) | bool isleaf(struct TreeNode *root)
  function sumOfLeftLeaves (line 6) | int sumOfLeftLeaves(struct TreeNode *root)

FILE: leetcode/src/42.c
  function trap (line 10) | int trap(int* height, int heightSize){

FILE: leetcode/src/434.c
  function countSegments (line 2) | int countSegments(char * s){

FILE: leetcode/src/442.c
  function cmpval (line 1) | int cmpval(const void *a, const void *b) { return *(int *)a - *(int *)b; }

FILE: leetcode/src/45.c
  function jump (line 4) | int jump(int* nums, int numsSize) {

FILE: leetcode/src/461.c
  function hammingDistance (line 1) | int hammingDistance(int x, int y)

FILE: leetcode/src/476.c
  function findComplement (line 1) | int findComplement(int num)

FILE: leetcode/src/485.c
  function max (line 1) | int max(a,b){
  function findMaxConsecutiveOnes (line 8) | int findMaxConsecutiveOnes(int* nums, int numsSize){

FILE: leetcode/src/50.c
  function powPositive (line 1) | double powPositive(double x, int n){
  function myPow (line 20) | double myPow(double x, int n){

FILE: leetcode/src/509.c
  function fib (line 1) | int fib(int N)

FILE: leetcode/src/520.c
  function detectCapitalUse (line 1) | bool detectCapitalUse(char *word)
  function isAllUpper (line 24) | bool isAllUpper(char *word)
  function detectCapitalUse (line 34) | bool detectCapitalUse(char *word)

FILE: leetcode/src/53.c
  function maxcmp (line 2) | int maxcmp(int a, int b) { return a >= b ? a : b; }
  function maxSubArray (line 4) | int maxSubArray(int *nums, int numsSize)

FILE: leetcode/src/540.c
  function singleNonDuplicate (line 14) | int singleNonDuplicate(int* nums, int numsSize) {

FILE: leetcode/src/561.c
  function cmpval (line 1) | int cmpval(const void *a, const void *b) { return *(int *)a - *(int *)b; }
  function arrayPairSum (line 2) | int arrayPairSum(int *nums, int numsSize)

FILE: leetcode/src/567.c
  function countCharsForStringSlice (line 3) | void countCharsForStringSlice(int* charsCounter, char* s, int length, in...
  function checkInclusion (line 14) | bool checkInclusion(char* s1, char* s2) {

FILE: leetcode/src/6.c
  function testZigZag (line 86) | static void testZigZag(char* s, int numRows, char* expected)
  function test (line 100) | static void test()
  function main (line 147) | int main(void)

FILE: leetcode/src/617.c
  type TreeNode (line 1) | struct TreeNode
  type TreeNode (line 3) | struct TreeNode
  type TreeNode (line 3) | struct TreeNode
  type TreeNode (line 3) | struct TreeNode
  type TreeNode (line 9) | struct TreeNode
  type TreeNode (line 9) | struct TreeNode
  type TreeNode (line 9) | struct TreeNode
  type TreeNode (line 14) | struct TreeNode

FILE: leetcode/src/62.c
  function uniquePaths (line 17) | int uniquePaths(int m, int n)

FILE: leetcode/src/63.c
  function uniquePathsWithObstacles (line 13) | int uniquePathsWithObstacles(int** obstacleGrid, int obstacleGridSize,

FILE: leetcode/src/647.c
  function countSubstrings (line 4) | int countSubstrings(char *s)
  function countPalin (line 19) | int countPalin(char *s, int head, int tail, int len)

FILE: leetcode/src/669.c
  type TreeNode (line 14) | struct TreeNode
  type TreeNode (line 14) | struct TreeNode

FILE: leetcode/src/674.c
  function findLengthOfLCIS (line 1) | int findLengthOfLCIS(int *nums, int numsSize)

FILE: leetcode/src/684.c
  function find (line 4) | int find(int* sets, int index){
  function unionSet (line 12) | void unionSet(int* sets, int i1, int i2){

FILE: leetcode/src/69.c
  function mySqrt (line 2) | int mySqrt(int x){

FILE: leetcode/src/7.c
  function reverse (line 3) | int reverse(int x)

FILE: leetcode/src/700.c
  type TreeNode (line 10) | struct TreeNode
  type TreeNode (line 10) | struct TreeNode

FILE: leetcode/src/701.c
  type TreeNode (line 1) | struct TreeNode
  type TreeNode (line 1) | struct TreeNode
  type TreeNode (line 5) | struct TreeNode
  type TreeNode (line 5) | struct TreeNode

FILE: leetcode/src/704.c
  function search (line 1) | int search(int *nums, int numsSize, int target)
  function cmpint (line 24) | int cmpint(const void *a, const void *b) { return *(int *)a - *(int *)b; }
  function search (line 26) | int search(int *nums, int numsSize, int target)

FILE: leetcode/src/75.c
  function swap (line 1) | void swap(int *x, int *y){
  function sortColors (line 9) | void sortColors(int* arr, int n){

FILE: leetcode/src/771.c
  function numJewelsInStones (line 4) | int numJewelsInStones(char *j, char *s)

FILE: leetcode/src/79.c
  function getPointKey (line 1) | int getPointKey(int i, int j, int boardSize, int boardColSize){
  function exitsWord (line 8) | bool exitsWord(int i, int j, char** board, int boardSize, int* boardColS...
  function exist (line 44) | bool exist(char** board, int boardSize, int* boardColSize, char* word){

FILE: leetcode/src/8.c
  function myAtoi (line 1) | int myAtoi(char *str)

FILE: leetcode/src/807.c
  function maxIncreaseKeepingSkyline (line 7) | int maxIncreaseKeepingSkyline(int** grid, int gridSize, int* gridColSize){

FILE: leetcode/src/82.c
  type ListNode (line 1) | struct ListNode
  type ListNode (line 1) | struct ListNode

FILE: leetcode/src/83.c
  type ListNode (line 2) | struct ListNode
  type ListNode (line 2) | struct ListNode
  type ListNode (line 4) | struct ListNode

FILE: leetcode/src/841.c
  function visitRooms (line 1) | void visitRooms(int key, int** rooms, int roomsSize, int* roomsColSize, ...
  function canVisitAllRooms (line 15) | bool canVisitAllRooms(int** rooms, int roomsSize, int* roomsColSize){

FILE: leetcode/src/852.c
  function peakIndexInMountainArray (line 1) | int peakIndexInMountainArray(int *A, int ASize)

FILE: leetcode/src/876.c
  type ListNode (line 9) | struct ListNode
  type ListNode (line 9) | struct ListNode
  type ListNode (line 11) | struct ListNode

FILE: leetcode/src/9.c
  function isPalindrome (line 1) | bool isPalindrome(int x)

FILE: leetcode/src/901.c
  type Stack (line 6) | typedef struct stack{
  type StockSpanner (line 13) | typedef struct {
  function StockSpanner (line 20) | StockSpanner* stockSpannerCreate() {
  function stockSpannerNext (line 29) | int stockSpannerNext(StockSpanner* obj, int price) {
  function stockSpannerFree (line 51) | void stockSpannerFree(StockSpanner* obj) {

FILE: leetcode/src/931.c
  function minFallingPathSum (line 6) | int minFallingPathSum(int** matrix, int matrixSize, int* matrixColSize){

FILE: leetcode/src/938.c
  function rangeSumBST (line 1) | int rangeSumBST(struct TreeNode *root, int L, int R)

FILE: leetcode/src/94.c
  function processTraversal (line 1) | void processTraversal(struct TreeNode *root, int *res, int *size)
  type TreeNode (line 11) | struct TreeNode

FILE: leetcode/src/953.c
  function isWordLess (line 3) | bool isWordLess(char* word1, char* word2, int* charOrder){
  function isAlienSorted (line 25) | bool isAlienSorted(char ** words, int wordsSize, char * order){

FILE: leetcode/src/965.c
  function isUnivalTree (line 1) | bool isUnivalTree(struct TreeNode *root)

FILE: leetcode/src/977.c
  function cmpval (line 24) | int cmpval(const void *a, const void *b) { return *(int *)a - *(int *)b; }

FILE: leetcode/src/979.c
  type NodeDistributeInfo (line 10) | struct NodeDistributeInfo {
  type NodeDistributeInfo (line 15) | struct NodeDistributeInfo
  type TreeNode (line 15) | struct TreeNode
  type NodeDistributeInfo (line 16) | struct NodeDistributeInfo
  type NodeDistributeInfo (line 16) | struct NodeDistributeInfo
  type NodeDistributeInfo (line 24) | struct NodeDistributeInfo
  type NodeDistributeInfo (line 25) | struct NodeDistributeInfo
  function distributeCoins (line 45) | int distributeCoins(struct TreeNode* root) {

FILE: leetcode/src/98.c
  function checkIsBst (line 13) | bool checkIsBst(struct TreeNode* node, bool leftBoundInf, int leftBound,...
  function isValidBST (line 22) | bool isValidBST(struct TreeNode* root){

FILE: leetcode/src/997.c
  function findJudge (line 4) | int findJudge(int n, int** trust, int trustSize, int* trustColSize){

FILE: machine_learning/adaline_learning.c
  type adaline (line 43) | struct adaline
  function new_adaline (line 59) | struct adaline new_adaline(const int num_features, const double eta)
  function delete_adaline (line 89) | void delete_adaline(struct adaline *ada)
  function adaline_activation (line 105) | int adaline_activation(double x) { return x > 0 ? 1 : -1; }
  type adaline (line 112) | struct adaline
  function adaline_predict (line 136) | int adaline_predict(struct adaline *ada, const double *x, double *out)
  function adaline_fit_sample (line 158) | double adaline_fit_sample(struct adaline *ada, const double *x, const in...
  function adaline_fit (line 184) | void adaline_fit(struct adaline *ada, double **X, const int *y, const in...
  function test1 (line 225) | void test1(double eta)
  function test2 (line 273) | void test2(double eta)
  function test3 (line 336) | void test3(double eta)
  function main (line 398) | int main(int argc, char **argv)

FILE: machine_learning/k_means_clustering.c
  type observation (line 38) | typedef struct observation
  type cluster (line 52) | typedef struct cluster
  function calculateNearst (line 69) | int calculateNearst(observation* o, cluster clusters[], int k)
  function calculateCentroid (line 97) | void calculateCentroid(observation observations[], size_t size,
  function cluster (line 134) | cluster* kMeans(observation observations[], size_t size, int k)
  function printEPS (line 237) | void printEPS(observation pts[], size_t len, cluster cent[], int k)
  function test (line 321) | static void test()
  function test2 (line 356) | void test2()
  function main (line 384) | int main()

FILE: machine_learning/kohonen_som_topology.c
  type kohonen_array_3d (line 47) | struct kohonen_array_3d
  type kohonen_array_3d (line 67) | struct kohonen_array_3d
  function _random (line 87) | double _random(double a, double b)
  function save_2d_data (line 102) | int save_2d_data(const char *fname, double **X, int num_points,
  function save_u_matrix (line 139) | int save_u_matrix(const char *fname, struct kohonen_array_3d *W)
  function get_min_2d (line 204) | void get_min_2d(double **X, int N, double *val, int *x_idx, int *y_idx)
  function kohonen_update_weights (line 234) | double kohonen_update_weights(const double *X, struct kohonen_array_3d *W,
  function kohonen_som (line 314) | void kohonen_som(double **X, struct kohonen_array_3d *W, int num_samples,
  function test_2d_classes (line 366) | void test_2d_classes(double *const *data, int N)
  function test1 (line 406) | void test1()
  function test_3d_classes1 (line 465) | void test_3d_classes1(double *const *data, int N)
  function test2 (line 506) | void test2()
  function test_3d_classes2 (line 564) | void test_3d_classes2(double *const *data, int N)
  function test3 (line 609) | void test3()
  function get_clock_diff (line 663) | double get_clock_diff(clock_t start_t, clock_t end_t)
  function main (line 669) | int main(int argc, char **argv)

FILE: machine_learning/kohonen_som_trace.c
  function _random (line 54) | double _random(double a, double b)
  function save_nd_data (line 70) | int save_nd_data(const char *fname, double **X, int num_points,
  function kohonen_get_min_1d (line 104) | void kohonen_get_min_1d(double const *X, int N, double *val, int *idx)
  function kohonen_update_weights (line 129) | void kohonen_update_weights(double const *x, double *const *W, double *D,
  function kohonen_som_tracer (line 179) | void kohonen_som_tracer(double **X, double *const *W, int num_samples,
  function test_circle (line 223) | void test_circle(double *const *data, int N)
  function test1 (line 261) | void test1()
  function test_lamniscate (line 319) | void test_lamniscate(double *const *data, int N)
  function test2 (line 358) | void test2()
  function test_3d_classes (line 410) | void test_3d_classes(double *const *data, int N)
  function test3 (line 462) | void test3()
  function get_clock_diff (line 511) | double get_clock_diff(clock_t start_t, clock_t end_t)
  function main (line 517) | int main(int argc, char **argv)

FILE: math/armstrong_number.c
  function power (line 7) | int power(int x, unsigned int y)
  function order (line 17) | int order(int x)
  function isArmstrong (line 30) | int isArmstrong(int x)
  function main (line 50) | int main()

FILE: math/cantor_set.c
  type CantorSet (line 11) | typedef struct _cantor_set
  function propagate (line 23) | void propagate(CantorSet *head)
  function print (line 55) | void print(CantorSet *head)
  function free_memory (line 72) | void free_memory(CantorSet *head)
  function main (line 84) | int main(int argc, char const *argv[])

FILE: math/cartesian_to_polar.c
  function to_polar (line 22) | void to_polar(double x, double y, double *r, double *theta)
  function get_rand (line 88) | double get_rand(double lim1, double lim2)
  function test (line 98) | void test()
  function main (line 118) | int main()

FILE: math/catalan.c
  function factorial (line 5) | long int factorial(int x)  // long int for more than 10 factorial
  function main (line 16) | int main()

FILE: math/collatz.c
  function main (line 16) | int main(int argc, char *argv[])

FILE: math/euclidean_algorithm_extended.c
  type euclidean_result_t (line 20) | typedef struct euclidean_result
  function xy_push (line 36) | static inline void xy_push(int arr[2], int newval)
  function calculate_next_xy (line 54) | static inline void calculate_next_xy(int quotient, int prev[2])
  function euclidean_result_t (line 69) | euclidean_result_t extended_euclidean_algorithm(int a, int b)
  function single_test (line 121) | static inline void single_test(int a, int b, int gcd, int x, int y)
  function test (line 135) | static void test()
  function main (line 150) | int main()

FILE: math/factorial.c
  function main (line 2) | int main()

FILE: math/factorial_large_number.c
  type large_num (line 14) | typedef struct _large_num
  function large_num (line 24) | large_num *new_number(void)
  function delete_number (line 37) | void delete_number(large_num *num)
  function add_digit (line 48) | void add_digit(large_num *num, unsigned int value)
  function multiply (line 66) | void multiply(large_num *num, unsigned long n)
  function main (line 94) | int main(int argc, char *argv[])

FILE: math/factorial_trailing_zeroes.c
  function main (line 7) | int main()

FILE: math/fibonacci.c
  function fib (line 26) | unsigned int fib(int number)
  function getInput (line 50) | int getInput(void)
  function test (line 92) | static void test()
  function main (line 103) | int main()

FILE: math/fibonacci_dp.c
  function fib (line 10) | int fib(int n)
  function main (line 38) | int main(int argc, char *argv[])

FILE: math/fibonacci_fast.c
  function fib (line 23) | void fib(unsigned long n, unsigned long *C, unsigned long *D)
  function main (line 65) | int main(int argc, char *argv[])

FILE: math/fibonacci_formula.c
  function fib (line 17) | int fib(unsigned int n) {
  function test (line 28) | static void test () {
  function main (line 52) | int main() {

FILE: math/gcd.c
  function GCD (line 4) | int GCD(int x, int y)
  function main (line 11) | int main()

FILE: math/is_armstrong.c
  function main (line 3) | int main()

FILE: math/large_factorials.c
  function main (line 3) | int main()

FILE: math/lcm.c
  function gcd (line 11) | int gcd(int a, int b)
  function lcm (line 19) | int lcm(int a, int b) { return (a * b) / gcd(a, b); }
  function main (line 22) | int main()

FILE: math/lerp.c
  function lerp (line 4) | float lerp(float k0, float k1, float t) { return k0 + t * (k1 - k0); }
  function lerp_precise (line 6) | float lerp_precise(int k0, int k1, float t) { return (1 - t) * k0 + t * ...
  function main (line 8) | int main()

FILE: math/palindrome.c
  function main (line 14) | int main()
  function isPalindrome (line 29) | bool isPalindrome(int number)

FILE: math/prime.c
  function isPrime (line 16) | bool isPrime(int x)
  function test (line 43) | void test()
  function main (line 67) | int main()

FILE: math/prime_factoriziation.c
  type range (line 24) | typedef struct data
  type range (line 29) | typedef range *Range;
  function main (line 46) | int main()
  function Range (line 60) | Range int_fact(int n)
  function print_arr (line 136) | void print_arr(Range pStr)
  function destroy (line 160) | void destroy(Range r)

FILE: math/prime_sieve.c
  function prime (line 21) | void prime(int *p)
  function count (line 42) | int count(int *arr, const int size){
  function test (line 56) | static void test()
  function main (line 73) | int main(int argc, const char *argv[])

FILE: math/strong_number.c
  function isStrong (line 15) | bool isStrong(int number)
  function test (line 43) | void test()
  function main (line 53) | int main()

FILE: misc/demonetization.c
  function ways (line 8) | int ways(int n, int *a, int k)
  function main (line 19) | int main()

FILE: misc/hamming_distance.c
  function hamming_distance (line 21) | int hamming_distance(char* str1, char* str2)
  function test (line 41) | static void test()
  function main (line 58) | int main()

FILE: misc/lexicographic_permutations.c
  function swap (line 5) | void swap(char *left, char *right)
  function compare (line 12) | int compare(const void *a, const void *b) { return (*(char *)a - *(char ...
  function PrintSortedPermutations (line 14) | void PrintSortedPermutations(char *str)
  function main (line 51) | int main()

FILE: misc/longest_subsequence.c
  function longestSub (line 4) | void longestSub(int *ARRAY, int ARRAY_LENGTH, int **RESULT, int *RESULT_...
  function main (line 82) | int main()

FILE: misc/mcnaughton_yamada_thompson.c
  type ASTNode (line 27) | struct ASTNode {
  type ASTNode (line 33) | struct ASTNode
  type ASTNode (line 34) | struct ASTNode
  type ASTNode (line 36) | struct ASTNode
  type transRule (line 41) | struct transRule {
  type transRule (line 46) | struct transRule
  type NFAState (line 46) | struct NFAState
  type transRule (line 47) | struct transRule
  type NFAState (line 54) | struct NFAState {
  type NFAState (line 59) | struct NFAState
  type NFAState (line 60) | struct NFAState
  type NFA (line 70) | struct NFA {
  type NFA (line 82) | struct NFA
  type NFA (line 83) | struct NFA
  type NFA (line 84) | struct NFA
  type NFAState (line 84) | struct NFAState
  type NFA (line 85) | struct NFA
  type transRule (line 85) | struct transRule
  type NFA (line 86) | struct NFA
  type NFA (line 87) | struct NFA
  type NFA (line 88) | struct NFA
  function isLiteral (line 99) | int isLiteral(const char ch) {
  function indexOf (line 151) | size_t indexOf(const char* str, char key) {
  type ASTNode (line 189) | struct ASTNode
  type ASTNode (line 191) | struct ASTNode
  function redirect (line 267) | void redirect(struct NFA* nfa, struct NFAState* src, struct NFAState* de...
  type NFA (line 279) | struct NFA
  type ASTNode (line 279) | struct ASTNode
  type NFA (line 281) | struct NFA
  type NFA (line 298) | struct NFA
  type NFA (line 299) | struct NFA
  type NFA (line 308) | struct NFA
  type NFA (line 308) | struct NFA
  type NFAState (line 310) | struct NFAState
  type NFA (line 312) | struct NFA
  type transRule (line 314) | struct transRule
  type NFAState (line 316) | struct NFAState
  type NFA (line 330) | struct NFA
  type NFA (line 331) | struct NFA
  type NFA (line 344) | struct NFA
  function addState (line 369) | void addState(struct NFA* nfa, struct NFAState* state) {
  function addRule (line 380) | void addRule(struct NFA* nfa, struct transRule* rule, int loc) {
  function postProcessing (line 393) | void postProcessing(struct NFA* nfa) {
  function contains (line 428) | int contains(struct NFAState** states, int len, struct NFAState* state) {
  function findEmpty (line 446) | void findEmpty(struct NFAState* target, struct NFAState** states, int *s...
  function transit (line 465) | void transit(struct NFA* nfa, char input) {
  function isAccepting (line 522) | int isAccepting(const struct NFA* nfa) {
  function testHelper (line 540) | void testHelper(const char* regex, const char* string, const int expecte...
  function test (line 572) | static void test(void) {
  function main (line 593) | int main(void) {
  type ASTNode (line 606) | struct ASTNode
  type ASTNode (line 607) | struct ASTNode
  type ASTNode (line 607) | struct ASTNode
  function destroyNode (line 619) | void destroyNode(struct ASTNode* node) {
  type transRule (line 637) | struct transRule
  type NFAState (line 637) | struct NFAState
  type transRule (line 638) | struct transRule
  type transRule (line 638) | struct transRule
  function destroyRule (line 649) | void destroyRule(struct transRule* rule) {
  type NFAState (line 657) | struct NFAState
  type NFAState (line 658) | struct NFAState
  type NFAState (line 658) | struct NFAState
  type transRule (line 660) | struct transRule
  function destroyState (line 669) | void destroyState(struct NFAState* state) {
  type NFA (line 678) | struct NFA
  type NFA (line 679) | struct NFA
  type NFA (line 679) | struct NFA
  type NFAState (line 682) | struct NFAState
  type transRule (line 684) | struct transRule
  type NFAState (line 686) | struct NFAState
  type NFA (line 688) | struct NFA
  function destroyNFA (line 701) | void destroyNFA(struct NFA* nfa) {

FILE: misc/mirror.c
  function main (line 9) | int main(int argc, char *argv[])
  function saisie (line 16) | void saisie(char *cpointeur)
  function compte (line 48) | int compte(char *s)

FILE: misc/pid.c
  type pid (line 30) | struct pid
  function pid_step (line 42) | float pid_step(struct pid *controller, float dt, float error)
  function main (line 58) | int main()

FILE: misc/poly_add.c
  type term (line 19) | struct term
  function free_poly (line 31) | void free_poly(struct term *poly)
  function create_polynomial (line 48) | void create_polynomial(struct term **poly, int coef, int pow)
  function poly_add (line 73) | void poly_add(struct term **pol, struct term *poly1, struct term *poly2)
  function display_polynomial (line 164) | void display_polynomial(struct term *poly)
  function test1 (line 186) | static void test1(struct term *poly1, struct term *poly2, struct term *p...
  function test2 (line 221) | static void test2(struct term *poly1, struct term *poly2, struct term *p...
  function test3 (line 261) | static void test3(struct term *poly1, struct term *poly2, struct term *p...
  function main (line 293) | int main(void)

FILE: misc/postfix_evaluation.c
  type Stack (line 20) | struct Stack {
  type Stack (line 24) | struct Stack
  function push (line 31) | void push(int8_t opd) {
  function pop (line 44) | int8_t pop() {
  function evaluate (line 60) | int8_t evaluate(char post[]) {
  function test (line 105) | static void test() {
  function main (line 124) | int main() {

FILE: misc/quartile.c
  function main (line 5) | int main()

FILE: misc/rselect.c
  function swap (line 4) | void swap(int *a, int *b)
  function part (line 11) | int part(int a[], int l, int r, int n, int pivot, int pindex)
  function rselect (line 35) | int rselect(int a[], int l, int r, int n, int o)
  function main (line 65) | int main()

FILE: misc/run_length_encoding.c
  function test (line 71) | static void test() {
  function main (line 88) | int main() {

FILE: misc/shunting_yard.c
  function getPrecedence (line 22) | int getPrecedence(char operator) {
  function getAssociativity (line 48) | int getAssociativity(char operator) {
  function shuntingYard (line 73) | int shuntingYard(const char *input, char *output) {
  function test (line 205) | static void test() {
  function main (line 235) | int main() {

FILE: misc/sudoku_solver.c
  type sudoku (line 32) | struct sudoku
  function OKrow (line 48) | bool OKrow(const struct sudoku *a, int x, int y, int v)
  function OKcol (line 67) | bool OKcol(const struct sudoku *a, int x, int y, int v)
  function OKbox (line 85) | bool OKbox(const struct sudoku *a, int x, int y, int v)
  function OK (line 111) | bool OK(const struct sudoku *a, int x, int y, int v)
  function print (line 126) | void print(const struct sudoku *a)
  function get_next_unknown (line 144) | bool get_next_unknown(const struct sudoku *a, int *x, int *y)
  function solve (line 172) | bool solve(struct sudoku *a)
  function test (line 221) | void test()
  function main (line 246) | int main()

FILE: misc/tower_of_hanoi.c
  function hanoi (line 6) | void hanoi(int noOfDisks, char where, char to, char extra)
  function main (line 15) | int main(void)

FILE: misc/union_find.c
  function find (line 17) | int find(int *p, int x)
  function join (line 42) | void join(int *p, int x, int y) { p[find(p, x)] = find(p, y); }
  function main (line 45) | int main()

FILE: numerical_methods/bisection_method.c
  function sign (line 32) | double sign(double a, double b)
  function func (line 43) | double func(double x)
  function bisection (line 58) | double bisection(double x_left, double x_right, double tolerance)
  function test (line 91) | static void test()
  function main (line 107) | int main()

FILE: numerical_methods/durand_kerner_roots.c
  function poly_function (line 50) | long double complex poly_function(long double *coeffs, unsigned int degree,
  function check_termination (line 83) | char check_termination(long double delta)
  function main (line 95) | int main(int argc, char **argv)

FILE: numerical_methods/gauss_elimination.c
  function display (line 6) | void display(float a[ARRAY_SIZE][ARRAY_SIZE], int n)
  function interchange (line 19) | float interchange(float m[ARRAY_SIZE][ARRAY_SIZE], int i, int n)
  function eliminate (line 41) | float eliminate(float m[ARRAY_SIZE][ARRAY_SIZE], int i, int n)
  function main (line 56) | int main(void)

FILE: numerical_methods/gauss_seidel_method.c
  function main (line 4) | int main()

FILE: numerical_methods/lagrange_theorem.c
  function main (line 5) | int main()

FILE: numerical_methods/lu_decompose.c
  function lu_decomposition (line 20) | int lu_decomposition(double **A, double **L, double **U, int mat_size)
  function display (line 66) | void display(double **A, int N)
  function main (line 79) | int main(int argc, char **argv)

FILE: numerical_methods/mean.c
  function main (line 8) | int main(int argc, char **argv)

FILE: numerical_methods/median.c
  function main (line 5) | int main()

FILE: numerical_methods/newton_raphson_root.c
  function func (line 22) | double complex func(double complex x)
  function d_func (line 32) | double complex d_func(double complex x) { return 2. * x; }
  function main (line 37) | int main(int argc, char **argv)

FILE: numerical_methods/ode_forward_euler.c
  function problem (line 55) | void problem(const double *x, double *y, double *dy)
  function exact_solution (line 68) | void exact_solution(const double *x, double *y)
  function forward_euler_step (line 82) | void forward_euler_step(const double dx, const double *x, double *y, dou...
  function forward_euler (line 99) | double forward_euler(double dx, double x0, double x_max, double *y,
  function main (line 137) | int main(int argc, char *argv[])

FILE: numerical_methods/ode_midpoint_euler.c
  function problem (line 54) | void problem(const double *x, double *y, double *dy)
  function exact_solution (line 67) | void exact_solution(const double *x, double *y)
  function midpoint_euler_step (line 83) | void midpoint_euler_step(double dx, double *x, double *y, double *dy)
  function midpoint_euler (line 106) | double midpoint_euler(double dx, double x0, double x_max, double *y,
  function main (line 144) | int main(int argc, char *argv[])

FILE: numerical_methods/ode_semi_implicit_euler.c
  function problem (line 58) | void problem(const double *x, double *y, double *dy)
  function exact_solution (line 71) | void exact_solution(const double *x, double *y)
  function semi_implicit_euler_step (line 85) | void semi_implicit_euler_step(double dx, double *x, double *y, double *dy)
  function semi_implicit_euler (line 109) | double semi_implicit_euler(double dx, double x0, double x_max, double *y,
  function main (line 147) | int main(int argc, char *argv[])

FILE: numerical_methods/qr_decompose.h
  function print_matrix (line 22) | void print_matrix(double **A, /**< matrix to print */
  function vector_dot (line 43) | double vector_dot(double *a, double *b, int L)
  function vector_mag (line 64) | double vector_mag(double *vector, int L)
  function qr_decompose (line 142) | void qr_decompose(double **A, /**< input matrix to decompose */

FILE: numerical_methods/qr_decomposition.c
  function main (line 18) | int main(void)

FILE: numerical_methods/qr_eigen_values.c
  function create_matrix (line 27) | void create_matrix(double **A, int N)
  function eigen_values (line 106) | double eigen_values(double **A, double *eigen_vals, int mat_size,
  function test1 (line 224) | void test1()
  function test2 (line 271) | void test2()
  function main (line 315) | int main(int argc, char **argv)

FILE: numerical_methods/realtime_stats.c
  function stats_computer1 (line 24) | void stats_computer1(float x, float *mean, float *variance, float *std)
  function stats_computer2 (line 61) | void stats_computer2(float x, float *mean, float *variance, float *std)
  function test_function (line 92) | void test_function(const float *test_data, const int number_of_samples)
  function main (line 128) | int main(int argc, char **argv)

FILE: numerical_methods/secant_method.c
  function func (line 21) | double func(double x)
  function secant_method (line 36) | double secant_method(double x0, double x1, double tolerance)
  function test (line 61) | static void test()
  function main (line 76) | int main()

FILE: numerical_methods/simpsons_1_3rd_rule.c
  function f (line 4) | float f(float x)
  function main (line 10) | int main()

FILE: numerical_methods/variance.c
  function main (line 5) | int main()

FILE: process_scheduling_algorithms/non_preemptive_priority_scheduling.c
  type node (line 28) | typedef struct node {
  function insert (line 48) | void insert(node **root, int id, int at, int bt, int prior)
  function delete (line 81) | void delete(node **root, int id)
  function show_list (line 114) | void show_list(node *head)
  function l_length (line 129) | int l_length(node **root)
  function update (line 150) | void update(node **root, int id, int ct, int wt, int tat)
  function compare (line 199) | bool compare(node *a, node *b)
  function calculate_ct (line 215) | float calculate_ct(node **root)
  function calculate_tat (line 282) | float calculate_tat(node **root)
  function calculate_wt (line 307) | float calculate_wt(node **root)
  function test (line 332) | static void test()
  function main (line 364) | int main()

FILE: project_euler/problem_1/sol1.c
  function main (line 12) | int main()

FILE: project_euler/problem_1/sol2.c
  function main (line 15) | int main()

FILE: project_euler/problem_1/sol3.c
  function main (line 14) | int main()

FILE: project_euler/problem_1/sol4.c
  function main (line 12) | int main()

FILE: project_euler/problem_10/sol1.c
  function is_prime (line 11) | char is_prime(unsigned long n)
  function sum_of_primes (line 21) | unsigned long long sum_of_primes(unsigned long N)
  function main (line 33) | int main(int argc, char *argv[])

FILE: project_euler/problem_10/sol2.c
  function main (line 11) | int main(int argc, char *argv[])

FILE: project_euler/problem_12/sol1.c
  function count_divisors (line 19) | long count_divisors(long long n)
  function main (line 33) | int main(int argc, char **argv)

FILE: project_euler/problem_13/sol1.c
  function get_number (line 16) | int get_number(FILE *fp, char *buffer, uint8_t *out_int)
  function add_numbers (line 48) | int add_numbers(uint8_t *a, uint8_t *b, uint8_t N)
  function print_number (line 92) | int print_number(uint8_t *number, uint8_t N, int8_t num_digits_to_print)
  function main (line 123) | int main(void)

FILE: project_euler/problem_14/sol1.c
  function collatz (line 27) | long long collatz(long long start_num)
  function main (line 44) | int main(int argc, char **argv)

FILE: project_euler/problem_15/sol1.c
  function number_of_paths (line 17) | unsigned long long number_of_paths(int N)
  function main (line 30) | int main(int argc, char **argv)

FILE: project_euler/problem_16/sol1.c
  function main (line 12) | int main(int argc, char **argv)

FILE: project_euler/problem_19/sol1.c
  function get_month_days (line 15) | char get_month_days(short month)
  function is_leap_year (line 41) | char is_leap_year(short year)
  function main (line 79) | int main(int argc, char **argv)

FILE: project_euler/problem_2/so1.c
  function main (line 17) | int main()

FILE: project_euler/problem_20/sol1.c
  type big_int (line 17) | typedef struct _big_int
  function print_digit (line 26) | void print_digit(const big_int *my_int)
  function big_int (line 37) | big_int *add_digit(big_int *digit, char value)
  function remove_digits (line 76) | char remove_digits(big_int *digit, int N)
  function main (line 95) | int main(int argc, char **argv)

FILE: project_euler/problem_21/sol1.c
  function sum_of_divisors (line 13) | unsigned long sum_of_divisors(unsigned int N)
  function main (line 36) | int main(int argc, char **argv)

FILE: project_euler/problem_22/sol1.c
  function shell_sort (line 20) | void shell_sort(char data[][MAX_NAME_LEN], int LEN)
  function lazy_sort (line 48) | void lazy_sort(char data[][MAX_NAME_LEN], int LEN)
  function main (line 70) | int main(int argc, char **argv)

FILE: project_euler/problem_23/sol1.c
  function get_perfect_number (line 19) | char get_perfect_number(unsigned long N)
  function is_abundant (line 47) | unsigned long is_abundant(unsigned long N)
  function get_next_abundant (line 55) | unsigned long get_next_abundant(unsigned long N)
  function is_sum_of_abundant (line 71) | char is_sum_of_abundant(unsigned long N)
  function main (line 92) | int main(int argc, char **argv)

FILE: project_euler/problem_23/sol2.c
  function get_perfect_number (line 31) | char get_perfect_number(unsigned long N)
  function is_abundant (line 59) | char is_abundant(unsigned long N)
  function get_next_abundant (line 70) | unsigned long get_next_abundant(unsigned long N)
  function is_sum_of_abundant (line 87) | char is_sum_of_abundant(unsigned long N)
  function main (line 108) | int main(int argc, char **argv)

FILE: project_euler/problem_25/sol1.c
  function add_numbers (line 19) | unsigned int add_numbers(unsigned char *a, unsigned char *b, unsigned ch...
  function print_number (line 62) | int print_number(unsigned char *number, int N)
  function get_digits (line 75) | unsigned int get_digits(unsigned char *number)
  function main (line 83) | int main(int argc, char *argv[])

FILE: project_euler/problem_26/sol1.c
  function compare (line 19) | int compare(const void *a, const void *b)
  function main (line 25) | int main(int argc, char *argv[])

FILE: project_euler/problem_3/sol1.c
  function isprime (line 15) | char isprime(int no)
  function main (line 39) | int main()

FILE: project_euler/problem_3/sol2.c
  function main (line 14) | int main()

FILE: project_euler/problem_4/sol.c
  function is_palindromic (line 12) | int is_palindromic(unsigned int n)
  function main (line 25) | int main(void)

FILE: project_euler/problem_401/sol1.c
  function is_in (line 28) | char is_in(uint64_t N, uint64_t *D, uint64_t L)
  function get_divisors (line 47) | uint64_t get_divisors(uint64_t N, uint64_t *D)
  function sigma2 (line 93) | uint64_t sigma2(uint64_t N)
  function sigma (line 114) | uint64_t sigma(uint64_t N)
  function main (line 132) | int main(int argc, char **argv)

FILE: project_euler/problem_5/sol1.c
  function check_number (line 18) | static char check_number(unsigned long long n)
  function main (line 36) | int main(void)

FILE: project_euler/problem_5/sol2.c
  function check_number (line 30) | static int check_number(unsigned long long n)
  function main (line 48) | int main(void)

FILE: project_euler/problem_5/sol3.c
  function gcd (line 18) | unsigned long gcd(unsigned long a, unsigned long b)
  function lcm (line 41) | unsigned long lcm(unsigned long a, unsigned long b)
  function main (line 50) | int main(void)

FILE: project_euler/problem_6/sol.c
  function main (line 8) | int main(void)

FILE: project_euler/problem_7/sol.c
  function main (line 12) | int main(void)

FILE: project_euler/problem_7/sol2.c
  function main (line 11) | int main()

FILE: project_euler/problem_8/sol1.c
  function get_product (line 16) | long long int get_product(FILE *fp, long start_pos, int num_digits)
  function main (line 62) | int main(int argc, char *argv[])

FILE: project_euler/problem_8/sol2.c
  function main (line 11) | int main(int argc, char *argv[])

FILE: project_euler/problem_9/sol1.c
  function main (line 10) | int main(void)

FILE: project_euler/problem_9/sol2.c
  function main (line 23) | int main(void)

FILE: scripts/leetcode_directory_md.py
  class Task (line 11) | class Task:
  function fetch_leetcode_folder_tasks (line 20) | def fetch_leetcode_folder_tasks(solutions_folder: Path) -> list[Task]:
  function print_directory_md (line 65) | def print_directory_md(tasks_list: list[Task]) -> None:

FILE: searching/binary_search.c
  function binarysearch1 (line 21) | int binarysearch1(const int *arr, int l, int r, int x)
  function binarysearch2 (line 51) | int binarysearch2(const int *arr, int l, int r, int x)
  function test (line 75) | void test()
  function main (line 105) | int main(void)

FILE: searching/exponential_search.c
  function exponential_search (line 29) | int64_t exponential_search(const int64_t* arr, const uint16_t length, co...
  function binary_search (line 56) | int64_t binary_search(const int64_t* arr, const uint16_t l_index, const ...
  function main (line 72) | int main()
  function test (line 82) | static void test()

FILE: searching/fibonacci_search.c
  function fibMonaccianSearch (line 4) | int fibMonaccianSearch(int arr[], int x, int n)
  function main (line 65) | int main(void)

FILE: searching/floyd_cycle_detection_algorithm.c
  function duplicateNumber (line 25) | uint32_t duplicateNumber(const uint32_t *in_arr, size_t n)
  function test (line 49) | static void test()
  function main (line 64) | int main()

FILE: searching/interpolation_search.c
  function interpolationSearch (line 17) | int interpolationSearch(int arr[], int n, int key)
  function main (line 36) | int main()

FILE: searching/jump_search.c
  function jump_search (line 24) | int jump_search(const int *arr, int x, size_t n)
  function test (line 58) | void test()
  function main (line 81) | int main()

FILE: searching/linear_search.c
  function linearsearch (line 4) | int linearsearch(int *arr, int size, int val)
  function main (line 15) | int main()

FILE: searching/modified_binary_search.c
  function binarySearch (line 18) | int binarySearch(const int **mat, int i, int j_low, int j_high, int x)
  function modifiedBinarySearch (line 48) | void modifiedBinarySearch(const int **mat, int n, int m, int x)
  function main (line 97) | int main()

FILE: searching/other_binary_search.c
  function binarySearch (line 5) | int binarySearch(int array[], int leng, int searchX)
  function main (line 31) | int main(int argc, char *argv[])

FILE: searching/pattern_search/boyer_moore_search.c
  function max (line 6) | int max(int a, int b) { return (a > b) ? a : b; }
  function computeArray (line 8) | void computeArray(char *pattern, int size, int arr[NUM_OF_CHARS])
  function boyer_moore_search (line 17) | void boyer_moore_search(char *str, char *pattern)
  function main (line 41) | int main()

FILE: searching/pattern_search/naive_search.c
  function naive_search (line 5) | void naive_search(char *str, char *pattern)
  function main (line 23) | int main()

FILE: searching/pattern_search/rabin_karp_search.c
  function rabin_karp_search (line 7) | void rabin_karp_search(char *str, char *pattern, int d, int q)
  function main (line 49) | int main()

FILE: searching/sentinel_linear_search.c
  function sentinel_linear_search (line 36) | int sentinel_linear_search( int arr[], int len, int key ){
  function test (line 59) | static void test(){
  function main (line 76) | int main(){

FILE: searching/ternary_search.c
  function ternarySearch (line 5) | int ternarySearch(int l, int r, int key, int ar[])
  function main (line 50) | int main()

FILE: sorting/bead_sort.c
  function display (line 23) | void display(const int *arr, int n)
  function bead_sort (line 37) | void bead_sort(int *a, size_t len)
  function main (line 75) | int main(int argc, const char *argv[])

FILE: sorting/binary_insertion_sort.c
  function display (line 8) | void display(int *arr, int n)
  function binarySearch (line 18) | int binarySearch(int *arr, int key, int low, int high)
  function insertionSort (line 34) | void insertionSort(int *arr, int size)
  function main (line 55) | int main(int argc, const char *argv[])

FILE: sorting/bogo_sort.c
  function check_sorted (line 5) | bool check_sorted(int *a, int n)
  function shuffle (line 15) | void shuffle(int *a, int n)
  function sort (line 27) | void sort(int *a, int n)
  function main (line 32) | int main()

FILE: sorting/bubble_sort.c
  function display (line 17) | void display(const int *arr, int n)
  function swap (line 31) | void swap(int *first, int *second)
  function bubbleSort (line 43) | void bubbleSort(int *arr, int size)
  function test (line 70) | void test()
  function main (line 89) | int main(int argc, const char *argv[])

FILE: sorting/bubble_sort_2.c
  function bubble_sort (line 24) | void bubble_sort(int* array_sort)
  function test (line 58) | static void test() {
  function main (line 83) | int main()

FILE: sorting/bubble_sort_recursion.c
  function swap (line 17) | void swap(int *first, int *second)
  function bubbleSort (line 29) | void bubbleSort(int *arr, int size)
  function test (line 53) | void test()
  function main (line 72) | int main()

FILE: sorting/bucket_sort.c
  type Node (line 13) | struct Node
  type Node (line 20) | struct Node
  type Node (line 20) | struct Node
  type Node (line 22) | struct Node
  function BucketSort (line 25) | void BucketSort(int arr[])
  type Node (line 107) | struct Node
  type Node (line 107) | struct Node
  type Node (line 109) | struct Node
  type Node (line 121) | struct Node
  type Node (line 125) | struct Node
  type Node (line 144) | struct Node
  function getBucketIndex (line 162) | int getBucketIndex(int value) { return value / INTERVAL; }
  function print (line 164) | void print(int ar[])
  function printBuckets (line 174) | void printBuckets(struct Node *list)
  function main (line 184) | int main(void)

FILE: sorting/cocktail_sort.c
  function cocktailSort (line 7) | void cocktailSort(int arr[], int size)
  function main (line 46) | int main()

FILE: sorting/comb_sort.c
  function sort (line 5) | void sort(int *numbers, int size)
  function display (line 25) | void display(int *array, int n)
  function main (line 32) | int main()

FILE: sorting/counting_sort.c
  function main (line 12) | int main()

FILE: sorting/cycle_sort.c
  function display (line 6) | void display(int *arr, int n)
  function swap (line 18) | void swap(int *first, int *second)
  function cycleSort (line 26) | void cycleSort(int *arr, int n)
  function main (line 83) | int main()

FILE: sorting/gnome_sort.c
  function sort (line 4) | void sort(int *numbers, int size)
  function display (line 24) | void display(int *array, int n)
  function main (line 31) | int main()

FILE: sorting/heap_sort.c
  function max_heapify (line 7) | void max_heapify(int *a, int i, int n)
  function heapsort (line 30) | void heapsort(int *a, int n)
  function build_maxheap (line 42) | void build_maxheap(int *a, int n)
  function main (line 51) | int main()

FILE: sorting/heap_sort_2.c
  function swap (line 32) | void swap(int8_t *first, int8_t *second)
  function heapifyDown (line 48) | void heapifyDown(int8_t *arr, const uint8_t size)
  function heapifyUp (line 82) | void heapifyUp(int8_t *arr, uint8_t i)
  function heapSort (line 97) | void heapSort(int8_t *arr, const uint8_t size)
  function test (line 127) | static void test()
  function main (line 149) | int main()

FILE: sorting/insertion_sort.c
  function insertionSort (line 16) | void insertionSort(int *arr, int size)
  function test (line 36) | static void test()
  function main (line 53) | int main(int argc, const char *argv[])

FILE: sorting/insertion_sort_recursive.c
  function RecursionInsertionSort (line 20) | void RecursionInsertionSort(int *arr, int size)
  function test (line 44) | static void test()
  function main (line 65) | int main(int argc, const char *argv[])

FILE: sorting/merge_sort.c
  function swap (line 17) | void swap(int *a, int *b)
  function merge (line 33) | void merge(int *a, int l, int r, int n)
  function merge_sort (line 87) | void merge_sort(int *a, int n, int l, int r)
  function main (line 106) | int main(void)

FILE: sorting/merge_sort_nr.c
  function mergesort (line 19) | void mergesort(int x[], int n)
  function show (line 63) | void show(int x[], int n)
  function main (line 70) | int main()  // main function

FILE: sorting/multikey_quick_sort.c
  function vecswap (line 29) | void vecswap(int i, int j, int n, char *x[])
  function ssort1 (line 39) | void ssort1(char *x[], int n, int depth)
  function ssort1main (line 87) | void ssort1main(char *x[], int n) { ssort1(x, n, 0); }
  function vecswap2 (line 91) | void vecswap2(char **a, char **b, int n)
  function inssort (line 121) | void inssort(char **a, int n, int d)
  function ssort2 (line 136) | void ssort2(char **a, int n, int depth)
  function ssort2main (line 199) | void ssort2main(char **a, int n) { ssort2(a, n, 0); }
  type tnode (line 203) | struct tnode
  type Tnode (line 204) | typedef struct tnode
  function Tptr (line 213) | Tptr insert1(Tptr p, char *s)
  function cleanup1 (line 233) | void cleanup1(Tptr p)
  function insert2 (line 252) | void insert2(char *s)
  function cleanup2 (line 295) | void cleanup2()
  function search1 (line 303) | int search1(char *s)
  function search2 (line 323) | int search2(char *s)
  function pmsearch (line 352) | void pmsearch(Tptr p, char *s)
  function nearsearch (line 368) | void nearsearch(Tptr p, char *s, int d)
  function main (line 388) | int main(int argc, char *argv[])

FILE: sorting/odd_even_sort.c
  function swap (line 26) | void swap(int32_t *first, int32_t *second)
  function oddEvenSort (line 52) | void oddEvenSort(int *arr, int size)
  function test (line 90) | static void test()
  function main (line 116) | int main()

FILE: sorting/pancake_sort.c
  function flip (line 6) | void flip(int arr[], int i)
  function findMax (line 21) | int findMax(int arr[], int n)
  function pancakeSort (line 33) | void pancakeSort(int *arr, int n)
  function display (line 55) | void display(int arr[], int n)
  function main (line 68) | int main()

FILE: sorting/partition_sort.c
  function swap (line 4) | void swap(int *a, int *b)
  function partition (line 11) | int partition(int arr[], int low, int high)
  function partitionSort (line 38) | void partitionSort(int arr[], int low, int high)
  function printArray (line 48) | void printArray(int arr[], int n)
  function main (line 55) | int main()

FILE: sorting/patience_sort.c
  function patienceSort (line 22) | void patienceSort(int *array, int length) {
  function printArray (line 104) | void printArray(int *array,int length) {
  function testArray (line 120) | void testArray(int *array,int length) {
  function test (line 139) | static void test() {
  function main (line 157) | int main() {

FILE: sorting/pigeonhole_sort.c
  function pigeonholeSort (line 4) | void pigeonholeSort(int arr[], int size)
  function main (line 44) | int main()

FILE: sorting/quick_sort.c
  function display (line 5) | void display(int arr[], int n)
  function swap (line 17) | void swap(int *first, int *second)
  function partition (line 31) | int partition(int arr[], int lower, int upper)
  function quickSort (line 59) | void quickSort(int arr[], int lower, int upper)
  function main (line 74) | int main()

FILE: sorting/radix_sort.c
  function largest (line 3) | int largest(int a[], int n)
  function RadixSort (line 14) | void RadixSort(int a[], int n)
  function main (line 56) | int main()

FILE: sorting/radix_sort_2.c
  function MAX (line 8) | int MAX(int *ar, int size)
  function countSort (line 20) | void countSort(int *arr, int n, int place)
  function radixsort2 (line 50) | void radixsort2(int *arr, int n,
  function display (line 62) | void display(int *arr, int N)
  function main (line 68) | int main(int argc, const char *argv[])

FILE: sorting/random_quick_sort.c
  function getBig (line 13) | int getBig(int *a, int i, int right, int pivot)
  function getSmall (line 23) | int getSmall(int *a, int j, int left, int pivot)
  function swap (line 33) | void swap(int *a, int *b)
  function random_quick (line 40) | void random_quick(int *a, int left, int right)
  function main (line 81) | int main()

FILE: sorting/selection_sort.c
  function swap (line 16) | void swap(int *first, int *second)
  function selectionSort (line 28) | void selectionSort(int *arr, int size)
  function test (line 50) | static void test()
  function main (line 69) | int main(int argc, const char *argv[])

FILE: sorting/selection_sort_recursive.c
  function swap (line 19) | void swap(int8_t *first, int8_t *second)
  function findIndex (line 32) | uint8_t findIndex(const int8_t *arr, const uint8_t size)
  function selectionSort (line 56) | void selectionSort(int8_t *arr, const uint8_t size)
  function test (line 80) | static void test()
  function main (line 102) | int main()

FILE: sorting/shaker_sort.c
  function swap (line 4) | void swap(int *a, int *b)
  function shakersort (line 11) | void shakersort(int *a, int n)
  function main (line 28) | int main()

FILE: sorting/shell_sort.c
  function show_data (line 13) | void show_data(int arr[], int len)
  function swap (line 21) | void swap(int *a, int *b)
  function shellSort (line 30) | void shellSort(int array[], int len)
  function main (line 40) | int main(int argc, char *argv[])

FILE: sorting/shell_sort2.c
  function show_data (line 16) | void show_data(int *arr, long len)
  function swap (line 26) | inline void swap(int *a, int *b)
  function shell_sort (line 41) | void shell_sort(int *array, long LEN)
  function main (line 66) | int main(int argc, char *argv[])

FILE: sorting/stooge_sort.c
  function main (line 4) | int main()
  function stoogesort (line 21) | void stoogesort(int arr[], int i, int j)