U tdo5@sdZddlmZmZddlmZmZddlmZddl m Z m Z Gddded Z Gd d d e Z Gd d d ed ZGddde ZGddde ZdS)z1 Abstract base classes for the drawing routines. )ABCMetaabstractmethod)atan2pi) TextAlignment))get_bezier_control_points_for_curved_edgeevaluate_cubic_bezierc@seZdZdZeddZdS)AbstractDrawerzXAbstract class that serves as a base class for anything that draws an igraph object.cOstdSz8Abstract method, must be implemented in derived classes.NNotImplementedError)selfargskwdsrS/home/sam/Atlas/atlas_env/lib/python3.8/site-packages/igraph/drawing/baseclasses.pydrawszAbstractDrawer.drawN)__name__ __module__ __qualname____doc__rrrrrrr sr ) metaclassc@s&eZdZdZdddZeddZdS)AbstractXMLRPCDrawerzfAbstract drawer that uses a remote service via XML-RPC to draw something on a remote display. NcCsDddl}||}|j||_|dkr2|j|_nt|j||_dS)aConstructs an abstract drawer using the XML-RPC service at the given URL. @param url: the URL where the XML-RPC calls for the service should be addressed to. @param service: the name of the service at the XML-RPC address. If C{None}, requests will be directed to the server proxy object constructed by C{xmlrpclib.ServerProxy}; if not C{None}, the given attribute will be looked up in the server proxy object. rN) xmlrpc.client_resolve_hostnameclient ServerProxyserverservicegetattr)rurlrZxmlrpcrrr__init__ s   zAbstractXMLRPCDrawer.__init__cCsddlm}m}ddl}||}|j}|d|r6|Sddlm}d|kr\|d|d}||}|j dk r|d||j f}t |}||d<||S) zParses the given URL, resolves the hostname to an IP address and returns a new URL with the resolved IP address. This speeds up things big time on Mac OS X where an IP lookup would be performed for every XML-RPC call otherwise.r)urlparse urlunparseNz [0-9.:]+$) gethostbyname:z%s:%dr) urllib.parser#r$renetlocmatchsocketr%indexportlist)r!r#r$r(Z url_partshostnamer%rrrr4s   z&AbstractXMLRPCDrawer._resolve_hostname)N)rrrrr" staticmethodrrrrrrs rc@sDeZdZdZeddZeddZeddZdd Z d d Z d S) AbstractEdgeDrawerzeAbstract edge drawer object from which all concrete edge drawer implementations are derived. cCs(|dks|dkrdS|dkr dSt|S)zmConverts values given to the 'curved' edge style argument in plotting calls to floating point values.NFgT?)float)valuerrr_curvature_to_floatWs z&AbstractEdgeDrawer._curvature_to_floatcCstdS)aDraws a directed edge. @param edge: the edge to be drawn. Visual properties of the edge are defined by the attributes of this object. @param src_vertex: the source vertex. Visual properties are defined by the attributes of this object. @param dest_vertex: the source vertex. Visual properties are defined by the attributes of this object. Nr redge src_vertex dest_vertexrrrdraw_directed_edgeas z%AbstractEdgeDrawer.draw_directed_edgecCstdS)aDraws an undirected edge. @param edge: the edge to be drawn. Visual properties of the edge are defined by the attributes of this object. @param src_vertex: the source vertex. Visual properties are defined by the attributes of this object. @param dest_vertex: the source vertex. Visual properties are defined by the attributes of this object. Nr r6rrrdraw_undirected_edgens z'AbstractEdgeDrawer.draw_undirected_edgecCs\|jd|jd}|jd|jd}|dks8|dkrNt| |dt}nd}|jr|j|j\}}\} } t||| | |j\} } t||f| | | | df} n0|jd|jdd|jd|jddf} td}|dkrtjtj}}n`t||d}tj tj tj tj tj tj tj tj g|}tj tjtjtj tj tjtjtj g|}| ||ffS) areturns the position where the label of an edge should be drawn. the default implementation returns the midpoint of the edge and an alignment that tries to avoid overlapping the label with the edge. @param edge: the edge to be drawn. visual properties of the edge are defined by the attributes of this object. @param src_vertex: the source vertex. visual properties are given again as attributes. @param dest_vertex: the target vertex. visual properties are given again as attributes. @return: a tuple containing two more tuples: the desired position of the label and the desired alignment of the label, where the position is given as c{(x, y)} and the alignment is given as c{(horizontal, vertical)}. members of the alignment tuple are taken from constants in the l{textalignment} class. rrNr2g@) positionrrZcurvedrr rZCENTERintRIGHTLEFTZBOTTOMZTOP)rr7r8r9ZdxZdyZanglex1y1x2y2Zaux1Zaux2posZpi4ZhalignZvalignr,rrrget_label_position{sZ    z%AbstractEdgeDrawer.get_label_positionc Cs`|j|j\}}\}}ddtt||||d}d|krLdkr\nn d|d}|S)aGet the rotation angle of the label to align with the edge. @param edge: the edge to be drawn. visual properties of the edge are defined by the attributes of this object. @param src_vertex: the source vertex. visual properties are given again as attributes. @param dest_vertex: the target vertex. visual properties are given again as attributes. @return: a float with the desired angle, in degrees (out of 360). ihgf@Zi)r?rr) rr7r8r9rCrDrErFZrotationrrrget_label_rotations " z%AbstractEdgeDrawer.get_label_rotationN) rrrrr0r5rr:r;rHrKrrrrr1Rs   Hr1c@s$eZdZdZddZeddZdS)AbstractVertexDrawerzdAbstract vertex drawer object from which all concrete vertex drawer implementations are derived.cCs||_||_dS)a,Constructs the vertex drawer and associates it to the given palette. @param palette: the palette that can be used to map integer color indices to colors when drawing vertices @param layout: the layout of the vertices in the graph being drawn N)layoutpalette)rrNrMrrrr"szAbstractVertexDrawer.__init__cCstdS)aDraws the given vertex. @param visual_vertex: object specifying the visual properties of the vertex. Its structure is defined by the VisualVertexBuilder of the L{CairoGraphDrawer}; see its source code. @param vertex: the raw igraph vertex being drawn @param coords: the X and Y coordinates of the vertex as specified by the layout algorithm, scaled into the bounding box. Nr )rZ visual_vertexZvertexcoordsrrrrs zAbstractVertexDrawer.drawN)rrrrr"rrrrrrrLs rLc@sBeZdZdZeddZed ddZeddZed d Z dS) AbstractGraphDrawerz\Abstract class that serves as a base class for anything that draws an igraph.Graph. cOstdSr r )rgraphrrrrrrszAbstractGraphDrawer.drawNcCsLddlm}t||r"||j}n&t|ts4|dkr@||}n||}|S)aHelper method that ensures that I{layout} is an instance of L{Layout}. If it is not, the method will try to convert it to a L{Layout} according to the following rules: - If I{layout} is a string, it is assumed to be a name of an igraph layout, and it will be passed on to the C{layout} method of the given I{graph} if I{graph} is not C{None}. - If I{layout} is C{None}, the C{layout} method of I{graph} will be invoked with no parameters, which will call the default layout algorithm. - Otherwise, I{layout} will be passed on to the constructor of L{Layout}. This handles lists of lists, lists of tuples and such. If I{layout} is already a L{Layout} instance, it will still be copied and a copy will be returned. This is because graph drawers are allowed to transform the layout for their purposes, and we don't want the transformation to propagate back to the caller. r)LayoutN)Z igraph.layoutrR isinstancerOstrrM)rMrQrRrrr ensure_layouts    z!AbstractGraphDrawer.ensure_layoutcCsd|kr|dS|ddkr"dS|d}d}t|trX|\}}t|trX|d}|j|}ttt t ||j t |d}|S)aReturns the order in which the edge of the given graph have to be drawn, assuming that the relevant keyword arguments (C{edge_order} and C{edge_order_by}) are given in C{kwds} as a dictionary. If neither C{edge_order} nor C{edge_order_by} is present in C{kwds}, this function returns C{None} to indicate that the graph drawer is free to choose the most convenient edge ordering. edge_order edge_order_byNFdesckeyreverse) getrStuplerTlower startswithessortedr.rangelen __getitem__bool)rQrrWr[attrsrVrrr_determine_edge_order&s"   z)AbstractGraphDrawer._determine_edge_ordercCsd|kr|dS|ddkr"dS|d}d}t|trX|\}}t|trX|d}|j|}ttt t ||j t |d}|S)aReturns the order in which the vertices of the given graph have to be drawn, assuming that the relevant keyword arguments (C{vertex_order} and C{vertex_order_by}) are given in C{kwds} as a dictionary. If neither C{vertex_order} nor C{vertex_order_by} is present in C{kwds}, this function returns C{None} to indicate that the graph drawer is free to choose the most convenient vertex ordering. vertex_ordervertex_order_byNFrXrY) r\rSr]rTr^r_vsrar.rbrcrdre)rQrrir[rfrhrrr_determine_vertex_orderDs"   z+AbstractGraphDrawer._determine_vertex_order)N) rrrrrrr0rUrgrkrrrrrPs  # rPN)rabcrrmathrrtextrutilsrr r rr1rLrPrrrrs  7