Commit 798c73a

authored

style: include bool_to_int_with_if (TheAlgorithms#867)

1 parent c149ad5 commit 798c73aCopy full SHA for 798c73a

File tree

-10

lines changed

-10

lines changed

Lines changed: 0 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -24,7 +24,6 @@ restriction = "warn"`
`24`	`24`	`nursery = "warn"`
`25`	`25`	`cargo = "warn"`
`26`	`26`	`# pedantic-lints:`
`27`		`-bool_to_int_with_if = { level = "allow", priority = 1 }`
`28`	`27`	`cast_lossless = { level = "allow", priority = 1 }`
`29`	`28`	`cast_possible_truncation = { level = "allow", priority = 1 }`
`30`	`29`	`cast_possible_wrap = { level = "allow", priority = 1 }`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -108,7 +108,7 @@ pub struct MultiBinaryBloomFilter {`
`108`	`108`
`109`	`109`	`impl MultiBinaryBloomFilter {`
`110`	`110`	`pub fn with_dimensions(filter_size: usize, hash_count: usize) -> Self {`
`111`		`- let bytes_count = filter_size / 8 + iffilter_size % 8 > 0{1}else{0}; // we need 8 times less entries in the array, since we are using bytes. Careful that we have at least one element though`
	`111`	`+ let bytes_count = filter_size / 8 + usize::from(filter_size % 8 > 0); // we need 8 times less entries in the array, since we are using bytes. Careful that we have at least one element though`
`112`	`112`	`Self {`
`113`	`113`	`filter_size,`
`114`	`114`	`bytes: vec![0; bytes_count],`

Lines changed: 1 addition & 5 deletions

Original file line number	Diff line number	Diff line change
`@@ -50,11 +50,7 @@ pub fn naive_levenshtein_distance(string1: &str, string2: &str) -> usize {`
`50`	`50`
`51`	`51`	`let updated_matrix = (1..=string1.len()).fold(distance_matrix, \|matrix, i\| {`
`52`	`52`	`(1..=string2.len()).fold(matrix, \|mut inner_matrix, j\| {`
`53`		`- let cost = if string1.as_bytes()[i - 1] == string2.as_bytes()[j - 1] {`
`54`		`- 0`
`55`		`- } else {`
`56`		`- 1`
`57`		`- };`
	`53`	`+ let cost = usize::from(string1.as_bytes()[i - 1] != string2.as_bytes()[j - 1]);`
`58`	`54`	`inner_matrix[i][j] = (inner_matrix[i - 1][j - 1] + cost)`
`59`	`55`	`.min(inner_matrix[i][j - 1] + 1)`
`60`	`56`	`.min(inner_matrix[i - 1][j] + 1);`

Lines changed: 3 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -51,7 +51,7 @@ pub fn compute_suffix(chars: &[char]) -> Vec<usize> {`
`51`	`51`	`while j > 0 && chars[j] != chars[i] {`
`52`	`52`	`j = suffix[j - 1];`
`53`	`53`	`}`
`54`		`- suffix[i] = j + ifchars[j] == chars[i]{1}else{0};`
	`54`	`+ suffix[i] = j + (chars[j] == chars[i])asusize;`
`55`	`55`	`}`
`56`	`56`	`suffix`
`57`	`57`	`}`
`@@ -72,13 +72,13 @@ pub fn compute_suffix(chars: &[char]) -> Vec<usize> {`
`72`	`72`	/// `reversed[0..=i]`.
`73`	`73`	`pub fn compute_prefix_match(original: &[char], reversed: &[char], suffix: &[usize]) -> Vec<usize> {`
`74`	`74`	`let mut match_table = vec![0; original.len()];`
`75`		`- match_table[0] = iforiginal[0] == reversed[0]{1}else{0};`
	`75`	`+ match_table[0] = usize::from(original[0] == reversed[0]);`
`76`	`76`	`for i in 1..original.len() {`
`77`	`77`	`let mut j = match_table[i - 1];`
`78`	`78`	`while j > 0 && reversed[i] != original[j] {`
`79`	`79`	`j = suffix[j - 1];`
`80`	`80`	`}`
`81`		`- match_table[i] = j + ifreversed[i] == original[j]{1}else{0};`
	`81`	`+ match_table[i] = j + usize::from(reversed[i] == original[j]);`
`82`	`82`	`}`
`83`	`83`	`match_table`
`84`	`84`	`}`

Comments

(0)