8372f48b7a
Change-Id: Ibd4c9811daa6e9e692457ce480a58c964fef7cb9 Signed-off-by: Julien Danjou <julien@danjou.info>
138 lines
4.8 KiB
Python
138 lines
4.8 KiB
Python
#
|
|
# Copyright 2012 New Dream Network, LLC (DreamHost)
|
|
# Copyright (c) 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.
|
|
"""Tests for aodh/utils.py
|
|
"""
|
|
import datetime
|
|
import decimal
|
|
|
|
from oslotest import base
|
|
|
|
from aodh import utils
|
|
|
|
|
|
class TestUtils(base.BaseTestCase):
|
|
|
|
def test_datetime_to_decimal(self):
|
|
expected = 1356093296.12
|
|
utc_datetime = datetime.datetime.utcfromtimestamp(expected)
|
|
actual = utils.dt_to_decimal(utc_datetime)
|
|
self.assertAlmostEqual(expected, float(actual), places=5)
|
|
|
|
def test_decimal_to_datetime(self):
|
|
expected = 1356093296.12
|
|
dexpected = decimal.Decimal(str(expected)) # Python 2.6 wants str()
|
|
expected_datetime = datetime.datetime.utcfromtimestamp(expected)
|
|
actual_datetime = utils.decimal_to_dt(dexpected)
|
|
# Python 3 have rounding issue on this, so use float
|
|
self.assertAlmostEqual(utils.dt_to_decimal(expected_datetime),
|
|
utils.dt_to_decimal(actual_datetime),
|
|
places=5)
|
|
|
|
def test_recursive_keypairs(self):
|
|
data = {'a': 'A', 'b': 'B',
|
|
'nested': {'a': 'A', 'b': 'B'}}
|
|
pairs = list(utils.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(utils.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(utils.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)
|
|
|
|
def test_decimal_to_dt_with_none_parameter(self):
|
|
self.assertIsNone(utils.decimal_to_dt(None))
|
|
|
|
def test_dict_to_kv(self):
|
|
data = {'a': 'A',
|
|
'b': 'B',
|
|
'nested': {'a': 'A',
|
|
'b': 'B',
|
|
},
|
|
'nested2': [{'c': 'A'}, {'c': 'B'}]
|
|
}
|
|
pairs = list(utils.dict_to_keyval(data))
|
|
self.assertEqual([('a', 'A'),
|
|
('b', 'B'),
|
|
('nested.a', 'A'),
|
|
('nested.b', 'B'),
|
|
('nested2[0].c', 'A'),
|
|
('nested2[1].c', 'B')],
|
|
sorted(pairs, key=lambda x: x[0]))
|
|
|
|
def test_hash_ring(self):
|
|
num_nodes = 10
|
|
num_keys = 1000
|
|
|
|
nodes = [str(x) for x in range(num_nodes)]
|
|
hr = utils.HashRing(nodes)
|
|
|
|
buckets = [0] * num_nodes
|
|
assignments = [-1] * num_keys
|
|
for k in range(num_keys):
|
|
n = int(hr.get_node(str(k)))
|
|
self.assertTrue(0 <= n <= num_nodes)
|
|
buckets[n] += 1
|
|
assignments[k] = n
|
|
|
|
# at least something in each bucket
|
|
self.assertTrue(all((c > 0 for c in buckets)))
|
|
|
|
# approximately even distribution
|
|
diff = max(buckets) - min(buckets)
|
|
self.assertTrue(diff < 0.3 * (num_keys / num_nodes))
|
|
|
|
# consistency
|
|
num_nodes += 1
|
|
nodes.append(str(num_nodes + 1))
|
|
hr = utils.HashRing(nodes)
|
|
for k in range(num_keys):
|
|
n = int(hr.get_node(str(k)))
|
|
assignments[k] -= n
|
|
reassigned = len([c for c in assignments if c != 0])
|
|
self.assertTrue(reassigned < num_keys / num_nodes)
|