insert() [5/6]

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

template<typename InputIt>

void fl::MapRedBlackTree< Key, Value, Compare, Allocator >::insert ( InputIt first, InputIt last )

inline

Definition at line 1157 of file rbtree.h.

                                             {
        for (InputIt it = first; it != last; ++it) {
            mTree.insert(*it);
        }
    }