hsgui / tree.py

# Copyright 2010 Hardcoded Software (http://www.hardcoded.net)
# This software is licensed under the "BSD" License as described in the "LICENSE" file, 
# which should be included with this package. The terms are also available at 
# http://www.hardcoded.net/licenses/bsd_license

class Node(list):
    def __init__(self, name):
        self._name = name
        self._parent = None
        self._path = None
    def __eq__(self, other):
        return self is other
    def __hash__(self):
        return object.__hash__(self)
    def __repr__(self):
        return '<Node %r>' % self.name
    def append(self, node):
        list.append(self, node)
        node._parent = self
        node._path = None
    def clear(self):
        del self[:]
    def find(self, predicate, include_self=True):
            return next(self.findall(predicate, include_self=include_self))
        except StopIteration:
            return None
    def findall(self, predicate, include_self=True):
        if include_self and predicate(self):
            yield self
        for child in self:
            for found in child.findall(predicate, include_self=True):
                yield found
    def get_node(self, index_path):
        result = self
        if index_path:
            for index in index_path:
                result = result[index]
        return result
    def get_path(self, target_node):
        if target_node is None:
            return None
        return target_node.path
    def children_count(self):
        return len(self)
    def name(self):
        return self._name
    def parent(self):
        return self._parent
    def path(self):
        if self._path is None:
            if self._parent is None:
                self._path = []
                self._path = self._parent.path + [self._parent.index(self)]
        return self._path
    def root(self):
        if self._parent is None:
            return self
            return self._parent.root

class Tree(Node):
    def __init__(self):
        Node.__init__(self, '')
        self._selected_nodes = []
    def __hash__(self):
        return object.__hash__(self)
    def _select_nodes(self, nodes):
        # all selection changes go through this method, so you can override this if you want to
        # customize the tree's behavior.
        self._selected_nodes = nodes
    def clear(self):
        self._selected_nodes = []
    def selected_node(self):
        return self._selected_nodes[0] if self._selected_nodes else None
    def selected_node(self, node):
        if node is not None:
    def selected_nodes(self):
        return self._selected_nodes
    def selected_nodes(self, nodes):
    def selected_path(self):
        return self.get_path(self.selected_node)
    def selected_path(self, index_path):
        if index_path is not None:
            self.selected_paths = [index_path]
    def selected_paths(self):
        return list(map(self.get_path, self._selected_nodes))
    def selected_paths(self, index_paths):
        nodes = []
        for path in index_paths:
            except IndexError:
Tip: Filter by directory path e.g. /media app.js to search for public/media/app.js.
Tip: Use camelCasing e.g. ProjME to search for ProjectModifiedEvent.java.
Tip: Filter by extension type e.g. /repo .js to search for all .js files in the /repo directory.
Tip: Separate your search with spaces e.g. /ssh pom.xml to search for src/ssh/pom.xml.
Tip: Use ↑ and ↓ arrow keys to navigate and return to view the file.
Tip: You can also navigate files with Ctrl+j (next) and Ctrl+k (previous) and view the file with Ctrl+o.
Tip: You can also navigate files with Alt+j (next) and Alt+k (previous) and view the file with Alt+o.