Functions — github.com/OpenGenus/quark

CodeHub MCPcopy Create free account

hub / github.com/OpenGenus/quark / functions

Functions5,611 in github.com/OpenGenus/quark

⨍ Functions 5,611◇ Types & classes 781

↓ 4 callersFunctionie

code/js/popper.min.js:4

↓ 4 callersFunctioninorder

Inorder traversal

code/code/data_structures/src/tree/binary_tree/binary_tree/tree/tree.cpp:19

↓ 4 callersMethodinsert

# Inserts the given +data+ into the binary search tree. Params: +data+:: Data to insert into BST.

code/code/data_structures/src/tree/binary_tree/binary_tree/tree/tree.rb:71

↓ 4 callersMethodinsert

code/code/data_structures/src/tree/b_tree/b_tree/b_tree.cpp:115

↓ 4 callersFunctioninvShiftRows

code/code/cryptography/src/aes_128/AES_128.py:160

↓ 4 callersFunctioninvSubBytes

code/code/cryptography/src/aes_128/AES_128.py:137

↓ 4 callersFunctionir

code/js/jquery.js:6

↓ 4 callersFunctionisEmpty

code/code/data_structures/src/stack/postfix_evaluation/infix_to_postfix_evaluation.cpp:7

↓ 4 callersMethodisEmpty

code/code/data_structures/src/stack/reverse_stack/reverse_stack.py:11

↓ 4 callersMethodisEmpty

Methods standard queue inherits from interface java.util.Collection

code/code/data_structures/src/queue/queue_using_stack/queue_using_stack.java:119

↓ 4 callersMethodisEmpty

code/code/data_structures/src/list/singly_linked_list/operations/unclassified/LinkedList.java:22

↓ 4 callersFunctionisLeapYear

code/js/moment.js:780

↓ 4 callersFunctionk

code/js/jquery.js:6

↓ 4 callersMethodleftChild

code/code/data_structures/src/tree/heap/min_heap/min_heap.java:44

↓ 4 callersFunctionleftmost

Function to find the leftmost node of a subtree

code/code/data_structures/src/tree/binary_tree/binary_tree/traversal/inorder/right_threaded/right_threaded.cpp:29

↓ 4 callersFunctionm

code/js/popper.min.js:4

↓ 4 callersFunctionmax

code/code/string_algorithms/src/boyer_moore_algorithm/boyer_moore.c:7

↓ 4 callersFunctionmin

code/code/search/src/exponential_search/exponential_search.go:22

↓ 4 callersMethodmin

(int x, int y, int z)

code/code/dynamic_programming/src/min_cost_path/min_cost_path.java:33

↓ 4 callersFunctionmt

code/js/jquery.js:4

↓ 4 callersFunctionmyStrTok

code/code/unclassified/src/tokenizer/string_tokenizer.cpp:6

↓ 4 callersMethodneighbors

code/code/backtracking/src/knight_tour/knight_tour.java:58

↓ 4 callersFunctionnn

code/js/jquery.js:6

↓ 4 callersFunctionnormalEqn

code/code/artificial_intelligence/src/Linear_Regression/linearRegression.js:24

↓ 4 callersMethodnormalizeAscii

code/code/cryptography/src/vigenere_cipher/vigenere_cipher.php:51

↓ 4 callersFunctiono

code/highlight.pack.js:2

↓ 4 callersMethodpartition

(Point A, Point B, Point P)

code/code/computational_geometry/src/quickhull/quickHull.java:48

↓ 4 callersFunctionpe

code/js/popper.min.js:4

↓ 4 callersMethodpeek

code/code/data_structures/src/stack/infix_to_postfix/infix_to_postfix.py:15

↓ 4 callersMethodpoll

Retrieves and removes the head of this queue, or returns null if this queue is empty. This method differs from peek only in that it throws an exceptio

code/code/data_structures/src/queue/queue_using_stack/queue_using_stack.java:80

↓ 4 callersFunctionpop

code/code/data_structures/src/stack/infix_to_postfix/infix_to_postfix.c:38

↓ 4 callersFunctionpop

code/code/data_structures/src/stack/infix_to_postfix/infix_to_postfix.cpp:38

↓ 4 callersFunctionprint

code/code/sorting/src/bubble_sort/bubble_sort.c:41

↓ 4 callersFunctionprintList

A utility function to print a linked list*/

code/code/data_structures/src/list/singly_linked_list/operations/unclassified/union_intersection_in_list.c:85

↓ 4 callersFunctionprintheap

The function printheap() is used for printing the max heap The parameters are: 1. heap - the heap array */

code/code/data_structures/src/tree/heap/max_heap/max_heap.c:110

↓ 4 callersFunctionpt

code/js/jquery.js:4

↓ 4 callersFunctionpush

code/code/data_structures/src/list/singly_linked_list/singly_linked_list.cpp:16

↓ 4 callersFunctionpush

code/code/data_structures/src/list/singly_linked_list/operations/reverse/reverse_iteration.cpp:28

↓ 4 callersMethodpush

code/code/data_structures/src/stack/stack/stack.java:15

↓ 4 callersMethodpush

code/code/data_structures/src/list/circular_linked_list/circular_linked_list.py:17

↓ 4 callersMethodpush

code/code/data_structures/src/list/singly_linked_list/operations/find/SearchElement_list.java:15

↓ 4 callersMethodput

(Key key, Value value)

code/code/data_structures/src/tree/multiway_tree/splay_tree/splay_tree.java:37

↓ 4 callersMethodquery

code/code/data_structures/src/tree/multiway_tree/fenwick_tree/fenwick_tree.py:28

↓ 4 callersMethodread

code/code/dynamic_programming/src/Array_Median/median.py:64

↓ 4 callersMethodresize

code/code/data_structures/src/tree/heap/max_heap/max_heap.java:36

↓ 4 callersMethodrightChild

code/code/data_structures/src/tree/heap/min_heap/min_heap.java:54

↓ 4 callersFunctionsearch

Searches for an element in the tree

code/code/data_structures/src/tree/binary_tree/binary_tree/tree/tree.c:52

↓ 4 callersFunctionsetButtonAndMenuStates

code/background-save.js:296

↓ 4 callersMethodsetNextNode

(Node<T> nextNode)

code/code/data_structures/src/list/singly_linked_list/singly_linked_list.cs:48

↓ 4 callersFunctionshiftRows

code/code/cryptography/src/aes_128/AES_128.py:152

↓ 4 callersFunctionshow_image

code/images.js:4

↓ 4 callersMethodshuffle

(Integer[] arr)

code/code/sorting/src/bogo_sort/bogo_sort.java:32

↓ 4 callersMethodsibling

code/code/data_structures/src/tree/multiway_tree/red_black_tree/red_black_tree.cpp:580

↓ 4 callersMethodsize

code/code/data_structures/src/hashs/hash_table/hash_table.java:36

↓ 4 callersMethodsize

! \brief Get size of the queue. * \return Size of the queue. */

code/code/data_structures/src/queue/queue/queue.cpp:99

↓ 4 callersFunctionsortTable

code/js/sites.js:20

↓ 4 callersMethodsplay

(Node h, Key key)

code/code/data_structures/src/tree/multiway_tree/splay_tree/splay_tree.java:97

↓ 4 callersFunctionsplit

(node, max_depth, min_size, depth)

code/code/artificial_intelligence/src/decision_tree/decision_tree.py:117

↓ 4 callersFunctionsubBytes

code/code/cryptography/src/aes_128/AES_128.py:127

↓ 4 callersFunctionsum_of_digits

* Calculates sum of digits in number * * @param int $num number * @return int sum of digits in number */

code/code/mathematical_algorithms/src/sum_of_digits/sum_of_digits.php:13

↓ 4 callersFunctionswap

code/code/sorting/src/bubble_sort/bubble_sort.c:8

↓ 4 callersFunctionswap

code/code/sorting/src/circle_sort/circle_sort.c:6

↓ 4 callersFunctionswap

code/code/sorting/src/quick_sort/quick_sort.c:4

↓ 4 callersMethodswap

* @param array $input * @param int $fromIndex * @param int $toIndex * @return array */

code/code/sorting/src/shaker_sort/shaker_sort.php:47

↓ 4 callersFunctionturtle_pos

code/code/cellular_automaton/src/langtons_ant/LangtonAnt.py:9

↓ 4 callersMethodunion

code/code/data_structures/src/tree/multiway_tree/union_find/union_find.js:17

↓ 4 callersMethodunique

code/code/data_structures/src/list/xor_linked_list/xor_linked_list.cpp:861

↓ 4 callersMethodvisit

(TreeSort node)

code/code/sorting/src/tree_sort/tree_sort.java:50

↓ 4 callersFunctionxt

code/js/jquery.js:4

↓ 4 callersFunctionyt

code/js/jquery.js:4

↓ 3 callersMethodAlive

Check the cell is alive

code/code/cellular_automaton/src/conways_game_of_life/life.go:41

↓ 3 callersFunctionAllocBlock

* If the freeBlocks list isn't empty, takes the head of the list as a new block. * Else, it allocs a new block on the disk. */

code/code/data_structures/src/tree/b_tree/b_tree/b_tree_C/btree.c:301

↓ 3 callersMethodBuildTrie

(IEnumerable<string> words)

code/code/data_structures/src/tree/tree/trie/trie.cs:139

↓ 3 callersFunctionDecode

Decode returns the text content of a morse coded message.

code/code/string_algorithms/src/morse_code/morsecode.go:43

↓ 3 callersFunctionE

code/js/popper.min.js:4

↓ 3 callersMethodEmpty

code/code/data_structures/src/stack/stack/stack.go:24

↓ 3 callersMethodEmpty

code/code/data_structures/src/queue/queue/queue.go:24

↓ 3 callersFunctionEnqueue

(Queue, element)

code/code/data_structures/src/queue/queue_using_linked_list/queue_using_linked_list.py:10

↓ 3 callersMethodEnqueue

Adds an element to the back of the queue.

code/code/data_structures/src/queue/queue/queue.cs:45

↓ 3 callersMethodGet

code/code/data_structures/src/hashs/hash_table/hash_table.go:43

↓ 3 callersMethodHashFunction

code/code/data_structures/src/hashs/hash_table/hash_table.java:40

↓ 3 callersFunctionI

code/js/jquery.js:5

↓ 3 callersFunctionLL_rotation

LL rotation rooted at X

code/code/mathematical_algorithms/src/2sum/2sum.c:39

↓ 3 callersFunctionM

code/js/jquery.js:4

↓ 3 callersFunctionMAKE_bin_HEAP

code/code/data_structures/src/tree/heap/binomial_heap/binomial_heap.c:28

↓ 3 callersFunctionMG_set

* Sets M[i][j] to val. */

code/code/graph_algorithms/src/data_structures/adjacency_matrix_C/mgraph_struct.c:62

↓ 3 callersFunctionMin

code/code/data_structures/src/tree/space_partitioning_tree/segment_tree/segment_tree_rmq.go:16

↓ 3 callersFunctionN

code/js/popper.min.js:4

↓ 3 callersMethodNode

code/code/data_structures/src/list/doubly_linked_list/doubly_linked_list.java:18

↓ 3 callersFunctionNode_addDEdge

* Connect srcNode to dest_ID by a directed edge. * * @srcNode The source node. * @dest_ID ID of the dest node. * * @return 0 on success, -1 on fa

code/code/graph_algorithms/src/adjacency_lists_graph_representation/adjacency_lists_in_C/lgraph_struct.c:180

↓ 3 callersFunctionPartition

code/code/sorting/src/median_sort/median_sort.cpp:14

↓ 3 callersMethodPop

code/code/data_structures/src/stack/stack/stack.go:12

↓ 3 callersMethodPop

code/code/data_structures/src/queue/queue/queue.go:12

↓ 3 callersMethodPrint

code/code/data_structures/src/list/circular_linked_list/circular_linked_list.java:83

↓ 3 callersMethodPush

code/code/data_structures/src/stack/stack/stack.go:8

↓ 3 callersMethodPush

code/code/data_structures/src/queue/queue/queue.go:8

↓ 3 callersFunctionR

code/js/popper.min.js:4

↓ 3 callersFunctionRR_rotation

RR rotation rooted at X

code/code/mathematical_algorithms/src/2sum/2sum.c:50

↓ 3 callersFunctionReadBlock

code/code/data_structures/src/tree/b_tree/b_tree/b_tree_C/btree.c:285

↓ 3 callersMethodShow

code/code/mathematical_algorithms/src/add_polynomials/add_polynomials.go:35

← previous next →501–600 of 5,611, ranked by callers