New Type Parser

[TheDataLeek]

I've implemented a new recursive type parser to hopefully resolve issues #2 and #3.

High level overview of the changes:

• Implemented recursive checker using private variables defined in the official typing.py source code.
• Added several tests to check the new behavior.
• Added support for callable argument annotation (e.g. foo(fun: Callable[[int], int]) -> None)

Some notes about this:

1. We assume that every level of an iterable type is annotated. If it isn't, an error will be raised.
2. Because every item is checked, it is not very efficient for large arrays or large nested structures of any time

Steps Forward:

• Add optimizations to quickly check nested structures
• Add numpy array support using dtype
• Add recursion level global value to limit how many levels deep we care about checking. Possibly may want to make the default behavior so that it only checks the first recursion level, basically yielding the current behavior.

Let me know if you want me to work on any of these changes before you consider my PR.

Will Farmer

[TheDataLeek]

Hey, saw your response on #3.

I totally missed the dev branch, that's completely my bad. I still have my code, I'll help improve the dev branch. I've been using this project daily since my switch to Python 3.5, so I'm very interested on helping improve the functionality.

Give me a bit to review the dev branch and see what needs to be done and I'll get back to you.

In the meantime, I'll close this PR as it's not necessary/not in the current direction of the project.

Thanks for the quick response! Will Farmer