end() [1/2]

template<typename T, typename Compare = less<T>, typename Allocator = allocator_slab<char>>

iterator fl::RedBlackTree< T, Compare, Allocator >::end ( )

inline

Definition at line 539 of file rbtree.h.

                   {
        return iterator(nullptr, this);
    }

Referenced by fl::RedBlackTree< value_type, PairCompare, Allocator >::begin(), fl::RedBlackTree< value_type, PairCompare, Allocator >::begin(), fl::RedBlackTree< value_type, PairCompare, Allocator >::cend(), fl::RedBlackTree< value_type, PairCompare, Allocator >::erase(), fl::RedBlackTree< value_type, PairCompare, Allocator >::find(), fl::RedBlackTree< value_type, PairCompare, Allocator >::find(), fl::RedBlackTree< value_type, PairCompare, Allocator >::insertImpl(), fl::RedBlackTree< value_type, PairCompare, Allocator >::lower_bound(), fl::RedBlackTree< value_type, PairCompare, Allocator >::lower_bound(), fl::MapRedBlackTree< Key, T, Compare, fl::allocator_slab< char > >::operator==(), fl::RedBlackTree< value_type, PairCompare, Allocator >::operator==(), fl::RedBlackTree< value_type, PairCompare, Allocator >::upper_bound(), and fl::RedBlackTree< value_type, PairCompare, Allocator >::upper_bound().

Here is the caller graph for this function: