Uses of Class
gen.annotation.Original

Packages that use Original

Package	Description
gen.lib.cdt
gen.lib.cgraph
gen.lib.common
gen.lib.dotgen
gen.lib.gvc
gen.lib.label
gen.lib.pack
gen.lib.pathplan

Uses of Original in gen.lib.cdt

Methods in gen.lib.cdt with annotations of type Original

Modifier and Type	Method	Description
static int	dtclose__c.dtclose(ST_dt_s dt)
static ST_dtdisc_s	dtdisc__c.dtdisc(ST_dt_s dt, ST_dtdisc_s disc, int type)
static ST_dtlink_s	dtextract__c.dtextract(ST_dt_s dt)
static ST_dtlink_s	dtflatten__c.dtflatten(ST_dt_s dt)
static java.lang.Object	dtdisc__c.dtmemory(ST_dt_s dt, java.lang.Object addr, size_t size, ST_dtdisc_s disc)
static ST_dt_s	dtopen__c.dtopen(ST_dtdisc_s disc, ST_dtmethod_s meth)
static int	dtrestore__c.dtrestore(ST_dt_s dt, ST_dtlink_s list)
static int	dtsize__c.dtsize_(ST_dt_s dt)
static java.lang.Object	dttree__c.dttree(ST_dt_s dt, __ptr__ obj, int type)
static ST_dt_s	dtview__c.dtview(ST_dt_s dt, ST_dt_s view)
static __ptr__	dtview__c.dtvsearch(ST_dt_s dt, __ptr__ obj, int type)
static int	dtsize__c.treecount(ST_dtlink_s e)

Uses of Original in gen.lib.cgraph

Methods in gen.lib.cgraph with annotations of type Original

Modifier and Type	Method	Description
static void	attr__c.addattr(ST_Agraph_s g, ST_Agobj_s obj, ST_Agsym_s sym)
static __ptr__	mem__c.agalloc(ST_Agraph_s g, size_t size)
static int	apply__c.agapply(ST_Agraph_s g, ST_Agobj_s obj, CFunction fn, __ptr__ arg, boolean preorder)
static ST_Agsym_s	attr__c.agattr(ST_Agraph_s g, int kind, CString name, CString value)
static ST_Agattr_s	attr__c.agattrrec(__ptr__ obj)
static ST_Agsym_s	attr__c.agattrsym(__ptr__ obj, CString name)
static __ptr__	rec__c.agbindrec(__ptr__ arg_obj, CString recname, size_t recsize, boolean mtf)
static ST_Agclos_s	graph__c.agclos(ST_Agdisc_s proto)
static boolean	obj__c.agcontains(ST_Agraph_s g, ST_Agobj_s obj)
static java.lang.Object	attr__c.agcopydict(java.lang.Object... arg_)
static ST_Agdatadict_s	attr__c.agdatadict(ST_Agraph_s g, boolean cflag)
static int	graph__c.agdegree(ST_Agraph_s g, ST_Agnode_s n, boolean want_in, boolean want_out)
static java.lang.Object	obj__c.agdelete(java.lang.Object... arg_)
static java.lang.Object	utils__c.agdictobjfree(java.lang.Object... arg_)
static java.lang.Object	utils__c.agdictobjmem(ST_dt_s dict, java.lang.Object p, size_t size, ST_dtdisc_s disc)
static ST_dt_s	attr__c.agdictof(ST_Agraph_s g, int kind)
static ST_Agsym_s	attr__c.agdictsym(ST_dt_s dict, CString name)
static __ptr__	utils__c.agdtdelete(ST_Agraph_s g, ST_dt_s dict, __ptr__ obj)
static void	utils__c.agdtdisc(ST_Agraph_s g, ST_dt_s dict, ST_dtdisc_s disc)
static ST_dt_s	utils__c.agdtopen(ST_Agraph_s g, ST_dtdisc_s disc, ST_dtmethod_s method)
static ST_Agedge_s	edge__c.agedge(ST_Agraph_s g, ST_Agnode_s t, ST_Agnode_s h, CString name, boolean cflag)
static void	attr__c.agedgeattr_init(ST_Agraph_s g, ST_Agedge_s e)
static int	edge__c.agedgeidcmpf(ST_dt_s d, ST_Agedge_s arg_e0, ST_Agedge_s arg_e1, ST_dtdisc_s disc)
static int	edge__c.agedgeseqcmpf(ST_dt_s d, ST_Agedge_s arg_e0, ST_Agedge_s arg_e1, ST_dtdisc_s disc)
static java.lang.Object	agerror__c.agerrorf(java.lang.Object... arg_)
static ST_Agedge_s	edge__c.agfindedge_by_key(ST_Agraph_s g, ST_Agnode_s t, ST_Agnode_s h, ST_Agtag_s key)
static ST_Agnode_s	node__c.agfindnode_by_id(ST_Agraph_s g, int id)
static ST_Agraph_s	subg__c.agfindsubg_by_id(ST_Agraph_s g, int id)
static ST_Agedge_s	edge__c.agfstedge(ST_Agraph_s g, ST_Agnode_s n)
static ST_Agedge_s	edge__c.agfstin(ST_Agraph_s g, ST_Agnode_s n)
static ST_Agnode_s	node__c.agfstnode(ST_Agraph_s g)
static ST_Agedge_s	edge__c.agfstout(ST_Agraph_s g, ST_Agnode_s n)
static ST_Agraph_s	subg__c.agfstsubg(ST_Agraph_s g)
static CString	attr__c.agget(__ptr__ obj, CString name)
static ST_Agrec_s	rec__c.aggetrec(__ptr__ obj, CString name, boolean mtf)
static ST_Agnode_s	edge__c.aghead(__ptr__ e)
static int	refstr__c.aghtmlstr(CString s)
static ST_Agnode_s	node__c.agidnode(ST_Agraph_s g, int id, int cflag)
static void	obj__c.aginitcb(ST_Agraph_s g, __ptr__ obj, ST_Agcbstack_s cbstack)
static java.lang.Object	imap__c.aginternalmapinsert(java.lang.Object... arg_)
static int	imap__c.aginternalmaplookup(ST_Agraph_s g, int objtype, CString str, int[] result)
static CString	imap__c.aginternalmapprint(ST_Agraph_s g, int objtype, int id)
static boolean	graph__c.agisdirected(ST_Agraph_s g)
static boolean	graph__c.agisstrict(ST_Agraph_s g)
static boolean	graph__c.agisundirected(ST_Agraph_s g)
static ST_Agsym_s	attr__c.aglocaldictsym(ST_dt_s dict, CString name)
static ST_Agrec_s	attr__c.agmakeattrs(ST_Agraph_s context, ST_Agobj_s obj)
static ST_Agdatadict_s	attr__c.agmakedatadict(ST_Agraph_s g)
static int	id__c.agmapnametoid(ST_Agraph_s g, int objtype, CString str, int[] result, boolean createflag)
static void	obj__c.agmethod_init(ST_Agraph_s g, __ptr__ obj)
static void	obj__c.agmethod_upd(ST_Agraph_s g, __ptr__ obj, ST_Agsym_s sym)
static CString	id__c.agnameof(ST_Agobj_s obj)
static int	graph__c.agnedges(ST_Agraph_s g)
static ST_Agsym_s	attr__c.agnewsym(ST_Agraph_s g, CString name, CString value, int id, int kind)
static int	graph__c.agnextseq(ST_Agraph_s g, int objtype)
static int	graph__c.agnnodes(ST_Agraph_s g)
static ST_Agnode_s	node__c.agnode(ST_Agraph_s g, CString name, boolean cflag)
static void	attr__c.agnodeattr_init(ST_Agraph_s g, ST_Agnode_s n)
static ST_Agedge_s	edge__c.agnxtedge(ST_Agraph_s g, ST_Agedge_s e, ST_Agnode_s n)
static ST_Agedge_s	edge__c.agnxtin(ST_Agraph_s g, ST_Agedge_s e)
static ST_Agnode_s	node__c.agnxtnode(ST_Agraph_s g, ST_Agnode_s n)
static ST_Agedge_s	edge__c.agnxtout(ST_Agraph_s g, ST_Agedge_s e)
static ST_Agraph_s	subg__c.agnxtsubg(ST_Agraph_s subg)
static int	obj__c.agobjkind(ST_Agobj_s arg)
static ST_Agraph_s	graph__c.agopen(CString name, ST_Agdesc_s desc, ST_Agdisc_s arg_disc)
static ST_Agraph_s	graph__c.agopen1(ST_Agraph_s g)
static ST_Agedge_s	edge__c.agopp(__ptr__ e)
static ST_Agraph_s	subg__c.agparent(ST_Agraph_s g)
static void	attr__c.agraphattr_init(ST_Agraph_s g)
static int	graph__c.agraphidcmpf(ST_dt_s d, ST_Agraph_s arg0, ST_Agraph_s arg1, ST_dtdisc_s disc)
static ST_Agraph_s	obj__c.agraphof(ST_Agobj_s obj)
static java.lang.Object	pend__c.agrecord_callback(java.lang.Object... arg_)
static void	id__c.agregister(ST_Agraph_s g, int objtype, java.lang.Object obj)
static ST_Agraph_s	obj__c.agroot(ST_Agobj_s obj)
static int	attr__c.agsafeset(ST_Agobj_s obj, CString name, CString value, CString def)
static CString	refstr__c.agstrbind(ST_Agraph_s g, CString s)
static CString	refstr__c.agstrdup(ST_Agraph_s g, CString s)
static int	refstr__c.agstrfree(ST_Agraph_s g, CString s)
static ST_Agedge_s	edge__c.agsubedge(ST_Agraph_s g, ST_Agedge_s e, boolean cflag)
static ST_Agraph_s	subg__c.agsubg(ST_Agraph_s g, CString name, boolean cflag)
static ST_Agnode_s	node__c.agsubnode(ST_Agraph_s g, ST_Agnode_s n0, boolean cflag)
static int	node__c.agsubnodeidcmpf(ST_dt_s d, __ptr__ arg0, __ptr__ arg1, ST_dtdisc_s disc)
static int	node__c.agsubnodeseqcmpf(ST_dt_s d, __ptr__ arg0, __ptr__ arg1, ST_dtdisc_s disc)
static ST_Agsubnode_s	edge__c.agsubrep(ST_Agraph_s g, ST_Agnode_s n)
static ST_Agnode_s	edge__c.agtail(ST_Agedge_s e)
static void	obj__c.agupdcb(ST_Agraph_s g, __ptr__ obj, ST_Agsym_s sym, ST_Agcbstack_s cbstack)
static CString	attr__c.agxget(__ptr__ obj, ST_Agsym_s sym)
static int	attr__c.agxset(ST_Agobj_s obj, ST_Agsym_s sym, CString value)
static int	graph__c.cnt(ST_dt_s d, CStarStar<ST_dtlink_s> set)
static ST_IMapEntry_t	imap__c.find_isym(ST_Agraph_s g, int objtype, int id)
static java.lang.Object	node__c.free_subnode(java.lang.Object... arg_)
static void	attr__c.freesym(ST_dt_s d, java.lang.Object obj, ST_dtdisc_s disc)
static ST_Agsym_s	attr__c.getattr(ST_Agraph_s g, int kind, CString name)
static java.lang.Object	id__c.idalloc(java.lang.Object... arg_)
static java.lang.Object	id__c.idclose(java.lang.Object... arg_)
static java.lang.Object	id__c.idfree(java.lang.Object... arg_)
static int	id__c.idmap(java.lang.Object state, int objtype, CString str, int[] id, boolean createflag)
static java.lang.Object	id__c.idopen(ST_Agraph_s g, ST_Agdisc_s disc)
static CString	id__c.idprint(__ptr__ state, int objtype, int id)
static void	id__c.idregister(java.lang.Object state, int objtype, java.lang.Object obj)
static java.lang.Object	attr__c.init_all_attrs(java.lang.Object... arg_)
static void	node__c.initnode(ST_Agraph_s g, ST_Agnode_s n)
static void	edge__c.ins(ST_dt_s d, CStarStar<ST_dtlink_s> set, ST_Agedge_s e)
static void	edge__c.installedge(ST_Agraph_s g, ST_Agedge_s e)
static void	node__c.installnode(ST_Agraph_s g, ST_Agnode_s n)
static void	node__c.installnodetoroot(ST_Agraph_s g, ST_Agnode_s n)
static ST_Agraph_s	subg__c.localsubg(ST_Agraph_s g, int id)
static __ptr__	mem__c.memalloc(__ptr__ heap, size_t request)
static java.lang.Object	mem__c.memfree(java.lang.Object... arg_)
static java.lang.Object	mem__c.memopen(ST_Agdisc_s disc)
static __ptr__	mem__c.memresize(__ptr__ heap, __ptr__ ptr, size_t oldsize, size_t request)
static ST_Agedge_s	edge__c.newedge(ST_Agraph_s g, ST_Agnode_s t, ST_Agnode_s h, int id)
static ST_Agnode_s	node__c.newnode(ST_Agraph_s g, int id, int seq)
static boolean	edge__c.ok_to_make_edge(ST_Agraph_s g, ST_Agnode_s t, ST_Agnode_s h)
static void	apply__c.rec_apply(ST_Agraph_s g, ST_Agobj_s obj, CFunction fn, __ptr__ arg, CFunction objsearch, boolean preorder)
static void	rec__c.set_data(ST_Agobj_s obj, ST_Agrec_s data, int mtflock)
static ST_Agsym_s	attr__c.setattr(ST_Agraph_s g, int kind, CString name, CString value)
static java.lang.Object	edge__c.subedge(java.lang.Object... arg_)
static ST_Agobj_s	apply__c.subgraph_search(ST_Agraph_s sub, ST_Agobj_s g)
static int	attr__c.topdictsize(ST_Agobj_s obj)

Uses of Original in gen.lib.common

Methods in gen.lib.common with annotations of type Original

Modifier and Type	Method	Description
static CArray<ST_pointf>	routespl__c._routesplines(ST_path pp, int[] npoints, int polyline)
static void	splines__c.add_box(ST_path P, ST_boxf b)
static void	ns__c.add_tree_edge(ST_Agedge_s e)
static ST_cinfo_t	postproc__c.addClusterObj(ST_Agraph_s g, ST_cinfo_t info)
static ST_boxf	utils__c.addLabelBB(ST_boxf bb, ST_textlabel_t lp, boolean flipxy)
static ST_boxf	postproc__c.addLabelObj(ST_textlabel_t lp, CArray<ST_object_t> objp, ST_boxf bb)
static ST_boxf	postproc__c.addNodeObj(ST_Agnode_s np, CArray<ST_object_t> objp, ST_boxf bb)
static ST_boxf	postproc__c.addNodeObj_(ST_Agnode_s np, CArray<ST_object_t> objp, ST_boxf bb)
static void	postproc__c.addXLabel(ST_textlabel_t lp, CArray<ST_object_t> objp, CArray<ST_xlabel_t> xlp, int initObj, ST_pointf pos)
static void	postproc__c.addXLabels(ST_Agraph_s gp)
static ST_boxf	postproc__c.adjustBB(CArray<ST_object_t> objp, ST_boxf bb)
static java.lang.Object	arrows__c.arrow_bb(java.lang.Object... arg)
static void	splines__c.arrow_clip(ST_Agedge_s fe, ST_Agnode_s hn, CArray<ST_pointf> ps, int[] startp, int[] endp, ST_bezier spl, ST_splineInfo info)
static void	arrows__c.arrow_flags(ST_Agedge_s e, int[] sflag, int[] eflag)
static java.lang.Object	arrows__c.arrow_gen(java.lang.Object... arg)
static java.lang.Object	arrows__c.arrow_gen_type(java.lang.Object... arg)
static double	arrows__c.arrow_length(ST_Agedge_s e, int flag)
static void	arrows__c.arrow_match_name(CString name, int[] flag)
static CString	arrows__c.arrow_match_name_frag(CString name, ST_arrowname_t[] arrownames, int[] flag)
static CString	arrows__c.arrow_match_shape(CString name, int[] flag)
static java.lang.Object	arrows__c.arrow_type_box(java.lang.Object... arg)
static java.lang.Object	arrows__c.arrow_type_crow(java.lang.Object... arg)
static java.lang.Object	arrows__c.arrow_type_curve(java.lang.Object... arg)
static java.lang.Object	arrows__c.arrow_type_diamond(java.lang.Object... arg)
static java.lang.Object	arrows__c.arrow_type_dot(java.lang.Object... arg)
static java.lang.Object	arrows__c.arrow_type_gap(java.lang.Object... arg)
static java.lang.Object	arrows__c.arrow_type_normal(java.lang.Object... arg_)
static java.lang.Object	arrows__c.arrow_type_tee(java.lang.Object... arg)
static int	arrows__c.arrowEndClip(ST_Agedge_s e, CArray<ST_pointf> ps, int startp, int endp, ST_bezier spl, int eflag)
static java.lang.Object	arrows__c.arrowOrthoClip(java.lang.Object... arg)
static int	arrows__c.arrowStartClip(ST_Agedge_s e, CArray<ST_pointf> ps, int startp, int endp, ST_bezier spl, int sflag)
static void	splines__c.beginpath(ST_path P, ST_Agedge_s e, int et, ST_pathend_t endp, boolean merge)
static ST_pointf	utils__c.Bezier(CArray<ST_pointf> V, int degree, double t, CArray<ST_pointf> Left, CArray<ST_pointf> Right)
static void	splines__c.bezier_clip(__ptr__ inside_context, __ptr__ inside, CArray<ST_pointf> sp, boolean left_inside)
static ST_shape_desc	shapes__c.bind_shape(CString name, ST_Agnode_s np)
static ST_pointf	geom__c.ccwrotatepf(ST_pointf p, int ccwrot)
static ST_pointf	postproc__c.centerPt(CArray<ST_xlabel_t> xlp)
static boolean	emit__c.check_control_points(CArray<ST_pointf> cp)
static int	routespl__c.checkpath(int boxn, ST_boxf[] boxes, ST_path thepath)
static ST_port	utils__c.chkPort(CFunction pf, ST_Agnode_s n, CString s)
static void	splines__c.clip_and_install(ST_Agedge_s fe, ST_Agnode_s hn, CArray<ST_pointf> ps, int pn, ST_splineInfo info)
static CString	shapes__c.closestSide(ST_Agnode_s n, ST_Agnode_s other, ST_port oldport)
static int	utils__c.common_init_edge(ST_Agedge_s e)
static void	utils__c.common_init_node(ST_Agnode_s n)
static java.lang.Object	shapes__c.compassPoint(java.lang.Object... arg)
static boolean	shapes__c.compassPort(ST_Agnode_s n, ST_boxf bp, ST_port pp, CString compass, int sides, ST_inside_t ictxt)
static double	splines__c.conc_slope(ST_Agnode_s n)
static int	splines__c.convert_sides_to_points(int tail_side, int head_side)
static int	postproc__c.countClusterLabels(ST_Agraph_s g)
static ST_point	shapes__c.cvtPt(ST_pointf p, int rankdir)
static ST_pointf	geom__c.cwrotatepf(ST_pointf p, int cwrot)
static ST_Agnode_s	utils__c.dequeue(ST_nodequeue q)
static void	ns__c.dfs_cutval(ST_Agnode_s v, ST_Agedge_s par)
static void	ns__c.dfs_enter_inedge(ST_Agnode_s v)
static void	ns__c.dfs_enter_outedge(ST_Agnode_s v)
static int	ns__c.dfs_range(ST_Agnode_s v, ST_Agedge_s par, int low)
static void	input__c.do_graph_label(ST_Agraph_s sg)
static ST_pointf	utils__c.dotneato_closest(ST_splines spl, ST_pointf pt)
static void	postproc__c.dotneato_postprocess(ST_Agraph_s g)
static ST_pointf	postproc__c.edgeHeadpoint(ST_Agedge_s e)
static ST_pointf	splines__c.edgeMidpoint(ST_Agraph_s g, ST_Agedge_s e)
static ST_pointf	postproc__c.edgeTailpoint(ST_Agedge_s e)
static int	utils__c.edgeType(CString s, int dflt)
static void	splines__c.endpath(ST_path P, ST_Agedge_s e, int et, ST_pathend_t endp, boolean merge)
static void	splines__c.endPoints(ST_splines spl, ST_pointf p, ST_pointf q)
static void	utils__c.enqueue(ST_nodequeue q, ST_Agnode_s n)
static ST_Agedge_s	ns__c.enter_edge(ST_Agedge_s e)
static java.lang.Object	shapes__c.epsf_gencode(java.lang.Object... arg)
static java.lang.Object	shapes__c.epsf_inside(java.lang.Object... arg)
static void	ns__c.exchange_tree_edges(ST_Agedge_s e, ST_Agedge_s f)
static int	ns__c.feasible_tree()
static java.lang.Object	shapes__c.find_user_shape(java.lang.Object... arg)
static int	input__c.findCharset(ST_Agraph_s g)
static java.lang.Object	shapes__c.free_field(java.lang.Object... arg)
static void	utils__c.free_queue(ST_nodequeue q)
static void	ns__c.freeTreeList(ST_Agraph_s g)
static boolean	input__c.getdoubles2ptf(ST_Agraph_s g, CString name, ST_pointf result)
static ST_splines	splines__c.getsplinepoints(ST_Agedge_s e)
static __ptr__	memory__c.gmalloc(size_t nbytes)
static void	input__c.graph_init(ST_Agraph_s g, boolean use_rankdir)
static __ptr__	memory__c.grealloc(__ptr__ ptr, size_t size)
static void	emit__c.gv_fixLocale(int set)
static void	utils__c.gv_nodesize(ST_Agnode_s n, boolean flip)
static void	postproc__c.gv_postprocess(ST_Agraph_s g, int allowTranslation)
static ST_boxf	htmltable__c.html_port(ST_Agnode_s n, CString pname, int[] sides)
static CString	utils__c.htmlEntityUTF8(CString s, ST_Agraph_s g)
static ST_Agnode_s	ns__c.incident(ST_Agedge_s e)
static void	ns__c.init_cutvalues()
static int	ns__c.init_graph(ST_Agraph_s g)
static void	ns__c.init_rank()
static __ptr__	emit__c.init_xdot(ST_Agraph_s g)
static void	utils__c.initFontEdgeAttr(ST_Agedge_s e, ST_fontinfo fi)
static void	utils__c.initFontLabelEdgeAttr(ST_Agedge_s e, ST_fontinfo fi, ST_fontinfo lfi)
static boolean	arrows__c.inside(ST_inside_t inside_context, ST_pointf p)
static double	shapes__c.invflip_angle(double angle, int rankdir)
static int	shapes__c.invflip_side(int side, int rankdir)
static java.lang.Object	shapes__c.isPolygon(java.lang.Object... arg)
static boolean	utils__c.late_bool(__ptr__ obj, ST_Agsym_s attr, int def)
static double	utils__c.late_double(__ptr__ obj, ST_Agsym_s attr, double def, double low)
static int	utils__c.late_int(__ptr__ obj, ST_Agsym_s attr, int def, int low)
static CString	utils__c.late_nnstring(__ptr__ obj, ST_Agsym_s attr, CString def)
static CString	utils__c.late_string(__ptr__ obj, ST_Agsym_s attr, CString def)
static ST_Agedge_s	ns__c.leave_edge()
static void	routespl__c.limitBoxes(ST_boxf[] boxes, int boxn, CArray<ST_pointf> pps, int pn, int delta)
static void	ns__c.LR_balance()
static int	htmltable__c.make_html_label(__ptr__ obj, ST_textlabel_t lp)
static ST_textlabel_t	labels__c.make_label(ST_Agobj_s obj, CString str, int kind, double fontsize, CString fontname, CString fontcolor)
static void	labels__c.make_simple_label(ST_GVC_s gvc, ST_textlabel_t lp)
static void	splines__c.makeSelfEdge(ST_path P, CArrayOfStar<ST_Agedge_s> edges, int ind, int cnt, double sizex, double sizey, ST_splineInfo sinfo)
static java.lang.Object	routespl__c.makeStraightEdge(java.lang.Object... arg_)
static void	postproc__c.map_edge(ST_Agedge_s e)
static ST_pointf	postproc__c.map_point(ST_pointf p)
static ST_field_t	shapes__c.map_rec_port(ST_field_t f, CString str)
static boolean	utils__c.mapbool(CString p)
static boolean	utils__c.mapBool(CString p, boolean dflt)
static int	utils__c.maptoken(CString p, CString[] name, int[] val)
static boolean	routespl__c.mkspacep(int size)
static ST_nodequeue	utils__c.new_queue(int sz)
static ST_bezier	splines__c.new_spline(ST_Agedge_s e, int sz)
static boolean	utils__c.noClip(ST_Agedge_s e, ST_Agsym_s sym)
static int	routespl__c.overlap(double i0, double i1, double j0, double j1)
static int	routespl__c.overlap(int i0, int i1, int j0, int j1)
static ST_field_t	shapes__c.parse_reclbl(ST_Agnode_s n, boolean LR, boolean flag, CString text)
static void	postproc__c.place_graph_label(ST_Agraph_s g)
static java.lang.Object	shapes__c.poly_free(java.lang.Object... arg_)
static java.lang.Object	shapes__c.poly_gencode(java.lang.Object... arg)
static void	shapes__c.poly_init(ST_Agnode_s n)
static boolean	shapes__c.poly_inside(ST_inside_t inside_context, ST_pointf p)
static int	shapes__c.poly_path(ST_Agnode_s n, ST_port p, int side, java.lang.Object rv, java.lang.Object kptr)
static ST_port	shapes__c.poly_port(ST_Agnode_s n, CString portname, CString compass)
static void	shapes__c.pos_reclbl(ST_field_t f, ST_pointf ul, int sides)
static double	geom__c.ptToLine2(ST_pointf a, ST_pointf b, ST_pointf p)
static int	ns__c.rank(ST_Agraph_s g, int balance, int maxiter)
static int	ns__c.rank2(ST_Agraph_s g, int balance, int maxiter, int search_size)
static java.lang.Object	shapes__c.record_free(java.lang.Object... arg_)
static java.lang.Object	shapes__c.record_gencode(java.lang.Object... arg)
static void	shapes__c.record_init(ST_Agnode_s n)
static boolean	shapes__c.record_inside(ST_inside_t inside_context, ST_pointf p)
static int	shapes__c.record_path(ST_Agnode_s n, ST_port prt, int side, ST_boxf rv, int[] kptr)
static ST_port	shapes__c.record_port(ST_Agnode_s n, CString portname, CString compass)
static void	ns__c.rerank(ST_Agnode_s v, int delta)
static void	shapes__c.resize_reclbl(ST_field_t f, ST_pointf sz, boolean nojustify_p)
static ST_port	shapes__c.resolvePort(ST_Agnode_s n, ST_Agnode_s other, ST_port oldport)
static java.lang.Object	shapes__c.resolvePorts(java.lang.Object... arg)
static ST_pointf	geom__c.rotatepf(ST_pointf p, int cwrot)
static CArray<ST_pointf>	routespl__c.routepolylines(ST_path pp, int[] npoints)
static CArray<ST_pointf>	routespl__c.routesplines(ST_path pp, int[] npoints)
static int	routespl__c.routesplinesinit()
static void	routespl__c.routesplinesterm()
static CString	utils__c.safefile(CString filename)
static boolean	shapes__c.same_side(ST_pointf p0, ST_pointf p1, ST_pointf L0, ST_pointf L1)
static void	ns__c.scan_and_normalize()
static java.lang.Object	splines__c.selfBottom(java.lang.Object... arg_)
static java.lang.Object	splines__c.selfLeft(java.lang.Object... arg_)
static void	splines__c.selfRight(CArrayOfStar<ST_Agedge_s> edges, int ind, int cnt, double stepx, double sizey, ST_splineInfo sinfo)
static int	splines__c.selfRightSpace(ST_Agedge_s e)
static java.lang.Object	splines__c.selfTop(java.lang.Object... arg_)
static void	utils__c.setEdgeType(ST_Agraph_s g, int dflt)
static void	input__c.setRatio(ST_Agraph_s g)
static void	splines__c.shape_clip0(__ptr__ inside_context, ST_Agnode_s n, CArray<ST_pointf> curve, boolean left_inside)
static EN_shape_kind	shapes__c.shapeOf(ST_Agnode_s n)
static CArray<ST_pointf>	routespl__c.simpleSplineRoute(ST_pointf tp, ST_pointf hp, ST_Ppoly_t poly, int[] n_spl_pts, boolean polyline)
static ST_pointf	shapes__c.size_reclbl(ST_Agnode_s n, ST_field_t f)
static java.lang.Object	shapes__c.star_inside(java.lang.Object... arg)
static java.lang.Object	shapes__c.star_size(java.lang.Object... arg)
static java.lang.Object	shapes__c.star_vertices(java.lang.Object... arg)
static void	labels__c.storeline(ST_GVC_s gvc, ST_textlabel_t lp, CString line, char terminator)
static int	strcasecmp__c.strcasecmp(CString s1, CString s2)
static CString	labels__c.strdup_and_subst_obj(CString str, __ptr__ obj)
static CString	labels__c.strdup_and_subst_obj0(CString str, ST_Agobj_s obj, int escBackslash)
static void	ns__c.TB_balance()
static ST_dt_s	textspan__c.textfont_dict_open(ST_GVC_s gvc)
static ST_pointf	textspan__c.textspan_size(ST_GVC_s gvc, ST_textspan_t span)
static int	ns__c.tight_tree()
static void	postproc__c.translate_bb(ST_Agraph_s g, int rankdir)
static void	postproc__c.translate_drawing(ST_Agraph_s g)
static boolean	ns__c.treesearch(ST_Agnode_s v)
static ST_Agnode_s	ns__c.treeupdate(ST_Agnode_s v, ST_Agnode_s w, int cutvalue, boolean dir)
static ST_Agnode_s	utils__c.UF_find(ST_Agnode_s n)
static void	utils__c.UF_setname(ST_Agnode_s u, ST_Agnode_s v)
static void	utils__c.UF_singleton(ST_Agnode_s u)
static ST_Agnode_s	utils__c.UF_union(ST_Agnode_s u, ST_Agnode_s v)
static void	shapes__c.unrecognized(ST_Agnode_s n, CString p)
static void	ns__c.update(ST_Agedge_s e, ST_Agedge_s f)
static void	emit__c.update_bb_bz(ST_boxf bb, CArray<ST_pointf> cp)
static void	utils__c.updateBB(ST_Agraph_s g, ST_textlabel_t lp)
static void	ns__c.x_cutval(ST_Agedge_s f)
static int	ns__c.x_val(ST_Agedge_s e, ST_Agnode_s v, int dir)
static __ptr__	memory__c.zmalloc(size_t nbytes)

Uses of Original in gen.lib.dotgen

Methods in gen.lib.dotgen with annotations of type Original

Modifier and Type	Method	Description
static void	flat__c.abomination(ST_Agraph_s g)
static void	acyclic__c.acyclic_(ST_Agraph_s g)
static void	decomp__c.add_to_component(ST_Agnode_s n)
static java.lang.Object	position__c.adjustAspectRatio(java.lang.Object... arg_)
static void	dotsplines__c.adjustregularpath(ST_path P, int fb, int lb)
static void	position__c.allocate_aux_edges(ST_Agraph_s g)
static void	mincross__c.allocate_ranks(ST_Agraph_s g)
static java.lang.Object	dotinit__c.attach_phase_attrs(java.lang.Object... arg)
static java.lang.Object	dotinit__c.attachPos(java.lang.Object... arg)
static java.lang.Object	mincross__c.balance(java.lang.Object... arg_)
static void	fastgr__c.basic_merge(ST_Agedge_s e, ST_Agedge_s rep)
static void	decomp__c.begin_component()
static ST_Agedge_s	dotsplines__c.bot_bound(ST_Agedge_s e, int side)
static ST_boxf	dotsplines__c.boxfof(double llx, double lly, double urx, double ury)
static void	mincross__c.build_ranks(ST_Agraph_s g, int pass)
static void	cluster__c.build_skeleton(ST_Agraph_s g, ST_Agraph_s subg)
static boolean	position__c.canreach(ST_Agnode_s u, ST_Agnode_s v)
static void	flat__c.checkFlatAdjacent(ST_Agedge_s e)
static ST_Agraph_s	dotsplines__c.cl_bound(ST_Agraph_s g, ST_Agnode_s n, ST_Agnode_s adj)
static boolean	dotsplines__c.cl_vninside(ST_Agraph_s cl, ST_Agnode_s n)
static void	class1__c.class1_(ST_Agraph_s g)
static void	class2__c.class2(ST_Agraph_s g)
static void	rank__c.cleanup1(ST_Agraph_s g)
static void	mincross__c.cleanup2(ST_Agraph_s g, int nc)
static ST_Agnode_s	cluster__c.clone_vn(ST_Agraph_s g, ST_Agnode_s vn)
static int	position__c.clust_ht(ST_Agraph_s g)
static void	rank__c.cluster_leader(ST_Agraph_s clust)
static void	rank__c.collapse_cluster(ST_Agraph_s g, ST_Agraph_s subg)
static java.lang.Object	rank__c.collapse_rankset(java.lang.Object... arg_)
static void	rank__c.collapse_sets(ST_Agraph_s rg, ST_Agraph_s g)
static void	dotsplines__c.completeregularpath(ST_path P, ST_Agedge_s first, ST_Agedge_s last, ST_pathend_t tendp, ST_pathend_t hendp, ST_boxf[] boxes, int boxn, int flag)
static void	position__c.compress_graph(ST_Agraph_s g)
static void	position__c.connectGraph(ST_Agraph_s g)
static boolean	mincross__c.constraining_flat_edge(ST_Agraph_s g, ST_Agnode_s v, ST_Agedge_s e)
static void	position__c.contain_clustnodes(ST_Agraph_s g)
static void	position__c.contain_nodes(ST_Agraph_s g)
static void	position__c.contain_subclust(ST_Agraph_s g)
static void	position__c.create_aux_edges(ST_Agraph_s g)
static void	decomp__c.decompose(ST_Agraph_s g, int pass)
static void	fastgr__c.delete_fast_edge(ST_Agedge_s e)
static void	fastgr__c.delete_fast_node(ST_Agraph_s g, ST_Agnode_s n)
static void	fastgr__c.delete_flat_edge(ST_Agedge_s e)
static void	acyclic__c.dfs(ST_Agnode_s n)
static java.lang.Object	position__c.do_leaves(java.lang.Object... arg_)
static void	dotinit__c.doDot(ST_Agraph_s g)
static java.lang.Object	dotinit__c.dot_cleanup(java.lang.Object... arg_)
static java.lang.Object	compound__c.dot_compoundEdges(java.lang.Object... arg_)
static void	position__c.dot_compute_bb(ST_Agraph_s g, ST_Agraph_s root)
static java.lang.Object	conc__c.dot_concentrate(java.lang.Object... arg_)
static void	dotinit__c.dot_init_edge(ST_Agedge_s e)
static void	dotinit__c.dot_init_node(ST_Agnode_s n)
static void	dotinit__c.dot_init_node_edge(ST_Agraph_s g)
static void	dotinit__c.dot_init_subg(ST_Agraph_s g, ST_Agraph_s droot)
static void	dotinit__c.dot_layout(ST_Agraph_s g)
static void	mincross__c.dot_mincross(ST_Agraph_s g, boolean doBalance)
static void	position__c.dot_position(ST_Agraph_s g, ST_aspect_t asp)
static void	rank__c.dot_rank(ST_Agraph_s g, ST_aspect_t asp)
static ST_Agraph_s	dotinit__c.dot_root(ST_Agobj_s p)
static void	sameport__c.dot_sameports(ST_Agraph_s g)
static void	dotsplines__c.dot_splines(ST_Agraph_s g)
static void	rank__c.dot1_rank(ST_Agraph_s g, ST_aspect_t asp)
static java.lang.Object	rank__c.dot2_rank(java.lang.Object... arg_)
static void	dotinit__c.dotLayout(ST_Agraph_s g)
static void	dotsplines__c.edge_normalize(ST_Agraph_s g)
static int	dotsplines__c.edgecmp(CArrayOfStar<ST_Agedge_s> ptr0, CArrayOfStar<ST_Agedge_s> ptr1)
static void	rank__c.edgelabel_ranks(ST_Agraph_s g)
static int	dotsplines__c.edgelblcmpfn(CArrayOfStar<ST_Agedge_s> ptr0, CArrayOfStar<ST_Agedge_s> ptr1)
static void	decomp__c.end_component()
static int	mincross__c.endpoint_class(ST_Agnode_s n)
static void	mincross__c.enqueue_neighbors(ST_nodequeue q, ST_Agnode_s n0, int pass)
static void	mincross__c.exchange(ST_Agnode_s v, ST_Agnode_s w)
static void	cluster__c.expand_cluster(ST_Agraph_s subg)
static void	position__c.expand_leaves(ST_Agraph_s g)
static void	rank__c.expand_ranksets(ST_Agraph_s g, ST_aspect_t asp)
static ST_Agedge_s	fastgr__c.fast_edge(ST_Agedge_s e)
static void	fastgr__c.fast_node(ST_Agraph_s g, ST_Agnode_s n)
static ST_Agedge_s	fastgr__c.ffe(ST_Agnode_s u, ST_elist uL, ST_Agnode_s v, ST_elist vL)
static void	mincross__c.fillRanks(ST_Agraph_s g)
static java.lang.Object	rank__c.find_clusters(java.lang.Object... arg_)
static ST_Agedge_s	fastgr__c.find_fast_edge(ST_Agnode_s u, ST_Agnode_s v)
static ST_Agnode_s	fastgr__c.find_fast_node(ST_Agraph_s g, ST_Agnode_s n)
static ST_Agedge_s	fastgr__c.find_flat_edge(ST_Agnode_s u, ST_Agnode_s v)
static void	flat__c.findlr(ST_Agnode_s u, ST_Agnode_s v, int[] lp, int[] rp)
static void	mincross__c.flat_breakcycles(ST_Agraph_s g)
static void	fastgr__c.flat_edge(ST_Agraph_s g, ST_Agedge_s e)
static boolean	flat__c.flat_edges(ST_Agraph_s g)
static int	flat__c.flat_limits(ST_Agraph_s g, ST_Agedge_s e)
static boolean	mincross__c.flat_mval(ST_Agnode_s n)
static void	flat__c.flat_node(ST_Agedge_s e)
static void	mincross__c.flat_reorder(ST_Agraph_s g)
static void	mincross__c.flat_rev(ST_Agraph_s g, ST_Agedge_s e)
static void	mincross__c.flat_search(ST_Agraph_s g, ST_Agnode_s v)
static void	mincross__c.free_matrix(ST_adjmatrix_t p)
static ST_Agnode_s	mincross__c.furthestnode(ST_Agraph_s g, ST_Agnode_s v, int dir)
static ST_Agedge_s	dotsplines__c.getmainedge(ST_Agedge_s e)
static boolean	position__c.go(ST_Agnode_s u, ST_Agnode_s v)
static int	mincross__c.in_cross(ST_Agnode_s v, ST_Agnode_s w)
static void	class2__c.incr_width(ST_Agraph_s g, ST_Agnode_s v)
static void	mincross__c.init_mccomp(ST_Agraph_s g, int c)
static void	mincross__c.init_mincross(ST_Agraph_s g)
static java.lang.Object	dotinit__c.initSubg(java.lang.Object... arg)
static boolean	mincross__c.inside_cluster(ST_Agraph_s g, ST_Agnode_s v)
static void	cluster__c.install_cluster(ST_Agraph_s g, ST_Agnode_s n, int pass, ST_nodequeue q)
static void	mincross__c.install_in_rank(ST_Agraph_s g, ST_Agnode_s n)
static void	cluster__c.interclexp(ST_Agraph_s subg)
static void	class2__c.interclrep(ST_Agraph_s g, ST_Agedge_s e)
static void	class1__c.interclust1(ST_Agraph_s g, ST_Agnode_s t, ST_Agnode_s h, ST_Agedge_s e)
static boolean	mincross__c.is_a_normal_node_of(ST_Agraph_s g, ST_Agnode_s v)
static boolean	mincross__c.is_a_vnode_of_an_edge_of(ST_Agraph_s g, ST_Agnode_s v)
static boolean	rank__c.is_cluster(ST_Agraph_s g)
static boolean	class2__c.is_cluster_edge(ST_Agedge_s e)
static void	position__c.keepout_othernodes(ST_Agraph_s g)
static ST_Agnode_s	class2__c.label_vnode(ST_Agraph_s g, ST_Agedge_s orig)
static double	position__c.largeMinlen(double l)
static ST_Agnode_s	class2__c.leader_of(ST_Agraph_s g, ST_Agnode_s v)
static boolean	mincross__c.left2right(ST_Agraph_s g, ST_Agnode_s v, ST_Agnode_s w)
static int	mincross__c.local_cross(ST_elist l, int dir)
static ST_Agedge_s	position__c.make_aux_edge(ST_Agnode_s u, ST_Agnode_s v, double len, int wt)
static void	class2__c.make_chain(ST_Agraph_s g, ST_Agnode_s from, ST_Agnode_s to, ST_Agedge_s orig)
static void	position__c.make_edge_pairs(ST_Agraph_s g)
static void	dotsplines__c.make_flat_adj_edges(ST_Agraph_s g, ST_path P, CArrayOfStar<ST_Agedge_s> edges, int ind, int cnt, ST_Agedge_s e0, int et)
static java.lang.Object	dotsplines__c.make_flat_bottom_edges(java.lang.Object... arg_)
static void	dotsplines__c.make_flat_edge(ST_Agraph_s g, ST_spline_info_t sp, ST_path P, CArrayOfStar<ST_Agedge_s> edges, int ind, int cnt, int et)
static void	dotsplines__c.make_flat_labeled_edge(ST_Agraph_s g, ST_spline_info_t sp, ST_path P, ST_Agedge_s e, int et)
static void	cluster__c.make_interclust_chain(ST_Agraph_s g, ST_Agnode_s from, ST_Agnode_s to, ST_Agedge_s orig)
static void	position__c.make_leafslots(ST_Agraph_s g)
static void	position__c.make_LR_constraints(ST_Agraph_s g)
static void	position__c.make_lrvn(ST_Agraph_s g)
static int	rank__c.make_new_cluster(ST_Agraph_s g, ST_Agraph_s subg)
static void	dotsplines__c.make_regular_edge(ST_Agraph_s g, ST_spline_info_t sp, ST_path P, CArrayOfStar<ST_Agedge_s> edges, int ind, int cnt, int et)
static void	cluster__c.make_slots(ST_Agraph_s root, int r, int pos, int d)
static ST_Agnode_s	flat__c.make_vn_slot(ST_Agraph_s g, int r, int pos)
static void	dotsplines__c.makeFlatEnd(ST_Agraph_s g, ST_spline_info_t sp, ST_path P, ST_Agnode_s n, ST_Agedge_s e, ST_pathend_t endp, boolean isBegin)
static int	dotsplines__c.makeLineEdge(ST_Agraph_s g, ST_Agedge_s fe, __ptr__ points, __ptr__ hp)
static ST_boxf	dotsplines__c.makeregularend(ST_boxf b, int side, double y)
static void	dotsplines__c.makeSimpleFlat(ST_Agnode_s tn, ST_Agnode_s hn, CArrayOfStar<ST_Agedge_s> edges, int ind, int cnt, int et)
static void	dotsplines__c.makeSimpleFlatLabels(ST_Agnode_s tn, ST_Agnode_s hn, CArrayOfStar<ST_Agedge_s> edges, int ind, int cnt, int et, int n_lbls)
static ST_Agnode_s	cluster__c.map_interclust_node(ST_Agnode_s n)
static void	cluster__c.map_path(ST_Agnode_s from, ST_Agnode_s to, ST_Agedge_s orig, ST_Agedge_s ve, int type)
static void	cluster__c.mark_clusters(ST_Agraph_s g)
static void	cluster__c.mark_lowcluster_basic(ST_Agraph_s g)
static void	cluster__c.mark_lowclusters(ST_Agraph_s root)
static ST_boxf	dotsplines__c.maximal_bbox(ST_Agraph_s g, ST_spline_info_t sp, ST_Agnode_s vn, ST_Agedge_s ie, ST_Agedge_s oe)
static boolean	mincross__c.medians(ST_Agraph_s g, int r0, int r1)
static void	class2__c.merge_chain(ST_Agraph_s g, ST_Agedge_s e, ST_Agedge_s f, boolean flag)
static void	mincross__c.merge_components(ST_Agraph_s g)
static void	fastgr__c.merge_oneway(ST_Agedge_s e, ST_Agedge_s rep)
static void	cluster__c.merge_ranks(ST_Agraph_s subg)
static void	mincross__c.merge2(ST_Agraph_s g)
static boolean	class2__c.mergeable(ST_Agedge_s e, ST_Agedge_s f)
static int	mincross__c.mincross_(ST_Agraph_s g, int startpass, int endpass, boolean doBalance)
static int	mincross__c.mincross_clust(ST_Agraph_s par, ST_Agraph_s g, boolean doBalance)
static void	mincross__c.mincross_options(ST_Agraph_s g)
static void	mincross__c.mincross_step(ST_Agraph_s g, int pass)
static ST_point	rank__c.minmax_edges(ST_Agraph_s g)
static boolean	rank__c.minmax_edges2(ST_Agraph_s g, ST_point slen)
static int	mincross__c.ncross(ST_Agraph_s g)
static ST_Agnode_s	dotsplines__c.neighbor(ST_Agraph_s g, ST_Agnode_s vn, ST_Agedge_s ie, ST_Agedge_s oe, int dir)
static ST_Agnode_s	mincross__c.neighbor(ST_Agnode_s v, int dir)
static ST_adjmatrix_t	mincross__c.new_matrix(int i, int j)
static ST_Agedge_s	fastgr__c.new_virtual_edge(ST_Agnode_s u, ST_Agnode_s v, ST_Agedge_s orig)
static void	rank__c.node_induce(ST_Agraph_s par, ST_Agraph_s g)
static java.lang.Object	mincross__c.nodeposcmpf(CArrayOfStar<ST_Agnode_s> n0, CArrayOfStar<ST_Agnode_s> n1)
static boolean	class1__c.nonconstraint_edge(ST_Agedge_s e)
static int	position__c.nsiter2(ST_Agraph_s g)
static int	mincross__c.ordercmpf(java.lang.Integer i0, java.lang.Integer i1)
static void	mincross__c.ordered_edges(ST_Agraph_s g)
static void	fastgr__c.other_edge(ST_Agedge_s e)
static int	mincross__c.out_cross(ST_Agnode_s v, ST_Agnode_s w)
static boolean	dotsplines__c.pathscross(ST_Agnode_s n0, ST_Agnode_s n1, ST_Agedge_s ie1, ST_Agedge_s oe1)
static void	dotsplines__c.place_vnlabel(ST_Agnode_s n)
static ST_Agnode_s	class2__c.plain_vnode(ST_Agraph_s g, ST_Agedge_s orig)
static int	dotsplines__c.portcmp(ST_port p0, ST_port p1)
static boolean	position__c.ports_eq(ST_Agedge_s e, ST_Agedge_s f)
static void	position__c.pos_clusters(ST_Agraph_s g)
static int	mincross__c.postorder(ST_Agraph_s g, ST_Agnode_s v, CArrayOfStar<ST_Agnode_s> list, int r)
static ST_boxf	dotsplines__c.rank_box(ST_spline_info_t sp, ST_Agraph_s g, int r)
static int	rank__c.rank_set_class(ST_Agraph_s g)
static void	rank__c.rank1(ST_Agraph_s g)
static java.lang.Object	aspect__c.rank3(java.lang.Object... arg_)
static int	mincross__c.rcross(ST_Agraph_s g, int r)
static ST_Agraph_s	mincross__c.realFillRanks(ST_Agraph_s g, int[] rnks, int rnks_sz, ST_Agraph_s sg)
static void	position__c.rec_bb(ST_Agraph_s g, ST_Agraph_s root)
static void	mincross__c.rec_reset_vlists(ST_Agraph_s g)
static void	mincross__c.rec_save_vlists(ST_Agraph_s g)
static void	dotsplines__c.recover_slack(ST_Agedge_s e, ST_path p)
static void	position__c.remove_aux_edges(ST_Agraph_s g)
static java.lang.Object	dotinit__c.remove_from_rank(java.lang.Object... arg)
static void	cluster__c.remove_rankleaders(ST_Agraph_s g)
static java.lang.Object	dotinit__c.removeFill(java.lang.Object... arg)
static void	rank__c.renewlist(ST_elist L)
static void	mincross__c.reorder(ST_Agraph_s g, int r, boolean reverse, boolean hasfixed)
static java.lang.Object	dotinit__c.resetCoord(java.lang.Object... arg)
static java.lang.Object	dotsplines__c.resetRW(java.lang.Object... arg_)
static void	dotsplines__c.resize_vn(ST_Agnode_s vn, int lx, int cx, int rx)
static void	mincross__c.restore_best(ST_Agraph_s g)
static void	acyclic__c.reverse_edge(ST_Agedge_s e)
static void	fastgr__c.safe_list_append(ST_Agedge_s e, ST_elist L)
static void	fastgr__c.safe_other_edge(ST_Agedge_s e)
static void	mincross__c.save_best(ST_Agraph_s g)
static void	mincross__c.save_vlist(ST_Agraph_s g)
static void	decomp__c.search_component(ST_Agraph_s g, ST_Agnode_s n)
static void	position__c.separate_subclust(ST_Agraph_s g)
static void	position__c.set_aspect(ST_Agraph_s g, ST_aspect_t asp)
static void	rank__c.set_minmax(ST_Agraph_s g)
static void	position__c.set_xcoords(ST_Agraph_s g)
static void	position__c.set_ycoords(ST_Agraph_s g)
static ST_aspect_t	aspect__c.setAspect(ST_Agraph_s g, ST_aspect_t adata)
static void	flat__c.setbounds(ST_Agnode_s v, int[] bounds, int[] lpos, int[] rpos)
static void	dotsplines__c.setflags(ST_Agedge_s e, int hint1, int hint2, int f3)
static boolean	dotsplines__c.spline_merge(ST_Agnode_s n)
static int	dotsplines__c.straight_len(ST_Agnode_s n)
static ST_Agedge_s	dotsplines__c.straight_path(ST_Agedge_s e, int cnt, CArray<ST_pointf> plist, int[] np)
static void	dotsplines__c.swap_bezier(CArray<ST_bezier> old, CArray<ST_bezier> new_)
static boolean	dotsplines__c.swap_ends_p(ST_Agedge_s e)
static void	dotsplines__c.swap_spline(ST_splines s)
static ST_Agedge_s	dotsplines__c.top_bound(ST_Agedge_s e, int side)
static void	mincross__c.transpose(ST_Agraph_s g, boolean reverse)
static int	mincross__c.transpose_step(ST_Agraph_s g, int r, boolean reverse)
static ST_Agedge_s	fastgr__c.virtual_edge(ST_Agnode_s u, ST_Agnode_s v, ST_Agedge_s orig)
static ST_Agnode_s	fastgr__c.virtual_node(ST_Agraph_s g)
static void	mincross__c.virtual_weight(ST_Agedge_s e)
static boolean	position__c.vnode_not_related_to(ST_Agraph_s g, ST_Agnode_s v)
static void	fastgr__c.zapinlist(ST_elist L, ST_Agedge_s e)

Uses of Original in gen.lib.gvc

Methods in gen.lib.gvc with annotations of type Original

Modifier and Type	Method	Description
static ST_GVC_s	gvc__c.gvContext(java.lang.Object... arg_)
static int	gvlayout__c.gvlayout_select(ST_GVC_s gvc, CString layout)
static int	gvlayout__c.gvLayoutJobs(ST_GVC_s gvc, ST_Agraph_s g)
static ST_GVC_s	gvcontext__c.gvNEWcontext(__ptr__ builtins, boolean demand_loading)
static java.lang.Object	gvplugin__c.gvplugin_install(java.lang.Object... arg_)
static ST_gvplugin_available_s	gvplugin__c.gvplugin_load(ST_GVC_s gvc, EN_api_t api, CString str)
static int	gvtextlayout__c.gvtextlayout_select(ST_GVC_s gvc)

Uses of Original in gen.lib.label

Methods in gen.lib.label with annotations of type Original

Modifier and Type	Method	Description
static double	xlabels__c.aabbaabb(ST_Rect_t r, ST_Rect_t s)
static int	node__c.AddBranch(ST_RTree rtp, ST_Branch_t b, ST_Node_t___ n, ST_Node_t___[] new_)
static void	split_q__c.Classify(ST_RTree rtp, int i, int group)
static ST_Rect_t	rectangle__c.CombineRect(ST_Rect_t r, ST_Rect_t rr)
static void	node__c.DisconBranch(ST_Node_t___ n, int i)
static int	xlabels__c.floorLog2(int n)
static void	split_q__c.GetBranches(ST_RTree rtp, ST_Node_t___ n, ST_Branch_t b)
static int	xlabels__c.getintrsxi(ST_XLabels_t xlp, ST_object_t op, ST_object_t cp)
static int	xlabels__c.hd_hil_s_from_xy(ST_point p, int n)
static int	xlabels__c.icompare(ST_dt_s dt, java.lang.Object v1, java.lang.Object v2, ST_dtdisc_s disc)
static void	node__c.InitBranch(ST_Branch_t b)
static void	node__c.InitNode(ST_Node_t___ n)
static void	split_q__c.InitPVars(ST_RTree rtp)
static void	rectangle__c.InitRect(ST_Rect_t r)
static boolean	xlabels__c.lblenclosing(ST_object_t objp, ST_object_t objp1)
static void	split_q__c.LoadNodes(ST_RTree rtp, ST_Node_t___ n, ST_Node_t___ q, ST_PartitionVars p)
static void	split_q__c.MethodZero(ST_RTree rtp)
static ST_Rect_t	node__c.NodeCover(ST_Node_t___ n)
static ST_Rect_t	rectangle__c.NullRect()
static void	xlabels__c.objp2rect(ST_object_t op, ST_Rect_t r)
static void	xlabels__c.objplp2rect(ST_object_t objp, ST_Rect_t r)
static ST_Rect_t	xlabels__c.objplpmks(ST_XLabels_t xlp, ST_object_t objp)
static boolean	rectangle__c.Overlap(ST_Rect_t r, ST_Rect_t s)
static int	node__c.PickBranch(ST_Rect_t r, ST_Node_t___ n)
static void	split_q__c.PickSeeds(ST_RTree rtp)
static int	xlabels__c.placeLabels(CArray<ST_object_t> objs, int n_objs, CArray<ST_xlabel_t> lbls, int n_lbls, ST_label_params_t params)
static double	xlabels__c.recordlintrsx(ST_XLabels_t xlp, ST_object_t op, ST_object_t cp, ST_Rect_t rp, double a, ST_object_t[] intrsx)
static double	xlabels__c.recordointrsx(ST_XLabels_t xlp, ST_object_t op, ST_object_t cp, ST_Rect_t rp, double a, ST_object_t[] intrsx)
static int	rectangle__c.RectArea(ST_Rect_t r)
static int	index__c.RTreeClose(ST_RTree rtp)
static int	index__c.RTreeClose2(ST_RTree rtp, ST_Node_t___ n)
static int	index__c.RTreeInsert(ST_RTree rtp, ST_Rect_t r, __ptr__ data, ST_Node_t___[] n, int level)
static int	index__c.RTreeInsert2(ST_RTree rtp, ST_Rect_t r, __ptr__ data, ST_Node_t___ n, ST_Node_t___[] new_, int level)
static ST_LeafList_t	index__c.RTreeLeafListAdd(ST_LeafList_t llp, ST_Branch_t lp)
static void	index__c.RTreeLeafListFree(ST_LeafList_t llp)
static ST_Node_t___	index__c.RTreeNewIndex(ST_RTree rtp)
static ST_LeafList_t	index__c.RTreeNewLeafList(ST_Branch_t lp)
static ST_Node_t___	node__c.RTreeNewNode(ST_RTree rtp)
static ST_RTree	index__c.RTreeOpen()
static ST_LeafList_t	index__c.RTreeSearch(ST_RTree rtp, ST_Node_t___ n, ST_Rect_t r)
static void	split_q__c.SplitNode(ST_RTree rtp, ST_Node_t___ n, ST_Branch_t b, ST_Node_t___[] nn)
static ST_BestPos_t	xlabels__c.xladjust(ST_XLabels_t xlp, ST_object_t objp)
static void	xlabels__c.xlfree(ST_XLabels_t xlp)
static int	xlabels__c.xlhdxload(ST_XLabels_t xlp)
static void	xlabels__c.xlhdxunload(ST_XLabels_t xlp)
static int	xlabels__c.xlhorder(ST_XLabels_t xlp)
static int	xlabels__c.xlinitialize(ST_XLabels_t xlp)
static ST_BestPos_t	xlabels__c.xlintersections(ST_XLabels_t xlp, ST_object_t objp, ST_object_t[] intrsx)
static ST_XLabels_t	xlabels__c.xlnew(CArray<ST_object_t> objs, int n_objs, CArray<ST_xlabel_t> lbls, int n_lbls, ST_label_params_t params)
static int	xlabels__c.xlspdxload(ST_XLabels_t xlp)

Uses of Original in gen.lib.pack

Methods in gen.lib.pack with annotations of type Original

Modifier and Type	Method	Description
static int	pack__c.getPack(ST_Agraph_s g, int not_def, int dflt)
static EN_pack_mode	pack__c.getPackInfo(ST_Agraph_s g, EN_pack_mode dflt, int dfltMargin, ST_pack_info pinfo)
static EN_pack_mode	pack__c.getPackModeInfo(ST_Agraph_s g, EN_pack_mode dflt, ST_pack_info pinfo)
static EN_pack_mode	pack__c.parsePackModeInfo(CString p, EN_pack_mode dflt, ST_pack_info pinfo)

Uses of Original in gen.lib.pathplan

Methods in gen.lib.pathplan with annotations of type Original

Modifier and Type	Method	Description
static ST_pointf	route__c.add(ST_pointf p1, ST_pointf p2)
static void	shortest__c.add2dq(int side, ST_pointnlink_t pnlp)
static void	route__c.addroot(double root, double[] roots, int[] rootnp)
static double	route__c.B0(double t)
static double	route__c.B01(double t)
static double	route__c.B1(double t)
static double	route__c.B2(double t)
static double	route__c.B23(double t)
static double	route__c.B3(double t)
static boolean	shortest__c.between(ST_pointf pap, ST_pointf pbp, ST_pointf pcp)
static int	shortest__c.ccw(ST_pointf p1p, ST_pointf p2p, ST_pointf p3p)
static void	shortest__c.connecttris(int tri1, int tri2)
static double	route__c.dist(ST_pointf p1, ST_pointf p2)
static double	route__c.dist_n(CArray<ST_pointf> p, int n)
static double	route__c.dot(ST_pointf p1, ST_pointf p2)
static int	shortest__c.finddqsplit(ST_pointnlink_t pnlp)
static void	shortest__c.growdq(int newdqn)
static void	route__c.growops(int newopn)
static void	shortest__c.growops(int newopn)
static void	shortest__c.growpnls(int newpnln)
static void	shortest__c.growtris(int newtrin)
static boolean	shortest__c.intersects(ST_pointf pap, ST_pointf pbp, ST_pointf pcp, ST_pointf pdp)
static boolean	shortest__c.isdiagonal(int pnli, int pnlip2, ST_pointnlink_t[] pnlps, int pnln)
static void	shortest__c.loadtriangle(__ptr__ pnlap, __ptr__ pnlbp, __ptr__ pnlcp)
static void	util__c.make_polyline(ST_Ppoly_t line, ST_Ppoly_t sline)
static boolean	shortest__c.marktripath(int trii, int trij)
static int	route__c.mkspline(CArray<ST_pointf> inps, int inpn, CArray<ST_tna_t> tnas, ST_pointf ev0, ST_pointf ev1, ST_pointf sp0, ST_pointf sv0, ST_pointf sp1, ST_pointf sv1)
static ST_pointf	route__c.normv(ST_pointf v)
static boolean	shortest__c.pointintri(int trii, ST_pointf pp)
static void	route__c.points2coeff(double v0, double v1, double v2, double v3, double[] coeff)
static int	route__c.Proutespline(CArray<ST_Pedge_t> edges, int edgen, ST_Ppoly_t input, CArray<ST_pointf> evs, ST_Ppoly_t output)
static int	shortest__c.Pshortestpath(ST_Ppoly_t polyp, CArray<ST_pointf> eps, ST_Ppoly_t output)
static int	route__c.reallyroutespline(CArray<ST_Pedge_t> edges, int edgen, CArray<ST_pointf> inps, int inpn, ST_pointf ev0, ST_pointf ev1)
static ST_pointf	route__c.scale(ST_pointf p, double c)
static int	solvers__c.solve1(double[] coeff, double[] roots)
static int	solvers__c.solve2(double[] coeff, double[] roots)
static int	solvers__c.solve3(double[] coeff, double[] roots)
static int	route__c.splinefits(CArray<ST_Pedge_t> edges, int edgen, ST_pointf pa, ST_pointf va, ST_pointf pb, ST_pointf vb, CArray<ST_pointf> inps, int inpn)
static int	route__c.splineintersectsline(CArray<ST_pointf> sps, CArray<ST_pointf> lps, double[] roots)
static boolean	route__c.splineisinside(CArray<ST_Pedge_t> edges, int edgen, CArray<ST_pointf> sps)
static void	shortest__c.splitdq(int side, int index)
static ST_pointf	route__c.sub(ST_pointf p1, ST_pointf p2)
static void	shortest__c.triangulate(ST_pointnlink_t[] pnlps, int pnln)