Functions — github.com/TheAlgorithms/Rust

hub / github.com/TheAlgorithms/Rust / functions

Functions2,908 in github.com/TheAlgorithms/Rust

⨍ Functions 2,908◇ Types & classes 211

↓ 6 callersFunctioncalculate_entropy

Calculate entropy of a set of labels

src/machine_learning/decision_tree.rs:21

↓ 6 callersMethodchild_mut

Returns a mutable reference to the left or right child.

src/data_structures/treap.rs:182

↓ 6 callersMethodcompress

Compresses the given text using the LZ77 algorithm. # Arguments `text` - The string to be compressed # Returns A vector of `Token`s representing t

src/compression/lz77.rs:121

↓ 6 callersMethoddecode

In case the encoding is invalid, `None` is returned

src/general/huffman_encoding.rs:197

↓ 6 callersMethoddelete

(&mut self, u: usize, v: usize)

src/graph/decremental_connectivity.rs:44

↓ 6 callersMethoddelete_ith

(&mut self, index: u32)

src/data_structures/linked_list.rs:146

↓ 6 callersFunctiondivide_u64

(n: u64)

src/ciphers/tea.rs:48

↓ 6 callersMethodencode

(&self, data: &[T])

src/general/huffman_encoding.rs:154

↓ 6 callersMethodfitness

(&self)

src/general/genetic.rs:288

↓ 6 callersMethodinsert

(&mut self, key: K, value: V)

src/data_structures/hash_table.rs:30

↓ 6 callersMethodinsert

Inserts a new item (disjoint set) into the data structure.

src/data_structures/union_find.rs:33

↓ 6 callersMethoditer_mut

'_ is the "explicitly elided lifetime" syntax of Rust

src/data_structures/stack_using_singly_linked_list.rs:85

↓ 6 callersFunctionjaro_winkler_distance

(str1: &str, str2: &str)

src/string/jaro_winkler_distance.rs:7

↓ 6 callersFunctionkth_smallest

Returns k-th smallest element of an array, i.e. its order statistics. Time complexity is O(n^2) in the worst case, but only O(n) on average. It mutate

src/searching/kth_smallest.rs:7

↓ 6 callersFunctionkth_smallest_heap

Returns k-th smallest element of an array. Time complexity is stably O(nlog(k)) in all cases Extra space is required to maintain the heap, and it does

src/searching/kth_smallest_heap.rs:13

↓ 6 callersFunctionleft_rotate

(tree: &mut RBTree<K, V>, x: *mut RBNode<K, V>)

src/data_structures/rb_tree.rs:508

↓ 6 callersFunctionminimax

Minimize the actions of the opponent while maximizing the game state of the current player.

src/graph/depth_first_search_tic_tac_toe.rs:195

↓ 6 callersMethodpartial_cmp

(&self, other: &Self)

src/graph/astar.rs:18

↓ 6 callersMethodpredict

(&self, test_point: &[f64])

src/machine_learning/decision_tree.rs:319

↓ 6 callersMethodprepare

(&mut self, max_number: usize)

src/math/linear_sieve.rs:26

↓ 6 callersMethodprint_matching

(&self)

src/graph/bipartite_matching.rs:53

↓ 6 callersMethodquery

(&mut self, range: Range<usize>)

src/data_structures/lazy_segment_tree.rs:44

↓ 6 callersMethodresize

(&mut self)

src/data_structures/hash_table.rs:47

↓ 6 callersFunctionright_rotate

(tree: &mut RBTree<K, V>, x: *mut RBNode<K, V>)

src/data_structures/rb_tree.rs:543

↓ 6 callersMethodsearch

(&self, searched_key: K)

src/data_structures/skip_list.rs:56

↓ 6 callersFunctionsum_of_years_digits_depreciation

Calculates depreciation using the **sum-of-years' digits (SYD)** method. This is an *accelerated* method: higher depreciation is charged in earlier y

src/financial/depreciation.rs:318

↓ 6 callersFunctiontest_full

(size: u32)

src/data_structures/veb_tree.rs:304

↓ 6 callersFunctionto_block

(data: &[u8])

src/ciphers/tea.rs:77

↓ 6 callersFunctiontop_down_merge_sort

(arr: &mut [T])

src/sorting/merge_sort.rs:22

↓ 6 callersFunctiontournament_sort

From Wikipedia: Tournament sort is a sorting algorithm. It improves upon the naive selection sort by using a priority queue to find the next element i

src/sorting/tournament_sort.rs:8

↓ 6 callersFunctiontrifid_encrypt

Encrypts a message using the Trifid cipher. # Arguments `message` - The message to encrypt `alphabet` - The characters to be used for the cipher (mu

src/ciphers/trifid.rs:26

↓ 6 callersMethodyin

(&self, frequencies: &[f64])

src/signal_analysis/yin.rs:60

↓ 5 callersFunctionassert_ranks_close

Assert that every node's rank is within `epsilon` of `expected`.

src/graph/page_rank.rs:135

↓ 5 callersFunctionbase32_encode

Encodes the given bytes into base32. The function converts binary data into base32 format using the standard alphabet. Output is padded with '=' char

src/ciphers/base32.rs:32

↓ 5 callersMethodceil

Returns the smallest value in this tree larger than value

src/data_structures/binary_search_tree.rs:145

↓ 5 callersMethodchild_mut

Returns a mutable reference to the left or right child.

src/data_structures/avl_tree.rs:197

↓ 5 callersMethodcolinear_point_on_segment

p must be colinear with the segment

src/geometry/segment.rs:55

↓ 5 callersMethodcontains

(x: F, y: F)

src/math/elliptic_curve.rs:86

↓ 5 callersFunctioncross_product

Cross Product and Magnitude Calculation This program defines functions to calculate the cross product of two 3D vectors and the magnitude of a vector

src/math/vector_cross_product.rs:13

↓ 5 callersFunctiondecrypt_part

Converts each letter of the input string into their respective trigram values, joins them and splits them into three equal groups of strings which are

src/ciphers/trifid.rs:109

↓ 5 callersMethodfind_components

(&mut self, adj: &[Vec<usize>])

src/graph/strongly_connected_components.rs:95

↓ 5 callersMethodfit

Fits the SVC with training data # Arguments `observations` - Training feature vectors `classes` - Class labels (should be 1.0 or -1.0) # Errors Retu

src/machine_learning/support_vector_classifier.rs:145

↓ 5 callersFunctionget_majority_class

Get the majority class label

src/machine_learning/decision_tree.rs:144

↓ 5 callersMethodget_parent

(&self, v: usize, i: usize)

src/graph/lowest_common_ancestor.rs:29

↓ 5 callersFunctionhuffman_decode

Decodes a Huffman-encoded string # Arguments `encoded` - The binary string to decode `codes` - HashMap of character to binary code mappings # Retur

src/compression/huffman_encoding.rs:245

↓ 5 callersFunctionkosaraju

(graph: &Graph)

src/graph/kosaraju.rs:43

↓ 5 callersFunctionpancake_sort

(arr: &mut [T])

src/sorting/pancake_sort.rs:3

↓ 5 callersMethodresize

(&mut self, new_size: usize)

src/math/bell_numbers.rs:59

↓ 5 callersFunctionrun_length_encode

(text: &str)

src/compression/run_length_encoding.rs:3

↓ 5 callersMethodsearch

(&self, key: K)

src/data_structures/hash_table.rs:39

↓ 5 callersFunctionsmith_waterman

Performs the Smith-Waterman local sequence alignment algorithm. This function creates a scoring matrix using dynamic programming to find the optimal

src/dynamic_programming/smith_waterman.rs:101

↓ 5 callersFunctionsolve_two_satisfiability

Returns an assignment that satisfies all the constraints, or a variable that makes such an assignment impossible.\ Variables should be numbered from 1

src/graph/two_satisfiability.rs:18

↓ 5 callersFunctionstable_matching

( men_preferences: &HashMap<String, Vec<String>>, women_preferences: &HashMap<String, Vec<String>>, )

src/greedy/stable_matching.rs:115

↓ 5 callersFunctionstraight_line_depreciation

Calculates depreciation using the **straight-line** method. The depreciable cost is divided equally across every period. Formula: ```text annual_exp

src/financial/depreciation.rs:111

↓ 5 callersFunctiontree_sort

(arr: &mut Vec<T>)

src/sorting/tree_sort.rs:63

↓ 5 callersFunctionvalidate_common

( useful_years: u32, purchase_value: f64, residual_value: f64, )

src/financial/depreciation.rs:67

↓ 5 callersFunctionvector_magnitude

Function to calculate the magnitude of a vector

src/math/vector_cross_product.rs:21

↓ 5 callersFunctionwave_sort

Wave Sort Algorithm Wave Sort is a sorting algorithm that works in O(n log n) time assuming the sort function used works in O(n log n) time. It arran

src/sorting/wave_sort.rs:18

↓ 5 callersFunctionxor

(text: &str, key: u8)

src/ciphers/xor.rs:5

↓ 4 callersFunctionadd_edge

(tree: &mut Graph<V>, a: V, b: V)

src/graph/prufer_code.rs:39

↓ 4 callersMethodadd_edge

(&mut self, u: usize, v: usize)

src/graph/tarjans_ssc.rs:14

↓ 4 callersFunctionaes_decrypt

(cipher_text: &[Byte], key: AesKey)

src/ciphers/aes.rs:263

↓ 4 callersFunctionaes_encrypt

(plain_text: &[Byte], key: AesKey)

src/ciphers/aes.rs:234

↓ 4 callersFunctionall_rotations

Generates all rotations of a string. # Arguments `s` - The string to rotate # Returns A vector containing all rotations of the input string # Exa

src/compression/burrows_wheeler_transform.rs:43

↓ 4 callersFunctionbase16_encode

Base16 encoding and decoding implementation. Base16, also known as hexadecimal encoding, represents binary data using 16 ASCII characters (0-9 and A-

src/ciphers/base16.rs:31

↓ 4 callersFunctionbinary_insertion_sort

(arr: &mut [T])

src/sorting/binary_insertion_sort.rs:18

↓ 4 callersFunctioncocktail_shaker_sort

(arr: &mut [T])

src/sorting/cocktail_shaker_sort.rs:1

↓ 4 callersMethodconsecutive_orientation

Returns the orientation of consecutive segments ab and bc.

src/geometry/point.rs:15

↓ 4 callersMethodcontains

(&self, item: &Item)

src/data_structures/probabilistic/bloom_filter.rs:46

↓ 4 callersFunctionconvert_pressure

Convert pressure from one unit to another. This function accepts both `PressureUnit` enums and string identifiers. # Arguments `value` - The numeri

src/conversions/pressure.rs:225

↓ 4 callersFunctioncosine

Returns the value of cos, approximated with the given tolerance, for an angle 'x' in radians

src/math/trig_functions.rs:77

↓ 4 callersFunctioncycle_sort

(arr: &mut [i32])

src/sorting/cycle_sort.rs:3

↓ 4 callersFunctiondecrypt

Decrypts a ciphertext using the RSA private key # Arguments `ciphertext` - The encrypted message `private_key` - The private key to use for decrypti

src/ciphers/rsa_cipher.rs:218

↓ 4 callersMethoddelete

(&mut self, searched_key: K)

src/data_structures/skip_list.rs:154

↓ 4 callersMethoddirection

(&self, p: &Point)

src/geometry/segment.rs:22

↓ 4 callersFunctiondisplay_board

(board: &[Vec<Players>])

src/graph/depth_first_search_tic_tac_toe.rs:136

↓ 4 callersFunctiondouble_declining_balance_depreciation

Calculates depreciation using the **double-declining balance (DDB)** method. DDB is the most widely used form of the diminishing balance method. It

src/financial/depreciation.rs:386

↓ 4 callersFunctionencode

(message: &str)

src/ciphers/morse_code.rs:7

↓ 4 callersFunctionencrypt

Encrypts a message using the RSA public key # Arguments `message` - The plaintext message (must be less than n) `public_key` - The public key to use

src/ciphers/rsa_cipher.rs:192

↓ 4 callersFunctionexchange_sort

(arr: &mut [i32])

src/sorting/exchange_sort.rs:3

↓ 4 callersFunctionfind_median

(numbers: &[f64])

src/math/interquartile_range.rs:8

↓ 4 callersMethodfind_set

Finds the representative (root) of the set containing `element` with path compression. Path compression ensures that future queries are faster by dir

src/graph/disjoint_set_union.rs:56

↓ 4 callersMethodfrequency

Returns the frequency of this node

src/compression/huffman_encoding.rs:64

↓ 4 callersFunctionfrom_integer

()

src/math/field.rs:325

↓ 4 callersFunctiongenerate_nearly_ordered_vec

(n: u32, swap_times: u32)

src/sorting/sort_utils.rs:21

↓ 4 callersFunctiongenerate_random_vec

(n: u32, range_l: i32, range_r: i32)

src/sorting/sort_utils.rs:7

↓ 4 callersFunctionget_frequency

(bytes: &[u8])

src/general/huffman_encoding.rs:239

↓ 4 callersMethodheight

Returns the height of the left or right subtree.

src/data_structures/avl_tree.rs:205

↓ 4 callersMethodhigh

(&self, value: u32)

src/data_structures/veb_tree.rs:41

↓ 4 callersMethodindex

(&self, cluster: u32, offset: u32)

src/data_structures/veb_tree.rs:49

↓ 4 callersMethodis_leaf

(&self)

src/data_structures/b_tree.rs:40

↓ 4 callersMethodkernel_function

Computes the kernel function between two vectors

src/machine_learning/support_vector_classifier.rs:115

↓ 4 callersMethodleft_child_idx

Returns the index of the left child of the element at `idx`. # Parameters - `idx`: The index of the element. # Returns The index of the left child.

src/data_structures/heap.rs:184

↓ 4 callersFunctionlist_subset

list all subset combinations of n element in given set of r element. This is a recursive function that collects all subsets of the set of size n with

src/dynamic_programming/subset_generation.rs:4

↓ 4 callersMethodlow

(&self, value: u32)

src/data_structures/veb_tree.rs:45

↓ 4 callersFunctionodd_even_sort

(arr: &mut [T])

src/sorting/odd_even_sort.rs:1

↓ 4 callersFunctionpatience_sort

(arr: &mut [T])

src/sorting/patience_sort.rs:3

↓ 4 callersFunctionpeak_signal_to_noise_ratio

Computes the PSNR in decibels (dB) between an original and a compressed image. # Arguments `original` - Pixel values of the original image (u8 slice,

src/compression/peak_signal_to_noise_ratio.rs:22

↓ 4 callersFunctionpermute

Here's a basic (naive) implementation for generating permutations

src/general/permutations/naive.rs:6

↓ 4 callersMethodprefix_query

Computes the sum of elements from the start of the tree up to a specified index. This operation efficiently calculates the prefix sum using the tree

src/data_structures/fenwick_tree.rs:87

← previous next →101–200 of 2,908, ranked by callers