b1cef8c4a0
Implemented layering so it will allow to have multiple solver engines. Implements blueprint: dynamic-allocation Change-Id: I7ed1ec0216fb9778b4fa5be4fb4f6141a0e26fc9
34 lines
1.1 KiB
Python
34 lines
1.1 KiB
Python
# -*- coding: utf-8 -*-
|
|
|
|
# Copyright 2016 Mirantis, Inc.
|
|
#
|
|
# 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 bareon_allocator.parsers import ExpressionsParser
|
|
from bareon_allocator.tests import base
|
|
|
|
|
|
class TestParsersExpressions(base.TestCase):
|
|
|
|
def test_substitutes_value_recursively(self):
|
|
parsed = ExpressionsParser(
|
|
[{'key1': 'key2'},
|
|
{'list': [{'list_key': 'yaql=$.some_key'}]}],
|
|
{'some_key': 'some_value'}).parse()
|
|
|
|
self.assertEqual(
|
|
parsed,
|
|
[{'key1': 'key2'},
|
|
{'list': [{'list_key': 'some_value'}]}])
|