/opt/imh-python/lib/python3.9/site-packages/keystoneauth1/tests/unit
NameSizeModeActions
access/-0755rm
data/-0755rm
exceptions/-0755rm
extras/-0755rm
identity/-0755rm
loading/-0755rm
__pycache__/-0755rm
client_fixtures.py44750644editdlrm
k2k_fixtures.py53340644editdlrm
keystoneauth_fixtures.py23780644editdlrm
matchers.py31800644editdlrm
oidc_fixtures.py34990644editdlrm
test_betamax_fixture.py46280644editdlrm
test_betamax_hooks.py65930644editdlrm
test_betamax_serializer.py19730644editdlrm
test_discovery.py519610644editdlrm
test_fair_sempahore.py28930644editdlrm
test_fixtures.py137350644editdlrm
test_hacking_checks.py17990644editdlrm
test_http_basic.py18770644editdlrm
test_matchers.py34000644editdlrm
test_noauth.py17280644editdlrm
test_service_token.py46700644editdlrm
test_session.py801850644editdlrm
test_token_endpoint.py26320644editdlrm
test_utils.py8000644editdlrm
utils.py52340644editdlrm
__init__.py00644editdlrm
Edit: /opt/imh-python/lib/python3.9/site-packages/keystoneauth1/tests/unit/matchers.py (3180B)
# Copyright 2013 OpenStack Foundation # # Licensed under the Apache License, Version 2.0 (the "License"); you may # not use this file except in compliance with the License. You may obtain # a copy of the License at # # http://www.apache.org/licenses/LICENSE-2.0 # # Unless required by applicable law or agreed to in writing, software # distributed under the License is distributed on an "AS IS" BASIS, WITHOUT # WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the # License for the specific language governing permissions and limitations # under the License. from lxml import etree from testtools import matchers class XMLEquals: """Parses two XML documents from strings and compares the results.""" def __init__(self, expected): self.expected = expected def __str__(self): """Return string representation of xml document info.""" return f"{self.__class__.__name__}({self.expected!r})" def match(self, other): def xml_element_equals(expected_doc, observed_doc): """Test 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. """ if expected_doc.tag != observed_doc.tag: return False if expected_doc.attrib != observed_doc.attrib: return False def _sorted_children(doc): return sorted(doc.getchildren(), key=lambda el: el.tag) expected_children = _sorted_children(expected_doc) observed_children = _sorted_children(observed_doc) if len(expected_children) != len(observed_children): return False for expected_el, observed_el in zip( expected_children, observed_children ): if not xml_element_equals(expected_el, observed_el): return False return True parser = etree.XMLParser(remove_blank_text=True) expected_doc = etree.fromstring(self.expected.strip(), parser) observed_doc = etree.fromstring(other.strip(), parser) if xml_element_equals(expected_doc, observed_doc): return return XMLMismatch(self.expected, other) class XMLMismatch(matchers.Mismatch): def __init__(self, expected, other): self.expected = expected self.other = other def describe(self): def pretty_xml(xml): parser = etree.XMLParser(remove_blank_text=True) doc = etree.fromstring(xml.strip(), parser) return etree.tostring( doc, encoding='utf-8', pretty_print=True ).decode('utf-8') return f'expected =\n{pretty_xml(self.expected)}\nactual =\n{pretty_xml(self.other)}'