insert()

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

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

inline

Definition at line 651 of file vector.h.

                                                                {
        // Find insertion point using binary search
        iterator pos = lower_bound(value);
        if (pos != end() && !mLess(value, *pos) && !mLess(*pos, value)) {
            // return false; // Already inserted.
            if (result) {
                // *result = kExists;
                *result = InsertResult::kExists;
            }
 
            return false;
        }
        if (mArray.size() >= mMaxSize) {
            // return false;  // Too full
            if (result) {
                *result = InsertResult::kMaxSize;
            }
            return false;
        }
        mArray.insert(pos, value);
        if (result) {
            *result = kInserted;
        }
 
        return true;
    }