1 files changed, 146 insertions, 0 deletions
diff --git a/sugar_network/sweets/solution.py b/sugar_network/sweets/solution.py
new file mode 100644
index 0000000..aa2f0ff
--- /dev/null
+++ b/sugar_network/sweets/solution.py
@@ -0,0 +1,146 @@
+# Copyright (C) 2011-2012, Aleksey Lim
+#
+# This program is free software: you can redistribute it and/or modify
+# it under the terms of the GNU General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# This program is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+# GNU General Public License for more details.
+#
+# You should have received a copy of the GNU General Public License
+# along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+
+DEEP = 2
+
+
+class Solution(object):
+
+    interface = property(lambda self: self.value.interface)
+    selections = property(lambda self: self.value.selections)
+
+    def __init__(self, value, req):
+        self.value = value
+        self.ready = True
+        self.details = {}
+        self.failure_reason = None
+        self.requirements = req
+        self._for_build = False#hooks.pkg_type != 'runtime'
+
+    def __getitem__(self, url):
+        result = self.selections.get(url)
+        if result is not None:
+            return _Selection(result)
+        else:
+            return None
+
+    def __iter__(self):
+        for i in self.selections.values():
+            yield _Selection(i)
+
+    def __hash__(self):
+        return hash(self.id)
+
+    def __cmp__(self, other):
+        return cmp(self.id, other.id)
+
+    @property
+    def id(self):
+        return (self.interface, tuple([i.path for i in self.commands]))
+
+    @property
+    def top(self):
+        return self[self.interface]
+
+    @property
+    def commands(self):
+        if self.top is None:
+            return []
+        else:
+            return self.value.commands
+
+    def walk(self, reverse=False, depth=DEEP, uniq=True, include_top=True):
+        done = set()
+
+        def process_node(url, parent_dep, extra_deps, path):
+            if uniq:
+                if url in done:
+                    return
+                done.add(url)
+
+            sel = self[url]
+            if sel is None:
+                yield _Selection(None, url), parent_dep, path
+                return
+
+            if reverse:
+                if include_top or url != self.interface:
+                    yield sel, parent_dep, path
+
+            if _is_shallow(len(path) + 1, depth):
+                for dep in sel.dependencies + extra_deps:
+                    for i in process_node(
+                            dep.interface, dep, [], path + [sel]):
+                        yield i
+
+            if not reverse:
+                if include_top or url != self.interface:
+                    yield sel, parent_dep, path
+
+        extra_deps = []
+        for i in self.commands:
+            extra_deps += i.requires
+
+        return process_node(self.interface, None, extra_deps, [])
+
+
+class _Selection(object):
+
+    def __init__(self, orig, interface=None):
+        self._value = orig
+        self._installed = None
+        self._to_install = None
+        self._interface = interface
+
+    def __repr__(self):
+        return self.interface
+
+    @property
+    def interface(self):
+        if self._value is None:
+            return self._interface
+        else:
+            return self['interface']
+
+    @property
+    def bindings(self):
+        return self._value.bindings
+
+    @property
+    def dependencies(self):
+        return self._value.dependencies
+
+    def __contains__(self, key):
+        return key in self._value.attrs
+
+    def __getitem__(self, key):
+        return self._value.attrs.get(key)
+
+    def __setitem__(self, key, value):
+        self._value.attrs[key] = value
+
+    def __hash__(self):
+        return hash(self['id'])
+
+    def __cmp__(self, other):
+        return cmp(self['id'], other['id'])
+
+
+def _is_shallow(node_depth, max_depth=None):
+    if max_depth is None:
+        max_depth = DEEP
+    max_depth = max(0, max_depth)
+    return node_depth <= max_depth or max_depth >= DEEP