}
he->PQnext = last->PQnext;
last->PQnext = he;
- PQcount += 1;
+ ++PQcount;
}
void PQdelete(Halfedge * he)
while (last->PQnext != he)
last = last->PQnext;
last->PQnext = he->PQnext;
- PQcount -= 1;
+ --PQcount;
deref(he->vertex);
he->vertex = (Site *) NULL;
}
* notice that always left>first, because of its initialization
*/
if (place[nodes[left]] > place_val)
- left = left - 1;
+ --left;
*middle = left;
nodes[first] = nodes[left];
nodes[left] = val;
double sum;
sum = 0.0;
- vec1 = vec1 + beg;
- vec2 = vec2 + beg;
+ vec1 += beg;
+ vec2 += beg;
for (i = end - beg + 1; i; i--) {
sum += (*vec1++) * (*vec2++);
}
{
int i;
- vec1 = vec1 + beg;
- vec2 = vec2 + beg;
+ vec1 += beg;
+ vec2 += beg;
for (i = end - beg + 1; i; i--) {
(*vec1++) += fac * (*vec2++);
}
if (PSinputscale > 0.0) {
int i;
for (i = 0; i < Ndim; i++)
- pvec[i] = pvec[i] / PSinputscale;
+ pvec[i] /= PSinputscale;
}
if (Ndim > 2) {
if (N_z && (p = agxget(np, N_z)) && (sscanf(p,"%lf",&z) == 1)) {
continue;
if (i == qp)
continue;
- n = n + poly[i]->pn;
+ n += poly[i]->pn;
}
bar = N_GNEW(n, Pedge_t);
b = 0;
/* handle case where one or more dimensions is too big */
if ((xf < 1.0) || (yf < 1.0)) {
if (xf < yf) {
- yf = yf / xf;
+ yf /= xf;
xf = 1.0;
} else {
- xf = xf / yf;
+ xf /= yf;
yf = 1.0;
}
}
* allocate it in the root graph and the connected components.
*/
for (n = agfstnode(g); n; n = agnxtnode(g, n)) {
- ND_pos(n)[0] = ND_pos(n)[0] * xf;
- ND_pos(n)[1] = ND_pos(n)[1] * yf;
+ ND_pos(n)[0] *= xf;
+ ND_pos(n)[1] *= yf;
}
scaleBB(g, xf, yf);
return TRUE;
void makevertex(Site * v)
{
v->sitenbr = nvertices;
- nvertices += 1;
+ ++nvertices;
#ifdef STANDALONE
out_vertex(v);
#endif
void deref(Site * v)
{
- v->refcnt -= 1;
+ --v->refcnt;
if (v->refcnt == 0)
makefree(v, &sfl);
}
void ref(Site * v)
{
- v->refcnt += 1;
+ ++v->refcnt;
}
mem = N_NEW(m * n, double);
for (i = 0; i < m; i++) {
rv[i] = mem;
- mem = mem + n;
+ mem += n;
for (j = 0; j < n; j++)
rv[i][j] = ival;
}
/* get storage */
n = 0;
for (poly_i = 0; poly_i < n_obs; poly_i++)
- n = n + obs[poly_i]->pn;
+ n += obs[poly_i]->pn;
rv->P = mymalloc(n * sizeof(Ppoint_t));
rv->start = mymalloc((n_obs + 1) * sizeof(int));
rv->next = mymalloc(n * sizeof(int));