MCPcopy Create free account

hub / github.com/OpenGenus/cosmos / functions

Functions8,543 in github.com/OpenGenus/cosmos

↓ 3 callersMethodarea
Return the area of the box
code/dynamic_programming/src/box_stacking/box_stacking.cpp:25
↓ 3 callersFunctionbinary_search
(arr, l, r, x)
code/search/src/binary_search/binary_search.rb:3
↓ 3 callersFunctionbitwiseRecursiveAddition
(n, m)
code/bit_manipulation/src/addition_using_bits/addition_using_bits.js:1
↓ 3 callersFunctionbnode_ins
* Inserts v in n and keeps the values sorted. * rc is the right child of the value (-1 if it hasn't). */
code/data_structures/src/tree/b_tree/b_tree/b_tree_c/btree.c:38
↓ 3 callersFunctionboardstring
(board, boardsize=boardsize)
code/backtracking/src/knight_tour/knight_tour.py:16
↓ 3 callersMethodbridge
(self)
code/graph_algorithms/src/bridges_in_graph/Count_bridges.py:56
↓ 3 callersFunctioncalculateGCD
(a, b int)
code/mathematical_algorithms/src/gcd_and_lcm/gcd_and_lcm.go:8
↓ 3 callersMethodcalculateHash
()
code/blockchain/Block.java:25
↓ 3 callersMethodcardinality
test/c++/catch.hpp:5136
↓ 3 callersMethodchangeTemperature
code/design_pattern/src/OOP_patterns/observer_pattern/observer_pattern.cpp:68
↓ 3 callersFunctioncheckAABBCollision
(a, b shape)
code/computational_geometry/src/axis_aligned_bounding_box_collision/axis_aligned_bounding_box_collision.go:18
↓ 3 callersFunctioncheckAABBCollision
code/computational_geometry/src/axis_aligned_bounding_box_collision/axis_aligned_bounding_box_collision.cpp:16
↓ 3 callersFunctioncheckLipogram
code/string_algorithms/src/lipogram_checker/lipogram_checker.js:10
↓ 3 callersFunctioncheckPalindrome
Checker */
code/string_algorithms/src/palindrome_checker/palindrome.php:6
↓ 3 callersMethodcheck_winner
(self)
code/artificial_intelligence/src/minimax/minimax.py:71
↓ 3 callersFunctioncleanup_tree
code/data_structures/src/tree/binary_tree/binary_tree/make_mirror_tree/make_mirror_tree.c:81
↓ 3 callersFunctionconstruct_and_insert
code/data_structures/test/tree/multiway_tree/red_black_tree/test_red_black.c:123
↓ 3 callersFunctioncontains
test/c++/catch.hpp:8501
↓ 3 callersMethodconvert
Converts infix expression to postfix @param infix infix expression to be converted @return postfix expression
code/data_structures/src/stack/infix_to_postfix/infix_to_postfix.java:39
↓ 3 callersFunctioncountDigits
(target int)
code/mathematical_algorithms/src/count_digits/count_digits.go:13
↓ 3 callersMethodcountDigits
(int n)
code/mathematical_algorithms/src/count_digits/count_digits.java:10
↓ 3 callersFunctioncountX
(tup, x)
code/languages/python/tuple/example.py:1
↓ 3 callersMethodcreateDimension
(int height, int side1, int side2)
code/dynamic_programming/src/box_stacking/box_stacking.java:89
↓ 3 callersFunctioncreateTree
Create a Tree by initializing its subtree to nil and setting it's value.
code/sorting/src/tree_sort/tree_sort.go:24
↓ 3 callersFunctioncreate_node
code/data_structures/src/tree/binary_tree/binary_tree/path_sum/sum_left/sum_left.c:11
↓ 3 callersFunctioncreate_node
code/data_structures/src/tree/binary_tree/binary_tree/minimum_height/minimum_height.c:10
↓ 3 callersFunctioncreate_node
code/data_structures/src/tree/binary_tree/binary_tree/diameter/diameter.c:18
↓ 3 callersFunctioncube
(n int)
code/mathematical_algorithms/src/armstrong_numbers/armstrong_numbers.go:26
↓ 3 callersMethodcurrentHashValue
()
code/blockchain/Block.java:17
↓ 3 callersFunctiondecimal_to_base
(N, base)
code/mathematical_algorithms/src/integer_conversion/decimal_to_any_base.js:23
↓ 3 callersMethoddecode
(String word)
code/cryptography/src/baconian_cipher/baconian_cipher.java:46
↓ 3 callersFunctiondequeue
deletion
code/data_structures/src/list/Queue_using_Linked_list/Queue_using_Linked_List.c:42
↓ 3 callersFunctiondetach
(block *node)
code/data_structures/src/DoubleLinkedList/lru_cache_with_dll/src_go/main.go:43
↓ 3 callersFunctiondfs
code/graph_algorithms/src/kuhn_maximum_matching/kuhn_maximum_matching.cpp:22
↓ 3 callersFunctiondisp_msg
* display a message and wait for escape key to continue *****************************************************************/
code/artificial_intelligence/src/image_processing/houghtransform/main.cpp:53
↓ 3 callersFunctiondisplay
code/cellular_automaton/src/conways_game_of_life/life.cpp:160
↓ 3 callersFunctiondisplay
code/data_structures/src/list/merge_two_sorted_lists/Merging_two_sorted.cpp:38
↓ 3 callersMethoddisplay
code/data_structures/src/stack/stack/stack.cpp:66
↓ 3 callersMethoddist
(Point p1, Point p2)
code/computational_geometry/src/graham_scan/graham_scan.java:16
↓ 3 callersFunctiondistance_2point
(x1, y1, x2, y2)
code/artificial_intelligence/src/isodata_clustering/isodata.py:5
↓ 3 callersMethoddoingIO
* Returns whether job is performing IO
code/operating_system/src/scheduling/multi_level_feedback_queue_scheduling/mlfq.ts:181
↓ 3 callersFunctiondrawline
code/computational_geometry/src/cohen_sutherland_lineclip/cohen_sutherland_lineclip.c:74
↓ 3 callersFunctioneggDrop
* Returns the minimum number of attempts * needed in the worst case for n eggs * and k floors. * Time complexity: O(n*k^2) */
code/dynamic_programming/src/egg_dropping_puzzle/egg_dropping_puzzle.cpp:19
↓ 3 callersFunctionencrypt
(s, e, n)
code/cryptography/src/rsa/rsa.py:19
↓ 3 callersMethodend
code/data_structures/src/hashs/hash_table/hash_table.cpp:123
↓ 3 callersFunctionenqueue
insertion
code/data_structures/src/list/Queue_using_Linked_list/Queue_using_Linked_List.c:14
↓ 3 callersMethodenqueue
(self, x)
code/data_structures/src/queue/reverse_queue/reverse_queue.py:10
↓ 3 callersFunctionenqueue_arriving_processes
* Check to see if new arriving processes must be enqueued. */
code/operating_system/src/scheduling/round_robin_scheduling/round_robin_c/round_robin.c:217
↓ 3 callersMethoderase
code/data_structures/src/tree/binary_tree/aa_tree/aa_tree.cpp:326
↓ 3 callersMethodeval
(int[] state)
code/cellular_automaton/src/genetic_algorithm/genetic_algorithm.java:131
↓ 3 callersFunctionevalua_poblacion
(poblacion, solucion)
code/cellular_automaton/src/genetic_algorithm/genetic_algorithm2.py:39
↓ 3 callersFunctionevaluate
evaluate p(x) in linear time
code/mathematical_algorithms/src/horner_polynomial_evaluation/horner_polynomial_evaluation.cpp:11
↓ 3 callersMethodexch
(int i,int j)
code/data_structures/src/tree/heap/max_heap/max_heap.java:77
↓ 3 callersMethodexecuteOnetoAll
(T src)
code/graph_algorithms/src/dijkstra_shortest_path/dijkstra_shortest_path.java:126
↓ 3 callersMethodexecuteOnetoOne
(T src, T goal)
code/graph_algorithms/src/dijkstra_shortest_path/dijkstra_shortest_path.java:174
↓ 3 callersFunctionexit_monitor
* Ask to leave the monitor. * Note that while leaving a monitor, pending processes on signal take precedence * over processes that asked to enter th
code/operating_system/src/concurrency/monitors/monitors_system_v/monitors.c:125
↓ 3 callersFunctionexponentialSearch
Part of Cosmos by OpenGenus Foundation
code/search/src/exponential_search/exponential_search.go:30
↓ 3 callersFunctionextractMin
code/greedy_algorithms/src/huffman_coding/huffman_coding.c:75
↓ 3 callersFunctionf
code/numerical_analysis/integral/src/integral_trapezoid.c:29
↓ 3 callersMethodfact
(long n)
code/mathematical_algorithms/src/catalan_number/catalan_number.java:22
↓ 3 callersMethodfactorial
code/mathematical_algorithms/src/factorial/factorial.kt:19
↓ 3 callersFunctionfilterTests
test/c++/catch.hpp:8985
↓ 3 callersFunctionfind
returns the representative (his input array index) of the set that includes x
code/data_structures/src/tree/multiway_tree/union_find/union_find.c:29
↓ 3 callersMethodfind
@author Kanakalatha Vemuru (https://github.com/KanakalathaVemuru) @param array is a sorted array where the element has to be searched @param key is an
code/search/src/fibonacci_search/fibonacci_search.java:19
↓ 3 callersMethodfind
Returns the first index at which the element is found Returns -1 if not found Takes O(n) time
code/data_structures/src/list/singly_linked_list/operations/find/find.py:53
↓ 3 callersFunctionfindAns
code/divide_conquer/src/search_in_a_rotated_array/search_in_a_rotated_array.cpp:32
↓ 3 callersFunctionfindBiggestSuffix
(first, second)
code/unclassified/src/biggest_suffix/biggest_suffix.js:25
↓ 3 callersFunctionfindMax
Function to query the Segment tree and return the value for a given range
code/dynamic_programming/src/longest_increasing_subsequence/longest_increasing_subsequence_using_segment_tree.cpp:46
↓ 3 callersFunctionfindSide
Returns the side of point p with respect to line joining points p1 and p2.
code/computational_geometry/src/quick_hull/quick_hull2.cpp:15
↓ 3 callersFunctionfindSide
code/divide_conquer/src/quick_hull/quick_hull.cpp:6
↓ 3 callersFunctionfinder
returns the corresponding code for both alphabet and numbers & vice versa
code/string_algorithms/src/morse_code/morsecode.cpp:61
↓ 3 callersFunctionfitness
For each gene in the DNA, this function calculates the difference between it and the character in the same position in the OPTIMAL string. These
code/cellular_automaton/src/genetic_algorithm/genetic_algorithm.py:62
↓ 3 callersMethodfitness
calculate the current fitness when getting the route as an array of integers, which city to visit first @param route array of integers, current route
code/greedy_algorithms/src/hillclimber/hillclimber.java:36
↓ 3 callersMethodforward_pass
(self, inputs)
code/artificial_intelligence/src/neural_network/neural_network.py:39
↓ 3 callersMethodfront
code/data_structures/src/queue/queue_using_linked_list/queue_using_linked_list.rb:36
↓ 3 callersMethodfront
(self)
code/data_structures/src/queue/reverse_queue/reverse_queue.py:24
↓ 3 callersMethodfull
(self)
code/data_structures/src/queue/queue/queue.py:12
↓ 3 callersFunctiongNode_ID
code/graph_algorithms/src/adjacency_lists_graph_representation/adjacency_lists_in_c/lgraph_struct.c:13
↓ 3 callersMethodgcd
code/cryptography/src/affine_cipher/affinekotlin.kt:173
↓ 3 callersMethodgetAllDistances
()
code/graph_algorithms/src/dijkstra_shortest_path/dijkstra_shortest_path.java:148
↓ 3 callersFunctiongetBiggerSize
code/divide_conquer/src/karatsuba_multiplication/karatsubamultiply.cpp:35
↓ 3 callersMethodgetCellIndex
(int cell)
code/cellular_automaton/src/elementary_cellular_automata/elementarycellularautomaton.java:58
↓ 3 callersMethodgetData
()
code/data_structures/src/tree/space_partitioning_tree/interval_tree/interval_tree.java:44
↓ 3 callersFunctiongetFitness
(target, candidate string)
code/cellular_automaton/src/genetic_algorithm/genetic_algorithm.go:75
↓ 3 callersMethodgetInstance
()
code/design_pattern/src/singleton_pattern/singleton_pattern.js:8
↓ 3 callersMethodgetKeyWord
()
code/algorithm_applications/src/Cichelli's Perfect Hashing Alogorithm/Key.java:34
↓ 3 callersFunctiongetMid
A utility function to get the middle index from corner indexes.
code/data_structures/src/tree/segment_tree/segment_tree.c:6
↓ 3 callersMethodgetMid
(int s, int e)
code/data_structures/src/tree/space_partitioning_tree/segment_tree/segment_tree.java:21
↓ 3 callersMethodgetSize
()
code/data_structures/src/queue/queue/queue.java:63
↓ 3 callersMethodgetSize
()
code/divide_conquer/src/merge_sort_using_divide_and_conquer/merge_sort_using_divide_and_conquer.java:24
↓ 3 callersMethodgetTestMacroName
test/c++/catch.hpp:4283
↓ 3 callersMethodget_data
(self)
code/data_structures/src/list/singly_linked_list/singly_linked_list.py:7
↓ 3 callersMethodget_key
(&self)
code/data_structures/src/hashs/hash_table/hash_table.rs:104
↓ 3 callersFunctionget_split
(dataset)
code/artificial_intelligence/src/decision_tree/decision_tree.py:102
↓ 3 callersMethodget_value
(self)
code/data_structures/src/hashs/hash_table/hash_table.py:31
↓ 3 callersFunctiongetnode
code/cryptography/src/huffman_encoding/huffman_encoding.c:14
↓ 3 callersFunctiongreatestDigit
(num)
code/mathematical_algorithms/src/greatest_digit_in_number/greatest_digit_in_number.js:1
↓ 3 callersFunctionhashCode
code/data_structures/src/hashs/hash_table/hash_table.c:17
↓ 3 callersMethodhexToBinary
code/compression/src/lossless_compression/huffman/huffman.cpp:531
↓ 3 callersMethodincludeSuccessfulResults
test/c++/catch.hpp:5843
← previousnext →801–900 of 8,543, ranked by callers