804 {
806 if (count == 0) return *this;
807
808
811 }
812
813 fl::size newLen =
mLength + count;
814
815
820 for (fl::size i = 0; i < count; ++i) newData->data()[
pos + i] = ch;
822 newData->data()[newLen] = '\0';
825 return *this;
826 }
827
828
832 }
836 return *this;
837 }
838
839
841 if (canInsertInPlace) {
843 canInsertInPlace = heap.get().use_count() <= 1 && heap->hasCapacity(newLen);
844 if (canInsertInPlace) {
845 char*
data = heap->data();
847 for (fl::size i = 0; i < count; ++i)
data[
pos + i] = ch;
850 }
851 }
852 if (!canInsertInPlace) {
854 const char* src =
c_str();
856 for (fl::size i = 0; i < count; ++i) newData->data()[
pos + i] = ch;
858 newData->data()[newLen] = '\0';
861 }
862 return *this;
863}
bool isNonOwning() const FL_NO_EXCEPT
void materialize() FL_NO_EXCEPT
NotNullStringHolderPtr & heapData() FL_NO_EXCEPT
bool hasHeapData() const FL_NO_EXCEPT
char * inlineBufferPtr() FL_NO_EXCEPT
fl::variant< NotNullStringHolderPtr, ConstLiteral, ConstView > mStorage
const char * c_str() const FL_NO_EXCEPT
const char * data() const FL_NO_EXCEPT
shared_ptr< T > make_shared(Args &&... args) FL_NO_EXCEPT
fl::not_null< StringHolderPtr > NotNullStringHolderPtr
FASTLED_FORCE_INLINE void * memmove(void *dest, const void *src, size_t n) FL_NO_EXCEPT
FASTLED_FORCE_INLINE void * memcpy(void *dest, const void *src, size_t n) FL_NO_EXCEPT
pair_element< I, T1, T2 >::type & get(pair< T1, T2 > &p) FL_NO_EXCEPT