update() [2/2]

template<typename T, fl::size N = 0>

T fl::detail::AlphaTrimmedMeanImpl< T, N >::update ( T input )

inline

Definition at line 46 of file alpha_trimmed_mean_impl.h.

                      {
        if (!mRing.full()) {
            T* base = &mSorted[0];
            T* pos = fl::lower_bound(base, base + mSortedCount, input);
            fl::size idx = static_cast<fl::size>(pos - base);
            for (fl::size i = mSortedCount; i > idx; --i) {
                mSorted[i] = mSorted[i - 1];
            }
            mSorted[idx] = input;
            ++mSortedCount;
        } else {
            T oldest = mRing.front();
            T* base = &mSorted[0];
            T* rm_pos = fl::lower_bound(base, base + mSortedCount, oldest);
            fl::size rm = static_cast<fl::size>(rm_pos - base);
            for (fl::size i = rm; i + 1 < mSortedCount; ++i) {
                mSorted[i] = mSorted[i + 1];
            }
            T* ins_pos = fl::lower_bound(base, base + mSortedCount - 1, input);
            fl::size idx = static_cast<fl::size>(ins_pos - base);
            for (fl::size i = mSortedCount - 1; i > idx; --i) {
                mSorted[i] = mSorted[i - 1];
            }
            mSorted[idx] = input;
        }
        mRing.push_back(input);
 
        fl::size lo = mTrimCount;
        fl::size hi = (mSortedCount > mTrimCount) ? mSortedCount - mTrimCount : 0;
        if (lo >= hi) {
            mLastValue = mSorted[mSortedCount / 2];
        } else {
            T sum = T(0);
            for (fl::size i = lo; i < hi; ++i) {
                sum = sum + mSorted[i];
            }
            mLastValue = div_by_count(sum, hi - lo);
        }
        return mLastValue;
    }

References fl::detail::div_by_count(), fl::lower_bound(), mLastValue, mRing, mSorted, mSortedCount, mTrimCount, and pos.

Here is the call graph for this function: