6 files changed, 394 insertions, 0 deletions

diff --git a/dot-dsl/.exercism/metadata.json b/dot-dsl/.exercism/metadata.json
new file mode 100644
index 0000000..5399056
--- /dev/null
+++ b/dot-dsl/.exercism/metadata.json
@@ -0,0 +1 @@
+{"track":"rust","exercise":"dot-dsl","id":"57ca2e502fdf482aa52e91c4f4f7f51e","url":"https://exercism.io/my/solutions/57ca2e502fdf482aa52e91c4f4f7f51e","handle":"dyamon","is_requester":true,"auto_approve":false}
\ No newline at end of file
diff --git a/dot-dsl/.gitignore b/dot-dsl/.gitignore
new file mode 100644
index 0000000..db7f315
--- /dev/null
+++ b/dot-dsl/.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
diff --git a/dot-dsl/Cargo.toml b/dot-dsl/Cargo.toml
new file mode 100644
index 0000000..3da0d67
--- /dev/null
+++ b/dot-dsl/Cargo.toml
@@ -0,0 +1,7 @@
+[package]
+edition = "2018"
+name = "dot-dsl"
+version = "0.1.0"
+
+[dependencies]
+maplit = "1.0.1"
diff --git a/dot-dsl/README.md b/dot-dsl/README.md
new file mode 100644
index 0000000..29e0e7a
--- /dev/null
+++ b/dot-dsl/README.md
@@ -0,0 +1,121 @@
+# DOT DSL
+
+A [Domain Specific Language (DSL)](https://en.wikipedia.org/wiki/Domain-specific_language) is a
+small language optimized for a specific domain. Since a DSL is
+targeted, it can greatly impact productivity/understanding by allowing the
+writer to declare *what* they want rather than *how*.
+
+One problem area where they are applied are complex customizations/configurations.
+
+For example the [DOT language](https://en.wikipedia.org/wiki/DOT_(graph_description_language)) allows
+you to write a textual description of a graph which is then transformed into a picture by one of
+the [Graphviz](http://graphviz.org/) tools (such as `dot`). A simple graph looks like this:
+
+    graph {
+        graph [bgcolor="yellow"]
+        a [color="red"]
+        b [color="blue"]
+        a -- b [color="green"]
+    }
+
+Putting this in a file `example.dot` and running `dot example.dot -T png
+-o example.png` creates an image `example.png` with red and blue circle
+connected by a green line on a yellow background.
+
+Write a Domain Specific Language similar to the Graphviz dot language.
+
+Our DSL is similar to the Graphviz dot language in that our DSL will be used
+to create graph data structures. However, unlike the DOT Language, our DSL will
+be an internal DSL for use only in our language.
+
+More information about the difference between internal and external DSLs can be
+found [here](https://martinfowler.com/bliki/DomainSpecificLanguage.html).
+
+## Builder pattern
+
+This exercise expects you to build several structs using `builder pattern`.
+In short, this pattern allows you to split the construction function of your struct, that contains a lot of arguments, into 
+several separate functions. This approach gives you the means to make compact but highly-flexible struct construction and
+configuration.
+You can read more about it on the [following page](https://doc.rust-lang.org/1.0.0/style/ownership/builders.html).
+
+
+## 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
+
+Wikipedia [https://en.wikipedia.org/wiki/DOT_(graph_description_language)](https://en.wikipedia.org/wiki/DOT_(graph_description_language))
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.
diff --git a/dot-dsl/src/lib.rs b/dot-dsl/src/lib.rs
new file mode 100644
index 0000000..654ee09
--- /dev/null
+++ b/dot-dsl/src/lib.rs
@@ -0,0 +1,119 @@
+pub mod graph {
+
+    use graph_items::edge::Edge;
+    use graph_items::node::Node;
+    use std::collections::HashMap;
+
+    pub mod graph_items {
+
+        pub mod node {
+
+            use std::collections::HashMap;
+
+            #[derive(Default, Debug, PartialEq, Eq, Clone)]
+            pub struct Node<'a> {
+                pub name: &'a str,
+                attrs: HashMap<String, String>,
+            }
+
+            impl<'a> Node<'a> {
+                pub fn new(name: &'a str) -> Node<'a> {
+                    Node {
+                        name,
+                        ..Default::default()
+                    }
+                }
+
+                pub fn with_attrs(mut self, attrs: &[(&'a str, &'a str)]) -> Node<'a> {
+                    for (key, value) in attrs {
+                        self.attrs.insert(key.to_string(), value.to_string());
+                    }
+                    self
+                }
+
+                pub fn get_attr(&self, key: &str) -> Option<&str> {
+                    self.attrs.get(key).map(|s| &s[..])
+                }
+            }
+        }
+
+        pub mod edge {
+
+            use std::collections::HashMap;
+
+            #[derive(Default, Debug, PartialEq, Eq, Clone)]
+            pub struct Edge<'a> {
+                pub x: &'a str,
+                pub y: &'a str,
+                attrs: HashMap<String, String>,
+            }
+
+            impl<'a> Edge<'a> {
+                pub fn new(x: &'a str, y: &'a str) -> Edge<'a> {
+                    Edge {
+                        x,
+                        y,
+                        ..Default::default()
+                    }
+                }
+
+                pub fn with_attrs(mut self, attrs: &[(&'a str, &'a str)]) -> Edge<'a> {
+                    for (key, value) in attrs {
+                        self.attrs.insert(key.to_string(), value.to_string());
+                    }
+                    self
+                }
+
+                pub fn get_attr(&self, key: &str) -> Option<&str> {
+                    self.attrs.get(key).map(|s| &s[..])
+                }
+            }
+        }
+    }
+
+    #[derive(Default, Debug)]
+    pub struct Graph<'a> {
+        pub nodes: Vec<Node<'a>>,
+        pub edges: Vec<Edge<'a>>,
+        pub attrs: HashMap<String, String>,
+    }
+
+    impl<'a> Graph<'a> {
+        pub fn new() -> Self {
+            Default::default()
+        }
+
+        pub fn with_attrs(mut self, attrs: &[(&'a str, &'a str)]) -> Graph<'a> {
+            for (key, value) in attrs {
+                self.attrs.insert(key.to_string(), value.to_string());
+            }
+            self
+        }
+
+        pub fn with_nodes(mut self, nodes: &[Node<'a>]) -> Graph<'a> {
+            for node in nodes {
+                self.nodes.push(node.clone());
+            }
+            self
+        }
+
+        pub fn with_edges(mut self, edges: &[Edge<'a>]) -> Graph<'a> {
+            for edge in edges {
+                self.edges.push(edge.clone())
+            }
+            self
+        }
+
+        pub fn get_node(&self, name: &str) -> Option<&Node<'a>> {
+            self.nodes.iter().find(|&node| node.name == name)
+        }
+
+        pub fn get_edge(&self, x: &str, y: &str) -> Option<&Edge<'a>> {
+            self.edges.iter().find(|&edge| edge.x == x && edge.y == y)
+        }
+
+        pub fn get_attr(&self, key: &str) -> Option<&str> {
+            self.attrs.get(key).map(|s| &s[..])
+        }
+    }
+}
diff --git a/dot-dsl/tests/dot-dsl.rs b/dot-dsl/tests/dot-dsl.rs
new file mode 100644
index 0000000..ae469b7
--- /dev/null
+++ b/dot-dsl/tests/dot-dsl.rs
@@ -0,0 +1,138 @@
+use dot_dsl::graph::graph_items::edge::Edge;
+use dot_dsl::graph::graph_items::node::Node;
+use dot_dsl::graph::Graph;
+use maplit::hashmap;
+
+#[test]
+fn test_empty_graph() {
+    let graph = Graph::new();
+
+    assert!(graph.nodes.is_empty());
+
+    assert!(graph.edges.is_empty());
+
+    assert!(graph.attrs.is_empty());
+}
+
+#[test]
+fn test_graph_with_one_node() {
+    let nodes = vec![Node::new("a")];
+
+    let graph = Graph::new().with_nodes(&nodes);
+
+    assert!(graph.edges.is_empty());
+
+    assert!(graph.attrs.is_empty());
+
+    assert_eq!(graph.nodes, vec![Node::new("a")]);
+}
+
+#[test]
+fn test_graph_with_one_node_with_keywords() {
+    let nodes = vec![Node::new("a").with_attrs(&[("color", "green")])];
+
+    let graph = Graph::new().with_nodes(&nodes);
+
+    assert!(graph.edges.is_empty());
+
+    assert!(graph.attrs.is_empty());
+
+    assert_eq!(
+        graph.nodes,
+        vec![Node::new("a").with_attrs(&[("color", "green")])]
+    );
+}
+
+#[test]
+fn test_graph_with_one_edge() {
+    let edges = vec![Edge::new("a", "b")];
+
+    let graph = Graph::new().with_edges(&edges);
+
+    assert!(graph.nodes.is_empty());
+
+    assert!(graph.attrs.is_empty());
+
+    assert_eq!(graph.edges, vec![Edge::new("a", "b")]);
+}
+
+#[test]
+fn test_graph_with_one_attribute() {
+    let graph = Graph::new().with_attrs(&[("foo", "1")]);
+
+    let expected_attrs = hashmap! {
+        "foo".to_string() => "1".to_string(),
+    };
+
+    assert!(graph.nodes.is_empty());
+
+    assert!(graph.edges.is_empty());
+
+    assert_eq!(graph.attrs, expected_attrs);
+}
+
+#[test]
+fn test_graph_with_attributes() {
+    let nodes = vec![
+        Node::new("a").with_attrs(&[("color", "green")]),
+        Node::new("c"),
+        Node::new("b").with_attrs(&[("label", "Beta!")]),
+    ];
+
+    let edges = vec![
+        Edge::new("b", "c"),
+        Edge::new("a", "b").with_attrs(&[("color", "blue")]),
+    ];
+
+    let attrs = vec![("foo", "1"), ("title", "Testing Attrs"), ("bar", "true")];
+
+    let expected_attrs = hashmap! {
+        "foo".to_string() => "1".to_string(),
+        "title".to_string() => "Testing Attrs".to_string(),
+        "bar".to_string() => "true".to_string(),
+    };
+
+    let graph = Graph::new()
+        .with_nodes(&nodes)
+        .with_edges(&edges)
+        .with_attrs(&attrs);
+
+    assert_eq!(
+        graph.nodes,
+        vec![
+            Node::new("a").with_attrs(&[("color", "green")]),
+            Node::new("c"),
+            Node::new("b").with_attrs(&[("label", "Beta!")]),
+        ]
+    );
+
+    assert_eq!(
+        graph.edges,
+        vec![
+            Edge::new("b", "c"),
+            Edge::new("a", "b").with_attrs(&[("color", "blue")]),
+        ]
+    );
+
+    assert_eq!(graph.attrs, expected_attrs);
+}
+
+#[test]
+fn test_graph_stores_attributes() {
+    let attributes = [("foo", "bar"), ("bat", "baz"), ("bim", "bef")];
+    let graph = Graph::new().with_nodes(
+        &["a", "b", "c"]
+            .iter()
+            .zip(attributes.iter())
+            .map(|(name, &attr)| Node::new(&name).with_attrs(&[attr]))
+            .collect::<Vec<_>>(),
+    );
+
+    assert_eq!(
+        graph
+            .get_node("c")
+            .expect("node must be stored")
+            .get_attr("bim"),
+        Some("bef")
+    );
+}