int c1 = 0;
// int c2 = 0;
- if (inc.isEmpty()) {
+ QListIterator<NETlink*> incFileIterator(inc);
+ if (!incFileIterator.hasNext()) {
*trueline = ln;
return NULL;
- }
+ }
pl.clear();
- pom = inc.first();
+ pom = incFileIterator.next();
if (pom->start > ln) {
*trueline = ln;
return NULL;
}
- while ((pom != NULL) && (ln > pom->start)) {
+ while ((incFileIterator.hasNext()) && (ln > pom->start)) {
if (ln < pom->start + pom->len) {
*trueline = ln-pom->start;
return pom;
}
pl.append(pom);
- pom=inc.takeFirst();
+ pom=incFileIterator.next();
}
- if (pom != NULL) {
- pom1 = pl.first();
+ if (incFileIterator.hasNext()) {
+ QListIterator<NETlink*> plIterator(pl);
c1=0;
- while (pom1 != NULL) {
+ while (plIterator.hasNext()) {
+ pom1 = plIterator.next();
c1 += pom1->len;
- pom1 = pl.takeFirst();
}
*trueline = ln - c1;
return NULL;
} else {
- pom1 = inc.first();
+ incFileIterator.toFront();
c1 = 0;
- while (pom1 != NULL) {
+ while (incFileIterator.hasNext()) {
+ pom1 = incFileIterator.next();
c1 += pom1->len;
- pom1=inc.takeFirst();
}
*trueline = ln - c1;
return NULL;