mostly by using (void) instead of () for functions with empty parameter lists.
size_t);
extern char *pathaccess(char *, const char *, const char *,
const char *, int);
- extern char *pathbin();
+ extern char *pathbin(void);
extern char *pathcat(char *, const char *, int, const char *,
const char *);
extern int pathgetlink(const char *, char *, int);
/* mkDeglist:
* Create an empty list of nodes.
*/
-deglist_t *mkDeglist()
+deglist_t *mkDeglist(void)
{
deglist_t *s = dtopen(&nodeDisc, Dtoset);
return s;
typedef Dt_t deglist_t;
- extern deglist_t *mkDeglist();
+ extern deglist_t *mkDeglist(void);
extern void freeDeglist(deglist_t * list);
extern void insertDeglist(deglist_t * list, Agnode_t * n);
extern void removeDeglist(deglist_t * list, Agnode_t * n);
typedef Dt_t edgelist;
- extern edgelist *init_edgelist();
+ extern edgelist *init_edgelist(void);
extern void add_edge(edgelist * list, Agedge_t * e);
extern void remove_edge(edgelist * list, Agedge_t * e);
extern void free_edgelist(edgelist * list);
int sz;
} nodelist_t;
- extern nodelist_t *mkNodelist();
+ extern nodelist_t *mkNodelist(void);
extern void freeNodelist(nodelist_t *);
extern int sizeNodelist(nodelist_t * list);
typedef Dt_t nodeset_t;
- extern nodeset_t *mkNodeset();
+ extern nodeset_t *mkNodeset(void);
extern void freeNodeset(nodeset_t *);
extern void clearNodeset(nodeset_t *);
extern void insertNodeset(nodeset_t * ns, Agnode_t * n);
int sz;
} nstack_t;
- extern nstack_t *mkStack();
+ extern nstack_t *mkStack(void);
extern void stackPush(nstack_t * s, Agnode_t * n);
extern Agnode_t *stackPop(nstack_t * s);
extern int stackSize(nstack_t * s);