MCPcopy Create free account

hub / github.com/OpenGenus/quark / functions

Functions5,611 in github.com/OpenGenus/quark

↓ 355 callersMethodbegin
code/code/data_structures/src/list/xor_linked_list/xor_linked_list.cpp:686
↓ 320 callersFunctionrange
(x)
code/code/sorting/src/bead_sort/bead_sort.js:2
↓ 315 callersMethodsize
@return the number of elements
code/code/data_structures/src/bag/bag.java:38
↓ 307 callersMethodend
code/code/data_structures/src/list/xor_linked_list/xor_linked_list.cpp:707
↓ 275 callersFunctiont
(t)
code/js/bootstrap.min.js:6
↓ 274 callersMethodpush_back
code/code/data_structures/src/list/xor_linked_list/xor_linked_list.cpp:631
↓ 250 callersMethodappend
add a value to the end
code/code/data_structures/src/list/singly_linked_list/singly_linked_list.cs:155
↓ 232 callersMethodpush
(&mut self, elem: T)
code/code/data_structures/src/stack/stack/stack.rs:12
↓ 231 callersFunctionprint
code/code/sorting/src/quick_sort/quick_sort.c:43
↓ 190 callersMethodreplace
code/code/data_structures/src/tree/multiway_tree/splay_tree/splay_tree.cpp:423
↓ 180 callersMethodlength
code/code/computational_geometry/src/halfplane_intersection/halfplane_intersection.cpp:70
↓ 170 callersMethodadd
(self, item)
code/code/data_structures/src/bag/bag.py:24
↓ 141 callersMethodsplit
(self, ind)
code/code/data_structures/src/tree/binary_tree/rope/rope.py:74
↓ 139 callersFunction$
(e,n,r)
code/js/jquery.js:5
↓ 133 callersMethodget
(K key)
code/code/data_structures/src/hashs/hash_table/hash_table.java:83
↓ 116 callersMethodtest
(self)
code/code/graph_algorithms/src/eulerian_path/eulerian.py:73
↓ 102 callersMethodempty
(self)
code/code/data_structures/src/queue/queue/queue.py:12
↓ 98 callersFunctionisSame
code/code/data_structures/test/tree/binary_tree/binary_tree/path_sum/test_path_sum_for_whole_paths.cpp:12
↓ 91 callersMethodtop
code/code/data_structures/src/tree/heap/min_heap/min_heap2.cpp:49
↓ 82 callersMethodinsert
(word)
code/code/data_structures/src/tree/tree/trie/trie.rb:2
↓ 81 callersMethodpop
(&mut self)
code/code/data_structures/src/stack/stack/stack.rs:16
↓ 80 callersFunctionprint
print the state in hexadecimal
code/code/cryptography/src/aes_128/aes_128.cpp:255
↓ 71 callersMethodparent
code/code/data_structures/src/tree/multiway_tree/red_black_tree/red_black_tree.cpp:72
↓ 65 callersFunctioninput
code/code/bit_manipulation/src/hamming_distance/hamming_distance.c:20
↓ 63 callersMethodcolor
code/code/data_structures/src/tree/multiway_tree/red_black_tree/red_black_tree.cpp:82
↓ 62 callersMethodformat
Formats the input stack string @param s It is a stack converted to string @return formatted input
code/code/data_structures/src/stack/infix_to_postfix/infix_to_postfix.java:83
↓ 59 callersMethodfront
code/code/data_structures/src/queue/queue/queue.rb:21
↓ 59 callersMethodleft
code/code/data_structures/src/tree/multiway_tree/red_black_tree/red_black_tree.cpp:34
↓ 59 callersMethodrbegin
code/code/data_structures/src/list/xor_linked_list/xor_linked_list.cpp:728
↓ 58 callersMethodback
code/code/data_structures/src/queue/queue/queue.rb:25
↓ 58 callersMethodparent
code/code/data_structures/src/tree/multiway_tree/splay_tree/splay_tree.cpp:180
↓ 57 callersFunctionaddRegexToken
(token, regex, strictRegex)
code/js/moment.js:667
↓ 55 callersFunctionprint
Functrion to pront a linked list */
code/code/data_structures/src/stack/reverse_stack/reverse_stack.c:151
↓ 54 callersMethodapply
Calculates Jaccard Similarity of two set character sequence passed as input. @param left first character sequence @param right second character seque
code/code/unclassified/src/jaccard_similarity/jaccard.java:30
↓ 53 callersMethodfind
code/code/data_structures/src/list/skip_list/skip_list.cpp:78
↓ 53 callersFunctionx
(e,t)
code/js/jquery.js:4
↓ 51 callersFunctionabs
(number int)
code/code/backtracking/src/n_queen/nqueen.go:24
↓ 51 callersMethodrend
code/code/data_structures/src/list/xor_linked_list/xor_linked_list.cpp:749
↓ 50 callersMethodforEach
Apply the given function to each value in the tree from left to right, i.e. from the lesser one to the greater one.
code/code/sorting/src/tree_sort/tree_sort.go:59
↓ 49 callersMethodnew
()
code/code/data_structures/src/stack/stack/stack.rs:6
↓ 49 callersMethodright
code/code/data_structures/src/tree/multiway_tree/red_black_tree/red_black_tree.cpp:44
↓ 49 callersMethodtoString
()
code/code/greedy_algorithms/src/hillclimber/Hillclimber.java:65
↓ 48 callersMethodoperator->
code/code/data_structures/src/list/xor_linked_list/xor_linked_list.cpp:105
↓ 48 callersMethodput
(K key, V value)
code/code/data_structures/src/hashs/hash_table/hash_table.java:47
↓ 46 callersFunctionaddFormatToken
(token, padded, ordinal, callback)
code/js/moment.js:562
↓ 46 callersMethodsort
(int[] a)
code/code/sorting/src/heap_sort/heap_sort.java:15
↓ 44 callersFunctionisSame
code/code/data_structures/test/list/test_list.cpp:82
↓ 43 callersMethodmax
(int a, int b)
code/code/data_structures/src/tree/binary_tree/avl_tree/avl_tree.java:28
↓ 42 callersMethodlen
(&self)
code/code/data_structures/src/stack/stack/stack.rs:31
↓ 40 callersFunctionmin
code/code/search/src/fibonacci_search/fibonacci_search.c:70
↓ 38 callersFunctiongetParsingFlags
(m)
code/js/moment.js:115
↓ 38 callersMethodrandom
Create a random number function from the standard Java Random class. Turn it into a uniformly distributed value within the range 0 to n-1
code/code/data_structures/src/list/skip_list/skip_list.java:13
↓ 37 callersMethodremoveChild
(self, side)
code/code/data_structures/src/tree/binary_tree/rope/rope.py:35
↓ 37 callersFunctiontoInt
(argumentForCoercion)
code/js/moment.js:268
↓ 36 callersMethodclear
code/code/data_structures/src/list/xor_linked_list/xor_linked_list.cpp:487
↓ 36 callersMethodupdate
updates the element at index idx by val
code/code/data_structures/src/tree/multiway_tree/fenwick_tree/fenwick_tree.cpp:28
↓ 35 callersMethodprint
* Print stack elements * * @param Stack $stack * @return void */
code/code/data_structures/src/stack/stack/stack.php:69
↓ 34 callersFunctionappend
code/code/data_structures/src/list/singly_linked_list/operations/push/push.cpp:39
↓ 34 callersMethodpop_back
code/code/data_structures/src/list/xor_linked_list/xor_linked_list.cpp:615
↓ 33 callersMethodpush
(value)
code/code/data_structures/src/tree/heap/min_heap/min_heap.rb:10
↓ 33 callersMethodsize
code/code/artificial_intelligence/src/SAT/togasat.cpp:123
↓ 32 callersMethodaround
code/code/data_structures/src/list/xor_linked_list/xor_linked_list.cpp:62
↓ 32 callersMethodcrbegin
code/code/data_structures/src/list/xor_linked_list/xor_linked_list.cpp:742
↓ 31 callersMethodconcat
(self, rope)
code/code/data_structures/src/tree/binary_tree/rope/rope.py:68
↓ 31 callersMethoderase
code/code/data_structures/src/list/xor_linked_list/xor_linked_list.cpp:522
↓ 31 callersMethodtrim
(String str,int n)
code/code/divide_conquer/src/karatsuba_multiplication/multiply.java:9
↓ 30 callersMethodleft
code/code/data_structures/src/tree/multiway_tree/splay_tree/splay_tree.cpp:143
↓ 30 callersMethodmin
code/code/data_structures/src/tree/heap/min_heap/min_heap.rb:30
↓ 30 callersMethodpreOrder
code/code/data_structures/src/tree/multiway_tree/red_black_tree/red_black_tree.cpp:243
↓ 30 callersMethodremove
()
code/code/data_structures/src/queue/queue/queue.java:35
↓ 28 callersMethodaddEdge
code/code/graph_algorithms/src/biconnected_components/biconnected_components.cpp:43
↓ 28 callersFunctiongetHeight
compute height of the tree
code/code/data_structures/src/tree/binary_tree/binary_tree/diameter/diameter2.cpp:34
↓ 28 callersFunctioninput
code/code/mathematical_algorithms/src/replace_0_with_5/0_to_5_efficent.cpp:4
↓ 28 callersMethodright
code/code/data_structures/src/tree/multiway_tree/splay_tree/splay_tree.cpp:151
↓ 28 callersFunctionsort
(arr)
code/code/sorting/src/bogo_sort/bogo_sort.js:26
↓ 27 callersMethodinsert
code/code/data_structures/src/tree/multiway_tree/red_black_tree/red_black_tree.cpp:164
↓ 26 callersFunctionLGraph_addDEdge
* Add a new directed edge to the graph, connecting src to dest. * * @graph The graph. * @src_ID ID of the source node. * @dest_ID ID of the dest n
code/code/graph_algorithms/src/adjacency_lists_graph_representation/adjacency_lists_in_C/lgraph_struct.c:163
↓ 26 callersMethodisSameTree
code/code/data_structures/src/tree/binary_tree/binary_tree/is_same/is_same.cpp:35
↓ 26 callersMethodshow
()
code/code/data_structures/src/hashs/hash_table/hash_table.cs:50
↓ 26 callersFunctionswap
A utility function to swap to integers
code/code/sorting/src/heap_sort/heap_sort.c:14
↓ 25 callersFunctionaddParseToken
(token, callback)
code/js/moment.js:694
↓ 25 callersMethodcontains
Checks if the bag contains a specific element @param element which you want to look for @return true if bag contains element, otherwise false
code/code/data_structures/src/bag/bag.java:59
↓ 25 callersFunctioncount
code/code/dynamic_programming/src/coin_change/coinchange.c:5
↓ 25 callersFunctionmove
* If tile borders empty space, moves tile and returns true, else * returns false. */
code/code/unclassified/src/fifteen_puzzle/fifteen.c:208
↓ 25 callersMethodvalue
code/code/data_structures/src/tree/multiway_tree/red_black_tree/red_black_tree.cpp:19
↓ 24 callersMethodcrend
code/code/data_structures/src/list/xor_linked_list/xor_linked_list.cpp:763
↓ 24 callersMethoddraw
(self, renderer)
code/code/artificial_intelligence/src/principal_component_analysis/pca.py:44
↓ 23 callersFunctionmax
code/code/mathematical_algorithms/src/2sum/2sum.c:8
↓ 23 callersMethodpop
code/code/data_structures/src/tree/heap/min_heap/min_heap.rb:17
↓ 22 callersFunctionp
(e)
code/js/popper.min.js:4
↓ 22 callersMethodprint
code/code/mathematical_algorithms/src/add_polynomials/add_polynomials.cpp:60
↓ 22 callersFunctionprintMatrix
(matrix)
code/code/cryptography/src/aes_128/AES_128.py:450
↓ 22 callersFunctionrememberURL
(url,baseuri,mimetype,charset)
code/content.js:922
↓ 21 callersFunctione
(e)
code/js/popper.min.js:4
↓ 21 callersFunctionhasOwnProp
(a, b)
code/js/moment.js:69
↓ 21 callersMethodnext
()
code/code/data_structures/src/bag/bag.java:96
↓ 21 callersFunctionprint
Prints tree
code/code/data_structures/src/tree/binary_tree/binary_tree/tree/tree.c:39
↓ 21 callersMethodprint
()
code/code/data_structures/src/tree/heap/min_heap/min_heap.java:160
↓ 21 callersMethodpush_front
code/code/data_structures/src/list/xor_linked_list/xor_linked_list.cpp:638
↓ 21 callersMethodsplice
code/code/data_structures/src/list/xor_linked_list/xor_linked_list.cpp:817
next →1–100 of 5,611, ranked by callers