madrocketsci/amsmathutil25
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

fixed bug in array.insert(index,array)

Browse Source
This commit is contained in:
Aaron
2026-04-27 19:25:59 -04:00
parent 9409daefb4
commit a704893c1d
26 changed files with 13 additions and 11 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
include/amsmathutil25/util/amsmathutil25_amsarray_impl.hpp
View File

@ -493,16 +493,16 @@ template<typename T> int amsarray<T>::insert(amsarray_size_t ind, const amsarray
else if(ind<=this->length)
{
oldlen = this->length;
res = this->resize_insert(this->length + other.length);
res = this->resize_insert(oldlen + other.length);
if(res==amsarray_success)
{
//for now, do things single threaded.
//to do things multithreaded, I'd need another buffer
if(this->data!=NULL && other.data!=NULL)
{
for(I=oldlen;I>=ind+other.length;I--)
for(I=oldlen+other.length-1;I>=ind+other.length;I--)
{
this->data[I] = std::move(this->data[I-1]);
this->data[I] = std::move(this->data[I-other.length]);
}
for(I=ind;I<ind+other.length;I++)
{

2
include/amsmathutil25/util/amsmathutil25_amsarray_sortimpl.hpp
View File

@ -300,6 +300,7 @@ template<typename T> int amsarray_quicksort_threaded(
rangeptr = 0;
ranges.append(ams::pair<amsarray_size_t,amsarray_size_t>(0,array->length));
while(rangeptr<ranges.length)
{
//spawn up to the maximum number of threads
@ -340,6 +341,7 @@ template<typename T> int amsarray_quicksort_threaded(
}
//rangeptr++;
}
}
return ret;