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

↓ 3 callersFunctioninsert

code/data_structures/src/tree/binary_tree/binary_tree/balance_binary_tree/balance_bst_dsw.cpp:21

↓ 3 callersMethodinsert

code/data_structures/src/tree/binary_tree/binary_tree/tree/tree.py:33

↓ 3 callersMethodinsertHead

code/data_structures/src/list/singly_linked_list/singly_linked_list.java:11

↓ 3 callersFunctioninside

code/computational_geometry/src/sutherland_hodgeman_clipping/sutherland_hodgeman_clipping.cpp:125

↓ 3 callersFunctioninterpolationSearchLooping

code/search/src/interpolation_search/interpolation_search.js:29

↓ 3 callersFunctioninterpolationSearchRecursion

( arr, value, low = 0, high = arr.length - 1 )

code/search/src/interpolation_search/interpolation_search.js:2

↓ 3 callersMethodintersect

Check if 2 boxes intersect. 3D collision detection. https://developer.mozilla.org/en-US/docs/Games/Techniques/3D_collision_de

code/data_structures/src/tree/space_partitioning_tree/oc_tree/oc_tree.py:80

↓ 3 callersFunctionisEmpty

code/data_structures/src/queue/queue_using_stack/queue_using_stack.c:35

↓ 3 callersMethodisEmpty

* Checks if the stack is empty * * @return bool true if is empty, false otherwise */

code/data_structures/src/stack/stack/stack.php:55

↓ 3 callersMethodisEmpty

code/data_structures/src/stack/stack/stack.java:44

↓ 3 callersMethodisEmpty

code/data_structures/src/stack/abstract_stack/cpp/array_stack/array_stack.h:132

↓ 3 callersFunctionisPalindromeIterative

code/string_algorithms/src/palindrome_checker/palindrome.c:7

↓ 3 callersFunctionisPalindromeIterative

code/string_algorithms/src/palindrome_checker/palindrome.py:13

↓ 3 callersFunctionisPalindromeIterative

code/string_algorithms/src/palindrome_checker/palindrome.cpp:22

↓ 3 callersFunctionisPalindromeRecursive

code/string_algorithms/src/palindrome_checker/palindrome.py:1

↓ 3 callersFunctionisPalindromeRecursive

Part of Cosmos by OpenGenus Foundation

code/string_algorithms/src/palindrome_checker/palindrome.cpp:7

↓ 3 callersFunctionisPalindromeReverse

code/string_algorithms/src/palindrome_checker/palindrome.py:9

↓ 3 callersFunctionisPalindromeReverse

code/string_algorithms/src/palindrome_checker/palindrome.cpp:17

↓ 3 callersMethodisSectionTracker

test/c++/catch.hpp:9153

↓ 3 callersFunctionisSquare

code/mathematical_algorithms/src/check_is_square/check_is_square.go:7

↓ 3 callersMethodisWord

code/data_structures/src/tree/tree/trie/trie.js:32

↓ 3 callersMethodis_cyclic

code/graph_algorithms/src/cycle_directed_graph/cycle_directed_graph.py:20

↓ 3 callersFunctionis_palindrome_recursive

code/string_algorithms/src/palindrome_checker/palindrome.c:17

↓ 3 callersFunctionis_pandigital

code/mathematical_algorithms/src/pandigital_number/pandigital_number.rb:1

↓ 3 callersFunctionis_safe

code/backtracking/src/knight_tour/knight_tour_withoutbt.c:21

↓ 3 callersFunctionis_zeroless_pandigital

code/mathematical_algorithms/src/pandigital_number/pandigital_number.rb:12

↓ 3 callersFunctionknapSack

code/dynamic_programming/src/knapsack/Knapsack_DP_all3tech.cpp:5

↓ 3 callersFunctionlength

code/data_structures/src/list/doubly_linked_list/menu_interface/dlink.h:336

↓ 3 callersMethodless

code/data_structures/src/tree/heap/max_heap/max_heap.java:73

↓ 3 callersFunctionlinearKernel

code/artificial_intelligence/src/support_vector_machine/svm.c:402

↓ 3 callersFunctionlongest_palindrome

Find the maximum length of a palindrome subsequence Dynamic Programming approach on solving the longest palindromic sequence. Time complexit

code/dynamic_programming/src/longest_palindromic_sequence/longest_palindromic_sequence.py:4

↓ 3 callersFunctionlongest_palindrome

helper function

code/dynamic_programming/src/longest_palindromic_sequence/longest_palindromic_sequence.cpp:40

↓ 3 callersFunctionlow

code/data_structures/src/tree/multiway_tree/van_emde_boas_tree/van_emde_boas.cpp:19

↓ 3 callersFunctionlower_bound

* Return the first element in v * that is greater than or equal * to x in O(log n). */

code/dynamic_programming/src/longest_bitonic_sequence/longest_bitonic_sequence.c:17

↓ 3 callersMethodmakeNode

code/data_structures/src/tree/binary_tree/binary_tree/tree/tree2.java:75

↓ 3 callersFunctionmakeRatio

test/c++/catch.hpp:10507

↓ 3 callersMethodmatches

test/c++/catch.hpp:9362

↓ 3 callersFunctionmax

code/data_structures/src/tree/binary_tree/binary_tree/tree/tree.go:47

↓ 3 callersFunctionmax

code/divide_conquer/src/maximum_contiguous_subsequence_sum/maximum_contiguous_subsequence_sum.c:3

↓ 3 callersMethodmaximum

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

↓ 3 callersMethodmerge_sort

(int left,int right)

code/divide_conquer/src/merge_sort_using_divide_and_conquer/merge_sort_using_divide_and_conquer.java:50

↓ 3 callersFunctionmin

Utility function to find a minimum of two numbers

code/dynamic_programming/src/assembly_line_scheduling/assembly_line_scheduling.cpp:10

↓ 3 callersFunctionmin

code/dynamic_programming/src/matrix_chain_multiplication/matrix_chain_multiplication.c:52

↓ 3 callersMethodminHeapify

code/randomized_algorithms/src/kth_smallest_element_algorithm/kth_smallest_element.java:51

↓ 3 callersFunctionminSkips

(self, A, s, target)

code/dynamic_programming/src/min_rests_skipped_to_reach_on_time/Minimum Skips to Arrive at Meeting On Time.py:1

↓ 3 callersMethodminimum

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

↓ 3 callersMethodmove

code/artificial_intelligence/src/minimax/minimax.py:33

↓ 3 callersMethodmultiply

c[k] = sum_{i=0}^k a[i] b[k-i]

code/mathematical_algorithms/src/multiply_polynomial/multiply_polynomial.cpp:139

↓ 3 callersMethodmutate

code/cellular_automaton/src/genetic_algorithm/genetic_algorithm.java:110

↓ 3 callersFunctionnewnode

Function to create a new node with value d

code/data_structures/src/tree/binary_tree/binary_tree/traversal/inorder/right_threaded/right_threaded.cpp:21

↓ 3 callersMethodoptimize

code/cellular_automaton/src/genetic_algorithm/genetic_algorithm.java:155

↓ 3 callersFunctionorientation

code/computational_geometry/src/graham_scan/graham_scan.py:10

↓ 3 callersFunctionorientation

To find orientation of ordered triplet (p, q, r). The function returns following values 0 --> p, q and r are colinear 1 --> Clockwise 2 --> Counterclo

code/computational_geometry/src/graham_scan/graham_scan2.cpp:47

↓ 3 callersFunctionpanLipogramChecker

code/string_algorithms/src/lipogram_checker/lipogram_checker.cpp:7

↓ 3 callersFunctionpancakeSort

code/sorting/src/pancake_sort/pancake_sort.cpp:6

↓ 3 callersMethodpar

code/graph_algorithms/src/dijkstra_shortest_path/dijkstra_shortest_path_efficient.py:56

↓ 3 callersMethodparent

code/data_structures/src/minHeap/minHeap.py:12

↓ 3 callersMethodparent

code/data_structures/src/tree/heap/min_heap/min_heap.java:34

↓ 3 callersFunctionparseSpecialTag

test/c++/catch.hpp:8790

↓ 3 callersFunctionpeek

code/data_structures/src/stack/infix_to_postfix/infix_to_postfix.c:34

↓ 3 callersFunctionpeek

code/data_structures/src/stack/infix_to_postfix/infix_to_postfix.cpp:34

↓ 3 callersMethodpeek

code/data_structures/src/stack/abstract_stack/cpp/array_stack/array_stack.h:124

↓ 3 callersFunctionpop

code/data_structures/src/stack/postfix_evaluation/postfix_evaluation.c:40

↓ 3 callersFunctionpop

code/data_structures/src/stack/balanced_expression/balanced_expression.c:28

↓ 3 callersFunctionpop

code/data_structures/src/stack/stack/stack.c:52

↓ 3 callersFunctionpop

code/data_structures/src/queue/queue_using_stack/queue_using_stack.c:48

↓ 3 callersMethodpop

* Removes an item from the stack * * @return void */

code/data_structures/src/stack/stack/stack.php:22

↓ 3 callersMethodpop

code/data_structures/src/stack/sort_stack/sort_stack.py:15

↓ 3 callersMethodpop

code/operating_system/src/memory_management/partitioned_allocation/worst_fit.cpp:29

↓ 3 callersMethodpop

code/operating_system/src/memory_management/partitioned_allocation/next_fit.cpp:29

↓ 3 callersMethodpop

code/operating_system/src/memory_management/partitioned_allocation/first_fit.cpp:29

↓ 3 callersFunctionpower

Part of Cosmos by OpenGenus Foundation

code/mathematical_algorithms/src/exponentiation_power/exponentiation_power.c:3

↓ 3 callersMethodpower

(long a, long b, long mod)

code/mathematical_algorithms/src/fermats_little_theorem/fermats_little_theorem.java:4

↓ 3 callersFunctionpredict

code/artificial_intelligence/src/perceptron/perceptron.py:2

↓ 3 callersMethodprice

code/greedy_algorithms/src/fractional_knapsack/fractional_knapsack.go:34

↓ 3 callersFunctionprime

code/cryptography/src/rsa/rsa.c:23

↓ 3 callersFunctionprimeFactors

code/mathematical_algorithms/src/prime_numbers_of_n/prime_numbers_of_n.js:1

↓ 3 callersFunctionprint

code/data_structures/src/list/doubly_linked_list/menu_interface/doubly_link.c:55

↓ 3 callersFunctionprint

code/data_structures/src/list/singly_linked_list/menu_interface/singly_list.c:48

↓ 3 callersMethodprint

code/data_structures/src/list/doubly_linked_list/doubly_linked_list.cpp:128

↓ 3 callersMethodprintGraph

code/data_structures/src/graph/graph.py:36

↓ 3 callersFunctionprintVector

code/sorting/src/pancake_sort/pancake_sort.cpp:22

↓ 3 callersFunctionprint_group_stats

scripts/stats.py:113

↓ 3 callersMethodpropagate

(self, fromRegister=None)

code/quantum_algorithms/shors_algorithm/P1_shor_primefactorization.py:66

↓ 3 callersFunctionpush

code/data_structures/src/stack/stack/stack.c:45

↓ 3 callersFunctionpush

inserting an element

code/data_structures/src/list/stack_using_linked_list/stack_using_linked_list.c:12

↓ 3 callersMethodpush

* Adds an item to the stack * * @param int $element * @return void */

code/data_structures/src/stack/stack/stack.php:35

↓ 3 callersMethodpush

code/data_structures/src/queue/circular_buffer/circular_buffer.py:10

↓ 3 callersMethodpush

code/data_structures/src/tree/heap/priority_queue/priority_queue.py:29

↓ 3 callersMethodqueryRange

! * \brief Queries the range [l, r] in O(log(n)) time * It can be used for any function(e.g. Range Sum Queries) * \param l The starting

code/data_structures/src/sparse_table/sparse_table.cpp:54

↓ 3 callersMethodqueryRangeIdempotent

! * \brief Queries the range [l, r] in 0(1) time * It can only be used if the function is idempotent(e.g. Range Minimum Queries) * \par

code/data_structures/src/sparse_table/sparse_table.cpp:36

↓ 3 callersFunctionrandInterval

code/mathematical_algorithms/src/fractals/simple_julia.cpp:19

↓ 3 callersFunctionreadFile

code/artificial_intelligence/src/factorization_machines/matrix_factorization.py:74

↓ 3 callersFunctionrecurse

code/sorting/src/tree_sort/tree_sort.js:18

↓ 3 callersMethodregisterStartupException

test/c++/catch.hpp:7435

↓ 3 callersMethodregisterTest

test/c++/catch.hpp:8997

↓ 3 callersMethodrelu

code/artificial_intelligence/src/neural_network/neural_network.py:61

↓ 3 callersMethodremainingTokens

test/c++/catch.hpp:4957

↓ 3 callersMethodremove

code/data_structures/test/bag/test_bag.cpp:56

↓ 3 callersMethodremove

* remove * @param ele - the element to delete if found */

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

← previous next →901–1,000 of 8,543, ranked by callers