Commit a11736a

authored

style: include match_bool (TheAlgorithms#858)

1 parent d0f0762 commit a11736aCopy full SHA for a11736a

File tree

+21

-20

lines changed

+21

-20

lines changed

Lines changed: 0 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -48,7 +48,6 @@ manual_assert = { level = "allow", priority = 1 }`
`48`	`48`	`manual_let_else = { level = "allow", priority = 1 }`
`49`	`49`	`manual_string_new = { level = "allow", priority = 1 }`
`50`	`50`	`many_single_char_names = { level = "allow", priority = 1 }`
`51`		`-match_bool = { level = "allow", priority = 1 }`
`52`	`51`	`match_on_vec_items = { level = "allow", priority = 1 }`
`53`	`52`	`match_same_arms = { level = "allow", priority = 1 }`
`54`	`53`	`match_wildcard_for_single_variants = { level = "allow", priority = 1 }`

Lines changed: 8 additions & 6 deletions

Original file line number	Diff line number	Diff line change
`@@ -13,9 +13,10 @@ pub fn transposition(decrypt_mode: bool, msg: &str, key: &str) -> String {`
`13`	`13`	`let key_uppercase = key.to_uppercase();`
`14`	`14`	`let mut cipher_msg: String = msg.to_string();`
`15`	`15`
`16`		`- let keys: Vec<&str> = match decrypt_mode {`
`17`		`- false => key_uppercase.split_whitespace().collect(),`
`18`		`- true => key_uppercase.split_whitespace().rev().collect(),`
	`16`	`+ let keys: Vec<&str> = if decrypt_mode {`
	`17`	`+ key_uppercase.split_whitespace().rev().collect()`
	`18`	`+ } else {`
	`19`	`+ key_uppercase.split_whitespace().collect()`
`19`	`20`	`};`
`20`	`21`
`21`	`22`	`for cipher_key in keys.iter() {`
`@@ -47,9 +48,10 @@ pub fn transposition(decrypt_mode: bool, msg: &str, key: &str) -> String {`
`47`	`48`
`48`	`49`	`// Determines whether to encrypt or decrypt the message,`
`49`	`50`	`// and returns the result`
`50`		`- cipher_msg = match decrypt_mode {`
`51`		`- false => encrypt(cipher_msg, key_order),`
`52`		`- true => decrypt(cipher_msg, key_order),`
	`51`	`+ cipher_msg = if decrypt_mode {`
	`52`	`+ decrypt(cipher_msg, key_order)`
	`53`	`+ } else {`
	`54`	`+ encrypt(cipher_msg, key_order)`
`53`	`55`	`};`
`54`	`56`	`}`
`55`	`57`

Lines changed: 4 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -155,9 +155,10 @@ impl HuffmanEncoding {`
`155`	`155`	`result.push(state.symbol.unwrap());`
`156`	`156`	`state = &dict.root;`
`157`	`157`	`}`
`158`		`- match self.get_bit(i) {`
`159`		`- false => state = state.left.as_ref().unwrap(),`
`160`		`- true => state = state.right.as_ref().unwrap(),`
	`158`	`+ state = if self.get_bit(i) {`
	`159`	`+ state.right.as_ref().unwrap()`
	`160`	`+ } else {`
	`161`	`+ state.left.as_ref().unwrap()`
`161`	`162`	`}`
`162`	`163`	`}`
`163`	`164`	`if self.num_bits > 0 {`

Lines changed: 9 additions & 10 deletions

Original file line number	Diff line number	Diff line change
`@@ -82,17 +82,16 @@ where`
`82`	`82`	`{`
`83`	`83`	`use std::collections::HashSet;`
`84`	`84`
`85`		`- match a.len() == b.len() {`
`86`		`- true => {`
`87`		`- // This is O(n^2) but performs better on smaller data sizes`
`88`		`- //b.iter().all(\|item\| a.contains(item))`
	`85`	`+ if a.len() == b.len() {`
	`86`	`+ // This is O(n^2) but performs better on smaller data sizes`
	`87`	`+ //b.iter().all(\|item\| a.contains(item))`
`89`	`88`
`90`		`- // This is O(n), performs well on larger data sizes`
`91`		`- let set_a: HashSet<&T> = a.iter().collect();`
`92`		`- let set_b: HashSet<&T> = b.iter().collect();`
`93`		`- set_a == set_b`
`94`		`- }`
`95`		`- false => false,`
	`89`	`+ // This is O(n), performs well on larger data sizes`
	`90`	`+ let set_a: HashSet<&T> = a.iter().collect();`
	`91`	`+ let set_b: HashSet<&T> = b.iter().collect();`
	`92`	`+ set_a == set_b`
	`93`	`+ }else{`
	`94`	`+ false`
`96`	`95`	`}`
`97`	`96`	`}`
`98`	`97`

Comments

(0)