Solve Luhn_algorithm

Author: BProg

luhn/.exercism/metadata.json

@@ -0,0 +1 @@
+{"track":"rust","exercise":"luhn","id":"1a853db0b19e459f9d5d65d16935e744","url":"https://exercism.io/my/solutions/1a853db0b19e459f9d5d65d16935e744","handle":"iostafi","is_requester":true,"auto_approve":false}

luhn/.gitignore

@@ -0,0 +1,8 @@
+# Generated by Cargo
+# will have compiled files and executables
+/target/
+**/*.rs.bk
+
+# Remove Cargo.lock from gitignore if creating an executable, leave it for libraries
+# More information here http://doc.crates.io/guide.html#cargotoml-vs-cargolock
+Cargo.lock

luhn/Cargo.toml

@@ -0,0 +1,4 @@
+[package]
+edition = "2018"
+name = "luhn"
+version = "1.6.1"

luhn/README.md

@@ -0,0 +1,145 @@
+# Luhn
+
+Given a number determine whether or not it is valid per the Luhn formula.
+
+The [Luhn algorithm](https://en.wikipedia.org/wiki/Luhn_algorithm) is
+a simple checksum formula used to validate a variety of identification
+numbers, such as credit card numbers and Canadian Social Insurance
+Numbers.
+
+The task is to check if a given string is valid.
+
+Validating a Number
+------
+
+Strings of length 1 or less are not valid. Spaces are allowed in the input,
+but they should be stripped before checking. All other non-digit characters
+are disallowed.
+
+## Example 1: valid credit card number
+
+```text
+4539 1488 0343 6467
+```
+
+The first step of the Luhn algorithm is to double every second digit,
+starting from the right. We will be doubling
+
+```text
+4_3_ 1_8_ 0_4_ 6_6_
+```
+
+If doubling the number results in a number greater than 9 then subtract 9
+from the product. The results of our doubling:
+
+```text
+8569 2478 0383 3437
+```
+
+Then sum all of the digits:
+
+```text
+8+5+6+9+2+4+7+8+0+3+8+3+3+4+3+7 = 80
+```
+
+If the sum is evenly divisible by 10, then the number is valid. This number is valid!
+
+## Example 2: invalid credit card number
+
+```text
+8273 1232 7352 0569
+```
+
+Double the second digits, starting from the right
+
+```text
+7253 2262 5312 0539
+```
+
+Sum the digits
+
+```text
+7+2+5+3+2+2+6+2+5+3+1+2+0+5+3+9 = 57
+```
+
+57 is not evenly divisible by 10, so this number is not valid.
+
+## Rust Installation
+
+Refer to the [exercism help page][help-page] for Rust installation and learning
+resources.
+
+## Writing the Code
+
+Execute the tests with:
+
+```bash
+$ cargo test
+```
+
+All but the first test have been ignored. After you get the first test to
+pass, open the tests source file which is located in the `tests` directory
+and remove the `#[ignore]` flag from the next test and get the tests to pass
+again. Each separate test is a function with `#[test]` flag above it.
+Continue, until you pass every test.
+
+If you wish to run all ignored tests without editing the tests source file, use:
+
+```bash
+$ cargo test -- --ignored
+```
+
+To run a specific test, for example `some_test`, you can use:
+
+```bash
+$ cargo test some_test
+```
+
+If the specific test is ignored use:
+
+```bash
+$ cargo test some_test -- --ignored
+```
+
+To learn more about Rust tests refer to the [online test documentation][rust-tests]
+
+Make sure to read the [Modules][modules] chapter if you
+haven't already, it will help you with organizing your files.
+
+## Further improvements
+
+After you have solved the exercise, please consider using the additional utilities, described in the [installation guide](https://exercism.io/tracks/rust/installation), to further refine your final solution.
+
+To format your solution, inside the solution directory use
+
+```bash
+cargo fmt
+```
+
+To see, if your solution contains some common ineffective use cases, inside the solution directory use
+
+```bash
+cargo clippy --all-targets
+```
+
+## Submitting the solution
+
+Generally you should submit all files in which you implemented your solution (`src/lib.rs` in most cases). If you are using any external crates, please consider submitting the `Cargo.toml` file. This will make the review process faster and clearer.
+
+## Feedback, Issues, Pull Requests
+
+The [exercism/rust](https://github.com/exercism/rust) repository on GitHub is the home for all of the Rust exercises. If you have feedback about an exercise, or want to help implement new exercises, head over there and create an issue. Members of the rust track team are happy to help!
+
+If you want to know more about Exercism, take a look at the [contribution guide](https://github.com/exercism/docs/blob/master/contributing-to-language-tracks/README.md).
+
+[help-page]: https://exercism.io/tracks/rust/learning
+[modules]: https://doc.rust-lang.org/book/ch07-02-defining-modules-to-control-scope-and-privacy.html
+[cargo]: https://doc.rust-lang.org/book/ch14-00-more-about-cargo.html
+[rust-tests]: https://doc.rust-lang.org/book/ch11-02-running-tests.html
+
+## Source
+
+The Luhn Algorithm on Wikipedia [http://en.wikipedia.org/wiki/Luhn_algorithm](http://en.wikipedia.org/wiki/Luhn_algorithm)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

luhn/src/lib.rs

@@ -0,0 +1,41 @@
+use std::str::Chars;
+
+/// Check a Luhn checksum.
+pub fn is_valid(code: &str) -> bool {
+    let code_without_spaces = code.replace(" ", "");
+    if code_without_spaces.len() <= 1 {
+        return false;
+    }
+    let chs: Chars = code_without_spaces.chars();
+    let mut chs_vec: Vec<char> = chs.collect::<Vec<char>>();
+    chs_vec.reverse();
+    let chs_slice = &chs_vec[..];
+
+    let sum: Option<u32> = chs_slice.chunks(2).fold(Some(0), |sum, chunk| {
+        if sum.is_none() {
+            return sum;
+        }
+        let ch_left = chunk.get(0).unwrap_or(&'a');
+        let maybe_digit_left = ch_left.to_digit(10);
+
+        let ch_right = chunk.get(1).unwrap_or(&'0');
+        let maybe_digit_right = ch_right
+            .to_digit(10)
+            .and_then(|digit| Some(luhn_double_digit(digit)));
+        if let (Some(left), Some(right)) = (maybe_digit_left, maybe_digit_right) {
+            Some(sum.unwrap_or(0) + left + right)
+        } else {
+            None
+        }
+    });
+    sum.map_or_else(|| false, |v| v % 10 == 0)
+}
+
+fn luhn_double_digit(digit: u32) -> u32 {
+    let double = digit * 2;
+    if double > 9 {
+        double - 9
+    } else {
+        double
+    }
+}

luhn/tests/luhn.rs

@@ -0,0 +1,127 @@
+use luhn::*;
+
+fn process_valid_case(number: &str, is_luhn_expected: bool) {
+    assert_eq!(is_valid(number), is_luhn_expected);
+}
+
+#[test]
+fn test_single_digit_strings_can_not_be_valid() {
+    process_valid_case("1", false);
+}
+
+#[test]
+#[ignore]
+fn test_a_single_zero_is_invalid() {
+    process_valid_case("0", false);
+}
+
+#[test]
+#[ignore]
+fn test_a_simple_valid_sin_that_remains_valid_if_reversed() {
+    process_valid_case("059", true);
+}
+
+#[test]
+#[ignore]
+fn test_a_simple_valid_sin_that_becomes_invalid_if_reversed() {
+    process_valid_case("59", true);
+}
+
+#[test]
+#[ignore]
+fn test_a_valid_canadian_sin() {
+    process_valid_case("055 444 285", true);
+}
+
+#[test]
+#[ignore]
+fn test_invalid_canadian_sin() {
+    process_valid_case("055 444 286", false);
+}
+
+#[test]
+#[ignore]
+fn test_invalid_credit_card() {
+    process_valid_case("8273 1232 7352 0569", false);
+}
+
+#[test]
+#[ignore]
+fn test_valid_number_with_an_even_number_of_digits() {
+    process_valid_case("095 245 88", true); // 0_ 5_ 4_ 8_ = 09 12 85 87 = 10 15 15 = 40
+}
+
+#[test]
+#[ignore]
+fn strings_that_contain_non_digits_are_invalid() {
+    process_valid_case("055a 444 285", false);
+}
+
+#[test]
+#[ignore]
+fn test_valid_strings_with_punctuation_included_become_invalid() {
+    process_valid_case("055-444-285", false);
+}
+
+#[test]
+#[ignore]
+fn symbols_are_invalid() {
+    process_valid_case("055£ 444$ 285", false);
+}
+
+#[test]
+#[ignore]
+fn test_single_zero_with_space_is_invalid() {
+    process_valid_case(" 0", false);
+}
+
+#[test]
+#[ignore]
+fn test_more_than_a_single_zero_is_valid() {
+    process_valid_case("0000 0", true);
+}
+
+#[test]
+#[ignore]
+fn test_input_digit_9_is_correctly_converted_to_output_digit_9() {
+    process_valid_case("091", true);
+}
+
+#[test]
+#[ignore]
+/// using ascii value for doubled non-digit isn't allowed
+/// Convert non-digits to their ascii values and then offset them by 48 sometimes accidentally declare an invalid string to be valid.
+/// This test is designed to avoid that solution.
+fn test_using_ascii_value_for_doubled_nondigit_isnt_allowed() {
+    process_valid_case(":9", false);
+}
+
+#[test]
+#[ignore]
+/// valid strings with a non-digit added at the end become invalid
+fn test_valid_strings_with_a_nondigit_added_at_the_end_become_invalid() {
+    process_valid_case("059a", false);
+}
+
+#[test]
+#[ignore]
+/// valid strings with symbols included become invalid
+fn test_valid_strings_with_symbols_included_become_invalid() {
+    process_valid_case("055# 444$ 285", false);
+}
+
+#[test]
+#[ignore]
+/// using ascii value for non-doubled non-digit isn't allowed
+/// Convert non-digits to their ascii values and then offset them by 48 sometimes accidentally declare an invalid string to be valid.
+/// This test is designed to avoid that solution.
+fn test_using_ascii_value_for_nondoubled_nondigit_isnt_allowed() {
+    process_valid_case("055b 444 285", false);
+}
+
+#[test]
+#[ignore]
+/// valid number with an odd number of spaces
+fn test_valid_number_with_an_odd_number_of_spaces() {
+    process_valid_case("234 567 891 234", true);
+}