zdoom/gzdoom
0
0
Fork 0
mirror of https://github.com/ZDoom/gzdoom.git synced 2025-02-17 01:31:25 +00:00
Code Issues Projects Releases Packages Wiki Activity

- fixed: Array.Insert must zero all elements before the new one if something gets inserted outside the existing range.

Browse source
This commit is contained in:
Christoph Oelckers 2020-10-17 11:40:51 +02:00
parent d6e962c91e
commit 0526e0e04e
1 changed files with 5 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

9
src/common/scripting/core/dynarrays.cpp
View file

@ -87,11 +87,12 @@ template<class T> void ArrayDelete(T *self, int index, int count)
template<class T, class U, int fill = 1> void ArrayInsert(T *self, int index, U val) template<class T, class U, int fill = 1> void ArrayInsert(T *self, int index, U val)
{ {
//int oldSize = self->Size(); int oldSize = self->Size();
self->Insert(index, static_cast<typename T::value_type>(val)); self->Insert(index, static_cast<typename T::value_type>(val));
// Is this even necessary? All Insert does is inserting one defined element into the array and moving the rest. if constexpr (fill)
// It never creates empty tailing entries. fillcount in the macro will always be 0 {
//if (fill) { DYNARRAY_FILL_ITEMS_SKIP(1); } for (unsigned i = oldSize; i < self->Size() - 1; i++) (*self)[i] = 0;
}
} }
template<class T> void ArrayShrinkToFit(T *self) template<class T> void ArrayShrinkToFit(T *self)