MCPcopy Create free account

hub / github.com/OpenGenus/quark / functions

Functions5,611 in github.com/OpenGenus/quark

↓ 3 callersMethodTop
()
code/code/data_structures/src/stack/stack/stack.go:20
↓ 3 callersMethodTop
()
code/code/data_structures/src/queue/queue/queue.go:20
↓ 3 callersFunctionU
(e,t)
code/js/popper.min.js:4
↓ 3 callersFunction_n
(e,n)
code/js/jquery.js:6
↓ 3 callersFunction_t
(e,t)
code/js/jquery.js:5
↓ 3 callersFunctionabsRound
(number)
code/js/moment.js:2772
↓ 3 callersMethodadd
Insert value in bloom filter
code/code/data_structures/src/hashs/bloom_filter/bloom_filter.py:20
↓ 3 callersMethodadd
@param element - the element to add
code/code/data_structures/src/bag/bag.java:45
↓ 3 callersMethodadd
Inserts the specified element into this queue if it is possible to do so immediately without violating capacity restrictions, returning true upon succ
code/code/data_structures/src/queue/queue_using_stack/queue_using_stack.java:29
↓ 3 callersFunctionaddFavorites
()
code/js/popup.js:411
↓ 3 callersFunctionaddRoundKey
---------------------------------Decrypt--------------------------------(begin) do the add round key
code/code/cryptography/src/aes_128/aes_128.cpp:191
↓ 3 callersMethodadd_str
(String a,String b,int n)
code/code/divide_conquer/src/karatsuba_multiplication/multiply.java:19
↓ 3 callersFunctionalertNotify
(message)
code/background-save.js:334
↓ 3 callersFunctionatop
code/code/data_structures/src/stack/postfix_evaluation/infix_to_postfix_evaluation.cpp:36
↓ 3 callersFunctionb
()
code/highlight.pack.js:2
↓ 3 callersFunctionbfs
Given a start node and a function or code block this performs a bread first search and will exit upon function or code block returning true, or return
code/code/graph_algorithms/src/breadth_first_search/bfs.rb:43
↓ 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/code/data_structures/src/tree/b_tree/b_tree/b_tree_C/btree.c:38
↓ 3 callersFunctionboardstring
(board, boardsize=boardsize)
code/code/backtracking/src/knight_tour/knight_tour.py:14
↓ 3 callersFunctionbt
(e)
code/js/jquery.js:4
↓ 3 callersFunctionc
(t)
code/js/jquery.js:4
↓ 3 callersFunctioncalculateGCD
(a, b int)
code/code/mathematical_algorithms/src/gcd_and_lcm/gcd_and_lcm.go:8
↓ 3 callersMethodchangeTemperature
code/code/design_pattern/src/observer_pattern/observer_pattern.cpp:71
↓ 3 callersFunctioncheckAABBCollision
(a, b shape)
code/code/computational_geometry/src/axis_aligned_bounding_box_collision/axis_aligned_bounding_box_collision.go:18
↓ 3 callersFunctioncheckAABBCollision
code/code/computational_geometry/src/axis_aligned_bounding_box_collision/axis_aligned_bounding_box_collision.cpp:14
↓ 3 callersFunctioncheckLipogram
code/code/string_algorithms/src/lipogram_checker/lipogram_checker.js:7
↓ 3 callersFunctioncheckOverflow
(m)
code/js/moment.js:1977
↓ 3 callersFunctioncheckPalindrome
Checker */
code/code/string_algorithms/src/palindrome_checker/palindrome.php:6
↓ 3 callersFunctioncleanup_tree
code/code/data_structures/src/tree/binary_tree/binary_tree/make_mirror_tree/make_mirror_tree.c:81
↓ 3 callersFunctionclear
* Clears screen using ANSI escape sequences. */
code/code/unclassified/src/fifteen_puzzle/fifteen.c:140
↓ 3 callersFunctioncloneWithOffset
(input, model)
code/js/moment.js:2830
↓ 3 callersMethodcompareTo
Sorts by base area(length X width)
code/code/dynamic_programming/src/box_stacking/BoxStacking.java:105
↓ 3 callersFunctionconfigFromArray
(config)
code/js/moment.js:2031
↓ 3 callersFunctionconfigFromStringAndFormat
(config)
code/js/moment.js:2386
↓ 3 callersFunctionconstruct_and_insert
code/code/data_structures/test/tree/multiway_tree/red_black_tree/test_red_black.c:123
↓ 3 callersMethodconstructor
()
code/code/artificial_intelligence/src/q_learning/qLearning.js:97
↓ 3 callersFunctioncopyConfig
(to, from)
code/js/moment.js:190
↓ 3 callersFunctioncountDigits
(target int)
code/code/mathematical_algorithms/src/count_digits/count_digits.go:13
↓ 3 callersMethodcreateDimension
(int height, int side1, int side2)
code/code/dynamic_programming/src/box_stacking/BoxStacking.java:89
↓ 3 callersFunctioncreateInvalid
(flags)
code/js/moment.js:174
↓ 3 callersFunctioncreateTree
Create a Tree by initializing its subtree to nil and setting it's value.
code/code/sorting/src/tree_sort/tree_sort.go:24
↓ 3 callersFunctioncreateUTCDate
(y)
code/js/moment.js:1159
↓ 3 callersFunctioncreate_node
code/code/data_structures/src/tree/binary_tree/binary_tree/path_sum/sum_left/sum_left.c:11
↓ 3 callersFunctioncreate_node
code/code/data_structures/src/tree/binary_tree/binary_tree/minimum_height/minimum_height.c:10
↓ 3 callersFunctioncreate_node
code/code/data_structures/src/tree/binary_tree/binary_tree/diameter/diameter.c:18
↓ 3 callersFunctionct
(e,t)
code/js/jquery.js:4
↓ 3 callersFunctioncube
(n int)
code/code/mathematical_algorithms/src/armstrong_numbers/armstrong_numbers.go:26
↓ 3 callersFunctiondecimal_to_base
(N, base)
code/code/mathematical_algorithms/src/integer_conversion/decimal_to_any_base.js:24
↓ 3 callersFunctiondisplay
code/code/cellular_automaton/src/conways_game_of_life/life.cpp:138
↓ 3 callersMethoddisplay
code/code/data_structures/src/stack/stack/stack.cpp:51
↓ 3 callersFunctiondist
code/code/computational_geometry/src/jarvis_march/jarvis_march.cpp:51
↓ 3 callersMethoddist
(Point p1, Point p2)
code/code/computational_geometry/src/graham_scan/GrahamScan.java:16
↓ 3 callersMethoddoingIO
* Returns whether job is performing IO
code/code/operating_system/src/multi_level_feedback_queue_scheduling/mlfq.ts:181
↓ 3 callersFunctiondrawline
code/code/computational_geometry/src/cohen_sutherland_lineclip/lineclip.c:74
↓ 3 callersFunctiondt
(e)
code/js/jquery.js:4
↓ 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/code/dynamic_programming/src/egg_dropping_puzzle/egg_dropping_puzzle.cpp:19
↓ 3 callersMethodend
code/code/data_structures/src/hashs/hash_table/hash_table.cpp:113
↓ 3 callersMethodenqueue
(self, x)
code/code/data_structures/src/queue/reverse_queue/reverse_queue.py:10
↓ 3 callersFunctionenterComments
()
code/content.js:1345
↓ 3 callersMethoderase
code/code/data_structures/src/tree/binary_tree/aa_tree/aa_tree.cpp:308
↓ 3 callersFunctionevalua_poblacion
(poblacion, solucion)
code/code/cellular_automaton/src/genetic_algorithm/genetic_algorithm2.py:36
↓ 3 callersMethodexch
(int i,int j)
code/code/data_structures/src/tree/heap/max_heap/max_heap.java:77
↓ 3 callersFunctionexponentialSearch
Part of Cosmos by OpenGenus Foundation
code/code/search/src/exponential_search/exponential_search.go:30
↓ 3 callersFunctionf
(e,t,a,i)
code/highlight.pack.js:2
↓ 3 callersMethodfact
(long n)
code/code/mathematical_algorithms/src/catalan_number/catalan_number.java:22
↓ 3 callersMethodfactorial
(int n)
code/code/mathematical_algorithms/src/factorial/factorial_recursion.cs:3
↓ 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/code/cellular_automaton/src/genetic_algorithm/genetic_algorithm.py:57
↓ 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/code/greedy_algorithms/src/hillclimber/Hillclimber.java:36
↓ 3 callersMethodforward_pass
(self, inputs)
code/code/artificial_intelligence/src/neural_network/neuralnetwork.py:34
↓ 3 callersMethodfront
code/code/data_structures/src/queue/queue_using_linked_list/queue_using_linked_list.rb:36
↓ 3 callersMethodfront
(self)
code/code/data_structures/src/queue/reverse_queue/reverse_queue.py:24
↓ 3 callersFunctiong
(e)
code/js/popper.min.js:4
↓ 3 callersFunctiongNode_ID
code/code/graph_algorithms/src/adjacency_lists_graph_representation/adjacency_lists_in_C/lgraph_struct.c:13
↓ 3 callersFunctiongatherOtherResources
()
code/content.js:390
↓ 3 callersMethodgetCellIndex
(int cell)
code/code/cellular_automaton/src/elementary_cellular_automata/ElementaryCellularAutomaton.java:58
↓ 3 callersMethodgetCost
()
code/code/cellular_automaton/src/genetic_algorithm/genetic_algorithm.java:186
↓ 3 callersMethodgetData
()
code/code/data_structures/src/tree/space_partitioning_tree/interval_tree/interval_tree.java:44
↓ 3 callersFunctiongetDateOffset
(m)
code/js/moment.js:2844
↓ 3 callersFunctiongetDb
()
code/saved.js:11
↓ 3 callersFunctiongetFitness
(target, candidate string)
code/code/cellular_automaton/src/genetic_algorithm/genetic_algorithm.go:75
↓ 3 callersMethodgetMid
(int s, int e)
code/code/data_structures/src/tree/space_partitioning_tree/segment_tree/segment_tree.java:21
↓ 3 callersMethodgetSize
()
code/code/divide_conquer/src/merge_sort_using_divide_and_conquer/MergeSort.java:24
↓ 3 callersFunctiongetValue
(elm)
code/js/sites.js:37
↓ 3 callersMethodget_data
(self)
code/code/data_structures/src/list/singly_linked_list/singly_linked_list.py:7
↓ 3 callersMethodget_key
(&self)
code/code/data_structures/src/hashs/hash_table/hash_table.rs:104
↓ 3 callersFunctionget_split
(dataset)
code/code/artificial_intelligence/src/decision_tree/decision_tree.py:97
↓ 3 callersFunctiongetnode
code/code/cryptography/src/huffman_encoding/huffman_encoding.c:14
↓ 3 callersFunctiongreatestDigit
(num)
code/code/mathematical_algorithms/src/greatest_digit_in_number/greatest_digit_in_number.js:1
↓ 3 callersFunctionhashCode
code/code/data_structures/src/hashs/hash_table/hash_table.c:17
↓ 3 callersMethodhexToBinary
code/code/compression/src/lossless_compression/huffman/huffman.cpp:497
↓ 3 callersFunctioni
(e)
code/highlight.pack.js:2
↓ 3 callersFunctioni
(i)
code/js/bricklayer.min.js:1
↓ 3 callersFunctioni
(t,e)
code/js/bootstrap.min.js:6
↓ 3 callersFunctioninitiateAction
(tab,menuaction,srcurl,action)
code/background-save.js:246
↓ 3 callersMethodinsertHead
(T data)
code/code/data_structures/src/list/singly_linked_list/singly_linked_list.java:11
↓ 3 callersFunctioninside
code/code/computational_geometry/src/sutherland_hodgeman_clipping/sutherland.cpp:116
↓ 3 callersFunctionisDate
(input)
code/js/moment.js:57
↓ 3 callersMethodisEmpty
(self)
code/code/graph_algorithms/src/dijkstra_shortest_path/dijkstra_efficient.py:15
↓ 3 callersMethodisEmpty
* Checks if the stack is empty * * @return bool true if is empty, false otherwise */
code/code/data_structures/src/stack/stack/stack.php:55
↓ 3 callersMethodisEmpty
()
code/code/data_structures/src/stack/stack/stack.java:44
↓ 3 callersMethodisEmpty
code/code/data_structures/src/stack/abstract_stack/cpp/arrayStack/ArrayStack.h:132
← previousnext →601–700 of 5,611, ranked by callers