MCPcopy Create free account

hub / github.com/OpenGenus/cosmos / functions

Functions8,543 in github.com/OpenGenus/cosmos

↓ 4 callersFunctioncbn_ary
code/algorithm_applications/src/Strassens algorithm/strassens algorithm.cpp:66
↓ 4 callersFunctioncheckIP
(ip string)
code/networking/src/validate_ip/ipv4_check.go:8
↓ 4 callersFunctioncheckIfAnagrams
(str1, str2)
code/string_algorithms/src/anagram_search/anagram_search.js:36
↓ 4 callersFunctionclear
code/data_structures/src/list/doubly_linked_list/menu_interface/doubly_link.c:173
↓ 4 callersMethodcloneReplaceLeft
code/data_structures/src/tree/binary_tree/treap/persistent_treap.kt:25
↓ 4 callersMethodcloneReplaceRight
code/data_structures/src/tree/binary_tree/treap/persistent_treap.kt:29
↓ 4 callersFunctioncountDigits
(n)
code/mathematical_algorithms/src/count_digits/count_digits.js:3
↓ 4 callersMethoddecodeString
(self, string: str)
code/online_challenges/src/leetcode/decode_string/encryption_string.py:16
↓ 4 callersFunctiondel1
code/online_challenges/src/codechef/MEETUP/MEETUP.cpp:81
↓ 4 callersFunctiondel2
code/online_challenges/src/codechef/MEETUP/MEETUP.cpp:90
↓ 4 callersMethoddequeue
code/data_structures/src/queue/queue/queue.rb:13
↓ 4 callersFunctiondeterminePrev
(arr, idx)
code/sorting/src/bead_sort/bead_sort.js:10
↓ 4 callersFunctiondf
derivate 3x² - 8x
code/mathematical_algorithms/src/newton_raphson_method/newton_raphson.php:13
↓ 4 callersFunctiondfs
code/graph_algorithms/src/cut_vertices/cut_vertices.cpp:23
↓ 4 callersFunctiondfs
(current, graph, visitFunc)
code/graph_algorithms/src/depth_first_search/depth_first_search.py:27
↓ 4 callersFunctiondimColour
Colour::LightGrey
test/c++/catch.hpp:10211
↓ 4 callersMethoddisplay
(self)
code/data_structures/src/queue/queue/queue.py:37
↓ 4 callersFunctiondist
* Returns square of the distance between the two Point class objects * @param p1: Object of class Point aka first Point * @param p2:
code/computational_geometry/src/chans_algorithm/chans_algorithm.cpp:56
↓ 4 callersFunctiondist
(p1, p2)
code/divide_conquer/src/closest_pair_of_points/closest_pair.py:7
↓ 4 callersFunctiondoubleTriangleArea
code/online_challenges/src/project_euler/problem_102/problem_102.cpp:11
↓ 4 callersFunctiondrawwindow
code/computational_geometry/src/cohen_sutherland_lineclip/cohen_sutherland_lineclip.c:66
↓ 4 callersFunctioneggDrop
code/dynamic_programming/src/egg_dropping_puzzle/egg_dropping_puzzle.c:13
↓ 4 callersMethodelement
()
code/data_structures/src/list/skip_list/skip_list.java:67
↓ 4 callersMethodempty
code/data_structures/src/tree/heap/soft_heap/soft_heap.cpp:72
↓ 4 callersMethodempty
code/operating_system/src/memory_management/partitioned_allocation/worst_fit.cpp:38
↓ 4 callersMethodempty
code/operating_system/src/memory_management/partitioned_allocation/next_fit.cpp:38
↓ 4 callersMethodempty
code/operating_system/src/memory_management/partitioned_allocation/first_fit.cpp:38
↓ 4 callersFunctionendsWith
test/c++/catch.hpp:8495
↓ 4 callersMethodenqueue
! \brief Insert element at the end of the queue. * \param value Value to be inserted. */
code/data_structures/src/queue/queue/queue.cpp:38
↓ 4 callersMethodequals
(Object o)
code/data_structures/src/tree/space_partitioning_tree/kd_tree/kd_tree.java:129
↓ 4 callersMethodfail
test/c++/catch.hpp:9192
↓ 4 callersFunctionfibonacci
Returns the nth term in the Fibonacci Sequence
code/mathematical_algorithms/src/fibonacci_number/fibonacci_number.go:6
↓ 4 callersFunctionfind
(vertice)
code/greedy_algorithms/src/kruskal_minimum_spanning_tree/kruskal.py:11
↓ 4 callersFunctionfind
A utility function to find set of an element i (uses path compression technique)
code/greedy_algorithms/src/kruskal_minimum_spanning_tree/kruskal.c:46
↓ 4 callersFunctionfind
code/data_structures/src/list/singly_linked_list/operations/find/find.c:20
↓ 4 callersMethodfind
(subset subsets[], int i)
code/graph_algorithms/src/kruskal_minimum_spanning_tree/kruskal_minimum_spanning_tree.java:46
↓ 4 callersMethodfind
(self, parent, i)
code/graph_algorithms/src/kruskal_minimum_spanning_tree/kruskal_minimum_spanning_tree.py:12
↓ 4 callersMethodfind
(int v)
code/data_structures/src/tree/multiway_tree/union_find/union_find.java:14
↓ 4 callersMethodfind
code/data_structures/src/tree/multiway_tree/red_black_tree/red_black_tree.cpp:232
↓ 4 callersMethodfind_parent
(self, v, set_map)
code/graph_algorithms/src/cycle_directed_graph/cycle_directed_graph.py:12
↓ 4 callersFunctionfindset
disjoint set
code/graph_algorithms/src/kruskal_minimum_spanning_tree/kruskal_minimum_spanning_tree.cpp:7
↓ 4 callersFunctionfindset
code/graph_algorithms/src/cycle_undirected_graph/cycle_undirected_graph_union_find.cpp:13
↓ 4 callersMethodfront_enqueue
(self, data)
code/data_structures/src/queue/double_ended_queue/double_ended_queue.py:11
↓ 4 callersFunctiongcd
code/online_challenges/src/codechef/GCD2/GCD2.c:4
↓ 4 callersFunctiongcd
(a, b)
code/mathematical_algorithms/src/gcd_and_lcm/gcd_and_lcm.js:1
↓ 4 callersMethodgetAt
(int idx)
code/data_structures/src/list/singly_linked_list/operations/unclassified/linked_list.java:56
↓ 4 callersMethodgetCurrentDistance
(T id)
code/graph_algorithms/src/dijkstra_shortest_path/dijkstra_shortest_path.java:101
↓ 4 callersFunctiongetCurrentNanosecondsSinceEpoch
test/c++/catch.hpp:9484
↓ 4 callersMethodgetElapsedSeconds
test/c++/catch.hpp:9526
↓ 4 callersMethodgetFirstLetter
()
code/algorithm_applications/src/Cichelli's Perfect Hashing Alogorithm/Key.java:38
↓ 4 callersMethodgetLastLetter
()
code/algorithm_applications/src/Cichelli's Perfect Hashing Alogorithm/Key.java:42
↓ 4 callersMethodgetNeighbors
()
code/graph_algorithms/src/dijkstra_shortest_path/dijkstra_shortest_path.java:33
↓ 4 callersMethodgetResultCapture
IContext
test/c++/catch.hpp:6127
↓ 4 callersMethodgetUnassignedLetterPosition
()
code/algorithm_applications/src/Cichelli's Perfect Hashing Alogorithm/Key.java:91
↓ 4 callersFunctionheight_tree
code/data_structures/src/tree/binary_tree/binary_tree/diameter/diameter.c:65
↓ 4 callersMethodinitialIndent
test/c++/catch.hpp:4538
↓ 4 callersFunctioninorder
code/data_structures/src/tree/binary_tree/avl_tree/avl_tree.c:188
↓ 4 callersFunctioninsert
function to insert a node into the treap performs simple BST insert and calls treap_insert_fixup
code/data_structures/src/tree/binary_tree/treap/treap.cpp:79
↓ 4 callersMethodinsert
# Inserts the given +data+ into the binary search tree. Params: +data+:: Data to insert into BST.
code/data_structures/src/tree/binary_tree/binary_tree/tree/tree.rb:71
↓ 4 callersMethodinsert
code/data_structures/src/tree/b_tree/b_tree/b_tree.cpp:122
↓ 4 callersMethodinsert_vertex
(self, vertex)
code/data_structures/src/graph/graph.py:5
↓ 4 callersFunctioninsertattail
Appending elements in the Linked List
code/data_structures/src/list/singly_linked_list/operations/delete/delete_node_without_head_linked_list.cpp:27
↓ 4 callersFunctioninvShiftRows
(stmt)
code/cryptography/src/aes_128/aes_128.py:1138
↓ 4 callersFunctioninvSubBytes
(stmt)
code/cryptography/src/aes_128/aes_128.py:1111
↓ 4 callersMethodinvert
(TreeSort node)
code/sorting/src/tree_sort/tree_sort.java:24
↓ 4 callersMethodisEmpty
code/data_structures/test/bag/test_bag.cpp:41
↓ 4 callersMethodisEmpty
()
code/data_structures/src/DoubleLinkedList/src_java/DoubleLinkedLists.java:8
↓ 4 callersMethodisEmpty
(self)
code/data_structures/src/stack/reverse_stack/reverse_stack.py:11
↓ 4 callersMethodisEmpty
Methods standard queue inherits from interface java.util.Collection
code/data_structures/src/queue/queue_using_stack/queue_using_stack.java:119
↓ 4 callersMethodisEmpty
()
code/data_structures/src/list/singly_linked_list/operations/unclassified/linked_list.java:22
↓ 4 callersFunctionisPalindrome
(str)
code/unclassified/src/palindrome/palindrome_check/palindrome_check.js:1
↓ 4 callersFunctionisWhitespace
test/c++/catch.hpp:4388
↓ 4 callersFunctionkaratsubaMultiply
code/mathematical_algorithms/src/karatsuba_multiplication/karatsuba_multiplication.cpp:57
↓ 4 callersMethodleftChild
(self, pos)
code/data_structures/src/maxHeap/maxheap.py:24
↓ 4 callersMethodleftChild
(self, pos)
code/data_structures/src/minHeap/minHeap.py:15
↓ 4 callersMethodleftChild
(int pos)
code/data_structures/src/tree/heap/min_heap/min_heap.java:44
↓ 4 callersFunctionleftmost
Function to find the leftmost node of a subtree
code/data_structures/src/tree/binary_tree/binary_tree/traversal/inorder/right_threaded/right_threaded.cpp:32
↓ 4 callersFunctionlength
code/data_structures/src/list/singly_linked_list/menu_interface/link.h:283
↓ 4 callersFunctionlist_to_string
(bit_list)
code/cryptography/src/sha/sha_256/sha_256.py:126
↓ 4 callersMethodlogin
()
code/design_pattern/src/OOP_patterns/proxy/protection/proxy/userproxy.java:17
↓ 4 callersFunctionlongest_palindrome
helper function
code/dynamic_programming/src/longest_palindromic_sequence/longest_palindromic_sequence.c:44
↓ 4 callersFunctionmax
utility function to get max
code/dynamic_programming/src/longest_palindromic_sequence/longest_palindromic_sequence.c:17
↓ 4 callersFunctionmin
code/search/src/exponential_search/exponential_search.c:3
↓ 4 callersFunctionmin
code/dynamic_programming/src/min_cost_path/min_cost_path.c:6
↓ 4 callersFunctionmyStrTok
code/unclassified/src/tokenizer/tokenizer.cpp:6
↓ 4 callersFunctionnaive_multi
code/divide_conquer/src/strassen_matrix_multiplication/main.cpp:138
↓ 4 callersMethodneighbors
(int r, int c)
code/backtracking/src/knight_tour/knight_tour.java:58
↓ 4 callersMethodnextDouble
()
code/languages/Java/Reduce_Time_complexity.java:88
↓ 4 callersFunctionnormalEqn
(X, y)
code/artificial_intelligence/src/linear_regression/linear_regression.js:24
↓ 4 callersFunctionnormalEqn
(X, y)
code/artificial_intelligence/src/linear_regression/linear_regression/linear_regression.js:24
↓ 4 callersMethodnormalizeAscii
($character)
code/cryptography/src/vigenere_cipher/vigenere_cipher.php:51
↓ 4 callersMethodoperation
()
code/design_pattern/src/OOP_patterns/decorator/decorator.ts:2
↓ 4 callersMethodparent
(self, pos)
code/data_structures/src/maxHeap/maxheap.py:17
↓ 4 callersMethodpartition
(Point A, Point B, Point P)
code/computational_geometry/src/quick_hull/quick_hull.java:48
↓ 4 callersFunctionperformOptionalSelector
test/c++/catch.hpp:504
↓ 4 callersFunctionpop
code/data_structures/src/stack/infix_to_postfix/infix_to_postfix.c:38
↓ 4 callersFunctionpop
code/data_structures/src/stack/infix_to_postfix/infix_to_postfix.cpp:38
↓ 4 callersFunctionpop
delete an element
code/data_structures/src/list/stack_using_linked_list/stack_using_linked_list.c:29
↓ 4 callersFunctionprint
printing the elements
code/data_structures/src/list/Queue_using_Linked_list/Queue_using_Linked_List.c:67
↓ 4 callersFunctionprint
printing the elements
code/data_structures/src/list/stack_using_linked_list/stack_using_linked_list.c:44
← previousnext →601–700 of 8,543, ranked by callers