jaseci 1.4.2.5__py3-none-any.whl → 2.0.0__py3-none-any.whl

jaseci/prim/node.py

@@ -1,532 +0,0 @@
-"""
-Node class for Jaseci
-
-Each node has an id, name, timestamp and it's set of edges.
-First node in list of 'member_node_ids' is designated root node
-"""
-from collections import OrderedDict
-from jaseci.prim.element import Element
-from jaseci.prim.obj_mixins import Anchored
-from jaseci.prim.edge import Edge
-from jaseci.utils.id_list import IdList
-from jaseci.utils.utils import logger
-
-import uuid
-
-TO = 0
-FROM = 1
-BI = 2
-
-
-class Node(Element, Anchored):
-    """Node class for Jaseci"""
-
-    def __init__(self, dimension=0, **kwargs):
-        self.edge_ids = IdList(self)
-        self.fast_edges = {}  # {name: [[NODEID, DIR, EDGEID, CONTEXT],...]}
-        self._fast_edge_ids = IdList(self)
-        self.parent_node_ids = IdList(self)
-        self.member_node_ids = IdList(self)
-        self.dimension = dimension  # Nodes are always hdgd 0
-        Element.__init__(self, **kwargs)
-        Anchored.__init__(self)
-
-    @property
-    def smart_edges(self):
-        obj_list = self.smart_edge_list.obj_list()
-        for i in obj_list:
-            if i.is_fast() and i.jid in self.edge_ids:
-                self.edge_ids.remove_obj(i)
-                self._fast_edge_ids.remove_obj(i)
-                self.smart_add_edge(i)
-        return obj_list
-
-    @property
-    def smart_edge_list(self):
-        if not len(self._fast_edge_ids):
-            self.smart_build_fast_edge_ids()
-        return self._fast_edge_ids
-
-    def smart_build_fast_edge_ids(self):
-        self._fast_edge_ids = IdList(self, in_list=self.edge_ids)
-        for k in self.fast_edges.keys():
-            for v in self.fast_edges[k]:
-                link_order = [v[0], self.jid] if v[1] == FROM else [self.jid, v[0]]
-                if len(v) > 2 and self._h.has_obj(v[2]):
-                    edge = self._h.get_obj(self._m_id, v[2])
-                    if len(v) > 3:
-                        v[3] = edge.context
-                    else:
-                        v.append(edge.context)
-                else:
-                    edge = Edge(
-                        m_id=self._m_id, h=self._h, kind="edge", name=k, auto_save=False
-                    )
-                    edge.from_node_id = link_order[0]
-                    edge.to_node_id = link_order[1]
-                    edge.bidirected = v[1] == BI
-                    edge.jid = v[2] if len(v) > 2 else uuid.uuid4().urn
-                    edge.context = v[3] if len(v) > 3 else {}
-                    # old `edge.save()` might be confusing
-                    # this line doesn't mean it has to be saved on db
-                    # it only needs to be available on cache (memory, redis)
-                    self._h.commit_obj_to_cache(edge, True)
-                self._fast_edge_ids.add_obj(edge, bypass=True)
-
-    def smart_add_edge(self, obj):
-        # make sure fast edges built
-        if not len(self._fast_edge_ids):
-            self.smart_build_fast_edge_ids()
-        # add new edge
-        self._fast_edge_ids.add_obj(obj)
-        # then store how needed
-        if obj.is_fast():
-            self.smart_edge_to_fast_edge(obj)
-        else:
-            self.edge_ids.add_obj(obj)
-
-    def smart_edge_to_fast_edge(self, obj):
-        if obj.name not in self.fast_edges:
-            self.fast_edges[obj.name] = []
-        details = [
-            obj.opposing_node(self).jid,
-            BI if obj.is_bidirected() else TO if obj.from_node() == self else FROM,
-            obj.jid,
-            obj.context,
-        ]
-        self.fast_edges[obj.name].append(details)
-
-    def smart_remove_edge(self, obj):
-        if obj.is_fast():
-            pluck = None
-            for i in self.fast_edges[obj.name]:
-                other_node_id = obj.to_node_id if i[1] == TO else obj.from_node_id
-                if i[0] == other_node_id:
-                    if obj.is_bidirected() or not (
-                        i[1] == TO and obj.to_node() == self
-                    ):
-                        pluck = i
-                        break
-            self.fast_edges[obj.name].remove(pluck)
-            if not len(self.fast_edges[obj.name]):
-                del self.fast_edges[obj.name]
-        elif obj and obj.jid in self.edge_ids:
-            self.edge_ids.remove_obj(obj)
-        self.clear_fast_edge_ids()
-        self.save()
-
-    def clear_fast_edge_ids(self):
-        self._fast_edge_ids = IdList(self)
-
-    def attach(self, node_obj, edge_set=None, as_outbound=True, as_bidirected=False):
-        """
-        Generalized attach function for attaching nodes with edges
-        """
-        if edge_set is None:
-            edge_set = [
-                Edge(
-                    m_id=self._m_id,
-                    h=self._h,
-                    kind="edge",
-                    name="generic",
-                )
-            ]
-        link_order = [self, node_obj] if as_outbound else [node_obj, self]
-        for e in edge_set:
-            if not e.connect(link_order[0], link_order[1]):
-                # Node not found error logged in set node function
-                return []
-            e.set_bidirected(as_bidirected)
-        # save and return
-        self.save()
-        node_obj.save()
-        return edge_set
-
-    def attach_outbound(self, node_obj, edge_set=None):
-        """
-        Creates edge to a node and returns the edge
-        edge_set is the list of edges to be used to make connections
-        new edge is created if edge_set is empty
-        """
-        return self.attach(node_obj, edge_set, as_outbound=True)
-
-    def attach_inbound(self, node_obj, edge_set=None):
-        """
-        Creates edge from a node and returns the edge
-        edge_set is the list of edges to be used to make connections
-        new edge is created if edge_set is empty
-        """
-        return self.attach(node_obj, edge_set, as_outbound=False)
-
-    def attach_bidirected(self, node_obj, edge_set=None):
-        """
-        Creates bidirected edge to node returns the edge
-        edge_set is the list of edges to be used to make connections
-        new edge is created if edge_set is empty
-        """
-        return self.attach(node_obj, edge_set, as_bidirected=True)
-
-    def detach(
-        self,
-        node_obj,
-        edge_set=None,
-        as_outbound=True,
-        as_bidirected=False,
-        ignore_direction=False,
-        silent=True,
-    ):
-        """
-        Generalized detach function for detaching nodes with edges
-        """
-        if edge_set is None:
-            edge_set = self.attached_edges(node_obj)
-        link_order = [self, node_obj] if as_outbound else [node_obj, self]
-        num_detached = 0
-        for e in edge_set:
-            # validate edge connection exists
-            if not e.connects(
-                link_order[0], link_order[1], ignore_direction=ignore_direction
-            ):
-                if not silent:
-                    logger.warning(
-                        str(
-                            f"{e} does not connect "
-                            f"{link_order[0]} to {link_order[1]}"
-                        )
-                    )
-                continue
-            if as_bidirected and not ignore_direction and not e.is_bidirected():
-                if not silent:
-                    logger.warning(str(f"{e} is not a bidirected edge "))
-                continue
-            # destroy edge
-            num_detached += 1
-            e.destroy()
-        return num_detached
-
-    def detach_outbound(self, node_obj, edge_set=None, silent=True):
-        """
-        Destroy edges to a node
-        edge_set is the list of edges to be detached (and distroyed)
-        all edges are deteached and destroyed if edge_set empty
-        returns number of detachments
-        """
-        return self.detach(node_obj, edge_set, as_outbound=True)
-
-    def detach_inbound(self, node_obj, edge_set=None, silent=True):
-        """
-        Destroy edges from a node
-        edge_set is the list of edges to be detached (and distroyed)
-        all edges are deteached and destroyed if edge_set empty
-        returns number of detachments
-        """
-        return self.detach(node_obj, edge_set, as_outbound=False)
-
-    def detach_bidirected(self, node_obj, edge_set=None, silent=True):
-        """
-        Destroy bidirected edges between nodes
-        edge_set is the list of edges to be detached (and distroyed)
-        all edges are deteached and destroyed if edge_set empty
-        returns number of detachments
-        """
-        return self.detach(node_obj, edge_set, as_bidirected=True)
-
-    def detach_edges(self, node_obj, edge_set=None, silent=True):
-        """
-        Destroy given edges between nodes without checking orientation
-        edge_set is the list of edges to be detached (and distroyed)
-        all edges are deteached and destroyed if edge_set empty
-        returns number of detachments
-        """
-        return self.detach(node_obj, edge_set, ignore_direction=True)
-
-    def destroy_outbound(self, node_obj, edge_set=None):
-        """
-        Destroys attached node and all relevant edges
-        Node and all edges are destroyed if edge_set empty
-        """
-        if edge_set is None:
-            edge_set = self.outbound_edges(node_obj)
-        if self.detach_outbound(node_obj, edge_set):
-            node_obj.destroy()
-
-    def destroy_inbound(self, node_obj, edge_set=None):
-        """
-        Destroys attached node and all relevant edges
-        Node and all edges are destroyed if edge_set empty
-        """
-        if edge_set is None:
-            edge_set = self.inbound_edges(node_obj)
-        if self.detach_inbound(node_obj, edge_set):
-            node_obj.destroy()
-
-    def destroy_bidirected(self, node_obj, edge_set=None):
-        """
-        Destroys attached node and all relevant edges
-        Node and all edges are destroyed if edge_set empty
-        """
-        if edge_set is None:
-            edge_set = self.bidirected_edges(node_obj)
-        if self.detach_bidirected(node_obj, edge_set):
-            node_obj.destroy()
-
-    def is_attached_out(self, node_obj, edge_set=None):
-        """
-        Tests whether edges attach to a node
-        """
-        out_set = self.outbound_edges(node_obj)
-        if edge_set is None:
-            return len(out_set)
-        else:
-            for e in edge_set:
-                if e not in out_set:
-                    return False
-        return True
-
-    def is_attached_in(self, node_obj, edge_set=None):
-        """
-        Tests whether edges attach from a node
-        """
-        in_set = self.inbound_edges(node_obj)
-        if edge_set is None:
-            return len(in_set)
-        else:
-            for e in edge_set:
-                if e not in in_set:
-                    return False
-        return True
-
-    def is_attached_bi(self, node_obj, edge_set=None):
-        """
-        Tests whether edges attach either to or from a node
-        """
-        bi_set = self.bidirected_edges(node_obj)
-        if edge_set is None:
-            return len(bi_set)
-        else:
-            for e in edge_set:
-                if e not in bi_set:
-                    return False
-        return True
-
-    def outbound_edges(self, node_obj=None):
-        """Returns list of all edges out of node"""
-        edge_set = []
-        for e in self.smart_edges:
-            if not e.is_bidirected() and e.connects(self, node_obj):
-                edge_set.append(e)
-        return edge_set
-
-    def inbound_edges(self, node_obj=None):
-        """Returns list of all edges in to node"""
-        edge_set = []
-        for e in self.smart_edges:
-            if not e.is_bidirected() and e.connects(node_obj, self):
-                edge_set.append(e)
-        return edge_set
-
-    def bidirected_edges(self, node_obj=None):
-        """Returns list of all edges between nodes"""
-        edge_set = []
-        for e in self.smart_edges:
-            if e.is_bidirected() and e.connects(self, node_obj):
-                edge_set.append(e)
-        return edge_set
-
-    def attached_edges(self, node_obj=None, silent=False):
-        """
-        Returns the edges connecting self to or from a node
-
-        silent is used to indicate whther the edge is intened to be used.
-        (effectively turns off error checking when false)
-        """
-        edge_set = (
-            self.outbound_edges(node_obj)
-            + self.inbound_edges(node_obj)
-            + self.bidirected_edges(node_obj)
-        )
-        if not silent and edge_set is None:
-            logger.error(str(f"No edges found between {self} and {node_obj}"))
-        return edge_set
-
-    def outbound_nodes(self, edge_set=None):
-        """Returns list of all nodes connected by edges out"""
-        if edge_set is None:
-            edge_set = self.smart_edges
-        ret_list = []
-        for e in edge_set:
-            if not e.is_bidirected() and e.connects(source=self):
-                ret_list.append(e.to_node())
-        return ret_list
-
-    def inbound_nodes(self, edge_set=None):
-        """Returns list of all nodes connected by edges in"""
-        if edge_set is None:
-            edge_set = self.smart_edges
-        ret_list = []
-        for e in edge_set:
-            if not e.is_bidirected() and e.connects(target=self):
-                ret_list.append(e.from_node())
-        return ret_list
-
-    def bidirected_nodes(self, edge_set=None):
-        """Returns list of all nodes connected by edges"""
-        if edge_set is None:
-            edge_set = self.smart_edges
-        ret_list = []
-        for e in edge_set:
-            if e.is_bidirected():
-                ret_list.append(e.opposing_node(self))
-        return ret_list
-
-    def attached_nodes(self):
-        """Returns list of all nodes connected"""
-        edge_set = self.smart_edges
-        ret_list = []
-        for e in edge_set:
-            ret_list.append(e.opposing_node(self))
-        return ret_list
-
-    def dimension_matches(self, node_obj, silent=True):
-        """Test if dimension matches another node"""
-        matches = self.dimension == node_obj.dimension
-        if not matches and not silent:
-            logger.error(
-                str(
-                    "'{}' cant connect to '{}' - dim mismatch {}->{}".format(
-                        self, node_obj, self.dimension, node_obj.dimension
-                    )
-                )
-            )
-        return matches
-
-    def make_member_of(self, node_obj):
-        """
-        Adds node to higher dimension node and does relevant checks
-        """
-        # check if valid inclusion
-        if node_obj.dimension != self.dimension + 1:
-            logger.error(
-                str(
-                    "'{}' cant be member to '{}' - dimension mismatch {}->{}".format(
-                        self, node_obj, self.dimension, node_obj.dimension
-                    )
-                )
-            )
-        # adds self to hdgd and hdgd to list of owners
-        else:
-            node_obj.member_node_ids.add_obj(self)
-            self.parent_node_ids.add_obj(node_obj)
-
-    def make_owner_of(self, node_obj):
-        """
-        Adds node to lower dimension node and does relevant checks
-        """
-        node_obj.make_member_of(self)
-
-    def leave_memebership_of(self, node_obj):
-        """Remove node from higher dimension node"""
-        node_obj.member_node_ids.remove_obj(self)
-        self.parent_node_ids.remove_obj(node_obj)
-
-    def disown(self, node_obj):
-        """Remove node from higher dimension node"""
-        node_obj.leave_membership_of(self)
-
-    def destroy(self):
-        """
-        Destroys self from memory and persistent storage
-        """
-        for i in self.smart_edges:
-            i.destroy()
-        super().destroy()
-
-    def dot_str(self, node_map=None, detailed=False):
-        """
-        DOT representation
-        """
-
-        def handle_str(str):
-            return str[:32].replace('"', '\\"')
-
-        if node_map is None:
-            nid = f"{uuid.UUID(self.jid).hex}"
-        else:
-            nid = f"{node_map.index(self.jid)}"
-
-        dstr = f'"n{nid}" [ '
-
-        if detailed:
-            dstr += f'id="{uuid.UUID(self.jid).hex}", '
-
-        dstr += f'label="n{nid}:{self.name}" '
-
-        node_dict = self.context
-        for i in self.private_values():
-            node_dict.pop(i)
-
-        if node_dict and detailed:
-            for k, v in node_dict.items():
-                if not isinstance(v, str) or v == "":
-                    continue
-                dstr += f', {k}="{handle_str(v)}"'
-
-        dstr += " ]"
-
-        return dstr + "\n"
-
-    def get_all_architypes(self, depth: int = 0):
-        """
-        Returns all reachable architypes
-        """
-
-        childs = {self.jid: self}
-
-        edges = OrderedDict()
-        nodes = OrderedDict(childs)
-
-        depth -= 1
-
-        while len(childs) and depth != 0:
-            new_childs = OrderedDict()
-
-            for node in childs.values():
-                for edge in node.attached_edges():
-                    if not (edge.jid in edges):
-                        n_node = False
-                        to_node = edge.to_node()
-
-                        if to_node == node:
-                            n_node = edge.from_node()
-                        else:
-                            n_node = to_node
-
-                        if not (n_node.jid in nodes):
-                            edges.update({edge.jid: edge})
-                            new_childs.update({n_node.jid: n_node})
-                        else:
-                            edges.update({edge.jid: edge})
-
-            childs = new_childs
-            nodes.update(childs)
-            depth -= 1
-
-        return nodes, edges
-
-    def traversing_dot_str(self, detailed=False, depth: int = 0):
-        """
-        DOT representation for graph.
-        NOTE: This is different from the dot_str method for node intentionally
-        because graph inherits node.
-        """
-        nodes, edges = self.get_all_architypes(depth)
-
-        # Construct the graph string
-        dstr = ""
-        dstr += f"strict digraph {self.name} {{\n"
-        for n in nodes.values():
-            dstr += f"    {n.dot_str(list(nodes.keys()), detailed)}"
-        for e in edges.values():
-            dstr += f"    {e.dot_str(list(nodes.keys()), list(edges.keys()), detailed)}"
-        dstr += "}"
-        return dstr