FastLED
3.9.15
Loading...
Searching...
No Matches
◆
insert()
template<typename T, typename LessThan = fl::less<T>>
bool
fl::SortedHeapVector
< T, LessThan >::insert
(
const T &
value
,
InsertResult
*
result
=
nullptr
)
inline
Definition at line
697
of file
vector.h
.
697
{
698
// Find insertion point using binary search
699
iterator
pos
=
lower_bound
(
value
);
700
if
(
pos
!=
end
() && !
mLess
(
value
, *
pos
) && !
mLess
(*
pos
,
value
)) {
701
// return false; // Already inserted.
702
if
(
result
) {
703
// *result = kExists;
704
*
result
=
InsertResult::kExists
;
705
}
706
707
return
false
;
708
}
709
if
(
mArray
.size() >=
mMaxSize
) {
710
// return false; // Too full
711
if
(
result
) {
712
*
result
=
InsertResult::kMaxSize
;
713
}
714
return
false
;
715
}
716
mArray
.insert(
pos
,
value
);
717
if
(
result
) {
718
*
result
=
kInserted
;
719
}
720
721
return
true
;
722
}
fl::SortedHeapVector::mMaxSize
size_t mMaxSize
Definition
vector.h:671
fl::SortedHeapVector::lower_bound
iterator lower_bound(const T &value)
Definition
vector.h:726
fl::SortedHeapVector::mArray
HeapVector< T > mArray
Definition
vector.h:669
fl::SortedHeapVector::end
iterator end()
Definition
vector.h:799
fl::SortedHeapVector::mLess
LessThan mLess
Definition
vector.h:670
fl::SortedHeapVector::iterator
HeapVector< T >::iterator iterator
Definition
vector.h:674
fl::SortedHeapVector
Definition
vector.h:667
fl
SortedHeapVector
Generated on Tue Jun 24 2025 00:58:16 for FastLED by
1.13.2