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
700 if (pos != end() && !mLess(value, *pos) && !mLess(*pos, value)) {
701 // return false; // Already inserted.
702 if (result) {
703 // *result = kExists;
705 }
706
707 return false;
708 }
709 if (mArray.size() >= mMaxSize) {
710 // return false; // Too full
711 if (result) {
713 }
714 return false;
715 }
716 mArray.insert(pos, value);
717 if (result) {
718 *result = kInserted;
719 }
720
721 return true;
722 }
iterator lower_bound(const T &value)
Definition vector.h:726
HeapVector< T > mArray
Definition vector.h:669
iterator end()
Definition vector.h:799
HeapVector< T >::iterator iterator
Definition vector.h:674