Source code for jina.types.routing.table

from collections import defaultdict
from typing import List, Optional, Union

from google.protobuf import json_format

from ..mixin import ProtoTypeMixin
from ...excepts import BadRequestType
from ...helper import typename
from ...proto import jina_pb2

if False:
    from ...peapods import BasePod

[docs]class TargetPod(ProtoTypeMixin): """ Wrapper class around `TargetPodProto`. It offers a Pythonic interface to allow users access to the :class:`jina.jina_pb2.TargetPodProto` object without working with Protobuf itself. :param target: the protobuf object of the TargetPod """ def __init__(self, target: 'jina_pb2.TargetPodProto') -> None: self._pb_body = target @property def port(self) -> int: """Returns the `port` field of this TargetPod :return: port """ return self.proto.port @property def port_out(self) -> int: """Returns the `port` field of this TargetPod :return: port """ return self.proto.port_out @property def host(self) -> str: """Returns the `host` field of this TargetPod :return: host """ return @property def full_address(self) -> str: """Return the full zmq adress of this TargetPod :return: address """ return f'{}:{self.port}' @property def full_out_address(self) -> str: """Return the full zmq adress of the tail of this TargetPod :return: address """ return f'{}:{self.port_out}' @property def expected_parts(self) -> int: """Return the `expected_parts` field of this TargetPod :return: expected_parts """ return self.proto.expected_parts @expected_parts.setter def expected_parts(self, value: int) -> None: """Sets the number of expected incoming message for a Pod. :param value: the new number of expected parts """ self.proto.expected_parts = value @property def out_edges(self) -> List[str]: """Return the `out_edges` field of this TargetPod :return: out_edges """ return list(self.proto.out_edges)
[docs] def add_edge(self, to_pod: str, send_as_bind: bool) -> None: """Adds an edge to the internal representation of the out_edges. :param to_pod: the name of the pod outtraffic should go to :param send_as_bind: True, if the TailPea should send via its ROUTER_BIND socket. """ edge = jina_pb2.RoutingEdgeProto(pod=to_pod, send_as_bind=send_as_bind) self.proto.out_edges.append(edge)
[docs]class RoutingTable(ProtoTypeMixin): """ Wrapper class around `RoutingTableProto`. It offers a Pythonic interface to allow users access to the :class:`jina.jina_pb2.RoutingTableProto` object without working with Protobuf itself. :param graph: the protobuf object of the RoutingTable """ def __init__( self, graph: Optional[ Union['jina_pb2.RoutingTableProto', bytes, dict, str, 'RoutingTable'] ] = None, copy: bool = False, ) -> None: self._pb_body = jina_pb2.RoutingTableProto() try: if isinstance(graph, RoutingTable): if copy: self._pb_body.CopyFrom(graph._pb_body) else: self._pb_body = graph._pb_body elif isinstance(graph, jina_pb2.RoutingTableProto): if copy: self._pb_body.CopyFrom(graph) else: self._pb_body = graph elif isinstance(graph, dict): json_format.ParseDict(graph, self._pb_body) elif isinstance(graph, str): json_format.Parse(graph, self._pb_body) elif isinstance(graph, bytes): self._pb_body.ParseFromString(graph) elif graph is not None: # note ``None`` is not considered as a bad type raise ValueError(f'{typename(graph)} is not recognizable') except Exception as ex: raise BadRequestType( f'fail to construct a {self.__class__} object from {graph}' ) from ex
[docs] def add_edge(self, from_pod: str, to_pod: str, send_as_bind: bool = False) -> None: """Adds an edge to the graph. :param from_pod: Pod from which traffic is send :param to_pod: Pod to which traffic is send :param send_as_bind: True, if the TailPea of the from_pod should send via its ROUTER_BIND socket. """ self._get_target_pod(from_pod).add_edge(to_pod, send_as_bind) self._get_target_pod(to_pod).expected_parts += 1
[docs] def add_pod(self, pod_name: str, pod: 'BasePod') -> None: """Adds a Pod vertex to the graph. :param pod_name: the name of the Pod. Should be unique to the graph. :param pod: the Pod object to be added """ if pod_name in self.pods: raise ValueError( f'Vertex with name {pod_name} already exists. Please check your configuration for unique Pod names.' ) target = self.pods[pod_name] = pod.head_host target.port = pod.head_port_in target.port_out = pod.tail_port_out target.target_identity = pod.head_zmq_identity
def _get_target_pod(self, pod: str) -> TargetPod: return TargetPod(self.pods[pod]) @property def active_pod(self) -> str: """ :return: the active Pod name """ return self.proto.active_pod @active_pod.setter def active_pod(self, pod_name: str) -> None: """Sets the currently active Pod in the routing. .. # noqa: DAR101 """ self.proto.active_pod = pod_name def _get_out_edges(self, pod: str) -> List[str]: return self._get_target_pod(pod).out_edges @property def active_target_pod(self) -> TargetPod: """ :return: a :class:`TargetPod` object of the currently active Pod """ return TargetPod(self.pods[self.active_pod]) @property def pods(self): """ :return: all Pod/vertices of the graph. """ return self.proto.pods
[docs] def get_next_targets(self) -> List['RoutingTable']: """ Calculates next routing graph for all currently outgoing edges. :return: new routing graphs with updated active Pods. """ targets = [] for edge in self._get_out_edges(self.active_pod): new_graph = RoutingTable(self, copy=True) new_graph.active_pod = edge.pod targets.append((new_graph, edge.send_as_bind)) return targets
[docs] def is_acyclic(self) -> bool: """ :return: True, if graph is acyclic, False otherwise. """ topological_sorting = self._topological_sort() position_lookup = { pod: position for position, pod in enumerate(topological_sorting) } for first in topological_sorting: for edge in self._get_out_edges(first): if position_lookup[first] > position_lookup[edge.pod]: return False return True
def _topological_sort(self): """ Calculates a topological sorting. It uses internally _topological_sort_pod() For more information see :return: topological sorting of all Pods by podname """ visited = defaultdict(bool) stack = [] for pod in self.pods: if not visited[pod]: self._topological_sort_pod(pod, visited, stack) return stack[::-1] def _topological_sort_pod(self, pod, visited, stack): visited[pod] = True for edge in self._get_out_edges(pod): if not visited[edge.pod]: self._topological_sort_pod(edge.pod, visited, stack) stack.append(pod)