| Trees | Indices | Help |
|---|
|
|
object --+
|
Base.Walker --+
|
AccessibleWalker
Walks the accessible hierarchy exactly as it is presented. The walk order is an in-order traversal of the subtree of the accessible hierarchy rooted at a top-level window accessible. The subtree is assumed to have no loops, though logic could be added to detect them.
|
|||
| 2-tuple of POR, callable |
|
||
| 2-tuple of POR, callable |
|
||
| 2-tuple of POR, callable |
|
||
| 2-tuple of POR, callable |
|
||
| 2-tuple of POR, callable |
|
||
| 2-tuple of POR, callable |
|
||
| POR |
|
||
| POR or None |
|
||
| POR or None |
|
||
| POR |
|
||
| POR |
|
||
| POR |
|
||
|
Inherited from Inherited from |
|||
|
|||
|
Inherited from |
|||
|
|||
|
Inherited from |
|||
|
|||
Gets the first child of the current accessible in the given POR. Returns the child accessible if it exists. If it does not exist, returns the given POR and _getNextPeer as the method to call to continue the search. |
Gets the next peer of the current accessible in the given POR. Returns the peer accessible if it exists, is visible, and is not trivial. If it does not exist, returns the given POR and _getParentNextPeer as the method to call to continue the search. If it is invisible, returns the peer POR and _getNextPeer as the method to call to continue the search. If it is trivial, returns the peer and _getFirstChild as the method to call to continue the search. If it is trivial, returns the child accessible and _getFirstChild as the method to call to continue the search. |
Gets the parent accessible of the current accessible in the given POR. Returns the parent and _getNextPeer as the method to call to continue the search if the parent exists. Returns a sentinel (None, None) if there is no parent indicating the given POR is the root of the subtree containing the starting POR. |
Gets the previous peer of the current accessible in the given POR. If it does not exist, returns the given POR and _getParent as the method to call to continue the search. If it is not visible, returns the peer accessible and _getPrevPeer as the method to call to continue the search. Otherwise, returns the peer accessible and _getLastChild as the method to call to continue the search. |
Gets the last child of the accessible in the given POR. If it does not exist, checks if the given POR is invisible or trivial. If so, returns the given POR and _getPrevPeer to continue the search. If not, returns a POR to the last item in the given POR as the result. If the last child does exist, checks if it is visible. If so, returns the child and _getLastChild to continue the search. If not, returns the child and _getPrevPeer to continue the search. |
Gets the parent accessible of the one in the given POR. Returns the last item in the parent if it exists. If it does not exist, Returns a sentinel (None, None) indicating the given POR is the root of the subtree containing the starting POR. If the parent is invisible or trivial, returns the parent and _getPrevPeer as the method to call to continue the search. |
Gets the last accessible of the given POR. Returns the given POR if any errors occur. |
Gets the next POR in the walk order. Calls _getFirstChild, _getNextPeer, and _getParentNextPeer to attempt to get the next valid POR. Each method determines whether the POR is valid as the next POR, and, if not, which call to make next. Each method potentially returns a POR and the next method to call to continue the search for the next POR.
|
Gets the previous POR in the walk order. Calls _getPrevPeer, _getLastChild, and _getParent to attempt to get the previous valid POR. Each method determines whether the POR is valid as the previous POR, and, if not, which call to make next. Each method potentially returns a POR and the next method to call to continue the search for the previous POR.
|
|
|
|
| Trees | Indices | Help |
|---|
| Generated by Epydoc 3.0beta1 on Mon Jun 4 15:33:26 2007 | http://epydoc.sourceforge.net |