void Cell::display(Output& o) {
int nn[4];
int totalnn= 0;
- for (int i=0; i<4; i++) {
+ int i;
+ for (i=0; i<4; i++) {
nn[i]= checkneededline(p[i],p[(i+1)&3]);
totalnn+= nn[i];
}
void SortedCellList::insert(Cell *it) {
double index= it->index();
- for (int fragment= used-1;
+ int fragment;
+ for (fragment= used-1;
fragment >= 0 && index < fragments[fragment]->entries[0].index;
fragment--);
if (fragment < 0) {
nf->entries[0].cell= it;
return;
}
- for (int entry= 0;
+ int entry;
+ for (entry= 0;
entry < fragments[fragment]->used &&
index > fragments[fragment]->entries[entry].index;
entry++);