- int i = 0;
- while ( i < oldNodeSize )
- {
- // skip a hole if any
- while ( i < oldNodeSize && idNodesOldToNew[i] < 0 )
- ++i;
- int startBloc = i;
- // look for a block end
- while ( i < oldNodeSize && idNodesOldToNew[i] >= 0 )
- ++i;
- int endBloc = i;
- copyNodes(newPoints, idNodesOldToNew, alreadyCopied, startBloc, endBloc);
- }
- newPoints->Squeeze();
+ int i = 0;
+ while ( i < oldNodeSize )
+ {
+ // skip a hole if any
+ while ( i < oldNodeSize && idNodesOldToNew[i] < 0 )
+ ++i;
+ int startBloc = i;
+ // look for a block end
+ while ( i < oldNodeSize && idNodesOldToNew[i] >= 0 )
+ ++i;
+ int endBloc = i;
+ copyNodes(newPoints, idNodesOldToNew, alreadyCopied, startBloc, endBloc);