Uses of Class
gen.annotation.Reviewed
-
Packages that use Reviewed 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 Reviewed in gen.lib.cdt
Methods in gen.lib.cdt with annotations of type Reviewed Modifier and Type Method Description static ST_dtlink_s
dtextract__c. dtextract(ST_dt_s dt)
static int
dtrestore__c. dtrestore(ST_dt_s dt, ST_dtlink_s list)
static int
dtsize__c. dtsize_(ST_dt_s dt)
static 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 Reviewed in gen.lib.cgraph
Methods in gen.lib.cgraph with annotations of type Reviewed 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 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 boolean
obj__c. agcontains(ST_Agraph_s g, ST_Agobj_s obj)
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 Object
utils__c. agdictobjmem(ST_dt_s dict, 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 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 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_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 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 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. agnnodes(ST_Agraph_s g)
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_Agedge_s
edge__c. agopp(__ptr__ e)
static ST_Agraph_s
subg__c. agparent(ST_Agraph_s g)
static ST_Agraph_s
obj__c. agraphof(ST_Agobj_s obj)
static void
id__c. agregister(ST_Agraph_s g, int objtype, Object obj)
static ST_Agraph_s
obj__c. agroot(ST_Agobj_s obj)
static CString
refstr__c. agstrdup(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_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
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 ST_Agsym_s
attr__c. getattr(ST_Agraph_s g, int kind, CString name)
static CString
id__c. idprint(__ptr__ state, int objtype, int id)
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 __ptr__
mem__c. memalloc(__ptr__ heap, size_t request)
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)
-
Uses of Reviewed in gen.lib.common
Methods in gen.lib.common with annotations of type Reviewed Modifier and Type Method Description static void
ns__c. add_tree_edge(ST_Agedge_s e)
static void
splines__c. beginpath(ST_path P, ST_Agedge_s e, int et, ST_pathend_t endp, boolean merge)
static ST_shape_desc
shapes__c. bind_shape(CString name, ST_Agnode_s np)
static ST_port
utils__c. chkPort(CFunction pf, ST_Agnode_s n, CString s)
static int
utils__c. common_init_edge(ST_Agedge_s e)
static void
utils__c. common_init_node(ST_Agnode_s n)
static int
postproc__c. countClusterLabels(ST_Agraph_s g)
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 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 void
splines__c. endpath(ST_path P, ST_Agedge_s e, int et, ST_pathend_t endp, boolean merge)
static void
utils__c. enqueue(ST_nodequeue q, ST_Agnode_s n)
static int
ns__c. feasible_tree()
static int
input__c. findCharset(ST_Agraph_s g)
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 __ptr__
memory__c. gmalloc(size_t nbytes)
static void
input__c. graph_init(ST_Agraph_s g, boolean use_rankdir)
static void
emit__c. gv_fixLocale(int set)
static void
utils__c. gv_nodesize(ST_Agnode_s n, boolean flip)
static CString
utils__c. htmlEntityUTF8(CString s, ST_Agraph_s g)
static void
ns__c. init_cutvalues()
static int
ns__c. init_graph(ST_Agraph_s g)
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
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 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 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 ST_nodequeue
utils__c. new_queue(int sz)
static boolean
utils__c. noClip(ST_Agedge_s e, ST_Agsym_s sym)
static void
shapes__c. poly_init(ST_Agnode_s n)
static ST_port
shapes__c. poly_port(ST_Agnode_s n, CString portname, CString compass)
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 void
shapes__c. record_init(ST_Agnode_s n)
static CString
utils__c. safefile(CString filename)
static void
ns__c. scan_and_normalize()
static void
utils__c. setEdgeType(ST_Agraph_s g, int dflt)
static void
input__c. setRatio(ST_Agraph_s g)
static EN_shape_kind
shapes__c. shapeOf(ST_Agnode_s n)
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_obj0(CString str, ST_Agobj_s obj, int escBackslash)
static void
ns__c. TB_balance()
static int
ns__c. tight_tree()
static boolean
ns__c. treesearch(ST_Agnode_s v)
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
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 Reviewed in gen.lib.dotgen
Methods in gen.lib.dotgen with annotations of type Reviewed Modifier and Type Method Description static void
acyclic__c. acyclic_(ST_Agraph_s g)
static void
decomp__c. add_to_component(ST_Agnode_s n)
static void
mincross__c. allocate_ranks(ST_Agraph_s g)
static void
fastgr__c. basic_merge(ST_Agedge_s e, ST_Agedge_s rep)
static void
decomp__c. begin_component()
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 void
flat__c. checkFlatAdjacent(ST_Agedge_s e)
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 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 void
rank__c. collapse_sets(ST_Agraph_s rg, 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
decomp__c. decompose(ST_Agraph_s g, int pass)
static void
fastgr__c. delete_fast_node(ST_Agraph_s g, ST_Agnode_s n)
static void
acyclic__c. dfs(ST_Agnode_s n)
static void
dotinit__c. doDot(ST_Agraph_s g)
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
rank__c. dot1_rank(ST_Agraph_s g, ST_aspect_t asp)
static void
dotinit__c. dotLayout(ST_Agraph_s g)
static void
rank__c. edgelabel_ranks(ST_Agraph_s g)
static void
decomp__c. end_component()
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 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
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 void
flat__c. flat_node(ST_Agedge_s e)
static void
mincross__c. flat_reorder(ST_Agraph_s g)
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 void
mincross__c. init_mccomp(ST_Agraph_s g, int c)
static void
mincross__c. init_mincross(ST_Agraph_s g)
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 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 ST_Agnode_s
class2__c. leader_of(ST_Agraph_s g, ST_Agnode_s v)
static int
mincross__c. local_cross(ST_elist l, int dir)
static void
position__c. make_leafslots(ST_Agraph_s g)
static int
rank__c. make_new_cluster(ST_Agraph_s g, ST_Agraph_s subg)
static void
cluster__c. make_slots(ST_Agraph_s root, int r, int pos, int d)
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 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 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
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 boolean
class1__c. nonconstraint_edge(ST_Agedge_s e)
static void
mincross__c. ordered_edges(ST_Agraph_s g)
static void
fastgr__c. other_edge(ST_Agedge_s e)
static int
mincross__c. postorder(ST_Agraph_s g, ST_Agnode_s v, CArrayOfStar<ST_Agnode_s> list, int r)
static int
rank__c. rank_set_class(ST_Agraph_s g)
static void
rank__c. rank1(ST_Agraph_s g)
static void
mincross__c. rec_reset_vlists(ST_Agraph_s g)
static void
mincross__c. rec_save_vlists(ST_Agraph_s g)
static void
cluster__c. remove_rankleaders(ST_Agraph_s g)
static void
rank__c. renewlist(ST_elist L)
static void
mincross__c. reorder(ST_Agraph_s g, int r, boolean reverse, boolean hasfixed)
static void
mincross__c. restore_best(ST_Agraph_s g)
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
rank__c. set_minmax(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
dotsplines__c. swap_bezier(CArray<ST_bezier> old, CArray<ST_bezier> new_)
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)
-
Uses of Reviewed in gen.lib.gvc
Methods in gen.lib.gvc with annotations of type Reviewed Modifier and Type Method Description 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)
-
Uses of Reviewed in gen.lib.label
Methods in gen.lib.label with annotations of type Reviewed Modifier and Type Method Description static void
split_q__c. LoadNodes(ST_RTree rtp, ST_Node_t___ n, ST_Node_t___ q, ST_PartitionVars p)
-
Uses of Reviewed in gen.lib.pack
Methods in gen.lib.pack with annotations of type Reviewed 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 Reviewed in gen.lib.pathplan
Methods in gen.lib.pathplan with annotations of type Reviewed Modifier and Type Method Description static void
route__c. addroot(double root, double[] roots, int[] rootnp)
-