public void integrateStackStart(IntegrateExp integrator) {
curBgInside.clear();
curBgOutside.clear();
// curBgInt = 0;
// curBgVol = 0;
// Zero out arrays
sliceExp = new double[numSubDiv];
sliceVol = new int[numSubDiv];
}
/**
* Fills all pairs satisfying a given condition into the specified lists. Fills into the lists,
* starting at index 0. After this call returns the specified lists both have a new size, the
* number of pairs satisfying the condition. Iteration order is guaranteed to be <i>identical</i>
* to the order used by method {@link #forEachKey(IntProcedure)}.
*
* <p><b>Example:</b> <br>
*
* <pre>
* IntDoubleProcedure condition = new IntDoubleProcedure() { // match even keys only
* public boolean apply(int key, double value) { return key%2==0; }
* }
* keys = (8,7,6), values = (1,2,2) --> keyList = (6,8), valueList = (2,1)</tt>
* </pre>
*
* @param condition the condition to be matched. Takes the current key as first and the current
* value as second argument.
* @param keyList the list to be filled with keys, can have any size.
* @param valueList the list to be filled with values, can have any size.
*/
public void pairsMatching(
final IntDoubleProcedure condition,
final IntArrayList keyList,
final DoubleArrayList valueList) {
keyList.clear();
valueList.clear();
for (int i = table.length; i-- > 0; ) {
if (state[i] == FULL && condition.apply(table[i], values[i])) {
keyList.add(table[i]);
valueList.add(values[i]);
}
}
}