|
Server : Apache/2.2.17 (Unix) mod_ssl/2.2.17 OpenSSL/0.9.8e-fips-rhel5 DAV/2 PHP/5.2.17 System : Linux localhost 2.6.18-419.el5 #1 SMP Fri Feb 24 22:47:42 UTC 2017 x86_64 User : nobody ( 99) PHP Version : 5.2.17 Disable Function : NONE Directory : /proc/21573/root/usr/lib/python2.4/site-packages/dogtail/ |
Upload File : |
mō
8 3Dc @ s# d Z d Z d f d YZ d S( s-
Author: David Malcolm <dmalcolm@redhat.com>
s# David Malcolm <dmalcolm@redhat.com>t
SearchPathc B sh t Z d Z d Z d Z d Z d Z d Z d Z d Z d Z
d Z d
Z RS( s
Class used by the recording framework (and for more verbose script
logging) for identifying nodes in a persistent way, independent of the
style of script being written.
Implemented as a list of (predicate, isRecursive) pairs, giving the
'best' way to find the Accessible wrapped by a Node, starting at the
root and applying each search in turn.
This is somewhat analagous to an absolute path in a filesystem, except
that some of searches may be recursive, rather than just searching
direct children.
FIXME: try to ensure uniqueness
FIXME: need some heuristics to get 'good' searches, whatever
that means
c C s
g | _ d S( N( t selft _SearchPath__list( R ( ( t0 /usr/lib/python2.4/site-packages/dogtail/path.pyt __init__ s c C sB d } x1 | i D]& \ } } | d | i | f 7} q W| d S( Nt {s /(%s,%s)t }( t resultR R t predicatet isRecursivet describeSearchResult( R R R R ( ( R t __str__ s
c C sn t | i t | i j o t SnD x@ t t | i D]) } | i | | i | j o t Sq= q= Wt S( N( t lenR R t othert Falset ranget it True( R R
R ( ( R t __eq__$ s c C s( | p t | i i | | f d S( N( R t AssertionErrorR R t appendR ( R R R ( ( R R 1 s c C s
t | i S( N( t iterR R ( R ( ( R t __iter__5 s c C s
t | i S( N( R R R ( R ( ( R t length8 s c C s; d } x. | i D]# \ } } | d | i | 7} q W| S( sy
Used by the recording system.
Generate the Python source code that will carry out this search.
t t .N( R R R R R t makeScriptMethodCall( R R R R ( ( R R ; s
c C sģ x= t t | i D]& } | i | | i | j o Pq q W| d j o^ t } | i | d | _ t o2 d GHd | GHd | GHd | GHd | GHd GHn | Sn d Sd S( sų
Given another SearchPath instance, if the other is 'below' this
one, return a SearchPath that describes how to reach it relative
to this one (a copy of the second part of the list). Otherwise
return None.
i i s ....................s from %ss to %ss i=%ss relative path %sN(
R R R R R R
R R R t None( R R
R R ( ( R t getRelativePathH s"
c C s; t } x+ t | D] } | i i | i | q W| S( sO
Get the first n components of this instance as a new instance
N( R R R t nR R R R ( R R R R ( ( R t getPrefixc s
c C s | i | \ } } | S( N( R R R R R ( R R R R ( ( R t getPredicatel s (
t __name__t
__module__t __doc__R R R R R R R R R R ( ( ( R R s
N( R" t
__author__R ( R R# ( ( R t ? s