37     typedef _Index Index;  typedef
38     typedef Matrix<Index,Dynamic,1> IndexVector; 
45 …MappedSuperNodalMatrix(Index m, Index n,  ScalarVector& nzval, IndexVector& nzval_colptr, IndexVec…  in MappedSuperNodalMatrix()
61 …void setInfos(Index m, Index n, ScalarVector& nzval, IndexVector& nzval_colptr, IndexVector& rowin…  in setInfos()
78     Index rows() { return m_row; }  in rows()
83     Index cols() { return m_col; }  in cols()
99     Index* colIndexPtr()  in colIndexPtr()
104     const Index* colIndexPtr() const  in colIndexPtr()
112     Index* rowIndex()  { return m_rowind; }  in rowIndex()
114     const Index* rowIndex() const  in rowIndex()
122     Index* rowIndexPtr() { return m_rowind_colptr; }  in rowIndexPtr()
124     const Index* rowIndexPtr() const   in rowIndexPtr()
132     Index* colToSup()  { return m_col_to_sup; }  in colToSup()
134     const Index* colToSup() const  in colToSup()
141     Index* supToCol() { return m_sup_to_col; }  in supToCol()
143     const Index* supToCol() const   in supToCol()
151     Index nsuper() const   in nsuper()
164     Index m_row; // Number of rows
165     Index m_col; // Number of columns 
166     Index m_nsuper; // Number of supernodes 
168     Index* m_nzval_colptr; //nzval_colptr[j] Stores the location in nzval[] which starts column j 
169     Index* m_rowind; // Array of compressed row indices of rectangular supernodes
170     Index* m_rowind_colptr; //rowind_colptr[j] stores the location in rowind[] which starts column j
171     Index* m_col_to_sup; // col_to_sup[j] is the supernode number to which column j belongs
172     Index* m_sup_to_col; //sup_to_col[s] points to the starting column of the s-th supernode
181 template<typename Scalar, typename Index>
182 class MappedSuperNodalMatrix<Scalar,Index>::InnerIterator
185      InnerIterator(const MappedSuperNodalMatrix& mat, Index outer)  in InnerIterator()
205     inline Index index() const { return m_matrix.rowIndex()[m_idrow]; }  in index()
206     inline Index row() const { return index(); }  in row()
207     inline Index col() const { return m_outer; }  in col()
209     inline Index supIndex() const { return m_supno; }  in supIndex()
219     const Index m_outer;                    // Current column 
220     const Index m_supno;                    // Current SuperNode number
221     Index m_idval;                          // Index to browse the values in the current column
222     const Index m_startidval;               // Start of the column value
223     const Index m_endidval;                 // End of the column value
224     Index m_idrow;                          // Index to browse the row indices 
225     Index m_endidrow;                       // End index of row indices of the current column
232 template<typename Scalar, typename Index>
234 void MappedSuperNodalMatrix<Scalar,Index>::solveInPlace( MatrixBase<Dest>&X) const  in solveInPlace()
236     Index n = X.rows();   in solveInPlace()
237     Index nrhs = X.cols();   in solveInPlace()
241     for (Index k = 0; k <= nsuper(); k ++)  in solveInPlace()
243       Index fsupc = supToCol()[k];                    // First column of the current supernode   in solveInPlace()
244 …Index istart = rowIndexPtr()[fsupc];            // Pointer index to the subscript of the current c…  in solveInPlace()
245       Index nsupr = rowIndexPtr()[fsupc+1] - istart;  // Number of rows in the current supernode  in solveInPlace()
246       Index nsupc = supToCol()[k+1] - fsupc;          // Number of columns in the current supernode  in solveInPlace()
247 …Index nrow = nsupr - nsupc;                     // Number of rows in the non-diagonal part of the …  in solveInPlace()
248       Index irow;                                     //Current index row  in solveInPlace()
252         for (Index j = 0; j < nrhs; j++)  in solveInPlace()
266         Index luptr = colIndexPtr()[fsupc];   in solveInPlace()
267         Index lda = colIndexPtr()[fsupc+1] - luptr;  in solveInPlace()
279         for (Index j = 0; j < nrhs; j++)  in solveInPlace()
281           Index iptr = istart + nsupc;   in solveInPlace()
282           for (Index i = 0; i < nrow; i++)  in solveInPlace()