Structuring as a package and add tests based on puzzle examples

Author: Nani-o

.gitignore

@@ -1 +1,5 @@
 *.pyc
+.pytest_cache
+.tox
+*egg-info
+venv

.travis.yml

@@ -0,0 +1,8 @@
+language: python
+python:
+  - "2.7"
+  - "3.6"
+install:
+  - pip install tox-travis
+script:
+  - tox

README.md

@@ -1,3 +1,5 @@
+[![Build Status](https://travis-ci.org/Nani-o/adventofcode2018.svg?branch=master)](https://travis-ci.org/Nani-o/adventofcode2018)
+
 Advent of code 2018
 ===================
 

aoc/__init__.py

@@ -5,7 +5,7 @@
 from argparse import ArgumentParser
 
 script_path = os.path.dirname(os.path.realpath(__file__))
-input_path = os.path.join(script_path, 'inputs')
+input_path = os.path.join(script_path, '../inputs')
 
 def get_input(day):
     input_file = os.path.join(input_path, "day{}".format(day))
@@ -15,11 +15,11 @@ def get_input(day):
     return puzzle_input
 
 def get_solver(day, part):
-    puzzle_file = "day{}".format(day)
-    puzzle_part_func = "part{}".format(part)
+    submodule_name = "day{}".format(day)
+    function_name = "part{}".format(part)
 
-    puzzle = __import__(name=puzzle_file)
-    solve_func = getattr(puzzle, puzzle_part_func)
+    module = __import__(name="aoc.{}".format(submodule_name))
+    solve_func = getattr(getattr(module, submodule_name), function_name)
     return solve_func
 
 def timeit(func, arg):
@@ -28,7 +28,7 @@ def timeit(func, arg):
     end = time.time()
     elapsed = (end - start) * 1000
     return result, elapsed
-    
+
 def get_message(day, part, solution, elapsed):
     title = "Day {} - part {}".format(day, part)
     title = "{}\n".format(title) + "=" * len(title)
@@ -38,7 +38,7 @@ def get_message(day, part, solution, elapsed):
     message = "{}\n\n{}\n{}\n".format(title, result, time)
     return message
 
-if __name__ == '__main__':
+def main():
     parser = ArgumentParser()
     parser.add_argument('--day', '-d', type=int, help='Day of the puzzle to run')
     parser.add_argument('--part', '-p', type=int, help='Part of the puzzle of the day to run')
@@ -47,6 +47,9 @@ def get_message(day, part, solution, elapsed):
     solve_func = get_solver(args.day, args.part)
     puzzle_input = get_input(args.day)
     solution, elapsed = timeit(solve_func, puzzle_input)
-    
+
     message = get_message(args.day, args.part, solution, elapsed)
     print(message)
+
+if __name__ == '__main__':
+    main()

adventofcode.py renamed to aoc/aoc.py

@@ -1,11 +1,11 @@
 #!/usr/bin/env python
 
 def part1(puzzle_input):
-    frequency_changes = map(int, puzzle_input.split())
+    frequency_changes = list(map(int, puzzle_input.split()))
     return sum(frequency_changes)
 
 def part2(puzzle_input):
-    frequency_changes = map(int, puzzle_input.split())
+    frequency_changes = list(map(int, puzzle_input.split()))
 
     current_frequency_result = 0
     frequency_results = set([current_frequency_result])

day1.py renamed to aoc/day1.py

@@ -0,0 +1,16 @@
+#!/usr/bin/env python
+import os
+from setuptools import setup
+
+setup(
+    name = "aoc",
+    version = "0.0.1",
+    author = "Sofiane Medjkoune",
+    description = ("A simple cli to run advent of code 2018 puzzles"),
+    license = "MIT",
+    keywords = "adventofcode",
+    packages=['aoc'],
+    entry_points = {
+        'console_scripts': ['aoc=aoc.aoc:main'],
+    },
+)

day2.py renamed to aoc/day2.py

@@ -0,0 +1,25 @@
+#!/usr/bin/env python
+
+import pytest
+from aoc.day1 import part1, part2
+
+test_inputs = [
+    "+1\n-2\n+3\n+1",
+    "+1\n-1",
+    "+3\n+3\n+4\n-2\n-4",
+    "-6\n+3\n+8\n+5\n-6",
+    "+7\n+7\n-2\n-7\n-4"
+]
+
+expected_part1 = [3, 0, 4, 4, 1]
+expected_part2 = [2, 0, 10, 5, 14]
+
+@pytest.mark.parametrize("input,expected", list(zip(test_inputs, expected_part1)))
+def test_part1(input, expected):
+    solution = part1(input)
+    assert solution == expected
+
+@pytest.mark.parametrize("input,expected", list(zip(test_inputs, expected_part2)))
+def test_part2(input, expected):
+    solution = part2(input)
+    assert solution == expected