Back to index

salome-med  6.5.0
Public Member Functions | Public Attributes
INTERP_KERNEL::Matrix< T, type >::Row Class Reference
Inheritance diagram for INTERP_KERNEL::Matrix< T, type >::Row:
Inheritance graph
[legend]
Collaboration diagram for INTERP_KERNEL::Matrix< T, type >::Row:
Collaboration graph
[legend]

List of all members.

Public Member Functions

 Row ()
 Row (const Row &row)
Rowoperator= (const Row &row)
std::vector< std::pair< int, T >
>::const_iterator 
find (int elem) const
void erase (int elem)
void insert (const std::pair< int, T > &myPair)

Public Attributes

elements
 STL member.

Detailed Description

template<class T, NumberingPolicy type = ALL_C_MODE>
class INTERP_KERNEL::Matrix< T, type >::Row

Definition at line 54 of file InterpKernelMatrix.hxx.


Constructor & Destructor Documentation

template<class T, NumberingPolicy type = ALL_C_MODE>
INTERP_KERNEL::Matrix< T, type >::Row::Row ( ) [inline]

Definition at line 57 of file InterpKernelMatrix.hxx.

:std::vector< std::pair<int,T> >(){};
template<class T, NumberingPolicy type = ALL_C_MODE>
INTERP_KERNEL::Matrix< T, type >::Row::Row ( const Row row) [inline]

Definition at line 58 of file InterpKernelMatrix.hxx.

      {
        this->resize(row.size());
        for (int i=0; i<this->size(); i++)
          (*this)[i]=row[i];
      }

Here is the call graph for this function:


Member Function Documentation

template<class T, NumberingPolicy type = ALL_C_MODE>
void INTERP_KERNEL::Matrix< T, type >::Row::erase ( int  elem) [inline]

Definition at line 76 of file InterpKernelMatrix.hxx.

{ std::vector< std::pair<int,T> >::erase(std::find_if(std::vector< std::pair<int,T> >::begin(),std::vector< std::pair<int,T> >::end(),KeyComparator(elem))); }
template<class T, NumberingPolicy type = ALL_C_MODE>
std::vector< std::pair<int,T> >::const_iterator INTERP_KERNEL::Matrix< T, type >::Row::find ( int  elem) const [inline]

Definition at line 71 of file InterpKernelMatrix.hxx.

      {
        return std::find_if(std::vector< std::pair<int,T> >::begin(),std::vector< std::pair<int,T> >::end(),KeyComparator(elem));
      }
template<class T, NumberingPolicy type = ALL_C_MODE>
void INTERP_KERNEL::Matrix< T, type >::Row::insert ( const std::pair< int, T > &  myPair) [inline]

Definition at line 78 of file InterpKernelMatrix.hxx.

{ vector<std::pair<int,T> >::push_back(myPair); }
template<class T, NumberingPolicy type = ALL_C_MODE>
Row& INTERP_KERNEL::Matrix< T, type >::Row::operator= ( const Row row) [inline]

Definition at line 64 of file InterpKernelMatrix.hxx.

      {
        this->resize(row.size());
        for (int i=0; i<this->size(); i++)
          (*this)[i]=row[i];
        return *this;
      }

Here is the call graph for this function:


Member Data Documentation

template<typename T>
T std::vector< T >::elements [inherited]

STL member.


The documentation for this class was generated from the following file: