Functions — github.com/OpenGenus/cosmos

CodeHub MCPcopy Create free account

hub / github.com/OpenGenus/cosmos / functions

Functions8,543 in github.com/OpenGenus/cosmos

⨍ Functions 8,543◇ Types & classes 1,606

↓ 675 callersFunctionlen

code/sorting/src/bubble_sort/bubble_sort_linked_list.cpp:16

↓ 665 callersFunctionrange

code/sorting/src/bead_sort/bead_sort.js:2

↓ 648 callersFunctionprint

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

↓ 626 callersMethodpush_back

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

↓ 505 callersMethodsize

@return the number of elements

code/data_structures/src/bag/bag.java:38

↓ 434 callersMethodbegin

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

↓ 388 callersMethodappend

add a value to the end

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

↓ 358 callersMethodend

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

↓ 295 callersMethodlength

code/computational_geometry/src/halfplane_intersection/halfplane_intersection.cpp:97

↓ 197 callersMethodget

code/data_structures/src/hashs/hash_table/hash_table.py:117

↓ 183 callersMethodcolor

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

↓ 180 callersMethodpush

(&mut self, elem: T)

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

↓ 176 callersFunctioninput

code/bit_manipulation/src/hamming_distance/hamming_distance.c:21

↓ 175 callersMethodleft

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

↓ 175 callersMethodparent

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

↓ 173 callersMethodadd

* Bag::add * This function adds an item to the bag. ******************************************************************************/

code/data_structures/src/bag/bag.cpp:38

↓ 165 callersMethodright

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

↓ 159 callersMethodnextInt

code/languages/Java/Reduce_Time_complexity.java:57

↓ 149 callersFunctionprint

code/languages/c/linear_search/linear_search_linked_list.c:34

↓ 140 callersMethodinsert

code/data_structures/src/maxHeap/maxHeap.cpp:45

↓ 128 callersFunctionprint

print the state in hexadecimal

code/cryptography/src/aes_128/aes_128.cpp:275

↓ 123 callersMethodempty

code/data_structures/src/queue/queue/queue.py:9

↓ 105 callersMethodformat

Formats the input stack string @param s It is a stack converted to string @return formatted input

code/data_structures/src/stack/infix_to_postfix/infix_to_postfix.java:83

↓ 105 callersMethodfront

code/data_structures/src/queue/queue/queue.rb:21

↓ 98 callersFunctionisSame

code/data_structures/test/tree/binary_tree/binary_tree/path_sum/test_path_sum_for_whole_paths.cpp:13

↓ 93 callersMethodsplit

Splitting the string into desired blocks

code/cryptography/src/des_cipher/des_java/Main.java:102

↓ 92 callersMethoddeserialize

Decodes your encoded data to tree.

code/data_structures/src/tree/binary_tree/binary_tree/serializer/serializer.cpp:85

↓ 89 callersMethodsize

test/c++/catch.hpp:8672

↓ 88 callersMethodpop

code/data_structures/src/stack/stack/stack.rs:16

↓ 81 callersMethodsize

code/sorting/src/heap_sort/heapsort.go:37

↓ 80 callersMethodput

(K key, V value)

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

↓ 79 callersFunctionabs

code/backtracking/src/n_queen/n_queen.go:24

↓ 79 callersMethodsize

code/artificial_intelligence/src/sat/togasat.cpp:164

↓ 78 callersMethodclear

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

↓ 75 callersMethodback

code/data_structures/src/queue/queue/queue.rb:25

↓ 69 callersFunctionprint

Functrion to pront a linked list */

code/data_structures/src/stack/reverse_stack/reverse_stack.c:151

↓ 67 callersMethodempty

test/c++/catch.hpp:5773

↓ 65 callersFunctionprint

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

↓ 62 callersMethodrbegin

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

↓ 62 callersMethodtop

code/data_structures/src/tree/heap/min_heap/min_heap.cpp:45

↓ 60 callersFunctionmake

code/artificial_intelligence/src/a_star/a_star.py:19

↓ 59 callersMethodsubstr

test/c++/catch.hpp:8649

↓ 57 callersFunctionmin

code/search/src/fibonacci_search/fibonacci_search.c:70

↓ 55 callersMethodtop

code/data_structures/src/queue/queue/queue.py:31

↓ 54 callersMethodparent

code/data_structures/src/tree/multiway_tree/splay_tree/splay_tree.cpp:191

↓ 54 callersFunctionsort

code/sorting/src/bogo_sort/bogo_sort.js:28

↓ 53 callersMethodrend

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

↓ 52 callersFunctionmax

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

↓ 52 callersMethodnew

code/data_structures/src/stack/stack/stack.rs:6

↓ 49 callersMethoderase

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

↓ 48 callersMethodoperator->

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

↓ 48 callersFunctionprint

code/divide_conquer/src/quick_hull/quick_hull.cpp:50

↓ 48 callersMethodtop

code/data_structures/src/stack/stack_using_queue/stack_using_queue.py:10

↓ 46 callersMethodpop_back

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

↓ 46 callersMethodpush

code/data_structures/src/tree/heap/min_heap/min_heap.rb:10

↓ 44 callersFunctioninput

code/mathematical_algorithms/src/replace_0_with_5/0_to_5_efficent.cpp:4

↓ 44 callersFunctionisSame

code/data_structures/test/list/test_list.cpp:83

↓ 44 callersMethodlen

code/data_structures/src/stack/stack/stack.rs:31

↓ 42 callersMethodnext

code/design_pattern/src/iterator_pattern/iterator.java:6

↓ 42 callersMethodprint

code/data_structures/src/maxHeap/maxHeap.cpp:61

↓ 41 callersFunctionappend

code/data_structures/src/list/singly_linked_list/operations/push/push.cpp:44

↓ 41 callersMethodtoString

code/divide_conquer/src/quick_sort/quicksort.java:8

↓ 39 callersMethodmin

code/data_structures/src/tree/heap/min_heap/min_heap.rb:30

↓ 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/data_structures/src/list/skip_list/skip_list.java:13

↓ 38 callersFunctionstringify

test/c++/catch.hpp:596

↓ 37 callersMethodmax

code/dynamic_programming/src/longest_common_subsequence/longest_common_subsequence.cs:27

↓ 36 callersMethodaddNeighbor

(Vertex neighbor, Integer cost)

code/graph_algorithms/src/dijkstra_shortest_path/dijkstra_shortest_path.java:57

↓ 36 callersMethodend

test/c++/catch.hpp:4545

↓ 36 callersMethodfind

code/data_structures/src/list/skip_list/skip_list.cpp:80

↓ 36 callersFunctionfindpred

code/data_structures/src/tree/van_emde_boas_tree/van_emde_boas_tree.cpp:263

↓ 36 callersFunctionpairing

code/string_algorithms/src/morse_code/morsecode.cpp:56

↓ 36 callersMethodsort

($input, $options = array())

code/sorting/src/tree_sort/tree_sort.php:8

↓ 34 callersFunctioncount

code/dynamic_programming/src/coin_change/coinchange.c:5

↓ 34 callersMethodpop

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

↓ 33 callersMethodaround

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

↓ 33 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/sorting/src/tree_sort/tree_sort.go:59

↓ 33 callersMethodinsert

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

↓ 33 callersFunctionsum

Part of Cosmos by OpenGenus Foundation

code/unclassified/src/average/average.rb:2

↓ 32 callersMethodclose

code/languages/Java/Reduce_Time_complexity.java:122

↓ 32 callersMethodcrbegin

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

↓ 32 callersMethodindex

test/c++/catch.hpp:9290

↓ 32 callersFunctionmove

* If tile borders empty space, moves tile and returns true, else * returns false. */

code/unclassified/src/fifteen_puzzle/fifteen.c:206

↓ 30 callersMethodleft

code/data_structures/src/tree/multiway_tree/splay_tree/splay_tree.cpp:148

↓ 30 callersMethodpreOrder

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

↓ 29 callersMethodconnected

code/data_structures/src/tree/multiway_tree/union_find/union_find.py:19

↓ 29 callersMethodcount

code/data_structures/src/tree/multiway_tree/union_find/union_find.py:42

↓ 29 callersFunctionmax

get the max of two no.s

code/data_structures/src/tree/binary_tree/binary_tree/diameter/diameter2.cpp:15

↓ 29 callersMethodreplace

(string number)

code/mathematical_algorithms/src/replace_0_with_5/replace_0_with_5.cs:7

↓ 29 callersMethodresize

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

↓ 28 callersMethodaddEdge

code/graph_algorithms/src/biconnected_components/biconnected_components.cpp:43

↓ 28 callersFunctiongetHeight

compute height of the tree

code/data_structures/src/tree/binary_tree/binary_tree/diameter/diameter2.cpp:37

↓ 28 callersFunctionprint

Part of Cosmos by OpenGenus Foundation

code/data_structures/src/queue/reverse_queue/reverse_queue.cpp:6

↓ 28 callersFunctionreverse

Below is the function that reverses the given stack using insertAtBottom()

code/data_structures/src/stack/reverse_stack/reverse_stack.c:64

↓ 28 callersMethodright

code/data_structures/src/tree/multiway_tree/splay_tree/splay_tree.cpp:158

↓ 27 callersMethodAdd

code/data_structures/src/hashs/bloom_filter/bloom_filter.go:13

↓ 27 callersFunctionLength

code/computational_geometry/src/sphere_tetrahedron_intersection/luvector.hpp:515

↓ 27 callersMethodequals

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

↓ 27 callersFunctionprint

code/unclassified/src/spiral_print/spiral_print.c:34

↓ 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/graph_algorithms/src/adjacency_lists_graph_representation/adjacency_lists_in_c/lgraph_struct.c:163

↓ 26 callersMethodbegin

test/c++/catch.hpp:4544

next →1–100 of 8,543, ranked by callers