src/license_expression/_pyahocorasick.py
def items(self):
        """
        Yield tuple of all (key, value) stored in this trie.
        """
        items = []

        def walk(node, tokens):
            """
            Walk the trie, depth first.
            """
            tokens = [t for t in tokens + [node.token] if t]
            if node.output is not nil:
                items.append((node.output[0], node.output[1],))

            for child in node.children.values():
                if child is not node:
                    walk(child, tokens)

        walk(self.root, tokens=[])

        return iter(items)

        Yield tuple of all (key, value) stored in this trie.
        
Yield tuple of all (key, value) stored in this trie.
Yield tuple of all ( key value ) stored in this trie .
def items(self):
        items = []
        def walk(node, tokens):
            tokens = [t for t in tokens + [node.token] if t]
            if node.output is not nil:
                items.append((node.output[0], node.output[1],))
            for child in node.children.values():
                if child is not node:
                    walk(child, tokens)
        walk(self.root, tokens=[])
        return iter(items)
def items ( self ) : items = [ ] def walk ( node , tokens ) : """
            Walk the trie, depth first.
            """ tokens = [ t for t in tokens + [ node . token ] if t ] if node . output is not nil : items . append ( ( node . output [ 0 ] , node . output [ 1 ] , ) ) for child in node . children . values ( ) : if child is not node : walk ( child , tokens ) walk ( self . root , tokens = [ ] ) return iter ( items )
Yield tuple of all (key, value) stored in this trie.
Yield tuple of all ( key value ) stored in this trie .
"""
        Yield tuple of all (key, value) stored in this trie.
        """ """
            Walk the trie, depth first.
            """
self