Name	Size	Mode	Actions
access/	-	0755	rm
data/	-	0755	rm
extras/	-	0755	rm
identity/	-	0755	rm
loading/	-	0755	rm
client_fixtures.py	4926	0644	editdlrm
client_fixtures.pyc	3473	0644	editdlrm
k2k_fixtures.py	5454	0644	editdlrm
k2k_fixtures.pyc	4878	0644	editdlrm
keystoneauth_fixtures.py	2360	0644	editdlrm
keystoneauth_fixtures.pyc	2239	0644	editdlrm
matchers.py	3165	0644	editdlrm
matchers.pyc	3906	0644	editdlrm
oidc_fixtures.py	1690	0644	editdlrm
oidc_fixtures.pyc	1139	0644	editdlrm
test_betamax_fixture.py	2193	0644	editdlrm
test_betamax_fixture.pyc	2604	0644	editdlrm
test_discovery.py	7745	0644	editdlrm
test_discovery.pyc	6715	0644	editdlrm
test_fixtures.py	10719	0644	editdlrm
test_fixtures.pyc	9426	0644	editdlrm
test_hacking_checks.py	1744	0644	editdlrm
test_hacking_checks.pyc	2034	0644	editdlrm
test_matchers.py	1902	0644	editdlrm
test_matchers.pyc	1658	0644	editdlrm
test_session.py	30260	0644	editdlrm
test_session.pyc	32258	0644	editdlrm
test_token_endpoint.py	2337	0644	editdlrm
test_token_endpoint.pyc	3020	0644	editdlrm
test_utils.py	791	0644	editdlrm
test_utils.pyc	791	0644	editdlrm
utils.py	4950	0644	editdlrm
utils.pyc	6215	0644	editdlrm
__init__.py	0	0644	editdlrm
__init__.pyc	159	0644	editdlrm

Ñò 7 Wc@sSdd
kl
Z

ddklZ
def
d„ƒYZdeif
d„ƒYZdS(iÿÿÿÿ(
tetree(
tmatcherst XMLEqualsc
Bs)eZ
dZd
„Zd„Zd„ZRS(sEParses two XML documents from strings and compares the results. cCs |
|_dS(
N(
texpected(tselfR((sH/tmp/pip-build-wCUybK/keystoneauth1/keystoneauth1/tests/unit/matchers.pyt__init__s
c

Csd
|ii
|ifS(Ns%s(%r)(t __class__t__name__R(
R((sH/tmp/pip-build-wCUybK/keystoneauth1/keystoneauth1/tests/unit/matchers.pyt__str__s
csy‡f
d
†‰ti
dtƒ
}ti|iiƒ|ƒ}ti|
iƒ|ƒ}ˆ||ƒo
dS
t|i|
ƒS(Ncs¨|i|
ijo
t
S
|i|
ijo
t
S
d
„}||ƒ
}||
ƒ
}t|ƒ
t|ƒ
jo
t
S
x2t||ƒD]!\}}ˆ||ƒp
t
S
qWtS(sTests whether two XML documents are equivalent. This is a recursive algorithm that operates on each element in the hierarchy. Siblings are sorted before being checked to account for two semantically equivalent documents where siblings appear in different document order. The sorting algorithm is a little weak in that it could fail for documents where siblings at a given level are the same, but have different children. c

Sst|i
ƒd
d„ƒ

S(Ntkeyc


Ss|iS((
ttag(
tel((sH/tmp/pip-build-wCUybK/keystoneauth1/keystoneauth1/tests/unit/matchers.pyt3s(tsortedtgetchildren(
tdoc((sH/tmp/pip-build-wCUybK/keystoneauth1/keystoneauth1/tests/unit/matchers.pyt_sorted_children2s
(R tFalsetattribtlentziptTrue(texpected_doctobserved_docRtexpected_childrentobserved_childrentexpected_eltobserved_el(
txml_element_equals(sH/tmp/pip-build-wCUybK/keystoneauth1/keystoneauth1/tests/unit/matchers.pyRs 

 




tremove_blank_text(Rt XMLParserRt fromstringRtstriptXMLMismatch(RtothertparserRR((
RsH/tmp/pip-build-wCUybK/keystoneauth1/keystoneauth1/tests/unit/matchers.pytmatchs
#


(Rt __module__t__doc__RRR$(((sH/tmp/pip-build-wCUybK/keystoneauth1/keystoneauth1/tests/unit/matchers.pyRs  R!c
BseZ
d„Zd
„ZRS(cCs|
|_||_
dS(
N(RR"(RRR"((sH/tmp/pip-build-wCUybK/keystoneauth1/keystoneauth1/tests/unit/matchers.pyRNs

c
Cs)d
„}
d|
|iƒ
|
|i
ƒ
fS(Nc
SsLti
d
tƒ
}
ti|iƒ|
ƒ}ti|dddtƒ
idƒ
S(NRtencodingsutf-8tpretty_print(RRRRR ttostringtdecode(txmlR#R((sH/tmp/pip-build-wCUybK/keystoneauth1/keystoneauth1/tests/unit/matchers.pyt pretty_xmlSs



sexpected = %s actual = %s(RR"(RR,((sH/tmp/pip-build-wCUybK/keystoneauth1/keystoneauth1/tests/unit/matchers.pytdescribeRs

(RR%RR-(((sH/tmp/pip-build-wCUybK/keystoneauth1/keystoneauth1/tests/unit/matchers.pyR!Ls N(tlxmlRt testtoolsR
tobjectRtMismatchR!(((sH/tmp/pip-build-wCUybK/keystoneauth1/keystoneauth1/tests/unit/matchers.pyts
9