36 #include <qpOASES/Indexlist.hpp> 134 if (numberarray == 0)
149 return number[
iSort[index]] == givennumber ? iSort[index] : -1;
164 for (i =
length; i > j+1; i--)
180 int iSidx =
iSort[idx];
183 if (
number[iSidx] != removenumber )
187 for (i = 0; i <
length; i++)
189 for (i = idx+1; i <
length; i++)
193 for( i=iSidx; i<length-1; ++i )
219 number[iSort[index2]] = tmp;
222 iSort[index1] = iSort[index2];
271 iSort =
new int[physicallength];
272 for( i=0; i<physicallength; ++i )
291 int fst = 0, lst =
length-1, mid;
293 while (fst < lst - 1)
295 mid = (fst + lst) / 2;
296 if (i >=
number[iSort[mid]]) fst = mid;
returnValue addNumber(int addnumber)
returnValue getNumberArray(int *const numberarray) const
Allows to pass back messages to the calling function.
#define THROWERROR(retval)
returnValue swapNumbers(int number1, int number2)
Indexlist & operator=(const Indexlist &rhs)
returnValue removeNumber(int removenumber)
returnValue copy(const Indexlist &rhs)
void rhs(const real_t *x, real_t *f)
#define END_NAMESPACE_QPOASES
int number[INDEXLISTFACTOR *(NVMAX+NCMAX)]
Stores and manages index lists.
int findInsert(int i) const
int getIndex(int givennumber) const
#define BEGIN_NAMESPACE_QPOASES