trackler 2.2.1.71 → 2.2.1.72

data/tracks/rust/exercises/macros/.gitignore

@@ -0,0 +1,3 @@
+# Ignore Cargo.lock if creating a library
+# More information here http://doc.crates.io/guide.html#cargotoml-vs-cargolock
+Cargo.lock

data/tracks/rust/exercises/macros/.meta/description.md

@@ -0,0 +1,29 @@
+Macros are a powerful part of a Rust programmer's toolkit, and [macros by example](https://doc.rust-lang.org/reference/macros-by-example.html) are a relatively simple way to access this power. Let's write one!
+
+## Context
+
+What is a macro? [Wikipedia](https://en.wikipedia.org/wiki/Macro_(computer_science)) describes it thus:
+
+> A macro (short for "macroinstruction", from Greek μακρός 'long') in computer science is a rule or pattern that specifies how a certain input sequence (often a sequence of characters) should be mapped to a replacement output sequence (also often a sequence of characters) according to a defined procedure. The mapping process that instantiates (transforms) a macro use into a specific sequence is known as macro expansion.
+
+Illuminating! But to be more concrete, macros are a special syntax which allows you to generate code at compile time. Macros can be used compile-time calculation, but more often they're just another way to abstract your code. For example, you've probably already used `println!()` and `vec![]`. These each take an arbitrary number of arguments, so you can't express them as simple functions. On the other hand, they always expand to some amount of absolutely standard Rust code. If you're interested, you can use the [cargo expand](https://github.com/dtolnay/cargo-expand) subcommand to view the results of macro expansion in your code.
+
+For further information about macros in Rust, The Rust Book has a [good chapter](https://doc.rust-lang.org/book/first-edition/macros.html) on them.
+
+## Problem Statement
+
+You can produce a `Vec` of arbitrary length inline by using the `vec![]` macro. However, Rust doesn't come with a way to produce a [`HashMap`](https://doc.rust-lang.org/std/collections/struct.HashMap.html) inline. Rectify this by writing a `hashmap!()` macro.
+
+For example, a user of your library might write `hashmap!('a' => 3, 'b' => 11, 'z' => 32)`. This should expand to the following code:
+
+```rust
+{
+   let mut hm = HashMap::new();
+   hm.insert('a', 3);
+   hm.insert('b', 11);
+   hm.insert('z', 32);
+   hm
+}
+```
+
+Note that the [`maplit` crate](https://crates.io/crates/maplit) provides a macro which perfectly solves this exercise. Please implement your own solution instead of using this crate; please make an attempt on your own before viewing its source.

data/tracks/rust/exercises/macros/.meta/metadata.yml

@@ -0,0 +1,3 @@
+---
+blurb: "Implement a macro using macros-by-example"
+source: "Peter Goodspeed-Niklaus"

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

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

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

@@ -0,0 +1,70 @@
+# Macros
+
+Macros are a powerful part of a Rust programmer's toolkit, and [macros by example](https://doc.rust-lang.org/reference/macros-by-example.html) are a relatively simple way to access this power. Let's write one!
+
+## Context
+
+What is a macro? [Wikipedia](https://en.wikipedia.org/wiki/Macro_(computer_science)) describes it thus:
+
+> A macro (short for "macroinstruction", from Greek μακρός 'long') in computer science is a rule or pattern that specifies how a certain input sequence (often a sequence of characters) should be mapped to a replacement output sequence (also often a sequence of characters) according to a defined procedure. The mapping process that instantiates (transforms) a macro use into a specific sequence is known as macro expansion.
+
+Illuminating! But to be more concrete, macros are a special syntax which allows you to generate code at compile time. Macros can be used compile-time calculation, but more often they're just another way to abstract your code. For example, you've probably already used `println!()` and `vec![]`. These each take an arbitrary number of arguments, so you can't express them as simple functions. On the other hand, they always expand to some amount of absolutely standard Rust code. If you're interested, you can use the [cargo expand](https://github.com/dtolnay/cargo-expand) subcommand to view the results of macro expansion in your code.
+
+For further information about macros in Rust, The Rust Book has a [good chapter](https://doc.rust-lang.org/book/first-edition/macros.html) on them.
+
+## Problem Statement
+
+You can produce a `Vec` of arbitrary length inline by using the `vec![]` macro. However, Rust doesn't come with a way to produce a [`HashMap`](https://doc.rust-lang.org/std/collections/struct.HashMap.html) inline. Rectify this by writing a `hashmap!()` macro.
+
+For example, a user of your library might write `hashmap!('a' => 3, 'b' => 11, 'z' => 32)`. This should expand to the following code:
+
+```rust
+{
+   let mut hm = HashMap::new();
+   hm.insert('a', 3);
+   hm.insert('b', 11);
+   hm.insert('z', 32);
+   hm
+}
+```
+
+Note that the [`maplit` crate](https://crates.io/crates/maplit) provides a macro which perfectly solves this exercise. Please implement your own solution instead of using this crate; please make an attempt on your own before viewing its source.
+
+## 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 [Modules](https://doc.rust-lang.org/book/second-edition/ch07-00-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
+[modules]: https://doc.rust-lang.org/book/second-edition/ch07-00-modules.html
+[cargo]: https://doc.rust-lang.org/book/second-edition/ch14-00-more-about-cargo.html
+
+## Source
+
+Peter Goodspeed-Niklaus
+
+## 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/macros/example.rs

@@ -0,0 +1,16 @@
+// Ignoring the README's injunction, this is heavily based on the implementation from maplit.
+// Original source is at https://github.com/bluss/maplit/blob/master/src/lib.rs#L27-L60
+
+#[macro_export]
+macro_rules! hashmap {
+    ($($key:expr => $value:expr,)+) => { hashmap!($($key => $value),+) };
+    ($($key:expr => $value:expr),*) => {
+        {
+            let mut _map = ::std::collections::HashMap::new();
+            $(
+                _map.insert($key, $value);
+            )*
+            _map
+        }
+    };
+}

data/tracks/rust/exercises/macros/src/lib.rs

@@ -0,0 +1,6 @@
+#[macro_export]
+macro_rules! hashmap {
+    () => {
+        unimplemented!()
+    };
+}

data/tracks/rust/exercises/macros/tests/macros.rs

@@ -0,0 +1,62 @@
+#[macro_use]
+extern crate macros;
+
+use std::collections::HashMap;
+
+#[test]
+fn test_empty() {
+    let expected: HashMap<usize, usize> = HashMap::new();
+    let computed: HashMap<usize, usize> = hashmap!();
+    assert_eq!(computed, expected);
+}
+
+#[test]
+#[ignore]
+fn test_no_trailing_comma() {
+    let mut expected = HashMap::new();
+    expected.insert(1, "one");
+    expected.insert(2, "two");
+    assert_eq!(hashmap!(1 => "one", 2 => "two"), expected);
+}
+
+#[test]
+#[ignore]
+fn test_trailing_comma() {
+    let mut expected = HashMap::new();
+    expected.insert('h', 89);
+    expected.insert('a', 1);
+    expected.insert('s', 19);
+    expected.insert('h', 8);
+    assert_eq!(
+        hashmap!(
+            'h' => 89,
+            'a' => 1,
+            's' => 19,
+            'h' => 8,
+        ),
+        expected
+    );
+}
+
+#[test]
+#[ignore]
+fn test_nested() {
+    let mut expected = HashMap::new();
+    expected.insert("non-empty", {
+        let mut subhashmap = HashMap::new();
+        subhashmap.insert(23, 623);
+        subhashmap.insert(34, 21);
+        subhashmap
+    });
+    expected.insert("empty", HashMap::new());
+    assert_eq!(
+        hashmap!(
+            "non-empty" => hashmap!(
+                23 => 623,
+                34 => 21
+            ),
+            "empty" => hashmap!()
+        ),
+        expected
+    );
+}

data/tracks/rust/exercises/simple-linked-list/.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/simple-linked-list/.meta/hints.md

@@ -0,0 +1,34 @@
+## Implementation Hints
+
+Do not implement the struct `SimpleLinkedList` as a wrapper around a `Vec`. Instead, allocate nodes on the heap.  
+This might be implemented as:
+```
+pub struct SimpleLinkedList<T> {
+    head: Option<Box<Node<T>>>,
+}
+```
+The `head` field points to the first element (Node) of this linked list.  
+This implementation also requires a struct `Node` with the following fields:
+```
+struct Node<T> {
+    data: T,
+    next: Option<Box<Node<T>>>,
+}
+```
+`data` contains the stored data, and `next` points to the following node (if available) or None.  
+
+### Why Option<__Box__<Node<T>>> and not just Option<Node<T>>?
+Try it on your own. You will get the following error.
+
+```
+| struct Node<T>
+| ^^^^^^^^^^^^^^ recursive type has infinite size
+...
+|     next: Option<Node<T>>,
+|     --------------------- recursive without indirection
+ ```
+ 
+ The problem is that at compile time the size of next must be known.
+ Since `next` is recursive ("a node has a node has a node..."), the compiler does not know how much memory is to be allocated.
+ In contrast, [Box](https://doc.rust-lang.org/std/boxed/) is a heap pointer with a defined size.
+ 

data/tracks/rust/exercises/simple-linked-list/Cargo.toml

@@ -0,0 +1,5 @@
+[package]
+name = "simple_linked_list"
+version = "0.1.0"
+
+[dependencies]

data/tracks/rust/exercises/simple-linked-list/README.md

@@ -0,0 +1,96 @@
+# Simple Linked List
+
+Write a simple linked list implementation that uses Elements and a List.
+
+The linked list is a fundamental data structure in computer science,
+often used in the implementation of other data structures. They're
+pervasive in functional programming languages, such as Clojure, Erlang,
+or Haskell, but far less common in imperative languages such as Ruby or
+Python.
+
+The simplest kind of linked list is a singly linked list. Each element in the
+list contains data and a "next" field pointing to the next element in the list
+of elements.
+
+This variant of linked lists is often used to represent sequences or
+push-down stacks (also called a LIFO stack; Last In, First Out).
+
+As a first take, lets create a singly linked list to contain the range (1..10),
+and provide functions to reverse a linked list and convert to and from arrays.
+
+When implementing this in a language with built-in linked lists,
+implement your own abstract data type.
+
+## Implementation Hints
+
+Do not implement the struct `SimpleLinkedList` as a wrapper around a `Vec`. Instead, allocate nodes on the heap.  
+This might be implemented as:
+```
+pub struct SimpleLinkedList<T> {
+    head: Option<Box<Node<T>>>,
+}
+```
+The `head` field points to the first element (Node) of this linked list.  
+This implementation also requires a struct `Node` with the following fields:
+```
+struct Node<T> {
+    data: T,
+    next: Option<Box<Node<T>>>,
+}
+```
+`data` contains the stored data, and `next` points to the following node (if available) or None.  
+
+### Why Option<__Box__<Node<T>>> and not just Option<Node<T>>?
+Try it on your own. You will get the following error.
+
+```
+| struct Node<T>
+| ^^^^^^^^^^^^^^ recursive type has infinite size
+...
+|     next: Option<Node<T>>,
+|     --------------------- recursive without indirection
+ ```
+ 
+ The problem is that at compile time the size of next must be known.
+ Since `next` is recursive ("a node has a node has a node..."), the compiler does not know how much memory is to be allocated.
+ In contrast, [Box](https://doc.rust-lang.org/std/boxed/) is a heap pointer with a defined size.
+ 
+
+## 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 [Modules](https://doc.rust-lang.org/book/second-edition/ch07-00-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
+[modules]: https://doc.rust-lang.org/book/second-edition/ch07-00-modules.html
+[cargo]: https://doc.rust-lang.org/book/second-edition/ch14-00-more-about-cargo.html
+
+## Source
+
+Inspired by 'Data Structures and Algorithms with Object-Oriented Design Patterns in Ruby', singly linked-lists. [http://www.brpreiss.com/books/opus8/html/page96.html#SECTION004300000000000000000](http://www.brpreiss.com/books/opus8/html/page96.html#SECTION004300000000000000000)
+
+## 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/simple-linked-list/example.rs

@@ -0,0 +1,87 @@
+pub struct SimpleLinkedList<T> {
+    head: Option<Box<Node<T>>>,
+    len: usize,
+}
+
+struct Node<T> {
+    data: T,
+    next: Option<Box<Node<T>>>,
+}
+
+
+impl<T> SimpleLinkedList<T> {
+    pub fn new() -> Self {
+        SimpleLinkedList { head: None, len: 0 }
+    }
+
+    pub fn len(&self) -> usize {
+        self.len
+    }
+
+    pub fn push(&mut self, element: T) {
+        let node = Box::new(Node::new(element, self.head.take()));
+        self.head = Some(node);
+        self.len += 1;
+    }
+
+    pub fn pop(&mut self) -> Option<T> {
+        match self.len {
+            0 => None,
+            _ => {
+                self.len -= 1;
+                self.head.take().map(|node| {
+                    let node = *node;
+                    self.head = node.next;
+                    node.data
+                })
+            }
+        }
+    }
+
+    pub fn peek(&self) -> Option<&T> {
+        self.head.as_ref().map(|node| &node.data)
+    }
+}
+
+impl<T: Clone> SimpleLinkedList<T> {
+    pub fn rev(&self) -> SimpleLinkedList<T> {
+        let mut rev_list = SimpleLinkedList::new();
+        let mut next = self.head.as_ref().map(|node| &**node);
+        while let Some(node) = next {
+            rev_list.push(node.data.clone());
+            next = node.next.as_ref().map(|node| &**node);
+        }
+        rev_list
+    }
+}
+
+
+impl<'a, T: Clone> From<&'a [T]> for SimpleLinkedList<T> {
+    fn from(item: &[T]) -> Self {
+        let mut list = SimpleLinkedList::new();
+        for i in item {
+            list.push(i.clone());
+        }
+        list
+    }
+}
+
+impl<T> Into<Vec<T>> for SimpleLinkedList<T> {
+    fn into(mut self) -> Vec<T> {
+        let mut vec = Vec::new();
+        while let Some(data) = self.pop() {
+            vec.push(data);
+        }
+        vec.reverse();
+        vec
+    }
+}
+
+impl<T> Node<T> {
+    pub fn new(element: T, next: Option<Box<Node<T>>>) -> Self {
+        Node {
+            data: element,
+            next,
+        }
+    }
+}

data/tracks/rust/exercises/simple-linked-list/src/lib.rs

@@ -0,0 +1,46 @@
+pub struct SimpleLinkedList<T> {
+    // Delete this field
+    // _dummy is needed to avoid unused parameter error during compilation
+    _dummy: T,
+}
+
+impl<T> SimpleLinkedList<T> {
+    pub fn new() -> Self {
+        unimplemented!()
+    }
+
+    pub fn len(&self) -> usize {
+        unimplemented!()
+    }
+
+    pub fn push(&mut self, element: T) {
+        unimplemented!()
+    }
+
+    pub fn pop(&mut self) -> Option<T> {
+        unimplemented!()
+    }
+
+    pub fn peek(&self) -> Option<&T> {
+        unimplemented!()
+    }
+}
+
+impl<T: Clone> SimpleLinkedList<T> {
+    pub fn rev(&self) -> SimpleLinkedList<T> {
+        unimplemented!()
+    }
+}
+
+
+impl<'a, T: Clone> From<&'a [T]> for SimpleLinkedList<T> {
+    fn from(item: &[T]) -> Self {
+        unimplemented!()
+    }
+}
+
+impl<T> Into<Vec<T>> for SimpleLinkedList<T> {
+    fn into(mut self) -> Vec<T> {
+        unimplemented!()
+    }
+}