MapRedBlackTree() [4/5]

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

template<typename InputIt>

fl::MapRedBlackTree< Key, Value, Compare, Allocator >::MapRedBlackTree ( InputIt first, InputIt last, const Compare & comp = Compare(), const Allocator & alloc = Allocator() )

inline

Definition at line 1074 of file rbtree.h.

        : mTree(PairCompare(comp), alloc) {
        // Insert all elements from the range
        for (InputIt it = first; it != last; ++it) {
            mTree.insert(*it);
        }
    }