minetest/irrlicht
1
0
Fork 0
mirror of https://github.com/minetest/irrlicht.git synced 2024-11-18 08:10:32 +01:00
Code Issues Projects Releases Wiki Activity

Fix comment.

Browse Source 
(Did I have a stroke when I was typing the old one?)


git-svn-id: svn://svn.code.sf.net/p/irrlicht/code/trunk@6316 dfc29bdd-3216-0410-991c-e03cc46cb475
This commit is contained in:
cutealien 2022-03-24 22:24:13 +00:00
parent f013a95a0e
commit 60538c3646
1 changed files with 3 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
include/irrArray.h
View File

@ -234,9 +234,10 @@ public:
//! Set (copy) data from given memory block //! Set (copy) data from given memory block
/** \param newData data to set, must have newSize elements /** \param newData data to set, must have newSize elements
\param newSize Amount of elements in newData \param newSize Amount of elements in newData
\param canShrink When true we reallocate the array even it can shrink.
May reduce memory usage, but call is more whenever size changes.
\param newDataIsSorted Info if you pass sorted/unsorted data \param newDataIsSorted Info if you pass sorted/unsorted data
\param canShrink Specifies whether the array is reallocated even if
enough space is available. Setting this flag to false can speed up
array usage, but may use more memory than required by the data.
*/ */
void set_data(const T* newData, u32 newSize, bool newDataIsSorted=false, bool canShrink=false) void set_data(const T* newData, u32 newSize, bool newDataIsSorted=false, bool canShrink=false)
{ {