try_emplace() [1/4]

template<typename Key, typename Value, typename Compare = less<Key>, typename Allocator = allocator_slab<char>>

template<typename... Args>

fl::pair< iterator, bool > fl::MapRedBlackTree< Key, Value, Compare, Allocator >::try_emplace ( const Key & key, Args &&... args )

inline

Definition at line 1251 of file rbtree.h.

                                                                       {
        // Use lower_bound to find position (constructs Value() once for search)
        auto it = mTree.lower_bound(value_type(key, Value()));
 
        // Check if key already exists
        if (it != mTree.end() && it->first == key) {
            // Key exists, do NOT construct value from args
            return fl::pair<iterator, bool>(it, false);
        }
 
        // Key doesn't exist, now construct value from args and insert
        return mTree.emplace(key, fl::forward<Args>(args)...);
    }

Referenced by fl::MapRedBlackTree< Key, T, Compare, fl::allocator_slab< char > >< Key, T, Compare >::try_emplace(), and fl::MapRedBlackTree< Key, T, Compare, fl::allocator_slab< char > >< Key, T, Compare >::try_emplace().

Here is the caller graph for this function: