\returns the index of the root of the hierarchy */

* i n i t */

Returns whether the vector is empty. */

\internal */

\returns a view of the lower triangular matrix L */

uses a simple O(n^2) algorithm for sorting

* m o v e A c t i v e T o I n a c t i v e */

* m o v e F i x e d T o F r e e */

* m x I s S c a l a r */

* m x I s S c a l a r */

* m x I s S c a l a r */

* q p O A S E S _ O p t i o n s _ i n i t */

* i s Z e r o */

* q p O A S E S _ o b t a i n O u t p u t s */

* r e m o v e I n f s */

* r e m o v e N a N s */

* r e s e t */

* r e s e t */

\returns an expression of the \a i-th row of *this. Note that the numbering starts at 0. * * Example: \include MatrixBase_row.cpp * Output: \ver

* s e t C o n s t r a i n t P r o d u c t */

* s e t u p A l l F r e e */

* s e t u p A l l I n a c t i v e */

\returns an expression of P H P^-1 where H is the matrix represented by \c *this */

* a d d I n d e x */

* g e t N F X */

* s e t S t a t u s */

If input points to ( or { or [ or <, finds the position that closes it. If lines[linenum][pos] points to a '(' or '{' or '[' or '<', finds the li

* a d d I n d e x */

* s e t S t a t u s */

Return the most recent non-blank line and its line number. Args: clean_lines: A CleansedLines instance containing the file contents. linenu

* g e t L e n g t h */

* s e t T o M P C */

* s e t H */

* s e t P r i n t L e v e l */

* s o l v e Q P */

* a d d B o u n d */

* a d d C o n s t r a i n t */

* g e t O b j V a l */

* p e r f o r m R a t i o T e s t */

* p e r f o r m R a t i o T e s t */

* s e t H */

* s e t P r i n t L e v e l */

* s o l v e Q P */

* p r i n t C o p y r i g h t N o t i c e */

* Return the pointers to the beginning of each column in \ref valuePtr() */

Disables de-allocation of internal memory. */