forked from coin-or/qpOASES
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Indexlist.cpp
319 lines (248 loc) · 5.76 KB
/
Indexlist.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
/*
* This file is part of qpOASES.
*
* qpOASES -- An Implementation of the Online Active Set Strategy.
* Copyright (C) 2007-2017 by Hans Joachim Ferreau, Andreas Potschka,
* Christian Kirches et al. All rights reserved.
*
* qpOASES is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* qpOASES is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
* See the GNU Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with qpOASES; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*
*/
/**
* \file src/Indexlist.cpp
* \author Hans Joachim Ferreau, Andreas Potschka, Christian Kirches
* \version 3.2
* \date 2007-2017
*
* Implementation of the Indexlist class designed to manage index lists of
* constraints and bounds within a QProblem_SubjectTo.
*/
#include <qpOASES/Indexlist.hpp>
BEGIN_NAMESPACE_QPOASES
/*****************************************************************************
* P U B L I C *
*****************************************************************************/
/*
* I n d e x l i s t
*/
Indexlist::Indexlist( )
{
number = 0;
iSort = 0;
init( );
}
/*
* I n d e x l i s t
*/
Indexlist::Indexlist( int_t n )
{
number = 0;
iSort = 0;
init( n );
}
/*
* I n d e x l i s t
*/
Indexlist::Indexlist( const Indexlist& rhs )
{
copy( rhs );
}
/*
* ~ I n d e x l i s t
*/
Indexlist::~Indexlist( )
{
clear( );
}
/*
* o p e r a t o r =
*/
Indexlist& Indexlist::operator=( const Indexlist& rhs )
{
if ( this != &rhs )
{
clear( );
copy( rhs );
}
return *this;
}
/*
* i n i t
*/
returnValue Indexlist::init( int_t n
)
{
if ( n < 0 )
return THROWERROR( RET_INVALID_ARGUMENTS );
clear( );
length = 0;
physicallength = n;
if ( n > 0 )
{
number = new int_t[n];
iSort = new int_t[n];
}
return SUCCESSFUL_RETURN;
}
/*
* g e t N u m b e r A r r a y
*/
returnValue Indexlist::getNumberArray( int_t** const numberarray ) const
{
if (numberarray == 0)
return THROWERROR( RET_INVALID_ARGUMENTS );
*numberarray = number;
return SUCCESSFUL_RETURN;
}
/*
* g e t I S o r t A r r a y
*/
returnValue Indexlist::getISortArray( int_t** const iSortArray ) const
{
*iSortArray = iSort;
return SUCCESSFUL_RETURN;
}
/*
* g e t I n d e x
*/
int_t Indexlist::getIndex( int_t givennumber ) const
{
int_t index = findInsert(givennumber);
return number[iSort[index]] == givennumber ? iSort[index] : -1;
}
/*
* a d d N u m b e r
*/
returnValue Indexlist::addNumber( int_t addnumber )
{
if ( length >= physicallength )
return THROWERROR( RET_INDEXLIST_EXCEEDS_MAX_LENGTH );
int_t i, j;
number[length] = addnumber;
j = findInsert(addnumber);
for (i = length; i > j+1; i--)
iSort[i] = iSort[i-1];
iSort[j+1] = length;
++length;
return SUCCESSFUL_RETURN;
}
/*
* r e m o v e N u m b e r
*/
returnValue Indexlist::removeNumber( int_t removenumber )
{
int_t i;
int_t idx = findInsert( removenumber );
int_t iSidx = iSort[idx];
/* nothing to be done if number is not contained in index set */
if ( number[iSidx] != removenumber )
return SUCCESSFUL_RETURN;
/* update sorted indices iSort first */
for (i = 0; i < length; i++)
if (iSort[i] > iSidx) iSort[i]--;
for (i = idx+1; i < length; i++)
iSort[i-1] = iSort[i];
/* remove from numbers list */
for( i=iSidx; i<length-1; ++i )
number[i] = number[i+1];
number[length-1] = -1;
--length;
return SUCCESSFUL_RETURN;
}
/*
* s w a p N u m b e r s
*/
returnValue Indexlist::swapNumbers( int_t number1, int_t number2 )
{
int_t index1 = findInsert( number1 );
int_t index2 = findInsert( number2 );
/* consistency check */
if ( ( number[iSort[index1]] != number1 ) || ( number[iSort[index2]] != number2 ) )
return THROWERROR( RET_INDEXLIST_CORRUPTED );
int_t tmp;
/* swap numbers */
tmp = number[iSort[index1]];
number[iSort[index1]] = number[iSort[index2]];
number[iSort[index2]] = tmp;
/* swap sorting indices */
tmp = iSort[index1];
iSort[index1] = iSort[index2];
iSort[index2] = tmp;
return SUCCESSFUL_RETURN;
}
/*****************************************************************************
* P R O T E C T E D *
*****************************************************************************/
/*
* c l e a r
*/
returnValue Indexlist::clear( )
{
if ( iSort != 0 )
{
delete[] iSort;
iSort = 0;
}
if ( number != 0 )
{
delete[] number;
number = 0;
}
return SUCCESSFUL_RETURN;
}
/*
* c o p y
*/
returnValue Indexlist::copy( const Indexlist& rhs
)
{
int_t i;
length = rhs.length;
physicallength = rhs.physicallength;
if ( rhs.number != 0 )
{
number = new int_t[physicallength];
for( i=0; i<physicallength; ++i )
number[i] = rhs.number[i];
iSort = new int_t[physicallength];
for( i=0; i<physicallength; ++i )
iSort[i] = rhs.iSort[i];
}
else
{
number = 0;
iSort = 0;
}
return SUCCESSFUL_RETURN;
}
int_t Indexlist::findInsert(int_t i) const
{
/* quick check if index can be appended */
if (length == 0 || i < number[iSort[0]]) return -1;
if (i >= number[iSort[length-1]]) return length-1;
/* otherwise, perform bisection search */
int_t fst = 0, lst = length-1, mid;
while (fst < lst - 1)
{
mid = (fst + lst) / 2;
if (i >= number[iSort[mid]]) fst = mid;
else lst = mid;
}
return fst;
}
END_NAMESPACE_QPOASES
/*
* end of file
*/