Method insert

kratos/containers/pointer_vector_set.h:571–587

* @brief Inserts a pointer. * @details This function inserts a given pointer such that the resulting PointerVectorSet * is kept sorted. If there exists already a pointer with a key same as the key of the value, then * this will return iterator of that existing pointer (The value will not be inserted.) * @param value The pointer to be inserted. * @return An iterator pointin

     * @return An iterator pointing to the inserted element.
     */
    iterator insert(const TPointerType& value)
    {
        auto itr_pos = std::lower_bound(mData.begin(), mData.end(), KeyOf(*value), CompareKey());
        if (itr_pos == mData.end()) {
            // the position to insert is at the end.
            mData.push_back(value);
            mSortedPartSize = mData.size();
            return iterator(mData.end() - 1);
        } else if (EqualKeyTo(KeyOf(*value))(*itr_pos)) {
            // already found existing element with the same key, hence returning the existing element.
            return iterator(itr_pos);
        } else {
            // insert the new value before the itr_pos.
            mSortedPartSize = mData.size() + 1;
            return mData.insert(itr_pos, value);
        }
    }

    /**
     * @brief Inserts a pointer at the specified position.