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(),
1419
other
.
mTree
.
begin
(),
other
.
mTree
.
end
());
1420
}
fl::MapRedBlackTree::mTree
TreeType mTree
Definition
rbtree.h:1025
fl::MapRedBlackTree
Definition
rbtree.h:998
fl::RedBlackTree::end
iterator end()
Definition
rbtree.h:769
fl::RedBlackTree::begin
iterator begin()
Definition
rbtree.h:755
fl::lexicographical_compare
bool lexicographical_compare(Iterator1 first1, Iterator1 last1, Iterator2 first2, Iterator2 last2) FL_NOEXCEPT
Definition
algorithm.h:146
fl
MapRedBlackTree
Generated on Tue Jun 16 2026 00:07:05 for FastLED by
1.13.2