mirror of
https://github.com/arcan1s/ahriman.git
synced 2025-05-05 04:33:50 +00:00
247 lines
7.5 KiB
Python
247 lines
7.5 KiB
Python
import pytest
|
|
|
|
from ahriman.core.exceptions import PartitionError
|
|
from ahriman.core.tree import Leaf, Tree
|
|
from ahriman.models.package import Package
|
|
from ahriman.models.package_description import PackageDescription
|
|
from ahriman.models.package_source import PackageSource
|
|
from ahriman.models.remote_source import RemoteSource
|
|
|
|
|
|
def test_leaf_is_root_empty(leaf_ahriman: Leaf) -> None:
|
|
"""
|
|
must be root for empty packages list
|
|
"""
|
|
assert leaf_ahriman.is_root([])
|
|
|
|
|
|
def test_leaf_is_root_false(leaf_ahriman: Leaf, leaf_python_schedule: Leaf) -> None:
|
|
"""
|
|
must be root for empty dependencies list or if it does not depend on packages
|
|
"""
|
|
assert leaf_ahriman.is_root([leaf_python_schedule])
|
|
leaf_ahriman.dependencies = {"ahriman-dependency"}
|
|
assert leaf_ahriman.is_root([leaf_python_schedule])
|
|
|
|
|
|
def test_leaf_is_root_true(leaf_ahriman: Leaf, leaf_python_schedule: Leaf) -> None:
|
|
"""
|
|
must not be root if depends on packages
|
|
"""
|
|
leaf_ahriman.dependencies = {"python-schedule"}
|
|
assert not leaf_ahriman.is_root([leaf_python_schedule])
|
|
|
|
leaf_ahriman.dependencies = {"python2-schedule"}
|
|
assert not leaf_ahriman.is_root([leaf_python_schedule])
|
|
|
|
leaf_ahriman.dependencies = set(leaf_python_schedule.package.packages.keys())
|
|
assert not leaf_ahriman.is_root([leaf_python_schedule])
|
|
|
|
|
|
def test_tree_balance() -> None:
|
|
"""
|
|
must balance partitions
|
|
"""
|
|
leaf1 = Leaf(
|
|
Package(
|
|
base="package1",
|
|
version="1.0.0",
|
|
remote=RemoteSource(source=PackageSource.AUR),
|
|
packages={"package1": PackageDescription(depends=[])},
|
|
)
|
|
)
|
|
leaf2 = Leaf(
|
|
Package(
|
|
base="package2",
|
|
version="1.0.0",
|
|
remote=RemoteSource(source=PackageSource.AUR),
|
|
packages={"package2": PackageDescription(depends=[])},
|
|
)
|
|
)
|
|
leaf3 = Leaf(
|
|
Package(
|
|
base="package3",
|
|
version="1.0.0",
|
|
remote=RemoteSource(source=PackageSource.AUR),
|
|
packages={"package3": PackageDescription(depends=["package1"])},
|
|
)
|
|
)
|
|
leaf4 = Leaf(
|
|
Package(
|
|
base="package4",
|
|
version="1.0.0",
|
|
remote=RemoteSource(source=PackageSource.AUR),
|
|
packages={"package4": PackageDescription(depends=[])},
|
|
)
|
|
)
|
|
leaf5 = Leaf(
|
|
Package(
|
|
base="package5",
|
|
version="1.0.0",
|
|
remote=RemoteSource(source=PackageSource.AUR),
|
|
packages={"package5": PackageDescription(depends=[])},
|
|
)
|
|
)
|
|
first, second, third = Tree.balance([[leaf4], [leaf1, leaf2, leaf3], [leaf5]])
|
|
assert first == [leaf4, leaf2]
|
|
assert second == [leaf1, leaf3]
|
|
assert third == [leaf5]
|
|
|
|
|
|
def test_tree_balance_empty() -> None:
|
|
"""
|
|
must do not fail on empty tree balancing
|
|
"""
|
|
assert Tree.balance([]) == []
|
|
|
|
|
|
def test_tree_partition(package_ahriman: Package, package_python_schedule: Package) -> None:
|
|
"""
|
|
must partition dependencies tree
|
|
"""
|
|
partitions = Tree.partition([package_ahriman, package_python_schedule], count=1)
|
|
assert len(partitions) == 1
|
|
assert len(partitions[0]) == 2
|
|
|
|
partitions = Tree.partition([package_ahriman, package_python_schedule], count=2)
|
|
assert len(partitions) == 2
|
|
assert all(len(partition) < 2 for partition in partitions)
|
|
|
|
partitions = Tree.partition([package_ahriman, package_python_schedule], count=3)
|
|
assert len(partitions) == 2
|
|
assert all(len(partition) < 2 for partition in partitions)
|
|
|
|
|
|
def test_tree_partition_invalid_count() -> None:
|
|
"""
|
|
must raise PartitionError exception if count is invalid
|
|
"""
|
|
with pytest.raises(PartitionError):
|
|
Tree.partition([], count=0)
|
|
|
|
with pytest.raises(PartitionError):
|
|
Tree.partition([], count=-1)
|
|
|
|
|
|
def test_tree_resolve(package_ahriman: Package, package_python_schedule: Package) -> None:
|
|
"""
|
|
must resolve dependencies tree
|
|
"""
|
|
tree = Tree.resolve([package_ahriman, package_python_schedule])
|
|
assert len(tree) == 1
|
|
assert len(tree[0]) == 2
|
|
|
|
|
|
def test_tree_sort(leaf_ahriman: Leaf, leaf_python_schedule: Leaf) -> None:
|
|
"""
|
|
must sort leaves and return packages
|
|
"""
|
|
assert Tree.sort([[leaf_python_schedule, leaf_ahriman]]) == [[leaf_ahriman.package, leaf_python_schedule.package]]
|
|
|
|
|
|
def test_tree_levels(leaf_ahriman: Leaf, leaf_python_schedule: Leaf) -> None:
|
|
"""
|
|
must generate correct levels in the simples case
|
|
"""
|
|
leaf_ahriman.dependencies = set(leaf_python_schedule.package.packages.keys())
|
|
|
|
tree = Tree([leaf_ahriman, leaf_python_schedule])
|
|
first, second = tree.levels()
|
|
assert first == [leaf_python_schedule.package]
|
|
assert second == [leaf_ahriman.package]
|
|
|
|
|
|
def test_tree_levels_sorted() -> None:
|
|
"""
|
|
must reorder tree, moving packages which are not required for the next level further
|
|
"""
|
|
leaf1 = Leaf(
|
|
Package(
|
|
base="package1",
|
|
version="1.0.0",
|
|
remote=RemoteSource(source=PackageSource.AUR),
|
|
packages={"package1": PackageDescription(depends=[])},
|
|
)
|
|
)
|
|
leaf2 = Leaf(
|
|
Package(
|
|
base="package2",
|
|
version="1.0.0",
|
|
remote=RemoteSource(source=PackageSource.AUR),
|
|
packages={"package2": PackageDescription(depends=["package1"])},
|
|
)
|
|
)
|
|
leaf3 = Leaf(
|
|
Package(
|
|
base="package3",
|
|
version="1.0.0",
|
|
remote=RemoteSource(source=PackageSource.AUR),
|
|
packages={"package3": PackageDescription(depends=["package1"])},
|
|
)
|
|
)
|
|
leaf4 = Leaf(
|
|
Package(
|
|
base="package4",
|
|
version="1.0.0",
|
|
remote=RemoteSource(source=PackageSource.AUR),
|
|
packages={"package4": PackageDescription(depends=["package3"])},
|
|
)
|
|
)
|
|
|
|
tree = Tree([leaf1, leaf2, leaf3, leaf4])
|
|
first, second, third = tree.levels()
|
|
assert first == [leaf1.package]
|
|
assert second == [leaf3.package]
|
|
assert third == [leaf2.package, leaf4.package]
|
|
|
|
|
|
def test_tree_partitions() -> None:
|
|
"""
|
|
must divide tree into partitions
|
|
"""
|
|
leaf1 = Leaf(
|
|
Package(
|
|
base="package1",
|
|
version="1.0.0",
|
|
remote=RemoteSource(source=PackageSource.AUR),
|
|
packages={"package1": PackageDescription(depends=[])},
|
|
)
|
|
)
|
|
leaf2 = Leaf(
|
|
Package(
|
|
base="package2",
|
|
version="1.0.0",
|
|
remote=RemoteSource(source=PackageSource.AUR),
|
|
packages={"package2": PackageDescription(depends=["package1"])},
|
|
)
|
|
)
|
|
leaf3 = Leaf(
|
|
Package(
|
|
base="package3",
|
|
version="1.0.0",
|
|
remote=RemoteSource(source=PackageSource.AUR),
|
|
packages={"package3": PackageDescription(depends=["package1"])},
|
|
)
|
|
)
|
|
leaf4 = Leaf(
|
|
Package(
|
|
base="package4",
|
|
version="1.0.0",
|
|
remote=RemoteSource(source=PackageSource.AUR),
|
|
packages={"package4": PackageDescription(depends=[])},
|
|
)
|
|
)
|
|
leaf5 = Leaf(
|
|
Package(
|
|
base="package5",
|
|
version="1.0.0",
|
|
remote=RemoteSource(source=PackageSource.AUR),
|
|
packages={"package5": PackageDescription(depends=["package2"])},
|
|
)
|
|
)
|
|
|
|
tree = Tree([leaf1, leaf2, leaf3, leaf4, leaf5])
|
|
first, second = tree.partitions(count=3)
|
|
assert first == [leaf1.package, leaf2.package, leaf3.package, leaf5.package]
|
|
assert second == [leaf4.package]
|