import random
from typing import NamedTuple, FrozenSet, Tuple

from graph_experiments import constants


class Node(NamedTuple):
    index: int
    key_space: "KeySpace"
    # We store the index of nodes rather than the nodes themselves. This fixes
    # issues with the `neighbours` nodes becoming out of date as we change their
    # neighbours.
    neighbours: FrozenSet[int] = frozenset()

    def with_neighbours(self, neighbours: FrozenSet[int]) -> "Node":
        return Node(self.index, self.key_space, neighbours)


class KeySpace(NamedTuple):
    position: Tuple[float]

    @classmethod
    def random(cls, key_space_dimensions: int) -> "KeySpace":
        return KeySpace(
            tuple(
                float(random.uniform(constants.KEY_SPACE_LOWER, constants.KEY_SPACE_UPPER))
                for _ in range(key_space_dimensions)
            )
        )


class GraphArgs(NamedTuple):
    num_nodes: int
    key_space_dimensions: int
    max_neighbours: int

    def __str__(self) -> str:
        return ",".join(
            [f"n={self.num_nodes}", f"e={self.max_neighbours}", f"d={self.key_space_dimensions}",]
        )


class StrategyArgs(NamedTuple):
    neighbour_strategy_name: str
    distance_name: str
    test_strategy_name: str

    def __str__(self) -> str:
        return ",".join(
            [self.neighbour_strategy_name, self.distance_name, self.test_strategy_name,]
        )


class TestArgs(NamedTuple):
    num_search_tests: int
    num_graph_tests: int