Lines Matching defs:mBins
55 if (mBinSize <= 0 || mBins.size() < 2) {
61 //const int index = std::clamp(unboundedIndex, 0, (int)(mBins.size() - 1));
62 const int index = std::max(0, std::min((int)(mBins.size() - 1), unboundedIndex));
63 mBins[index]++;
69 std::fill(mBins.begin(), mBins.end(), 0);
83 for (size_t i = 0; i < mBins.size(); i++) {
84 if (mBins[i] != 0) {
88 ss << static_cast<int>(i) - 1 << kDivider << mBins[i];
98 if (totalCount() == 0 || mBinSize <= 0 || mBins.size() < 2) {
114 // Since totalCount() > 0, mBins is not empty and maxCount > 0.
115 const unsigned maxCount = *std::max_element(mBins.begin(), mBins.end());
122 // If firstNonZeroBin reaches mBins.size() - 1, then it must be a nonzero bin.
123 for (; firstNonZeroBin < mBins.size() - 1 && mBins[firstNonZeroBin] == 0; firstNonZeroBin++) {}
126 size_t lastNonZeroBin = mBins.size() - 1;
128 for (; lastNonZeroBin > 0 && mBins[lastNonZeroBin] == 0; lastNonZeroBin--) {}
129 const size_t lastBinToPrint = lastNonZeroBin == mBins.size() - 1 ? lastNonZeroBin
136 } else if (bin == mBins.size() - 1) {
143 const uint64_t binCount = mBins[bin];
