FastLED 3.9.15
Loading...
Searching...
No Matches

◆ operator<()

template<typename Key, typename Value, typename Compare = less<Key>, typename Allocator = allocator_slab<char>>
bool fl::MapRedBlackTree< Key, Value, Compare, Allocator >::operator< ( const MapRedBlackTree< Key, Value, Compare, Allocator > & other) const
inline

Definition at line 1417 of file rbtree.h.

1417 {
1418 return fl::lexicographical_compare(mTree.begin(), mTree.end(),
1420 }
iterator end()
Definition rbtree.h:769
iterator begin()
Definition rbtree.h:755
bool lexicographical_compare(Iterator1 first1, Iterator1 last1, Iterator2 first2, Iterator2 last2) FL_NOEXCEPT
Definition algorithm.h:146