MCPcopy Create free account

hub / github.com/OpenGenus/cosmos / functions

Functions8,543 in github.com/OpenGenus/cosmos

↓ 5 callersFunctionfind_optimal
code/data_structures/src/tree/multiway_tree/union_find/union_find.c:34
↓ 5 callersFunctionget
(key int)
code/data_structures/src/DoubleLinkedList/lru_cache_with_dll/src_go/main.go:78
↓ 5 callersMethodget
(long time)
code/data_structures/src/tree/space_partitioning_tree/interval_tree/interval_tree.java:271
↓ 5 callersMethodgetExpandedExpression
test/c++/catch.hpp:4269
↓ 5 callersMethodgetWeight
()
code/greedy_algorithms/src/fractional_knapsack/fractional_knapsack.java:86
↓ 5 callersMethodhasFilters
test/c++/catch.hpp:9385
↓ 5 callersFunctionheapify
(a, i)
code/data_structures/src/tree/heap/min_heap/min_heap.py:10
↓ 5 callersFunctioninsert
(root, nodeValue)
code/data_structures/src/binary_heap/binary_heap.py:29
↓ 5 callersFunctioninsert
code/data_structures/src/list/singly_linked_list/operations/delete/delete_nth_node.c:13
↓ 5 callersMethodinsert
Insert a record into the skiplist
code/data_structures/src/list/skip_list/skip_list.java:97
↓ 5 callersMethodinsert
(new_label string)
code/data_structures/src/list/singly_linked_list/singly_linked_list.go:10
↓ 5 callersMethodinsertAtLast
* Inserting new node in last */
code/data_structures/src/CircularLinkedList/circularLinkedList.cpp:77
↓ 5 callersFunctioninsertNode
code/languages/cpp/reverse_linked_list/reverse_linked_list_2pointers.cpp:15
↓ 5 callersFunctioninsertNode
code/languages/cpp/reverse_linked_list/reverse_linked_list_3pointers.cpp:12
↓ 5 callersFunctioninsertatbeg
(d, root)
code/data_structures/src/list/singly_linked_list/operations/print_reverse/print_reverse.py:18
↓ 5 callersFunctionisAnagram
(string1, string2)
code/string_algorithms/src/anagram_search/anagram_search.py:22
↓ 5 callersFunctionisAnagram
code/string_algorithms/src/anagram_search/anagram_search.cpp:32
↓ 5 callersFunctionisEmpty
code/data_structures/src/stack/infix_to_postfix/infix_to_postfix.c:30
↓ 5 callersFunctionisEmpty
code/data_structures/src/stack/infix_to_postfix/infix_to_postfix.cpp:30
↓ 5 callersMethodisEmpty
(self)
code/graph_algorithms/src/dijkstra_shortest_path/dijkstra_shortest_path_efficient.py:16
↓ 5 callersFunctionisPangram
(str: string)
code/string_algorithms/src/pangram_checker/pangram_checker.ts:3
↓ 5 callersFunctionis_rb_correct
code/data_structures/src/tree/multiway_tree/red_black_tree/red_black_tree.c:195
↓ 5 callersFunctionlist
test/c++/catch.hpp:7037
↓ 5 callersMethodmatch
test/c++/catch.hpp:7115
↓ 5 callersFunctionmatrixToText
(matrix)
code/cryptography/src/aes_128/aes_128.py:1601
↓ 5 callersFunctionmaximum
code/data_structures/src/tree/binary_tree/binary_tree/diameter/diameter.c:60
↓ 5 callersFunctionmerge
code/data_structures/src/tree/heap/priority_queue/leftist_tree/leftist_priority_queue.cpp:21
↓ 5 callersFunctionmin
code/artificial_intelligence/src/support_vector_machine/svm.c:464
↓ 5 callersFunctionmodC
modification cost
code/dynamic_programming/src/edit_distance/edit_distance_hirschberg.cpp:32
↓ 5 callersFunctionnewNode
for inserting a new node
code/data_structures/src/tree/binary_tree/binary_tree/count_universal_subtree/count_universal_subtrees.cpp:39
↓ 5 callersFunctionnewnode
code/graph_algorithms/src/left_view_binary_tree/left_view_binary_tree.cpp:11
↓ 5 callersMethodnotify
event: object
code/design_pattern/src/OOP_patterns/observer_pattern/observer_pattern.py:116
↓ 5 callersMethodpointUpdate
* @brief Point update in segment tree. Essentially performs `array[position] = value`. * * @param position Index to be updated
code/data_structures/src/tree/segment_tree/generic_segment_tree.cpp:75
↓ 5 callersMethodpreorder
code/data_structures/src/tree/heap/binomial_heap/binomial_heap.cpp:95
↓ 5 callersMethodprint
* Print stack elements * * @param Stack $stack * @return void */
code/data_structures/src/stack/stack/stack.php:69
↓ 5 callersMethodprintArray
(double[][] arr)
code/mathematical_algorithms/src/gaussian_elimination/gaussian_elimination.java:95
↓ 5 callersFunctionpush
code/data_structures/src/stack/postfix_evaluation/postfix_evaluation.c:47
↓ 5 callersMethodremoveFirst
()
code/data_structures/src/list/singly_linked_list/operations/unclassified/linked_list.java:142
↓ 5 callersFunctionremoveNonSignificantZeros
code/divide_conquer/src/karatsuba_multiplication/karatsubamultiply.cpp:98
↓ 5 callersMethodremoveSeperateCode
code/compression/src/lossless_compression/huffman/huffman.cpp:472
↓ 5 callersMethodreverse
(n)
code/mathematical_algorithms/src/reverse_number/reverse_number.rb:7
↓ 5 callersFunctionreverseFactorial
(target int)
code/mathematical_algorithms/src/reverse_factorial/reverse_factorial.go:17
↓ 5 callersMethodrngSeed
test/c++/catch.hpp:5847
↓ 5 callersFunctionrotate
* rrot = 1 (rrot = 0 is flipped) * * C B * / / \ * B => A C * / * A */
code/data_structures/src/tree/multiway_tree/red_black_tree/red_black_tree.c:48
↓ 5 callersFunctionsearch
code/data_structures/src/tree/tree/trie/trie.c:84
↓ 5 callersMethodsetNext
code/data_structures/src/list/singly_linked_list/singly_linked_list_with_classes.cpp:15
↓ 5 callersMethodshow
code/cellular_automaton/src/langtons_ant/langtons_ant.cpp:76
↓ 5 callersFunctionshuffle
code/sorting/src/bogo_sort/bogo_sort.c:31
↓ 5 callersMethodshuffle
(Integer[] arr)
code/sorting/src/bogo_sort/bogo_sort.java:32
↓ 5 callersMethodsplice
code/data_structures/src/list/xor_linked_list/xor_linked_list.cpp:812
↓ 5 callersMethodstart
test/c++/catch.hpp:9514
↓ 5 callersMethodstart
(self)
code/artificial_intelligence/src/minimax/minimax.py:334
↓ 5 callersFunctiontestSizeByTimes
(size, times)
code/search/test/test_search.py:58
↓ 5 callersFunctiontest_size_by_times
(size, times)
code/sorting/test/test_sort.py:77
↓ 5 callersMethodtoString
test/c++/catch.hpp:4010
↓ 5 callersMethodtoString
()
code/greedy_algorithms/src/hillclimber/hillclimber.java:65
↓ 5 callersFunctionto_terminal
(group)
code/artificial_intelligence/src/decision_tree/decision_tree.py:115
↓ 5 callersMethodtranslate
test/c++/catch.hpp:1787
↓ 5 callersFunctiontranspose
(matrix)
code/cryptography/src/aes_128/aes_128.py:1253
↓ 4 callersFunctionBTreeRoot
code/data_structures/src/tree/b_tree/b_tree/b_tree_c/btree.c:332
↓ 4 callersMethodBuildVehicle
()
code/design_pattern/src/builder_pattern/builder.cs:32
↓ 4 callersMethodContains
code/data_structures/src/hashs/bloom_filter/bloom_filter.cpp:23
↓ 4 callersFunctionCross
code/computational_geometry/src/sphere_tetrahedron_intersection/luvector.hpp:594
↓ 4 callersFunctionDISPLAY
code/data_structures/src/tree/heap/binomial_heap/binomial_heap.c:130
↓ 4 callersFunctionGCD
(a, b)
code/quantum_algorithms/shors_algorithm/P1_shor_primefactorization.py:312
↓ 4 callersMethodGetNode
(index int)
code/mathematical_algorithms/src/add_polynomials/add_polynomials.go:49
↓ 4 callersFunctionGetOracle
(x_val)
code/quantum_algorithms/grovers_algorithm/P1_grover_plot.py:26
↓ 4 callersFunctionLeftRotate
code/data_structures/src/tree/binary_tree/avl_tree/avl_tree.c:59
↓ 4 callersMethodLength
()
code/mathematical_algorithms/src/add_polynomials/add_polynomials.go:45
↓ 4 callersFunctionLineNormalL
code/computational_geometry/src/sphere_tetrahedron_intersection/luvector.hpp:776
↓ 4 callersFunctionPart_2
(pt,key,sbox1,sbox2)
code/cryptography/src/simple_des/sdes.py:66
↓ 4 callersFunctionProjLineL
code/computational_geometry/src/sphere_tetrahedron_intersection/luvector.hpp:746
↓ 4 callersMethodQuery
(ql int, qr int)
code/data_structures/src/tree/space_partitioning_tree/segment_tree/segment_tree_rmq.go:86
↓ 4 callersMethodQuery
(ql int, qr int)
code/data_structures/src/tree/space_partitioning_tree/segment_tree/segment_tree_sum.go:79
↓ 4 callersMethodReverse
()
code/data_structures/src/stack/reverse_stack/reverse_stack.go:44
↓ 4 callersFunctionRightRotate
code/data_structures/src/tree/binary_tree/avl_tree/avl_tree.c:45
↓ 4 callersMethod_down
(self, index, n)
code/data_structures/src/tree/heap/priority_queue/priority_queue.py:60
↓ 4 callersFunction_swap
code/sorting/src/intro_sort/intro_sort.cpp:73
↓ 4 callersMethodadd
(string value)
code/data_structures/src/hashs/hash_table/hash_table.cs:19
↓ 4 callersMethodaddChild
(self, side, node)
code/data_structures/src/tree/binary_tree/rope/rope.py:19
↓ 4 callersMethodaddElementEnd
2-Push back code
code/data_structures/src/list/singly_linked_list/operations/unclassified/linked_list_operations.cpp:48
↓ 4 callersMethodaddElementFirst
definition 1-Push front code
code/data_structures/src/list/singly_linked_list/operations/unclassified/linked_list_operations.cpp:38
↓ 4 callersMethodaddFirst
(int item)
code/data_structures/src/DoubleLinkedList/src_java/DoubleLinkedLists.java:11
↓ 4 callersMethodaddFirst
(self, data)
code/data_structures/src/list/doubly_linked_list/doubly_linked_list.py:14
↓ 4 callersMethodaddInterval
(Interval<Type> interval)
code/data_structures/src/tree/space_partitioning_tree/interval_tree/interval_tree.java:301
↓ 4 callersMethodaddNotification
(String notification)
code/design_pattern/src/OOP_patterns/observer_java/observer/network/artist.java:34
↓ 4 callersMethodadd_member
(self, member)
code/design_pattern/test/test_observer.py:15
↓ 4 callersFunctionadds
code/cryptography/src/huffman_encoding/huffman_encoding.c:27
↓ 4 callersMethodadjustString
test/c++/catch.hpp:7085
↓ 4 callersMethodall
test/c++/catch.hpp:6973
↓ 4 callersFunctionalloc_state_link
* Allocate a new state_link_t and return a pointer to it. */
code/string_algorithms/src/finite_automata/c/types.c:12
↓ 4 callersFunctionanagrams?
(first_word, second_word)
code/string_algorithms/src/anagram_search/anagram_search.rb:16
↓ 4 callersMethodapply
Calculates Jaccard Similarity of two set character sequence passed as input. @param left first character sequence @param right second character seque
code/unclassified/src/jaccard_similarity/jaccard.java:30
↓ 4 callersFunctionattach
Helper functions //
code/data_structures/src/DoubleLinkedList/lru_cache_with_dll/src_go/main.go:35
↓ 4 callersFunctionbl_add
code/data_structures/src/hashs/bloom_filter/bloom_filter.c:26
↓ 4 callersFunctionbl_contains
code/data_structures/src/hashs/bloom_filter/bloom_filter.c:32
↓ 4 callersFunctionbothOrAll
test/c++/catch.hpp:10213
↓ 4 callersFunctionbuild
code/data_structures/src/tree/space_partitioning_tree/segment_tree/segment_tree_rmq.cpp:16
↓ 4 callersFunctioncalculateFactorial
(i int)
code/mathematical_algorithms/src/factorial/factorial.go:8
↓ 4 callersFunctioncalculateLCM
(a, b int, integers ...int)
code/mathematical_algorithms/src/gcd_and_lcm/gcd_and_lcm.go:18
← previousnext →501–600 of 8,543, ranked by callers