##// END OF EJS Templates
ip-restritions: fix issue with loading empty IP rules for non-logged not-anonymous users....
ip-restritions: fix issue with loading empty IP rules for non-logged not-anonymous users. This case won't have any IP rules set. And we accidentally loaded them becuase of no empty user filter was present. This caused some odd display warnings for users.

File last commit:

r2487:fcee5614 default
r2838:d1dcf373 default
Show More
test_graphmod.py
85 lines | 2.8 KiB | text/x-python | PythonLexer
project: added all source files and assets
r1 # -*- coding: utf-8 -*-
release: update copyright year to 2018
r2487 # Copyright (C) 2010-2018 RhodeCode GmbH
project: added all source files and assets
r1 #
# This program is free software: you can redistribute it and/or modify
# it under the terms of the GNU Affero General Public License, version 3
# (only), as published by the Free Software Foundation.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU Affero General Public License
# along with this program. If not, see <http://www.gnu.org/licenses/>.
#
# This program is dual-licensed. If you wish to learn more about the
# RhodeCode Enterprise Edition, including its added features, Support services,
# and proprietary license terms, please see https://rhodecode.com/licenses/
from rhodecode.lib import graphmod
# pylint: disable=protected-access
def test_get_edge_color_multiple_parents():
node_color = 1
parent_color = 2
assert graphmod._get_edge_color(
'parent', 2, node_color, {'parent': parent_color}) == parent_color
def test_get_edge_color_multiple_unknown_parent():
node_color = 1
assert graphmod._get_edge_color('parent', 2, node_color, {}) == node_color
def test_get_edge_color_single_parent():
node_color = 1
assert graphmod._get_edge_color('parent', 1, node_color, {}) == node_color
def test_colored_linear():
tests: fixed tests for graphmod
r1380 dag = [
('hash', 'node3', ['node2'], 'master'),
('hash', 'node2', ['node1'], 'master'),
('hash', 'node1', [], 'master')
]
project: added all source files and assets
r1 expected_result = [
tests: fixed tests for graphmod
r1380 ('hash', (0, 1), [(0, 0, 1)], 'master'),
('hash', (0, 1), [(0, 0, 1)], 'master'),
('hash', (0, 1), [], 'master'),
project: added all source files and assets
r1 ]
assert list(graphmod._colored(dag)) == expected_result
def test_colored_diverging_branch():
tests: fixed tests for graphmod
r1380 dag = [
('hash', 'node3', ['node1'], 'stable'),
('hash', 'node2', ['node1'], 'stable'),
('hash', 'node1', [], 'stable')
]
project: added all source files and assets
r1 expected_result = [
tests: fixed tests for graphmod
r1380 ('hash', (0, 1), [(0, 0, 1)], 'stable'),
('hash', (1, 2), [(0, 0, 1), (1, 0, 2)], 'stable'),
('hash', (0, 1), [], 'stable'),
project: added all source files and assets
r1 ]
assert list(graphmod._colored(dag)) == expected_result
def test_colored_merged_branch():
dag = [
tests: fixed tests for graphmod
r1380 ('hash', 'node4', ['node2', 'node3'], 'stable'),
('hash', 'node3', ['node1'], 'stable'),
('hash', 'node2', ['node1'], 'stable'),
('hash', 'node1', [], 'stable'),
project: added all source files and assets
r1 ]
expected_result = [
tests: fixed tests for graphmod
r1380 ('hash', (0, 1), [(0, 0, 1), (0, 1, 2)], 'stable'),
('hash', (1, 2), [(0, 0, 1), (1, 1, 2)], 'stable'),
('hash', (0, 1), [(0, 0, 1), (1, 0, 2)], 'stable'),
('hash', (0, 2), [], 'stable'),
project: added all source files and assets
r1 ]
assert list(graphmod._colored(dag)) == expected_result