Implement archan provider

setup.py

@@ -72,6 +72,9 @@ def read(*names, **kwargs):
     entry_points={
         'console_scripts': [
             'dependenpy = dependenpy.cli:main',
+        ],
+        'archan': [
+            'dependenpy.ArchanProvider = dependenpy.dsm:ArchanProvider'
         ]
     },
 )

src/dependenpy/__init__.py

@@ -8,8 +8,8 @@
 be able to build a dependency matrix and use it for other purposes.
 """
 
-from .dsm import DSM, Dependency, Module, Package
+from .dsm import ArchanProvider, DSM, Dependency, Module, Package
 from .structures import Matrix, TreeMap
 
-__all__ = ('DSM', 'Dependency', 'Matrix', 'Module', 'Package', 'TreeMap')
+__all__ = ('ArchanProvider', 'DSM', 'Dependency', 'Matrix', 'Module', 'Package', 'TreeMap')
 __version__ = '3.1.0'

src/dependenpy/cli.py

@@ -21,7 +21,7 @@
 import sys
 
 from . import __version__
-from .dsm import DSM
+from .dsm import DSM, guess_depth
 from .printer import CSV, FORMAT, JSON
 
 parser = argparse.ArgumentParser(
@@ -98,10 +98,7 @@ def main(args=None):
     # guess convenient depth
     depth = args.depth
     if depth is None:
-        if len(packages) == 1:
-            depth = packages[0].count('.') + 2
-        else:
-            depth = min(p.count('.') for p in packages) + 1
+        depth = guess_depth(packages)
 
     # open file if not stdout
     output = args.output

src/dependenpy/dsm.py

@@ -17,6 +17,13 @@
 import sys
 from os.path import isdir, isfile, join, splitext
 
+try:
+    from archan import Provider, Argument
+except ImportError:
+    from collections import namedtuple
+    Provider = object
+    Argument = lambda *a, **k: None
+
 from .finder import Finder, PackageSpec
 from .node import LeafNode, NodeMixin, RootNode
 from .printer import PrintMixin
@@ -425,3 +432,44 @@ def __str__(self):
     def external(self):
         """Property to tell if the dependency's target is a valid node."""
         return isinstance(self.target, str)
+
+
+def guess_depth(packages):
+    if len(packages) == 1:
+        return packages[0].count('.') + 2
+    return min(p.count('.') for p in packages) + 1
+
+
+class ArchanProvider(Provider):
+    name = 'Dependency matrix provider for Archan'
+    description = 'Provide matrix data about internal dependencies ' \
+                  'in a set of packages.'
+    arguments = (
+        Argument('packages', list, 'the list of packages to check for'),
+        Argument(
+            'enforce_init', bool,
+            ' whether to assert presence of __init__.py files in directories'),
+        Argument('depth', int, 'the depth of the matrix to generate'),
+    )
+
+    def get_dsm(self, packages, enforce_init=True, depth=None):
+        """
+        Provide matrix data about internal dependencies in a set of packages.
+
+        Args:
+            *packages (list): the list of packages to check for.
+            enforce_init (bool):
+                whether to assert presence of __init__.py files in directories.
+            depth (int): the depth of the matrix to generate.
+
+        Returns:
+            dict: keys and data in a dictionary (no categories for now).
+        """
+        dsm = DSM(*packages, enforce_init=enforce_init)
+        if depth is None:
+            depth = guess_depth(packages)
+        matrix = dsm.as_matrix(depth=depth)
+        return {
+            'keys': matrix.keys,
+            'data': matrix.data
+        }