trackler 2.2.1.33 → 2.2.1.34

data/tracks/rust/config.json

@@ -167,6 +167,16 @@
         "loop"
       ]
     },
+    {
+      "uuid": "20e7d347-b80a-4656-ac34-0825126939ff",
+      "slug": "perfect-numbers",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 4,
+      "topics": [
+        "Mathematics"
+      ]
+    },
     {
       "uuid": "543a3ca2-fb9b-4f20-a873-ff23595d41df",
       "slug": "clock",
@@ -623,6 +633,20 @@
       "topics": [
       ]
     },
+    {
+      "uuid": "0a33f3ac-cedd-4a40-a132-9d044b0e9977",
+      "slug": "poker",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 6,
+      "topics": [
+         "lifetimes",
+         "struct",
+         "string parsing",
+         "enum",
+         "traits"
+      ]
+    },
     {
       "uuid": "f3172997-91f5-4941-a76e-91c4b8eed401",
       "slug": "anagram",

data/tracks/rust/exercises/perfect-numbers/.gitignore

@@ -0,0 +1,7 @@
+# Generated by Cargo
+# will have compiled files and executables
+/target/
+
+# 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

data/tracks/rust/exercises/perfect-numbers/Cargo.toml

@@ -0,0 +1,5 @@
+[package]
+name = "perfect_numbers"
+version = "1.0.1"
+
+[dependencies]

data/tracks/rust/exercises/perfect-numbers/README.md

@@ -0,0 +1,56 @@
+# Perfect Numbers
+
+Determine if a number is perfect, abundant, or deficient based on
+Nicomachus' (60 - 120 CE) classification scheme for natural numbers.
+
+The Greek mathematician [Nicomachus](https://en.wikipedia.org/wiki/Nicomachus) devised a classification scheme for natural numbers, identifying each as belonging uniquely to the categories of **perfect**, **abundant**, or **deficient** based on their [aliquot sum](https://en.wikipedia.org/wiki/Aliquot_sum). The aliquot sum is defined as the sum of the factors of a number not including the number itself. For example, the aliquot sum of 15 is (1 + 3 + 5) = 9
+
+- **Perfect**: aliquot sum = number 
+  - 6 is a perfect number because (1 + 2 + 3) = 6
+  - 28 is a perfect number because (1 + 2 + 4 + 7 + 14) = 28
+- **Abundant**: aliquot sum > number
+  - 12 is an abundant number because (1 + 2 + 3 + 4 + 6) = 16
+  - 24 is an abundant number because (1 + 2 + 3 + 4 + 6 + 8 + 12) = 36
+- **Deficient**: aliquot sum < number
+  - 8 is a deficient number because (1 + 2 + 4) = 7
+  - Prime numbers are deficient
+  
+Implement a way to determine whether a given number is **perfect**. Depending on your language track, you may also need to implement a way to determine whether a given number is **abundant** or **deficient**.
+
+## 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, remove the ignore flag (`#[ignore]`) from the next test and get the tests
+to pass again.  The test file is located in the `tests` directory.   You can
+also remove the ignore flag from all the tests to get them to run all at once
+if you wish.
+
+Make sure to read the [Crates and Modules](https://doc.rust-lang.org/stable/book/crates-and-modules.html) chapter if you
+haven't already, it will help you with organizing your files.
+
+## 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](https://github.com/orgs/exercism/teams/rust) 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]: http://exercism.io/languages/rust
+[crates-and-modules]: http://doc.rust-lang.org/stable/book/crates-and-modules.html
+
+## Source
+
+Taken from Chapter 2 of Functional Thinking by Neal Ford. [http://shop.oreilly.com/product/0636920029687.do](http://shop.oreilly.com/product/0636920029687.do)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/rust/exercises/perfect-numbers/example.rs

@@ -0,0 +1,20 @@
+pub fn classify(num: u64) -> Result<Classification, & 'static str> {
+    if num == 0 {
+        return Err("Number must be positive");
+    }
+    let sum: u64 = (1..num).filter(|i| num%i == 0).sum();
+    if sum == num {
+        Ok(Classification::Perfect)
+    } else if sum < num {
+        Ok(Classification::Deficient)
+    } else {
+        Ok(Classification::Abundant)
+    }
+}
+
+#[derive(Debug, PartialEq, Eq)]
+pub enum Classification {
+    Abundant,
+    Perfect,
+    Deficient
+}

data/tracks/rust/exercises/perfect-numbers/tests/perfect-numbers.rs

@@ -0,0 +1,33 @@
+extern crate perfect_numbers;
+
+use perfect_numbers::{Classification, classify};
+
+#[test]
+fn basic() {
+    assert_eq!(classify(0), Err("Number must be positive"));
+}
+
+#[test]
+#[ignore]
+fn test_all() {
+    struct TestClassification {
+        num: u64,
+        result: perfect_numbers::Classification
+    }
+    let test_table: Vec<TestClassification> = vec![
+        TestClassification { num: 6, result: Classification::Perfect },
+        TestClassification { num: 28, result: Classification::Perfect },
+        TestClassification { num: 33550336, result: Classification::Perfect },
+        TestClassification { num: 12, result: Classification::Abundant },
+        TestClassification { num: 30, result: Classification::Abundant },
+        TestClassification { num: 33550335, result: Classification::Abundant },
+        TestClassification { num: 2, result: Classification::Deficient },
+        TestClassification { num: 4, result: Classification::Deficient },
+        TestClassification { num: 32, result: Classification::Deficient },
+        TestClassification { num: 33550337, result: Classification::Deficient },
+        TestClassification { num: 1, result: Classification::Deficient },
+    ];
+    for t in test_table {
+        assert_eq!(classify(t.num), Ok(t.result));
+    }
+}

data/tracks/rust/exercises/poker/.gitignore

@@ -0,0 +1,7 @@
+# Generated by Cargo
+# will have compiled files and executables
+/target/
+
+# 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

data/tracks/rust/exercises/poker/.meta/hints.md

@@ -0,0 +1,8 @@
+## Hints
+
+- Ranking a list of poker hands can be considered a sorting problem.
+- Rust provides the [sort](https://doc.rust-lang.org/std/vec/struct.Vec.html#method.sort) method for `Vec<T> where T: Ord`.
+- [`Ord` types](https://doc.rust-lang.org/std/cmp/trait.Ord.html) are form a [total order](https://en.wikipedia.org/wiki/Total_order): exactly one of `a < b`, `a == b`, or `a > b` must be true.
+- Poker hands do not conform to a total order: it is possible for two hands to be non-equal but have equal sort order. Example: `3S 4S 5D 6H JH"`, `"3H 4H 5C 6C JD"`.
+- Rust provides the [`PartialOrd` trait](https://doc.rust-lang.org/std/cmp/trait.PartialOrd.html) to handle the case of sortable things which do not have a total order. However, it doesn't provide a standard `sort` method for `Vec<T> where T: PartialOrd`. The standard idiom to sort a vector in this case is `your_vec.sort_by(|a, b| a.partial_cmp(b).unwrap_or(Ordering::{Less|Equal|Greater}));`, depending on your needs. `
+- You might consider implementing a type representing a poker hand which implements `PartialOrd`.

data/tracks/rust/exercises/poker/Cargo-example.toml

@@ -0,0 +1,8 @@
+[package]
+name = "poker"
+version = "1.0.0"
+authors = ["Peter Goodspeed-Niklaus <peter.r.goodspeedniklaus@gmail.com>"]
+
+[dependencies]
+try_opt = "0.1.1"
+counter = "0.1.0"

data/tracks/rust/exercises/poker/Cargo.toml

@@ -0,0 +1,6 @@
+[package]
+name = "poker"
+version = "1.0.0"
+authors = ["Peter Goodspeed-Niklaus <peter.r.goodspeedniklaus@gmail.com>"]
+
+[dependencies]

data/tracks/rust/exercises/poker/README.md

@@ -0,0 +1,54 @@
+# Poker
+
+Pick the best hand(s) from a list of poker hands.
+
+See [wikipedia](https://en.wikipedia.org/wiki/List_of_poker_hands) for an
+overview of poker hands.
+
+## Hints
+
+- Ranking a list of poker hands can be considered a sorting problem.
+- Rust provides the [sort](https://doc.rust-lang.org/std/vec/struct.Vec.html#method.sort) method for `Vec<T> where T: Ord`.
+- [`Ord` types](https://doc.rust-lang.org/std/cmp/trait.Ord.html) are form a [total order](https://en.wikipedia.org/wiki/Total_order): exactly one of `a < b`, `a == b`, or `a > b` must be true.
+- Poker hands do not conform to a total order: it is possible for two hands to be non-equal but have equal sort order. Example: `3S 4S 5D 6H JH"`, `"3H 4H 5C 6C JD"`.
+- Rust provides the [`PartialOrd` trait](https://doc.rust-lang.org/std/cmp/trait.PartialOrd.html) to handle the case of sortable things which do not have a total order. However, it doesn't provide a standard `sort` method for `Vec<T> where T: PartialOrd`. The standard idiom to sort a vector in this case is `your_vec.sort_by(|a, b| a.partial_cmp(b).unwrap_or(Ordering::{Less|Equal|Greater}));`, depending on your needs. `
+- You might consider implementing a type representing a poker hand which implements `PartialOrd`.
+
+
+## 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, remove the ignore flag (`#[ignore]`) from the next test and get the tests
+to pass again.  The test file is located in the `tests` directory.   You can
+also remove the ignore flag from all the tests to get them to run all at once
+if you wish.
+
+Make sure to read the [Crates and Modules](https://doc.rust-lang.org/stable/book/crates-and-modules.html) chapter if you
+haven't already, it will help you with organizing your files.
+
+## 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](https://github.com/orgs/exercism/teams/rust) 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]: http://exercism.io/languages/rust
+[crates-and-modules]: http://doc.rust-lang.org/stable/book/crates-and-modules.html
+
+## Source
+
+Inspired by the training course from Udacity. [https://www.udacity.com/course/viewer#!/c-cs212/](https://www.udacity.com/course/viewer#!/c-cs212/)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/rust/exercises/poker/example.rs

@@ -0,0 +1,341 @@
+use std::fmt;
+use std::cmp::Ordering;
+
+#[macro_use]
+extern crate try_opt;
+
+extern crate counter;
+use counter::Counter;
+
+/// Given a list of poker hands, return a list of those hands which win.
+///
+/// Note the type signature: this function should return _the same_ reference to
+/// the winning hand(s) as were passed in, not reconstructed strings which happen to be equal.
+pub fn winning_hands<'a>(hands: &[&'a str]) -> Option<Vec<&'a str>> {
+    let mut hands = try_opt!(
+        hands
+            .iter()
+            .map(|source| Hand::try_from(source))
+            .collect::<Option<Vec<Hand>>>()
+    );
+    hands.sort_by(|a, b| a.partial_cmp(b).unwrap_or(Ordering::Less));
+    hands.last().map(|last| {
+        hands
+            .iter()
+            .rev()
+            .take_while(|&item| item.partial_cmp(last) == Some(Ordering::Equal))
+            .map(|hand| hand.source)
+            .collect()
+    })
+}
+
+#[derive(Debug, PartialEq, Eq, PartialOrd, Clone, Copy, Hash)]
+enum Suit {
+    Spades,
+    Clubs,
+    Diamonds,
+    Hearts,
+}
+
+impl Suit {
+    fn try_from(source: &str) -> Option<Suit> {
+        use Suit::*;
+        match source {
+            "S" => Some(Spades),
+            "C" => Some(Clubs),
+            "D" => Some(Diamonds),
+            "H" => Some(Hearts),
+            _ => None,
+        }
+    }
+}
+
+impl fmt::Display for Suit {
+    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+        use Suit::*;
+        write!(
+            f,
+            "{}",
+            match *self {
+                Spades => "S",
+                Clubs => "C",
+                Diamonds => "D",
+                Hearts => "H",
+            }
+        )
+    }
+}
+
+#[derive(Debug, PartialEq, Eq, Clone, Copy, Hash)]
+enum Rank {
+    Number(u8),
+    Jack,
+    Queen,
+    King,
+    Ace,
+}
+
+impl Rank {
+    fn try_from(source: &str) -> Option<Rank> {
+        use Rank::*;
+        match source {
+            "A" => Some(Ace),
+            "K" => Some(King),
+            "Q" => Some(Queen),
+            "J" => Some(Jack),
+            "10" => Some(Number(10)),
+            "9" => Some(Number(9)),
+            "8" => Some(Number(8)),
+            "7" => Some(Number(7)),
+            "6" => Some(Number(6)),
+            "5" => Some(Number(5)),
+            "4" => Some(Number(4)),
+            "3" => Some(Number(3)),
+            "2" => Some(Number(2)),
+            _ => None,
+        }
+    }
+
+    fn value(&self) -> usize {
+        use Rank::*;
+        match *self {
+            Ace => 14,
+            King => 13,
+            Queen => 12,
+            Jack => 11,
+            Number(n) => n as usize,
+        }
+    }
+}
+
+impl fmt::Display for Rank {
+    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+        use Rank::*;
+        let num_str; // early declaration to placate NLL of Number case
+        write!(
+            f,
+            "{}",
+            match *self {
+                Ace => "A",
+                King => "K",
+                Queen => "Q",
+                Jack => "J",
+                Number(n) => {
+                    num_str = n.to_string();
+                    &num_str
+                }
+            }
+        )
+    }
+}
+
+impl PartialOrd for Rank {
+    fn partial_cmp(&self, other: &Rank) -> Option<Ordering> {
+        Some(self.value().cmp(&other.value()))
+    }
+}
+
+#[derive(Debug, PartialEq, Eq, PartialOrd, Clone, Copy)]
+struct Card {
+    rank: Rank,
+    suit: Suit,
+}
+
+impl Card {
+    fn try_from_split(source: &str, split: usize) -> Option<Card> {
+        Some(Card {
+            rank: try_opt!(Rank::try_from(&source[..split])),
+            suit: try_opt!(Suit::try_from(&source[split..])),
+        })
+    }
+
+    fn try_from(source: &str) -> Option<Card> {
+        match source.len() {
+            3 => Card::try_from_split(source, 2),
+            2 => Card::try_from_split(source, 1),
+            _ => None,
+        }
+    }
+}
+
+impl fmt::Display for Card {
+    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+        write!(f, "{}{}", self.rank, self.suit)
+    }
+}
+
+#[derive(Debug, PartialEq, Eq, PartialOrd, Ord)]
+enum PokerHand {
+    HighCard,
+    OnePair,
+    TwoPair,
+    ThreeOfAKind,
+    Straight,
+    Flush,
+    FullHouse,
+    FourOfAKind,
+    StraightFlush,
+}
+
+impl PokerHand {
+    fn is_ace_low_straight(cards: &[Card]) -> bool {
+        // special case: ace-low straight
+        // still depends on the sorted precondition
+        cards[0].rank.value() == 2 && cards[4].rank == Rank::Ace &&
+            cards
+                .windows(2)
+                .take(3) // (0, 1), (1, 2), (2, 3) --> skips 4, ace
+                .map(|pair| pair[1].rank.value() - pair[0].rank.value())
+                .all(|diff| diff == 1)
+    }
+
+    fn analyze(cards: &[Card]) -> Option<PokerHand> {
+        if cards.len() == 5 {
+            let suit_counter = Counter::init(cards.iter().map(|c| c.suit));
+            let is_flush = suit_counter
+                .most_common()
+                .map(|(_suit, count)| count)
+                .next() == Some(5);
+            // Note that `is_straight` depends on a precondition: it only works
+            // if the input `cards` are sorted by rank value ascending.
+            let is_straight = cards
+                .windows(2)
+                .map(|pair| pair[1].rank.value() - pair[0].rank.value())
+                .all(|diff| diff == 1) ||
+                PokerHand::is_ace_low_straight(cards);
+
+            if is_flush && is_straight {
+                return Some(PokerHand::StraightFlush);
+            }
+
+            let rank_counter = Counter::init(cards.iter().map(|c| c.rank));
+            let mut rc_iter = rank_counter.most_common().map(|(_rank, count)| count);
+            let rc_most = rc_iter.next();
+            let rc_second = rc_iter.next();
+
+            if rc_most == Some(4) {
+                return Some(PokerHand::FourOfAKind);
+            }
+            if rc_most == Some(3) && rc_second == Some(2) {
+                return Some(PokerHand::FullHouse);
+            }
+            if is_flush {
+                return Some(PokerHand::Flush);
+            }
+            if is_straight {
+                return Some(PokerHand::Straight);
+            }
+            if rc_most == Some(3) {
+                return Some(PokerHand::ThreeOfAKind);
+            }
+            if rc_most == Some(2) && rc_second == Some(2) {
+                return Some(PokerHand::TwoPair);
+            }
+            if rc_most == Some(2) {
+                return Some(PokerHand::OnePair);
+            }
+            Some(PokerHand::HighCard)
+        } else {
+            None
+        }
+    }
+}
+
+#[derive(Debug, PartialEq, Eq)]
+struct Hand<'a> {
+    source: &'a str,
+    cards: [Card; 5],
+    hand_type: PokerHand,
+}
+
+impl<'a> Hand<'a> {
+    fn try_from(source: &'a str) -> Option<Hand> {
+        let mut cards = try_opt!(
+            source
+                .split_whitespace()
+                .map(|s| Card::try_from(s))
+                .collect::<Option<Vec<Card>>>()
+        );
+        cards.sort_by(|a, b| a.partial_cmp(b).unwrap_or(Ordering::Less));
+        if cards.len() == 5 {
+            Some(Hand {
+                source: source,
+                cards: [cards[0], cards[1], cards[2], cards[3], cards[4]],
+                hand_type: try_opt!(PokerHand::analyze(&cards)),
+            })
+        } else {
+            None
+        }
+    }
+
+    fn cmp_high_card(&self, other: &Hand, card: usize) -> Ordering {
+        let mut ordering = self.cards[card].rank.value().cmp(
+            &other.cards[card].rank.value(),
+        );
+        if card != 0 {
+            ordering = ordering.then_with(|| self.cmp_high_card(other, card - 1));
+        }
+        ordering
+    }
+
+    fn value_by_frequency(&self) -> (Option<Rank>, Option<Rank>, Option<Rank>) {
+        let rank_counter = Counter::init(self.cards.iter().map(|c| c.rank));
+        let mut rc_iter = rank_counter
+            .most_common_tiebreaker(|a, b| b.partial_cmp(a).unwrap_or(Ordering::Less))
+            .map(|(rank, _count)| rank);
+        (rc_iter.next(), rc_iter.next(), rc_iter.next())
+    }
+
+    fn cmp_cascade_by_freq(&self, other: &Hand) -> Ordering {
+        let (s1, s2, s3) = self.value_by_frequency();
+        let (o1, o2, o3) = other.value_by_frequency();
+        s1.partial_cmp(&o1)
+            .map(|c| {
+                c.then(
+                    s2.partial_cmp(&o2)
+                        .map(|c2| c2.then(s3.partial_cmp(&o3).unwrap_or(Ordering::Equal)))
+                        .unwrap_or(Ordering::Equal),
+                )
+            })
+            .unwrap_or(Ordering::Equal)
+    }
+
+    fn cmp_straight(&self, other: &Hand) -> Ordering {
+        let s = if PokerHand::is_ace_low_straight(&self.cards) {
+            5
+        } else {
+            self.cards[4].rank.value()
+        };
+        let o = if PokerHand::is_ace_low_straight(&other.cards) {
+            5
+        } else {
+            other.cards[4].rank.value()
+        };
+        s.cmp(&o)
+    }
+}
+
+impl<'a> fmt::Display for Hand<'a> {
+    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+        write!(f, "{}", self.source)
+    }
+}
+
+impl<'a> PartialOrd for Hand<'a> {
+    fn partial_cmp(&self, other: &Hand) -> Option<Ordering> {
+        Some(self.hand_type.cmp(&other.hand_type).then_with(|| {
+            use PokerHand::*;
+            match self.hand_type {
+                HighCard => self.cmp_high_card(other, 4),
+                OnePair => self.cmp_cascade_by_freq(other),
+                TwoPair => self.cmp_cascade_by_freq(other),
+                ThreeOfAKind => self.cmp_cascade_by_freq(other),
+                Straight => self.cmp_straight(other),
+                Flush => self.cmp_high_card(other, 4),
+                FullHouse => self.cmp_cascade_by_freq(other),
+                FourOfAKind => self.cmp_cascade_by_freq(other),
+                StraightFlush => self.cmp_straight(other),
+            }
+        }))
+    }
+}