mirror of
https://github.com/XRPLF/rippled.git
synced 2025-11-22 20:15:51 +00:00
Added StringArray::ensureStorageAllocated
This commit is contained in:
@@ -499,6 +499,11 @@ void StringArray::appendNumbersToDuplicates (const bool ignoreCase,
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
void StringArray::ensureStorageAllocated (int minNumElements)
|
||||||
|
{
|
||||||
|
strings.ensureStorageAllocated (minNumElements);
|
||||||
|
}
|
||||||
|
|
||||||
void StringArray::minimiseStorageOverheads()
|
void StringArray::minimiseStorageOverheads()
|
||||||
{
|
{
|
||||||
strings.minimiseStorageOverheads();
|
strings.minimiseStorageOverheads();
|
||||||
|
|||||||
@@ -385,6 +385,15 @@ public:
|
|||||||
*/
|
*/
|
||||||
void sort (bool ignoreCase);
|
void sort (bool ignoreCase);
|
||||||
|
|
||||||
|
//==============================================================================
|
||||||
|
/** Increases the array's internal storage to hold a minimum number of elements.
|
||||||
|
|
||||||
|
Calling this before adding a large known number of elements means that
|
||||||
|
the array won't have to keep dynamically resizing itself as the elements
|
||||||
|
are added, and it'll therefore be more efficient.
|
||||||
|
*/
|
||||||
|
void ensureStorageAllocated (int minNumElements);
|
||||||
|
|
||||||
//==============================================================================
|
//==============================================================================
|
||||||
/** Reduces the amount of storage being used by the array.
|
/** Reduces the amount of storage being used by the array.
|
||||||
|
|
||||||
|
|||||||
Reference in New Issue
Block a user