ó „¾^Yc@sEdZdZd„Zdefd„ƒYZdefd„ƒYZdS(s*Independent implementation of a Trie tree.tTrietTrieNodeccs1x*tt|ƒƒD]}|||d!VqWdS(Ni(trangetlen(tstringti((s4/tmp/pip-build-EndXZ2/flake8/flake8/plugins/_trie.pyt_iterate_stringlike_objectsscBs2eZdZd„Zd„Zd„Zd„ZRS(s'The object that manages the trie nodes.cCstddƒ|_dS(sInitialize an empty trie.N(RtNonetroot(tself((s4/tmp/pip-build-EndXZ2/flake8/flake8/plugins/_trie.pyt__init__scCsj|j}xJt|ƒD]<}|j|ƒ}|dkrL|j|gƒ}n|}qW|jj|ƒdS(s(Add the node data to the path described.N(RRt find_prefixRt add_childtdatatappend(R tpatht node_datatnodetprefixtchild((s4/tmp/pip-build-EndXZ2/flake8/flake8/plugins/_trie.pytadds   cCsI|j}x9t|ƒD]+}|j|ƒ}|dkr;dS|}qW|S(s'Find a node based on the path provided.N(RRR R(R RRRR((s4/tmp/pip-build-EndXZ2/flake8/flake8/plugins/_trie.pytfinds   cCs |jjƒS(sTraverse this tree. This performs a depth-first pre-order traversal of children in this tree. It returns the results consistently by first sorting the children based on their prefix and then traversing them in alphabetical order. (Rttraverse(R ((s4/tmp/pip-build-EndXZ2/flake8/flake8/plugins/_trie.pyR&s(t__name__t __module__t__doc__R RRR(((s4/tmp/pip-build-EndXZ2/flake8/flake8/plugins/_trie.pyR s   cBsAeZdZdd„Zd„Zd„Zdd„Zd„ZRS(s5The majority of the implementation details of a Trie.cCs%|p i|_||_||_dS(s-Initialize a TrieNode with data and children.N(tchildrenR R(R RR R((s4/tmp/pip-build-EndXZ2/flake8/flake8/plugins/_trie.pyR 4s cCsdj|j|jƒS(s4Generate an easy to read representation of the node.sTrieNode(prefix={0}, data={1})(tformatRR (R ((s4/tmp/pip-build-EndXZ2/flake8/flake8/plugins/_trie.pyt__repr__:scCs|jj|dƒS(s™Find the prefix in the children of this node. :returns: A child matching the prefix or None. :rtype: :class:`~TrieNode` or None N(RtgetR(R R((s4/tmp/pip-build-EndXZ2/flake8/flake8/plugins/_trie.pyR @scCs#t|||ƒ}||j|<|S(svCreate and add a new child node. :returns: The newly created node :rtype: :class:`~TrieNode` (RR(R RR Rtnew_node((s4/tmp/pip-build-EndXZ2/flake8/flake8/plugins/_trie.pyR Hs ccs_|js dSxKt|jjƒƒD]4}|j|}|Vx|jƒD] }|VqHWq#WdS(s-Traverse children of this node. This performs a depth-first pre-order traversal of the remaining children in this sub-tree. It returns the results consistently by first sorting the children based on their prefix and then traversing them in alphabetical order. N(RtsortedtkeysR(R RR((s4/tmp/pip-build-EndXZ2/flake8/flake8/plugins/_trie.pyRRs  N( RRRRR RR R R(((s4/tmp/pip-build-EndXZ2/flake8/flake8/plugins/_trie.pyR1s     N(sTriesTrieNode(Rt__all__RtobjectRR(((s4/tmp/pip-build-EndXZ2/flake8/flake8/plugins/_trie.pyts &