1720     QVector< QVector<int> > isects;  in toFillPolygons()  local
1721     isects.resize(count);  in toFillPolygons()
1730                 isects[j] << i;  in toFillPolygons()
1739         for (int j = 0; j < isects[i].size(); ++j) {  in toFillPolygons()
1740             printf("%d ", isects[i][j]);  in toFillPolygons()
1748         const QVector<int> &current_isects = isects.at(i);  in toFillPolygons()
1753             const QVector<int> &isects_j = isects.at(isect_j);  in toFillPolygons()
1756                 if (isect_k != i && !isects.at(i).contains(isect_k)) {  in toFillPolygons()
1757                     isects[i] += isect_k;  in toFillPolygons()
1760             isects[isect_j].clear();  in toFillPolygons()
1768         for (int j = 0; j < isects[i].size(); ++j) {  in toFillPolygons()
1769             printf("%d ", isects[i][j]);  in toFillPolygons()
1777         const QVector<int> &subpath_list = isects.at(i);  in toFillPolygons()