Searched refs:numCPs (Results 1 – 1 of 1) sorted by relevance
1381 int numCPs = 0; in GetIthHighestPersistence() local1385 numCPs++; in GetIthHighestPersistence()1387 if(numCPs <= i) in GetIthHighestPersistence()1391 Saddle **AllExtrema = new Saddle *[numCPs]; in GetIthHighestPersistence()1394 for(int j = 0; j < numV && currentIdx < numCPs; j++) in GetIthHighestPersistence()1408 SortSaddles(AllExtrema, numCPs); in GetIthHighestPersistence()1411 if((numCPs-1) >= i && i >= 0) in GetIthHighestPersistence()1412 retValue = AllExtrema[(numCPs-1)-i]->idx; in GetIthHighestPersistence()