Source code for pacman.model.graphs.abstract_edge_partition

# Copyright (c) 2017-2019 The University of Manchester
# This program is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation, either version 3 of the License, or
# (at your option) any later version.
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# GNU General Public License for more details.
# You should have received a copy of the GNU General Public License
# along with this program.  If not, see <>.
from spinn_utilities.abstract_base import AbstractBase, abstractproperty
from spinn_utilities.ordered_set import OrderedSet
from pacman.exceptions import (
    PacmanInvalidParameterException, PacmanAlreadyExistsException)

class AbstractEdgePartition(object, metaclass=AbstractBase):
    """ A collection of edges which start at a single vertex which have the\
        same semantics and so can share a single key or block of SDRAM\
        (depending on edge type).

    __slots__ = [
        # The partition identifier
        # The edges in the partition
        # The type of edges to accept

    def __init__(
            self, identifier, allowed_edge_types):
        :param str identifier: The identifier of the partition
        :param allowed_edge_types: The types of edges allowed
        :type allowed_edge_types: type or tuple(type, ...)
        :param str label: An optional label of the partition
        self._identifier = identifier
        self._allowed_edge_types = allowed_edge_types
        self._edges = OrderedSet()

[docs] def add_edge(self, edge): """ Add an edge to the edge partition. :param AbstractEdge edge: the edge to add :raises PacmanInvalidParameterException: If the edge does not belong in this edge partition """ # Check for an incompatible edge if not isinstance(edge, self._allowed_edge_types): raise PacmanInvalidParameterException( "edge", str(edge.__class__), "Edges of this graph must be one of the following types:" " {}".format(self._allowed_edge_types)) if edge in self._edges: raise PacmanAlreadyExistsException("Edge", edge) self._edges.add(edge)
@property def identifier(self): """ The identifier of this edge partition. :rtype: str """ return self._identifier @property def edges(self): """ The edges in this edge partition. .. note:: The order in which the edges are added is preserved for when they are requested later. If not, please talk to the software team. :rtype: iterable(AbstractEdge) """ return self._edges @property def n_edges(self): """ The number of edges in the edge partition. :rtype: int """ return len(self._edges) def __repr__(self): return (f"{self.__class__.__name__}(identifier={self.identifier}" f", n_edges={self.n_edges})") def __str__(self): return self.__repr__() def __contains__(self, edge): """ Check if the edge is contained within this partition :param AbstractEdge edge: the edge to search for. :rtype: bool """ return edge in self._edges @abstractproperty def pre_vertices(self): """ Provides the vertices associated with this partition .. note:: Most edge partitions will be :py:class:`AbstractSingleSourcePartition` and therefore provide the ``pre_vertex`` method. :rtype: iter(AbstractVertex) """