/* freeNodes:
* Free node resources.
*/
-static void freeNodes()
+static void freeNodes(void)
{
int i;
Info_t *ip = nodeInfo;
/* sortSites:
* Fill array of pointer to sites and sort the sites using scomp
*/
-static void sortSites()
+static void sortSites(void)
{
int i;
Site **sp;
deltax = xmax - xmin;
}
-static
-Site *nextOne()
+static Site *nextOne(void)
{
Site *s;
* Check for nodes with identical positions and tweak
* the positions.
*/
-static void rmEquality()
+static void rmEquality(void)
{
int i, cnt;
Site **ip;
return count;
}
-static void increaseBoundBox()
+static void increaseBoundBox(void)
{
double ydelta, xdelta;
Point ll, ur;
* Add corners of clipping window to appropriate sites.
* A site gets a corner if it is the closest site to that corner.
*/
-static void addCorners()
+static void addCorners(void)
{
Info_t *ip = nodeInfo;
Info_t *sws = ip;
* We first add the corner of the clipping windows to the
* vertex lists of the appropriate sites.
*/
-static void newPos()
+static void newPos(void)
{
int i;
Info_t *ip = nodeInfo;
* This could be optimized, over multiple components or
* even multiple graphs, but probably not worth it.
*/
-static void cleanup()
+static void cleanup(void)
{
PQcleanup();
ELcleanup();
edgeinit(); /* free memory */
}
-static int vAdjust()
+static int vAdjust(void)
{
int iterCnt = 0;
int overlapCnt = 0;
return f;
}
-static int sAdjust()
+static int sAdjust(void)
{
int iterCnt = 0;
int overlapCnt = 0;
extern int nsites; /* Number of sites */
extern int sqrt_nsites;
- extern void geominit();
+ extern void geominit(void);
extern double dist_2(Point *, Point *); /* Distance squared between two points */
extern void subPt(Point * a, Point b, Point c);
extern void addPt(Point * a, Point b, Point c);