trackler 2.2.1.62 → 2.2.1.63

data/tracks/python/exercises/simple-linked-list/example.py

@@ -0,0 +1,67 @@
+class Node(object):
+    def __init__(self, value):
+        self._value = value
+        self._next = None
+
+    def value(self):
+        return self._value
+
+    def next(self):
+        return self._next
+
+
+class LinkedIterator(object):
+    def __init__(self, linked_list):
+        self.current = linked_list._head
+
+    def __iter__(self):
+        return self
+
+    def __next__(self):
+        if self.current is None:
+            raise StopIteration
+        value = self.current.value()
+        self.current = self.current.next()
+        return value
+
+    def next(self):
+        return self.__next__()
+
+
+class LinkedList(object):
+    def __init__(self, values=[]):
+        self._head = None
+        self._len = 0
+        [self.push(v) for v in values]
+
+    def __iter__(self):
+        return LinkedIterator(self)
+
+    def __len__(self):
+        return self._len
+
+    def head(self):
+        if self._head is None:
+            raise EmptyListException()
+        return self._head
+
+    def push(self, value):
+        newNode = Node(value)
+        newNode._next = self._head
+        self._head = newNode
+        self._len += 1
+
+    def pop(self):
+        if self._head is None:
+            raise EmptyListException()
+        self._len -= 1
+        ret = self._head.value()
+        self._head = self._head.next()
+        return ret
+
+    def reversed(self):
+        return LinkedList(self)
+
+
+class EmptyListException(Exception):
+    pass

data/tracks/python/exercises/simple-linked-list/hints.md

@@ -0,0 +1,10 @@
+## Hints
+
+To support `list()`, see [implementing an iterator for a class.](https://docs.python.org/3/tutorial/classes.html#iterators)
+
+Additionally, note that Python2's `next()` has been replaced by `__next__()` in Python3. For dual compatibility, `next()` can be implemented as:
+
+```Python
+def next(self):
+    return self.__next__()
+```

data/tracks/python/exercises/simple-linked-list/simple_linked_list.py

@@ -0,0 +1,33 @@
+class Node(object):
+    def __init__(self, value):
+        pass
+
+    def value(self):
+        pass
+
+    def next(self):
+        pass
+
+
+class LinkedList(object):
+    def __init__(self, values=[]):
+        pass
+
+    def __len__(self):
+        pass
+
+    def head(self):
+        pass
+
+    def push(self, value):
+        pass
+
+    def pop(self):
+        pass
+
+    def reversed(self):
+        pass
+
+
+class EmptyListException(Exception):
+    pass

data/tracks/python/exercises/simple-linked-list/simple_linked_list_test.py

@@ -0,0 +1,112 @@
+import unittest
+
+from simple_linked_list import LinkedList, EmptyListException
+
+
+# No canonical data available for this exercise
+
+class LinkedListTest(unittest.TestCase):
+    def test_empty_list_has_len_zero(self):
+        sut = LinkedList()
+        self.assertEqual(len(sut), 0)
+
+    def test_singleton_list_has_len_one(self):
+        sut = LinkedList([1])
+        self.assertEqual(len(sut), 1)
+
+    def test_non_empty_list_has_correct_len(self):
+        sut = LinkedList([1, 2, 3])
+        self.assertEqual(len(sut), 3)
+
+    def test_error_on_empty_list_head(self):
+        sut = LinkedList()
+        with self.assertRaises(EmptyListException):
+            sut.head()
+
+    def test_singleton_list_has_head(self):
+        sut = LinkedList([1])
+        self.assertEqual(sut.head().value(), 1)
+
+    def test_non_empty_list_has_correct_head(self):
+        sut = LinkedList([1, 2])
+        self.assertEqual(sut.head().value(), 2)
+
+    def test_can_push_to_non_empty_list(self):
+        sut = LinkedList([1, 2, 3])
+        sut.push(4)
+        self.assertEqual(len(sut), 4)
+
+    def test_pushing_to_empty_list_changes_head(self):
+        sut = LinkedList()
+        sut.push(5)
+        self.assertEqual(len(sut), 1)
+        self.assertEqual(sut.head().value(), 5)
+
+    def test_can_from_non_empty_list(self):
+        sut = LinkedList([3, 4, 5])
+        self.assertEqual(sut.pop(), 5)
+        self.assertEqual(len(sut), 2)
+        self.assertEqual(sut.head().value(), 4)
+
+    def test_pop_from_singleton_list_removes_head(self):
+        sut = LinkedList([1])
+        self.assertEqual(sut.pop(), 1)
+        with self.assertRaises(EmptyListException):
+            sut.head()
+
+    def test_error_on_empty_list_pop(self):
+        sut = LinkedList()
+        with self.assertRaises(EmptyListException):
+            sut.pop()
+
+    def test_push_and_pop(self):
+        sut = LinkedList([1, 2])
+        sut.push(3)
+        self.assertEqual(len(sut), 3)
+        self.assertEqual(sut.pop(), 3)
+        self.assertEqual(sut.pop(), 2)
+        self.assertEqual(sut.pop(), 1)
+        self.assertEqual(len(sut), 0)
+        sut.push(4)
+        self.assertEqual(len(sut), 1)
+        self.assertEqual(sut.head().value(), 4)
+
+    def test_singleton_list_head_has_no_next(self):
+        sut = LinkedList([1])
+        self.assertIsNone(sut.head().next())
+
+    def test_non_empty_list_traverse(self):
+        sut = LinkedList(range(10))
+        current = sut.head()
+        for i in range(10):
+            self.assertEqual(current.value(), 9 - i)
+            current = current.next()
+        self.assertIsNone(current)
+
+    def test_empty_linked_list_to_list_is_empty(self):
+        sut = LinkedList()
+        self.assertEqual(list(sut), [])
+
+    def test_singleton_linked_list_to_list_list_with_singular_element(self):
+        sut = LinkedList([1])
+        self.assertEqual(list(sut), [1])
+
+    def test_non_empty_linked_list_to_list_is_list_with_all_elements(self):
+        sut = LinkedList([1, 2, 3])
+        self.assertEqual(list(sut), [3, 2, 1])
+
+    def test_reversed_empty_list_is_empty_list(self):
+        sut = LinkedList([])
+        self.assertEqual(list(sut.reversed()), [])
+
+    def test_reversed_singleton_list_is_same_list(self):
+        sut = LinkedList([1])
+        self.assertEqual(list(sut.reversed()), [1])
+
+    def test_reverse_non_empty_list(self):
+        sut = LinkedList([1, 2, 3])
+        self.assertEqual(list(sut.reversed()), [1, 2, 3])
+
+
+if __name__ == '__main__':
+    unittest.main()

data/tracks/rust/README.md

@@ -66,6 +66,8 @@ Please see the documentation about [adding new exercises](https://github.com/exe
 
 Note that:
 
+- The simplest way to generate a project template is to run `bin/init_exercise.py`. You'll need a Python installation >= 3.5 in order to run this script, but it will automate most of the following points for you.
+
 - Each exercise must stand on its own. Do not reference files outside the exercise directory. They will not be included when the user fetches the exercise.
 
 - Exercises must conform to the Exercism-wide standards described in [the documentation](https://github.com/exercism/docs/tree/master/language-tracks/exercises).