61 lines
2.3 KiB
Python
61 lines
2.3 KiB
Python
# 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 oslotest import base
|
|
|
|
from aodh.api.controllers.v2 import capabilities
|
|
|
|
|
|
class TestCapabilities(base.BaseTestCase):
|
|
|
|
def test_recursive_keypairs(self):
|
|
data = {'a': 'A', 'b': 'B',
|
|
'nested': {'a': 'A', 'b': 'B'}}
|
|
pairs = list(capabilities._recursive_keypairs(data))
|
|
self.assertEqual([('a', 'A'), ('b', 'B'),
|
|
('nested:a', 'A'), ('nested:b', 'B')],
|
|
pairs)
|
|
|
|
def test_recursive_keypairs_with_separator(self):
|
|
data = {'a': 'A',
|
|
'b': 'B',
|
|
'nested': {'a': 'A',
|
|
'b': 'B',
|
|
},
|
|
}
|
|
separator = '.'
|
|
pairs = list(capabilities._recursive_keypairs(data, separator))
|
|
self.assertEqual([('a', 'A'),
|
|
('b', 'B'),
|
|
('nested.a', 'A'),
|
|
('nested.b', 'B')],
|
|
pairs)
|
|
|
|
def test_recursive_keypairs_with_list_of_dict(self):
|
|
small = 1
|
|
big = 1 << 64
|
|
expected = [('a', 'A'),
|
|
('b', 'B'),
|
|
('nested:list', [{small: 99, big: 42}])]
|
|
data = {'a': 'A',
|
|
'b': 'B',
|
|
'nested': {'list': [{small: 99, big: 42}]}}
|
|
pairs = list(capabilities._recursive_keypairs(data))
|
|
self.assertEqual(len(expected), len(pairs))
|
|
for k, v in pairs:
|
|
# the keys 1 and 1<<64 cause a hash collision on 64bit platforms
|
|
if k == 'nested:list':
|
|
self.assertIn(v,
|
|
[[{small: 99, big: 42}],
|
|
[{big: 42, small: 99}]])
|
|
else:
|
|
self.assertIn((k, v), expected)
|