You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
133 lines
2.7 KiB
133 lines
2.7 KiB
6 years ago
|
/*
|
||
|
|
* This file is part of qpOASES.
|
||
|
|
*
|
||
|
|
* qpOASES -- An Implementation of the Online Active Set Strategy.
|
||
|
|
* Copyright (C) 2007-2008 by Hans Joachim Ferreau 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/SubjectTo.ipp
|
||
|
|
* \author Hans Joachim Ferreau
|
||
|
|
* \version 1.3embedded
|
||
|
|
* \date 2007-2008
|
||
|
|
*
|
||
|
|
* Implementation of the inlined member functions of the SubjectTo class
|
||
|
|
* designed to manage working sets of constraints and bounds within a QProblem.
|
||
|
|
*/
|
||
|
|
|
||
|
|
|
||
|
|
/*****************************************************************************
|
||
|
|
* P U B L I C *
|
||
|
|
*****************************************************************************/
|
||
|
|
|
||
|
|
|
||
|
|
/*
|
||
|
|
* g e t T y p e
|
||
|
|
*/
|
||
|
|
inline SubjectToType SubjectTo::getType( int i ) const
|
||
|
|
{
|
||
|
|
if ( ( i >= 0 ) && ( i < size ) )
|
||
|
|
return type[i];
|
||
|
|
else
|
||
|
|
return ST_UNKNOWN;
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
/*
|
||
|
|
* g e t S t a t u s
|
||
|
|
*/
|
||
|
|
inline SubjectToStatus SubjectTo::getStatus( int i ) const
|
||
|
|
{
|
||
|
|
if ( ( i >= 0 ) && ( i < size ) )
|
||
|
|
return status[i];
|
||
|
|
else
|
||
|
|
return ST_UNDEFINED;
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
/*
|
||
|
|
* s e t T y p e
|
||
|
|
*/
|
||
|
|
inline returnValue SubjectTo::setType( int i, SubjectToType value )
|
||
|
|
{
|
||
|
|
if ( ( i >= 0 ) && ( i < size ) )
|
||
|
|
{
|
||
|
|
type[i] = value;
|
||
|
|
return SUCCESSFUL_RETURN;
|
||
|
|
}
|
||
|
|
else
|
||
|
|
return THROWERROR( RET_INDEX_OUT_OF_BOUNDS );
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
/*
|
||
|
|
* s e t S t a t u s
|
||
|
|
*/
|
||
|
|
inline returnValue SubjectTo::setStatus( int i, SubjectToStatus value )
|
||
|
|
{
|
||
|
|
if ( ( i >= 0 ) && ( i < size ) )
|
||
|
|
{
|
||
|
|
status[i] = value;
|
||
|
|
return SUCCESSFUL_RETURN;
|
||
|
|
}
|
||
|
|
else
|
||
|
|
return THROWERROR( RET_INDEX_OUT_OF_BOUNDS );
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
/*
|
||
|
|
* s e t N o L o w e r
|
||
|
|
*/
|
||
|
|
inline void SubjectTo::setNoLower( BooleanType _status )
|
||
|
|
{
|
||
|
|
noLower = _status;
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
/*
|
||
|
|
* s e t N o U p p e r
|
||
|
|
*/
|
||
|
|
inline void SubjectTo::setNoUpper( BooleanType _status )
|
||
|
|
{
|
||
|
|
noUpper = _status;
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
/*
|
||
|
|
* i s N o L o w e r
|
||
|
|
*/
|
||
|
|
inline BooleanType SubjectTo::isNoLower( ) const
|
||
|
|
{
|
||
|
|
return noLower;
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
/*
|
||
|
|
* i s N o L o w e r
|
||
|
|
*/
|
||
|
|
inline BooleanType SubjectTo::isNoUpper( ) const
|
||
|
|
{
|
||
|
|
return noUpper;
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
/*
|
||
|
|
* end of file
|
||
|
|
*/
|