/** * {@inheritDoc} */ @Override public synchronized void clear() { super.clear(); }
/** * Resets the member state. */ public void resetState(RaftLog log) { snapshotIndex = 0; nextSnapshotIndex = 0; nextSnapshotOffset = 0; matchIndex = 0; heartbeatTime = 0; responseTime = 0; appending = 0; timeStats.clear(); configuring = false; installing = false; appendSucceeded = false; failures = 0; failureTime = 0; switch (member.getType()) { case PASSIVE: reader = log.openReader(log.writer().getLastIndex() + 1, RaftLogReader.Mode.COMMITS); break; case PROMOTABLE: case ACTIVE: reader = log.openReader(log.writer().getLastIndex() + 1, RaftLogReader.Mode.ALL); break; } }
/** * {@inheritDoc} */ @Override public synchronized void clear() { super.clear(); }
/** * Clear stats */ public void clear() { this.usersStats.clear(); } }
@Override public void reset() { statistics.clear(); }
/** * Reset metric except for percentile related data */ public synchronized void resetForTimeInterval() { switch (WINDOW_MODE) { case FIXED: // We don't clear responsesStats nor usersStats as it will slide as per my understanding of // http://commons.apache.org/proper/commons-math/userguide/stat.html break; case TIMED: for (DescriptiveStatistics stat : windowedStats) { stat.clear(); } break; default: // This cannot happen } errors.clear(); successes = 0; failures = 0; hits = 0; sentBytes = 0; receivedBytes = 0; }
void reset() { delTime = new ExponentialMovingAverage(ALPHA); //size = new DescriptiveStatistics(WINDOW_SIZE); lastPrintTS = -1; sizeAccum = 0; approxThroughput.clear(); selectionRatio.clear(); lastWindowsRatio = selectionRatio; updated = false; }
public void normaliseToMinimum(double normalMin) { final double min = stats.samples.getMin(); final double[] values = stats.samples.getValues(); stats.samples.clear(); final double diff = normalMin - min; for (double v : values) { stats.samples.addValue(v + diff); } }
stdDevStats.clear(); toFindMinWithPeakNoise.clear(); DescriptiveStatistics toCollectSampleWindows = new DescriptiveStatistics(); toCollectSampleWindows.clear(); toCollectSampleWindows.clear(); for (int j = 0; j < 1; j++) { int min = 0; stdDevStats.clear(); rightBound = peakRight + peakWidth; leftBound = peakLeft - peakWidth; stdDevStats.clear(); for (int i = leftBound; i <= peakLeft; i++) { stdDevStats.addValue(intensities[i]);
stdDevStats.clear(); toFindMinWithPeakNoise.clear(); DescriptiveStatistics toCollectSampleWindows = new DescriptiveStatistics(); toCollectSampleWindows.clear(); toCollectSampleWindows.clear(); for (int j = 0; j < 1; j++) { int min = 0; stdDevStats.clear(); rightBound = peakRight + peakWidth; leftBound = peakLeft - peakWidth; stdDevStats.clear(); for (int i = leftBound; i <= peakLeft; i++) { stdDevStats.addValue(intensities[i]);
stdDevStats.clear(); toFindMinNoPeakNoise.clear(); toFindMinWithPeakNoise.clear(); stdDevStats.clear(); int curRight = peakRight + initialWindowSize + i; int curLeft = peakLeft - initialWindowSize - i; stdDevStats.clear(); int rightBound = peakRight + peakWidth; int leftBound = peakLeft - peakWidth; stdDevStats.clear(); for (int i = leftBound; i <= peakLeft; i++) { stdDevStats.addValue(intensities[i]);
stdDevStats.clear(); toFindMinNoPeakNoise.clear(); toFindMinWithPeakNoise.clear(); stdDevStats.clear(); int curRight = peakRight + initialWindowSize + i + 1; int curLeft = peakLeft - initialWindowSize - i - 1; stdDevStats.clear(); int curRight = peakRight + 1 + i; int curLeft = peakLeft - 1 - i; stdDevStats.clear(); int rightBound = peakRight + peakWidth; int leftBound = peakLeft - peakWidth; stdDevStats.clear(); for (int i = leftBound; i <= peakLeft; i++) { stdDevStats.addValue(intensities[i]);
stdDevStats.clear(); boolean stop_sliding_left = false; for (int i = 0; i < (furthestPoint - windowSize); i++) { stdDevStats.clear(); stdDevStats.clear(); int rightBound = peakRight + peakWidth; int leftBound = peakLeft - peakWidth; stdDevStats.clear(); for (int i = leftBound; i <= peakLeft; i++) { stdDevStats.addValue(intensities[i]);
stdDevStats.clear(); toFindMinNoPeakNoise.clear(); toFindMinWithPeakNoise.clear(); stdDevStats.clear(); int curRight = peakRight + initialWindowSize + i + 1; int curLeft = peakLeft - initialWindowSize - i - 1; stdDevStats.clear(); int curRight = peakRight + 1 + i; int curLeft = peakLeft - 1 - i; stdDevStats.clear(); int rightBound = peakRight + peakWidth; int leftBound = peakLeft - peakWidth; stdDevStats.clear(); for (int i = leftBound; i <= peakLeft; i++) { stdDevStats.addValue(intensities[i]);
stdDevStats.clear(); boolean stop_sliding_left = false; for (int i = 0; i < (furthestPoint - windowSize); i++) { stdDevStats.clear(); stdDevStats.clear(); int rightBound = peakRight + peakWidth; int leftBound = peakLeft - peakWidth; stdDevStats.clear(); for (int i = leftBound; i <= peakLeft; i++) { stdDevStats.addValue(intensities[i]);
stdDevStats.clear(); toFindMinNoPeakNoise.clear(); toFindMinWithPeakNoise.clear(); stdDevStats.clear(); int curRight = peakRight + initialWindowSize + i; int curLeft = peakLeft - initialWindowSize - i; stdDevStats.clear(); int rightBound = peakRight + peakWidth; int leftBound = peakLeft - peakWidth; stdDevStats.clear(); for (int i = leftBound; i <= peakLeft; i++) { stdDevStats.addValue(intensities[i]);