#include <tnt_sparse_matrix_csr.h>
Public Methods | |
| Sparse_Matrix_CompRow (const Sparse_Matrix_CompRow &S) | |
| Sparse_Matrix_CompRow (int M, int N, int nz, const T *val, const int *r, const int *c) | |
| const T& | val (int i) const | 
| const int& | row_ptr (int i) const | 
| const int& | col_ind (int i) const | 
| int | dim1 () const | 
| int | dim2 () const | 
| int | NumNonzeros () const | 
| Sparse_Matrix_CompRow& | operator= (const Sparse_Matrix_CompRow &R) | 
Index values begin at 0.
Storage requirements: An (m x n) matrix with nz nonzeros requires no more than ((T+I)*nz + M*I) bytes, where T is the size of data elements and I is the size of integers.
      
  | 
  ||||
| 
 
  | 
  
      
  | 
  ||||||||||||||
| 
 Construct a read-only view of existing sparse matrix in compressed-row storage format. 
  | 
  
      
  | 
  ||||
| 
 
  | 
  
      
  | 
  ||||
| 
 
  | 
  
      
  | 
  ||||
| 
 
  | 
  
      
  | 
  ||||
| 
 
  | 
  
      
  | 
  ||||
| 
 
  | 
  
      
  | 
  ||||
| 
 
  | 
  
      
  | 
  ||||
| 
 
  | 
  
1.2.5 written by Dimitri van Heesch,
 © 1997-2001