MCPcopy Create free account

hub / github.com/algorithm-archivists/algorithm-archive / functions

Functions774 in github.com/algorithm-archivists/algorithm-archive

⨍ Functions 774◇ Types & classes 154
↓ 43 callersMethodsize
()
contents/stacks_and_queues/code/java/QueueTest.java:37
↓ 37 callersMethodpush
(T element)
contents/stacks_and_queues/code/java/StackTest.java:31
↓ 36 callersFunctionabs
(a int)
contents/euclidean_algorithm/code/go/euclidean.go:7
↓ 20 callersMethodpop
()
contents/stacks_and_queues/code/java/StackTest.java:26
↓ 12 callersMethodgetX
()
contents/jarvis_march/code/java/JarvisMarch.java:14
↓ 12 callersMethodtoString
()
contents/stable_marriage_problem/code/java/stable-marriage.java:103
↓ 10 callersMethodgetY
()
contents/jarvis_march/code/java/JarvisMarch.java:17
↓ 8 callersMethodcount
(&self)
contents/huffman_encoding/code/rust/huffman.rs:71
↓ 8 callersMethodgetChildren
()
contents/tree_traversal/code/php/tree_traversal.php:20
↓ 7 callersMethodempty
contents/stacks_and_queues/code/cpp/stack.cpp:61
↓ 7 callersMethodenqueue
(T element)
contents/stacks_and_queues/code/java/QueueTest.java:31
↓ 7 callersMethodgetId
()
contents/tree_traversal/code/php/tree_traversal.php:15
↓ 7 callersFunctionswap
contents/huffman_encoding/code/c/huffman.c:34
↓ 6 callersMethodAdd
(Node newNode)
contents/huffman_encoding/code/csharp/HuffmanCoding.cs:64
↓ 6 callersFunctionconvolve_linear
(signal, filter, output_size)
contents/convolutions/2d/code/python/2d_convolution.py:5
↓ 6 callersFunctionshuffle
contents/stable_marriage_problem/code/c/stable_marriage.c:14
↓ 5 callersMethodfront
()
contents/stacks_and_queues/code/java/QueueTest.java:42
↓ 5 callersMethodpush
(self, element: T)
contents/stacks_and_queues/code/python/stack.py:18
↓ 5 callersFunctionsum_matrix_dimensions
(mat1, mat2)
contents/convolutions/2d/code/python/2d_convolution.py:42
↓ 4 callersMethodPop
()
contents/huffman_encoding/code/go/huffman.go:30
↓ 4 callersMethodPush
(x interface{})
contents/huffman_encoding/code/go/huffman.go:22
↓ 4 callersMethoddequeue
()
contents/stacks_and_queues/code/java/QueueTest.java:26
↓ 4 callersFunctionfft
contents/split-operator_method/code/cpp/split_op.cpp:82
↓ 4 callersFunctionfft
(x: &mut Vec<Complex<f64>>, inverse: bool)
contents/split-operator_method/code/rust/split_op.rs:93
↓ 4 callersFunctionfft
contents/split-operator_method/code/c/split_op.c:31
↓ 4 callersFunctionheap_pop
contents/huffman_encoding/code/c/huffman.c:81
↓ 4 callersMethodsize
()
contents/stacks_and_queues/code/java/StackTest.java:62
↓ 4 callersMethodtop
()
contents/stacks_and_queues/code/java/StackTest.java:41
↓ 3 callersMethodPop
()
contents/huffman_encoding/code/csharp/HuffmanCoding.cs:73
↓ 3 callersMethodangle
(Point a, Point b, Point c)
contents/jarvis_march/code/java/JarvisMarch.java:34
↓ 3 callersMethodenqueue
(self, element: T)
contents/stacks_and_queues/code/python/queue.py:18
↓ 3 callersMethodenqueue
(data: T)
contents/stacks_and_queues/code/typescript/queue.ts:23
↓ 3 callersMethodenqueue
(T element)
contents/stacks_and_queues/code/java/QueueTest.java:58
↓ 3 callersFunctionf
Function proportional to target distribution, a sum of Gaussians. For testing, set normalize to True, to get target distribution exactly.
contents/metropolis/code/python/metropolis.py:4
↓ 3 callersFunctionfft
contents/cooley_tukey/code/c/fft.c:9
↓ 3 callersFunctionfind_neighbors
(canvas, p, old_val, new_val)
contents/flood_fill/code/python/flood_fill.py:10
↓ 3 callersFunctionfind_neighbors
contents/flood_fill/code/cpp/flood_fill.cpp:19
↓ 3 callersFunctionfind_neighbors
contents/flood_fill/code/c/flood_fill.c:28
↓ 3 callersMethodgenerate
(size, prefix, r)
contents/stable_marriage_problem/code/ruby/stable_marriage.rb:27
↓ 3 callersMethodgetName
()
contents/stable_marriage_problem/code/php/stable_marriage.php:16
↓ 3 callersFunctiongrid_cmp
contents/flood_fill/code/c/flood_fill.c:191
↓ 3 callersMethodlonely?
contents/stable_marriage_problem/code/ruby/stable_marriage.rb:10
↓ 3 callersFunctionmod1
(x, y)
contents/convolutions/1d/code/python/1d_convolution.py:3
↓ 3 callersFunctionn
(v, a)
contents/approximate_counting/code/python/approximate_counting.py:7
↓ 3 callersFunctionn
This function takes - v: value in register - a: a scaling value for the logarithm based on Morris's paper It returns n(v,a), the approximate count
contents/approximate_counting/code/cpp/approximate_counting.cpp:22
↓ 3 callersFunctionn
This function takes - v: value in register - a: a scaling value for the logarithm based on Morris's paper It returns the approximate count
contents/approximate_counting/code/c/approximate_counting.c:17
↓ 3 callersMethodn
(double v, double a)
contents/approximate_counting/code/java/ApproximateCounting.java:12
↓ 3 callersMethodnew
()
contents/stacks_and_queues/code/rust/Stack.rs:6
↓ 3 callersFunctionpolar_angle
contents/graham_scan/code/c/graham.c:28
↓ 3 callersFunctionprintMatrix
contents/gaussian_elimination/code/cpp/gaussian_elimination.cpp:75
↓ 3 callersFunctionprintMatrix
(a [][]float64)
contents/gaussian_elimination/code/go/gaussian_elimination.go:108
↓ 3 callersMethodpush
(data: T)
contents/stacks_and_queues/code/typescript/stack.ts:23
↓ 3 callersMethodpush
(T element)
contents/stacks_and_queues/code/java/StackTest.java:57
↓ 3 callersMethodtestApproximateCount
(int nTrials, int nItems, double a, double threshold)
contents/approximate_counting/code/java/ApproximateCounting.java:59
↓ 3 callersFunctiontest_approximate_count
(n_trials, n_items, a, threshold)
contents/approximate_counting/code/python/approximate_counting.py:37
↓ 3 callersFunctiontest_approximate_count
This function takes - n_trials: the number of counting trials - n_items: the number of items to count to - a: a scaling value for the logarithm based
contents/approximate_counting/code/cpp/approximate_counting.cpp:52
↓ 3 callersFunctiontest_approximate_count
This function takes - n_trials: the number of counting trials - n_items: the number of items to count to - a: a scaling value for the logarithm based
contents/approximate_counting/code/rust/approximate_counting.rs:45
↓ 3 callersFunctiontest_approximation_count
This function takes - n_trials: the number of counting trials - n_items: the number off items to count - a: a scaling value for the logarithm based on
contents/approximate_counting/code/c/approximate_counting.c:57
↓ 2 callersMethodShuffle
(this IList<T> list, Random rng)
contents/stable_marriage_problem/code/csharp/ListExtensions.cs:8
↓ 2 callersFunction_detect
Try to detect the kotlinc binary
builders/kotlin.py:44
↓ 2 callersFunctionapprox
(x, y, tol = 1e-12)
contents/cooley_tukey/code/javascript/fft.js:82
↓ 2 callersFunctionapprox
contents/cooley_tukey/code/c/fft.c:97
↓ 2 callersMethodbfsQueue
()
contents/tree_traversal/code/java/Tree.java:83
↓ 2 callersFunctioncomputus
(year, servois=False)
contents/computus/code/python/gauss_easter.py:1
↓ 2 callersFunctioncomputus
contents/computus/code/cpp/gauss_easter.cpp:4
↓ 2 callersFunctioncomputus
(year: number, servois: boolean = false)
contents/computus/code/typescript/gauss_easter.ts:15
↓ 2 callersFunctioncomputus
* @param {number} year * @param {boolean} [servois=false] * @returns {string}
contents/computus/code/javascript/gauss_easter.js:23
↓ 2 callersFunctioncomputus
contents/computus/code/c/gauss_easter.c:3
↓ 2 callersFunctionconvolve_linear
(signal, filter_array, output_size)
contents/convolutions/1d/code/python/1d_convolution.py:20
↓ 2 callersFunctioncreateTree
(rows, children)
contents/tree_traversal/code/javascript/tree.js:1
↓ 2 callersFunctioncreateTree
(numRow, numChild int)
contents/tree_traversal/code/go/treetraversal.go:62
↓ 2 callersFunctioncreate_circle
(image_resolution, grid_extents, radius)
contents/convolutions/2d/code/python/2d_convolution.py:55
↓ 2 callersFunctioncreate_gaussian_kernel
(kernel_size)
contents/convolutions/2d/code/python/2d_convolution.py:21
↓ 2 callersFunctioncreate_group
contents/stable_marriage_problem/code/c/stable_marriage.c:23
↓ 2 callersFunctioncreate_tree
(node, num_row, num_child)
contents/tree_traversal/code/python/tree_traversal.py:6
↓ 2 callersFunctioncreate_tree
contents/tree_traversal/code/cpp/tree_example.cpp:88
↓ 2 callersFunctioncreate_tree
(num_row: u64, num_child: u64)
contents/tree_traversal/code/rust/tree.rs:60
↓ 2 callersFunctioncreate_tree
contents/tree_traversal/code/c/tree_traversal.c:13
↓ 2 callersFunctiondestroy_tree
contents/tree_traversal/code/c/tree_traversal.c:27
↓ 2 callersMethoddfsRecursive
()
contents/tree_traversal/code/java/Tree.java:16
↓ 2 callersMethoddfsRecursiveInOrderBinary
()
contents/tree_traversal/code/java/Tree.java:43
↓ 2 callersMethoddfsRecursivePostOrder
()
contents/tree_traversal/code/java/Tree.java:29
↓ 2 callersMethoddfsStack
()
contents/tree_traversal/code/java/Tree.java:67
↓ 2 callersFunctiondrand
Returns a random double in [0, 1)
contents/IFS/code/cpp/IFS.cpp:25
↓ 2 callersFunctiondrand
contents/IFS/code/c/IFS.c:10
↓ 2 callersFunctionduplicate
contents/huffman_encoding/code/c/huffman.c:55
↓ 2 callersMethodencode
contents/huffman_encoding/code/cpp/huffman.cpp:184
↓ 2 callersMethodengageTo
(other)
contents/stable_marriage_problem/code/javascript/stable-marriage.js:14
↓ 2 callersFunctionenqueue
contents/tree_traversal/code/c/utility.h:83
↓ 2 callersFunctionenqueue
contents/flood_fill/code/c/flood_fill.c:119
↓ 2 callersFunctionequal
contents/jarvis_march/code/c/jarvis_march.c:25
↓ 2 callersMethodequal
(o point)
contents/jarvis_march/code/go/jarvis.go:23
↓ 2 callersFunctionfree_group
contents/stable_marriage_problem/code/c/stable_marriage.c:78
↓ 2 callersFunctiongenerate_tree
(int $numOfRows, int $numOfChildren)
contents/tree_traversal/code/php/tree_traversal.php:105
↓ 2 callersMethodgetPreferences
()
contents/stable_marriage_problem/code/php/stable_marriage.php:31
↓ 2 callersMethodgetPreferredMates
()
contents/stable_marriage_problem/code/java/stable-marriage.java:99
↓ 2 callersFunctionget_code
contents/huffman_encoding/code/c/huffman.c:204
↓ 2 callersFunctionheap_free
contents/huffman_encoding/code/c/huffman.c:116
↓ 2 callersFunctionheap_push
contents/huffman_encoding/code/c/huffman.c:62
↓ 2 callersMethodisSingle
()
contents/stable_marriage_problem/code/php/stable_marriage.php:36
next →1–100 of 774, ranked by callers