Indexlist.c File Reference

#include <qpOASES_e/Indexlist.h>

Include dependency graph for Indexlist.c:

Go to the source code of this file.

Functions
returnValue	Indexlist_addNumber (Indexlist *_THIS, int addnumber)
int	Indexlist_findInsert (Indexlist *_THIS, int i)
int	Indexlist_getIndex (Indexlist *_THIS, int givennumber)
returnValue	Indexlist_getISortArray (Indexlist *_THIS, int **const iSortArray)
returnValue	Indexlist_getNumberArray (Indexlist *_THIS, int **const numberarray)
returnValue	Indexlist_init (Indexlist *_THIS, int n)
returnValue	Indexlist_removeNumber (Indexlist *_THIS, int removenumber)
returnValue	Indexlist_swapNumbers (Indexlist *_THIS, int number1, int number2)
BEGIN_NAMESPACE_QPOASES void	IndexlistCON (Indexlist *_THIS, int n)
void	IndexlistCPY (Indexlist *FROM, Indexlist *TO)

Detailed Description

Author

Hans Joachim Ferreau, Andreas Potschka, Christian Kirches

Version

3.1embedded

Date

2007-2015

Implementation of the Indexlist class designed to manage index lists of constraints and bounds within a QProblem_SubjectTo.

Definition in file Indexlist.c.

Function Documentation

returnValue Indexlist_addNumber	(	Indexlist *	_THIS,
		int	addnumber
	)

Adds number to index list.

Returns

SUCCESSFUL_RETURN
RET_INDEXLIST_MUST_BE_REORDERD
RET_INDEXLIST_EXCEEDS_MAX_LENGTH

Parameters

addnumber

Number to be added.

Definition at line 139 of file Indexlist.c.

int Indexlist_findInsert	(	Indexlist *	_THIS,
		int	i
	)

Find first index j between -1 and length in sorted list of indices iSort such that numbers[iSort[j]] <= i < numbers[iSort[j+1]]. Uses bisection.

Returns

j.

Definition at line 219 of file Indexlist.c.

int Indexlist_getIndex	(	Indexlist *	_THIS,
		int	givennumber
	)

Determines the index within the index list at which a given number is stored.

Returns

>= 0: Index of given number.
-1: Number not found.

Parameters

givennumber

Number whose index shall be determined.

Definition at line 129 of file Indexlist.c.

returnValue Indexlist_getISortArray	(	Indexlist *	_THIS,
		int **const	iSortArray
	)

Creates an array of all numbers within the index set in correct order.

Returns

SUCCESSFUL_RETURN
RET_INDEXLIST_CORRUPTED

Parameters

iSortArray

Output: iSort Array.

Definition at line 118 of file Indexlist.c.

returnValue Indexlist_getNumberArray	(	Indexlist *	_THIS,
		int **const	numberarray
	)

Creates an array of all numbers within the index set in correct order.

Returns

SUCCESSFUL_RETURN
RET_INDEXLIST_CORRUPTED

Parameters

numberarray

Output: Array of numbers (NULL on error).

Definition at line 105 of file Indexlist.c.

returnValue Indexlist_init	(	Indexlist *	_THIS,
		int	n
	)

Initialises index list of desired physical length.

Returns

SUCCESSFUL_RETURN
RET_INVALID_ARGUMENTS

Parameters

n	Physical length of index list.

Definition at line 86 of file Indexlist.c.

returnValue Indexlist_removeNumber	(	Indexlist *	_THIS,
		int	removenumber
	)

Removes number from index list.

Returns

SUCCESSFUL_RETURN

Parameters

removenumber

Number to be removed.

Definition at line 160 of file Indexlist.c.

returnValue Indexlist_swapNumbers	(	Indexlist *	_THIS,
		int	number1,
		int	number2
	)

Swaps two numbers within index list.

Returns

SUCCESSFUL_RETURN

Parameters

number1	First number for swapping.
number2	Second number for swapping.

Definition at line 190 of file Indexlist.c.

BEGIN_NAMESPACE_QPOASES void IndexlistCON	(	Indexlist *	_THIS,
		int	n
	)

Constructor which takes the desired physical length of the index list.

Parameters

n	Physical length of index list.

Definition at line 49 of file Indexlist.c.

void IndexlistCPY	(	Indexlist *	FROM,
		Indexlist *	TO
	)

Copies all members from given rhs object.

Returns

SUCCESSFUL_RETURN

Definition at line 60 of file Indexlist.c.