Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit d0f0762

Browse files
authored
style: include redundant_type_annotations (TheAlgorithms#859)
1 parent 2f2edfb commit d0f0762

File tree

10 files changed

+15
-16
lines changed

10 files changed

+15
-16
lines changed

‎Cargo.toml‎

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -119,7 +119,6 @@ print_stdout = { level = "allow", priority = 1 }
119119
pub_use = { level = "allow", priority = 1 }
120120
pub_with_shorthand = { level = "allow", priority = 1 }
121121
question_mark_used = { level = "allow", priority = 1 }
122-
redundant_type_annotations = { level = "allow", priority = 1 }
123122
same_name_method = { level = "allow", priority = 1 }
124123
semicolon_outside_block = { level = "allow", priority = 1 }
125124
separated_literal_suffix = { level = "allow", priority = 1 }

‎src/ciphers/transposition.rs‎

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -10,7 +10,7 @@ use std::ops::Range;
1010
/// Encrypts or decrypts a message, using multiple keys. The
1111
/// encryption is based on the columnar transposition method.
1212
pub fn transposition(decrypt_mode: bool, msg: &str, key: &str) -> String {
13-
let key_uppercase:String = key.to_uppercase();
13+
let key_uppercase = key.to_uppercase();
1414
let mut cipher_msg: String = msg.to_string();
1515

1616
let keys: Vec<&str> = match decrypt_mode {
@@ -61,7 +61,7 @@ fn encrypt(mut msg: String, key_order: Vec<usize>) -> String {
6161
let mut encrypted_msg: String = String::from("");
6262
let mut encrypted_vec: Vec<String> = Vec::new();
6363

64-
let msg_len:usize = msg.len();
64+
let msg_len = msg.len();
6565
let key_len: usize = key_order.len();
6666

6767
let mut msg_index: usize = msg_len;
@@ -75,7 +75,7 @@ fn encrypt(mut msg: String, key_order: Vec<usize>) -> String {
7575

7676
// Loop every nth character, determined by key length, to create a column
7777
while index < msg_index {
78-
let ch:char = msg.remove(index);
78+
let ch = msg.remove(index);
7979
chars.push(ch);
8080

8181
index += key_index;
@@ -123,7 +123,7 @@ fn decrypt(mut msg: String, key_order: Vec<usize>) -> String {
123123
let mut decrypted_vec: Vec<String> = Vec::new();
124124
let mut indexed_vec: Vec<(usize, String)> = Vec::new();
125125

126-
let msg_len:usize = msg.len();
126+
let msg_len = msg.len();
127127
let key_len: usize = key_order.len();
128128

129129
// Split the message into columns, determined by 'message length divided by keyword length'.

‎src/machine_learning/k_means.rs‎

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -11,8 +11,8 @@ fn find_nearest(data_point: &(f64, f64), centroids: &[(f64, f64)]) -> u32 {
1111
let mut cluster: u32 = 0;
1212

1313
for (i, c) in centroids.iter().enumerate() {
14-
let d1:f64 = get_distance(data_point, c);
15-
let d2:f64 = get_distance(data_point, &centroids[cluster as usize]);
14+
let d1 = get_distance(data_point, c);
15+
let d2 = get_distance(data_point, &centroids[cluster as usize]);
1616

1717
if d1 < d2 {
1818
cluster = i as u32;
@@ -44,7 +44,7 @@ pub fn k_means(data_points: Vec<(f64, f64)>, n_clusters: usize, max_iter: i32) -
4444
let mut new_centroids_num: Vec<u32> = vec![0; n_clusters];
4545

4646
for (i, d) in data_points.iter().enumerate() {
47-
let nearest_cluster:u32 = find_nearest(d, &centroids);
47+
let nearest_cluster = find_nearest(d, &centroids);
4848
labels[i] = nearest_cluster;
4949

5050
new_centroids_position[nearest_cluster as usize].0 += d.0;

‎src/machine_learning/loss_function/hinge_loss.rs‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -16,7 +16,7 @@
1616
pub fn hng_loss(y_true: &[f64], y_pred: &[f64]) -> f64 {
1717
let mut total_loss: f64 = 0.0;
1818
for (p, a) in y_pred.iter().zip(y_true.iter()) {
19-
let loss:f64 = (1.0 - a * p).max(0.0);
19+
let loss = (1.0 - a * p).max(0.0);
2020
total_loss += loss;
2121
}
2222
total_loss / (y_pred.len() as f64)

‎src/machine_learning/loss_function/mean_absolute_error_loss.rs‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -17,7 +17,7 @@ pub fn mae_loss(predicted: &[f64], actual: &[f64]) -> f64 {
1717
let mut total_loss: f64 = 0.0;
1818
for (p, a) in predicted.iter().zip(actual.iter()) {
1919
let diff: f64 = p - a;
20-
let absolute_diff:f64 = diff.abs();
20+
let absolute_diff = diff.abs();
2121
total_loss += absolute_diff;
2222
}
2323
total_loss / (predicted.len() as f64)

‎src/math/area_under_curve.rs‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@ pub fn area_under_curve(start: f64, end: f64, func: fn(f64) -> f64, step_count:
88
}; //swap if bounds reversed
99

1010
let step_length: f64 = (end - start) / step_count as f64;
11-
let mut area:f64 = 0f64;
11+
let mut area = 0f64;
1212
let mut fx1 = func(start);
1313
let mut fx2: f64;
1414

‎src/math/logarithm.rs‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -9,7 +9,7 @@ use std::f64::consts::E;
99
///
1010
/// Advisable to use **std::f64::consts::*** for specific bases (like 'e')
1111
pub fn log<T: Into<f64>, U: Into<f64>>(base: U, x: T, tol: f64) -> f64 {
12-
let mut rez:f64 = 0f64;
12+
let mut rez = 0f64;
1313
let mut argument: f64 = x.into();
1414
let usable_base: f64 = base.into();
1515

‎src/math/prime_numbers.rs‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,7 @@ pub fn prime_numbers(max: usize) -> Vec<usize> {
66
}
77
for i in (3..max + 1).step_by(2) {
88
let stop: usize = (i as f64).sqrt() as usize + 1;
9-
let mut status:bool = true;
9+
let mut status = true;
1010

1111
for j in (3..stop).step_by(2) {
1212
if i % j == 0 {

‎src/math/sum_of_digits.rs‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -14,7 +14,7 @@
1414
/// ```
1515
pub fn sum_digits_iterative(num: i32) -> u32 {
1616
// convert to unsigned integer
17-
let mut num:u32 = num.unsigned_abs();
17+
let mut num = num.unsigned_abs();
1818
// initialize sum
1919
let mut result: u32 = 0;
2020

@@ -43,7 +43,7 @@ pub fn sum_digits_iterative(num: i32) -> u32 {
4343
/// ```
4444
pub fn sum_digits_recursive(num: i32) -> u32 {
4545
// convert to unsigned integer
46-
let num:u32 = num.unsigned_abs();
46+
let num = num.unsigned_abs();
4747
// base case
4848
if num < 10 {
4949
return num;

‎src/string/run_length_encoding.rs‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -29,7 +29,7 @@ pub fn run_length_decoding(target: &str) -> String {
2929
if target.trim().is_empty() {
3030
return "".to_string();
3131
}
32-
let mut character_count:String = String::new();
32+
let mut character_count = String::new();
3333
let mut decoded_target = String::new();
3434

3535
for c in target.chars() {

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /