25 #define extern __declspec(dllimport)
30 #ifndef HAVE_STRCASECMP
33 #ifndef HAVE_STRNCASECMP
34 extern int strncasecmp(
const char *
s1,
const char *s2,
size_t n);
47 extern double yDir (
double y);
71 extern char *
Fgets(FILE * fp);
72 extern const char *
safefile(
const char *filename);
74 extern boolean mapBool(
char *,
boolean);
76 extern int maptoken(
char *,
char **,
int *);
78 extern boolean findStopColor (
char* colorlist,
char* clrs[2],
float* frac);
117 extern void cat_libfile(
GVJ_t * job,
const char **arglib,
const char **stdlib);
124 extern void fix_fc(
void);
void s1(graph_t *, node_t *)
attrsym_t * safe_dcl(graph_t *g, int obj_kind, char *name, char *def)
char * latin1ToUTF8(char *s)
Agraphinfo_t * ginf(Agraph_t *g)
Agnodeinfo_t * ninf(Agnode_t *n)
Dt_t * mkClustMap(Agraph_t *g)
Agsym_t * setAttr(graph_t *g, void *obj, char *name, char *value, Agsym_t *ap)
char * htmlEntityUTF8(char *s, graph_t *g)
boolean overlap_edge(edge_t *e, boxf b)
char * late_nnstring(void *obj, attrsym_t *attr, char *def)
boolean findStopColor(char *colorlist, char *clrs[2], float *frac)
char * xml_url_string(char *s)
void undoClusterEdges(graph_t *g)
void common_init_node(node_t *n)
void UF_remove(node_t *u, node_t *v)
void enqueue(nodequeue *q, node_t *n)
char * ps_string(char *ins, int chset)
char * strdup_and_subst_obj(char *str, void *obj)
void UF_setname(node_t *u, node_t *v)
node_t * UF_find(node_t *n)
nodequeue * new_queue(int sz)
void write_plain(GVJ_t *job, graph_t *g, FILE *f, boolean extend)
void attach_attrs_and_arrows(graph_t *g, int *sp, int *ep)
void epsf_define(GVJ_t *job)
void cat_libfile(GVJ_t *job, const char **arglib, const char **stdlib)
char * xml_string(char *s)
int strncasecmp(const char *s1, const char *s2, unsigned int n)
char * scanEntity(char *t, agxbuf *xb)
void compute_bb(graph_t *g)
node_t * dequeue(nodequeue *q)
boolean mapBool(char *p, boolean dflt)
int late_int(void *obj, attrsym_t *attr, int def, int low)
void free_queue(nodequeue *q)
void UF_singleton(node_t *u)
void epsf_emit_body(GVJ_t *job, usershape_t *us)
double get_inputscale(graph_t *g)
const char * safefile(const char *filename)
pointf Bezier(pointf *V, int degree, double t, pointf *Left, pointf *Right)
Agraph_t * findCluster(Dt_t *map, char *name)
char * utf8ToLatin1(char *s)
double late_double(void *obj, attrsym_t *attr, double def, double low)
int strcasecmp(const char *s1, const char *s2)
int is_a_cluster(Agraph_t *g)
void updateBB(graph_t *g, textlabel_t *lp)
int common_init_edge(edge_t *e)
Agedgeinfo_t * einf(Agedge_t *e)
void setEdgeType(graph_t *g, int dflt)
void gv_nodesize(node_t *n, boolean flip)
boolean overlap_node(node_t *n, boxf b)
int edgeType(char *s, int dflt)
char * late_string(void *obj, attrsym_t *attr, char *def)
boxf polyBB(polygon_t *poly)
boolean overlap_label(textlabel_t *lp, boxf b)
void processClusterEdges(graph_t *g)
void attach_attrs(graph_t *g)
int maptoken(char *p, char **name, int *val)
pointf neato_closest(splines *spl, pointf p)
pointf dotneato_closest(splines *spl, pointf pt)
pointf spline_at_y(splines *spl, double y)
node_t * UF_union(node_t *u, node_t *v)
boolean late_bool(void *obj, attrsym_t *attr, int def)
char * xml_string0(char *s, boolean raw)
void get_gradient_points(pointf *A, pointf *G, int n, float angle, int flags)