insert()

template<typename T, typename LessThan = fl::less<T>>

bool fl::SortedHeapVector< T, LessThan >::insert ( const T & value, insert_result * result = nullptr )

inline

Definition at line 1035 of file vector.h.

                                                                              {
        iterator pos = lower_bound(value);
        if (pos != end() && !mLess(value, *pos) && !mLess(*pos, value)) {
            if (result) *result = exists;
            return false;
        }
        if (mArray.size() >= mMaxSize) {
            if (result) *result = at_capacity;
            return false;
        }
        mArray.insert(pos, value);
        if (result) *result = inserted;
        return true;
    }

References at_capacity, end(), exists, fl::FL_NO_EXCEPT, inserted, lower_bound(), mArray, mLess, mMaxSize, pos, and fl::type_rank< T >::value.

Here is the call graph for this function: