245 |
if(csind2 <= 0) { |
if(csind2 <= 0) { |
246 |
|
|
247 |
if(show1) { |
if(show1) { |
248 |
|
DBG(dbg_coorder) << "Interpolate but no to, show1\n"; |
249 |
for(int j = 0; j<npars; j++) { |
for(int j = 0; j<npars; j++) { |
250 |
params.push_back(points1[ind1 + j]); |
params.push_back(points1[ind1 + j]); |
251 |
} |
} |
252 |
} else { |
} else { |
253 |
|
DBG(dbg_coorder) << "Interpolate but no to, not showing, continuing\n"; |
254 |
continue; |
continue; |
255 |
} |
} |
256 |
} else { |
} else { |
257 |
|
DBG(dbg_coorder) << "Interpolate \n"; |
258 |
for(int j = 0; j<npars; j++) { |
for(int j = 0; j<npars; j++) { |
259 |
DBG(dbg_coorder) << "Interpolating " |
DBG(dbg_coorder) << "Interpolating " |
260 |
<<(ind1+j)<<" " <<(ind2+j)<<" = " |
<<(ind1+j)<<" " <<(ind2+j)<<" = " |
266 |
} |
} |
267 |
const Transform *prev[nprev]; |
const Transform *prev[nprev]; |
268 |
|
|
269 |
|
DBG(dbg_coorder) << "Parents \n"; |
270 |
for(int j=0; j<nprev; j++) { |
for(int j=0; j<nprev; j++) { |
271 |
int parent = inds1[i+1+j]; |
int parent = inds1[i+1+j]; |
272 |
Transform *parentcs = get(parent); // cs[parent]; -- check bounds using geT() |
Transform *parentcs = get(parent); // cs[parent]; -- check bounds using geT() |
273 |
|
DBG(dbg_coorder) << "Parent "<<j<<" "<<parent<<" "<<parentcs<<" \n"; |
274 |
if(parentcs == 0) { |
if(parentcs == 0) { |
275 |
DBG(dbg_coorder) << "Parent "<<j<<" not interp\n"; |
DBG(dbg_coorder) << "Parent "<<j<<" not interp\n"; |
276 |
goto nextInd; // If parent's not interpolating, neither are we. |
goto nextInd; // If parent's not interpolating, neither are we. |