mirror of
https://github.com/boostorg/ublas.git
synced 2026-02-23 16:12:09 +00:00
1207 lines
45 KiB
HTML
1207 lines
45 KiB
HTML
<html>
|
||
|
||
<head>
|
||
<meta http-equiv="Content-Type"
|
||
content="text/html; charset=iso-8859-1">
|
||
<meta name="GENERATOR" content="Microsoft FrontPage Express 2.0">
|
||
<title>Banded Matrix</title>
|
||
</head>
|
||
|
||
<body bgcolor="#FFFFFF">
|
||
|
||
<h1><img src="c++boost.gif" alt="c++boost.gif" align="center"
|
||
width="277" height="86">Banded Matrix</h1>
|
||
|
||
<h2><a name="banded_matrix"></a>Banded Matrix</h2>
|
||
|
||
<h4>Description</h4>
|
||
|
||
<p>The templated class <code>banded_matrix<T, F, A> </code>is
|
||
the base container adaptor for banded matrices. For a <em>(m x n</em>)-dimensional
|
||
banded matrix with <em>l</em> lower and <em>u</em> upper
|
||
diagonals and <em>0 <= i < m</em>,<em> 0 <= j < n</em>
|
||
holds <em>b</em><sub><em>i, j</em></sub><em> = 0</em>, if <em>i
|
||
> j + l</em> or <em>i < j - u</em>. The storage of banded
|
||
matrices is packed.</p>
|
||
|
||
<h4>Example</h4>
|
||
|
||
<pre>int main () {
|
||
using namespace boost::numeric::ublas;
|
||
banded_matrix<double> m (3, 3, 1, 1);
|
||
for (int i = 0; i < m.size1 (); ++ i)
|
||
for (int j = std::max (i - 1, 0); j < std::min (i + 2, m.size2 ()); ++ j)
|
||
m (i, j) = 3 * i + j;
|
||
std::cout << m << std::endl;
|
||
}</pre>
|
||
|
||
<h4>Definition</h4>
|
||
|
||
<p>Defined in the header banded.hpp.</p>
|
||
|
||
<h4>Template parameters</h4>
|
||
|
||
<table border="1">
|
||
<tr>
|
||
<th>Parameter </th>
|
||
<th>Description </th>
|
||
<th>Default </th>
|
||
</tr>
|
||
<tr>
|
||
<td><code>T</code> </td>
|
||
<td>The type of object stored in the matrix.</td>
|
||
<td> </td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>F</code></td>
|
||
<td>Functor describing the storage organization. <a href="#banded_matrix_1">[1]</a></td>
|
||
<td><code>row_major</code></td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>A</code></td>
|
||
<td>The type of the adapted array. <a href="#banded_matrix_2">[2]</a></td>
|
||
<td><code>unbounded_array<T></code></td>
|
||
</tr>
|
||
</table>
|
||
|
||
<h4>Model of</h4>
|
||
|
||
<p><a href="container.htm#matrix">Matrix</a>. </p>
|
||
|
||
<h4>Type requirements</h4>
|
||
|
||
<p>None, except for those imposed by the requirements of <a
|
||
href="container.htm#matrix">Matrix</a>.</p>
|
||
|
||
<h4>Public base classes</h4>
|
||
|
||
<p><code>matrix_expression<banded_matrix<T, F, A> ></code>
|
||
</p>
|
||
|
||
<h4>Members</h4>
|
||
|
||
<table border="1">
|
||
<tr>
|
||
<th>Member </th>
|
||
<th>Description </th>
|
||
</tr>
|
||
<tr>
|
||
<td><code>banded_matrix ()</code> </td>
|
||
<td>Allocates an uninitialized <code>banded_matrix</code>
|
||
that holds zero rows of zero elements.</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>banded_matrix (size_type size1, size_type
|
||
size2, size_type lower = 0, size_type upper = 0)</code></td>
|
||
<td>Allocates an uninitialized <code>banded_matrix</code>
|
||
that holds <code>(lower + 1 + upper)</code> diagonals
|
||
around the main diagonal of a matrix with <code>size1</code>
|
||
rows of <code>size2</code> elements.</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>banded_matrix (const banded_matrix &m)</code></td>
|
||
<td>The copy constructor.</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>template<class AE><br>
|
||
banded_matrix (const matrix_expression<AE> &ae)</code></td>
|
||
<td>The extended copy constructor.</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>void resize (size_type size1, size_type size2,
|
||
size_type lower = 0, size_type upper = 0)</code></td>
|
||
<td>Reallocates a <code>banded_matrix </code>to hold <code>(lower
|
||
+ 1 + upper)</code> diagonals around the main diagonal of
|
||
a matrix with <code>size1</code> rows of <code>size2</code>
|
||
elements. The content of the <code>banded_matrix</code>
|
||
is not preserved.</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>size_type size1 () const</code></td>
|
||
<td>Returns the number of rows. </td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>size_type size2 () const</code></td>
|
||
<td>Returns the number of columns. </td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>size_type lower () const</code></td>
|
||
<td>Returns the number of diagonals below the main
|
||
diagonal. </td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>size_type upper () const</code></td>
|
||
<td>Returns the number of diagonals above the main
|
||
diagonal. </td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>const_reference operator () (size_type i,
|
||
size_type j) const</code></td>
|
||
<td>Returns a <code>const</code> reference of the <code>j</code>-th
|
||
element in the <code>i</code>-th row. </td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>reference operator () (size_type i, size_type
|
||
j)</code></td>
|
||
<td>Returns a reference of the <code>j</code>-th element
|
||
in the <code>i</code>-th row. </td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>banded_matrix &operator = (const
|
||
banded_matrix &m)</code></td>
|
||
<td>The assignment operator.</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>banded_matrix &assign_temporary
|
||
(banded_matrix &m)</code></td>
|
||
<td>Assigns a temporary. May change the banded matrix <code>m</code>.</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>template<class AE><br>
|
||
banded_matrix &operator = (const
|
||
matrix_expression<AE> &ae)</code></td>
|
||
<td>The extended assignment operator.</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>template<class AE><br>
|
||
banded_matrix &assign (const
|
||
matrix_expression<AE> &ae)</code></td>
|
||
<td>Assigns a matrix expression to the banded matrix.
|
||
Left and right hand side of the assignment should be
|
||
independent.</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>template<class AE><br>
|
||
banded_matrix &operator += (const
|
||
matrix_expression<AE> &ae)</code></td>
|
||
<td>A computed assignment operator. Adds the matrix
|
||
expression to the banded matrix.</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>template<class AE><br>
|
||
banded_matrix &plus_assign (const
|
||
matrix_expression<AE> &ae)</code></td>
|
||
<td>Adds a matrix expression to the banded matrix. Left
|
||
and right hand side of the assignment should be
|
||
independent.</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>template<class AE><br>
|
||
banded_matrix &operator -= (const
|
||
matrix_expression<AE> &ae)</code></td>
|
||
<td>A computed assignment operator. Subtracts the matrix
|
||
expression from the banded matrix.</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>template<class AE><br>
|
||
banded_matrix &minus_assign (const
|
||
matrix_expression<AE> &ae)</code></td>
|
||
<td>Subtracts a matrix expression from the banded matrix.
|
||
Left and right hand side of the assignment should be
|
||
independent.</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>template<class AT><br>
|
||
banded_matrix &operator *= (const AT &at)</code></td>
|
||
<td>A computed assignment operator. Multiplies the banded
|
||
matrix with a scalar.</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>template<class AT><br>
|
||
banded_matrix &operator /= (const AT &at)</code></td>
|
||
<td>A computed assignment operator. Divides the banded
|
||
matrix through a scalar.</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>void swap (banded_matrix &m)</code></td>
|
||
<td>Swaps the contents of the banded matrices. </td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>void insert (size_type i, size_type j,
|
||
const_reference t)</code></td>
|
||
<td>Inserts the value <code>t</code> at the <code>j</code>-th
|
||
element of the <code>i</code>-th row.</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>void erase (size_type i, size_type j)</code></td>
|
||
<td>Erases the value at the <code>j</code>-th elemenst of
|
||
the <code>i</code>-th row.</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>void clear ()</code></td>
|
||
<td>Clears the matrix.</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>const_iterator1 begin1 () const</code></td>
|
||
<td>Returns a <code>const_iterator1</code> pointing to
|
||
the beginning of the <code>banded_matrix</code>. </td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>const_iterator1 end1 () const</code></td>
|
||
<td>Returns a <code>const_iterator1</code> pointing to
|
||
the end of the <code>banded_matrix</code>. </td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>iterator1 begin1 () </code></td>
|
||
<td>Returns a <code>iterator1</code> pointing to the
|
||
beginning of the <code>banded_matrix</code>. </td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>iterator1 end1 () </code></td>
|
||
<td>Returns a <code>iterator1</code> pointing to the end
|
||
of the <code>banded_matrix</code>. </td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>const_iterator2 begin2 () const</code></td>
|
||
<td>Returns a <code>const_iterator2</code> pointing to
|
||
the beginning of the <code>banded_matrix</code>. </td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>const_iterator2 end2 () const</code></td>
|
||
<td>Returns a <code>const_iterator2</code> pointing to
|
||
the end of the <code>banded_matrix</code>. </td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>iterator2 begin2 () </code></td>
|
||
<td>Returns a <code>iterator2</code> pointing to the
|
||
beginning of the <code>banded_matrix</code>. </td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>iterator2 end2 () </code></td>
|
||
<td>Returns a <code>iterator2</code> pointing to the end
|
||
of the <code>banded_matrix</code>. </td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>const_reverse_iterator1 rbegin1 () const</code></td>
|
||
<td>Returns a <code>const_reverse_iterator1</code>
|
||
pointing to the beginning of the reversed <code>banded_matrix</code>.
|
||
</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>const_reverse_iterator1 rend1 () const</code></td>
|
||
<td>Returns a <code>const_reverse_iterator1</code>
|
||
pointing to the end of the reversed <code>banded_matrix</code>.
|
||
</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>reverse_iterator1 rbegin1 () </code></td>
|
||
<td>Returns a <code>reverse_iterator1</code> pointing to
|
||
the beginning of the reversed <code>banded_matrix</code>.
|
||
</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>reverse_iterator1 rend1 () </code></td>
|
||
<td>Returns a <code>reverse_iterator1</code> pointing to
|
||
the end of the reversed <code>banded_matrix</code>. </td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>const_reverse_iterator2 rbegin2 () const</code></td>
|
||
<td>Returns a <code>const_reverse_iterator2</code>
|
||
pointing to the beginning of the reversed <code>banded_matrix</code>.
|
||
</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>const_reverse_iterator2 rend2 () const</code></td>
|
||
<td>Returns a <code>const_reverse_iterator2</code>
|
||
pointing to the end of the reversed <code>banded_matrix</code>.
|
||
</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>reverse_iterator2 rbegin2 () </code></td>
|
||
<td>Returns a <code>reverse_iterator2</code> pointing to
|
||
the beginning of the reversed <code>banded_matrix</code>.
|
||
</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>reverse_iterator2 rend2 () </code></td>
|
||
<td>Returns a <code>reverse_iterator2</code> pointing to
|
||
the end of the reversed <code>banded_matrix</code>. </td>
|
||
</tr>
|
||
</table>
|
||
|
||
<h4>Notes</h4>
|
||
|
||
<p><a name="#banded_matrix_1">[1]</a> Supported parameters for the
|
||
storage organization are <code>row_major</code> and <code>column_major</code>.</p>
|
||
|
||
<p><a name="#banded_matrix_2">[2]</a> Supported parameters for the
|
||
adapted array are <code>unbounded_array<T></code>, <code>bounded_array<T></code>
|
||
and <code>std::vector<T></code>. </p>
|
||
|
||
<h4>Interface</h4>
|
||
|
||
<pre><code> // Array based banded matrix class
|
||
template<class T, class F, class A>
|
||
class banded_matrix:
|
||
public matrix_expression<banded_matrix<T, F, A> > {
|
||
public:
|
||
typedef std::size_t size_type;
|
||
typedef std::ptrdiff_t difference_type;
|
||
typedef T value_type;
|
||
typedef const T &const_reference;
|
||
typedef T &reference;
|
||
typedef const T *const_pointer;
|
||
typedef T *pointer;
|
||
typedef F functor_type;
|
||
typedef A array_type;
|
||
typedef const A const_array_type;
|
||
typedef const banded_matrix<T, F, A> const_self_type;
|
||
typedef banded_matrix<T, F, A> self_type;
|
||
typedef const matrix_const_reference<const_self_type> const_closure_type;
|
||
typedef matrix_reference<self_type> closure_type;
|
||
typedef packed_tag storage_category;
|
||
typedef typename F::orientation_category orientation_category;
|
||
|
||
// Construction and destruction
|
||
banded_matrix ();
|
||
banded_matrix (size_type size1, size_type size2, size_type lower = 0, size_type upper = 0);
|
||
banded_matrix (const banded_matrix &m);
|
||
template<class AE>
|
||
banded_matrix (const matrix_expression<AE> &ae, size_type lower = 0, size_type upper = 0);
|
||
|
||
// Accessors
|
||
size_type size1 () const;
|
||
size_type size2 () const;
|
||
size_type lower () const;
|
||
size_type upper () const;
|
||
const_array_type &data () const;
|
||
array_type &data ();
|
||
|
||
// Resizing
|
||
void resize (size_type size1, size_type size2, size_type lower = 0, size_type upper = 0);
|
||
|
||
// Element access
|
||
const_reference operator () (size_type i, size_type j) const;
|
||
reference operator () (size_type i, size_type j);
|
||
|
||
// Assignment
|
||
banded_matrix &operator = (const banded_matrix &m);
|
||
banded_matrix &assign_temporary (banded_matrix &m);
|
||
template<class AE>
|
||
banded_matrix &operator = (const matrix_expression<AE> &ae);
|
||
template<class AE>
|
||
banded_matrix &reset (const matrix_expression<AE> &ae);
|
||
template<class AE>
|
||
banded_matrix &assign (const matrix_expression<AE> &ae);
|
||
template<class AE>
|
||
banded_matrix& operator += (const matrix_expression<AE> &ae);
|
||
template<class AE>
|
||
banded_matrix &plus_assign (const matrix_expression<AE> &ae);
|
||
template<class AE>
|
||
banded_matrix& operator -= (const matrix_expression<AE> &ae);
|
||
template<class AE>
|
||
banded_matrix &minus_assign (const matrix_expression<AE> &ae);
|
||
template<class AT>
|
||
banded_matrix& operator *= (const AT &at);
|
||
template<class AT>
|
||
banded_matrix& operator /= (const AT &at);
|
||
|
||
// Swapping
|
||
void swap (banded_matrix &m);
|
||
friend void swap (banded_matrix &m1, banded_matrix &m2);
|
||
|
||
// Element insertion and erasure
|
||
void insert (size_type i, size_type j, const_reference t);
|
||
void erase (size_type i, size_type j);
|
||
void clear ();
|
||
|
||
class const_iterator1;
|
||
class iterator1;
|
||
class const_iterator2;
|
||
class iterator2;
|
||
typedef reverse_iterator_base1<const_iterator1> const_reverse_iterator1;
|
||
typedef reverse_iterator_base1<iterator1> reverse_iterator1;
|
||
typedef reverse_iterator_base2<const_iterator2> const_reverse_iterator2;
|
||
typedef reverse_iterator_base2<iterator2> reverse_iterator2;
|
||
|
||
// Element lookup
|
||
const_iterator1 find1 (int rank, size_type i, size_type j) const;
|
||
iterator1 find1 (int rank, size_type i, size_type j);
|
||
const_iterator2 find2 (int rank, size_type i, size_type j) const;
|
||
iterator2 find2 (int rank, size_type i, size_type j);
|
||
const_iterator1 find_first1 (int rank, size_type i, size_type j) const;
|
||
iterator1 find_first1 (int rank, size_type i, size_type j);
|
||
const_iterator1 find_last1 (int rank, size_type i, size_type j) const;
|
||
iterator1 find_last1 (int rank, size_type i, size_type j);
|
||
const_iterator2 find_first2 (int rank, size_type i, size_type j) const;
|
||
iterator2 find_first2 (int rank, size_type i, size_type j);
|
||
const_iterator2 find_last2 (int rank, size_type i, size_type j) const;
|
||
iterator2 find_last2 (int rank, size_type i, size_type j);
|
||
|
||
// Iterators simply are indices.
|
||
|
||
class const_iterator1:
|
||
public container_const_reference<banded_matrix>,
|
||
public random_access_iterator_base<const_iterator1, value_type> {
|
||
public:
|
||
typedef packed_random_access_iterator_tag iterator_category;
|
||
typedef typename banded_matrix::difference_type difference_type;
|
||
typedef typename banded_matrix::value_type value_type;
|
||
typedef typename banded_matrix::const_reference reference;
|
||
typedef typename banded_matrix::const_pointer pointer;
|
||
typedef const_iterator2 dual_iterator_type;
|
||
typedef const_reverse_iterator2 dual_reverse_iterator_type;
|
||
|
||
// Construction and destruction
|
||
const_iterator1 ();
|
||
const_iterator1 (const banded_matrix &m, size_type it1, size_type it2);
|
||
const_iterator1 (const iterator1 &it);
|
||
|
||
// Arithmetic
|
||
const_iterator1 &operator ++ ();
|
||
const_iterator1 &operator -- ();
|
||
const_iterator1 &operator += (difference_type n);
|
||
const_iterator1 &operator -= (difference_type n);
|
||
difference_type operator - (const const_iterator1 &it) const;
|
||
|
||
// Dereference
|
||
reference operator * () const;
|
||
|
||
const_iterator2 begin () const;
|
||
const_iterator2 end () const;
|
||
const_reverse_iterator2 rbegin () const;
|
||
const_reverse_iterator2 rend () const;
|
||
|
||
// Indices
|
||
size_type index1 () const;
|
||
size_type index2 () const;
|
||
|
||
// Assignment
|
||
const_iterator1 &operator = (const const_iterator1 &it);
|
||
|
||
// Comparison
|
||
bool operator == (const const_iterator1 &it) const;
|
||
bool operator < (const const_iterator1 &it) const;
|
||
};
|
||
|
||
const_iterator1 begin1 () const;
|
||
const_iterator1 end1 () const;
|
||
|
||
class iterator1:
|
||
public container_reference<banded_matrix>,
|
||
public random_access_iterator_base<iterator1, value_type> {
|
||
public:
|
||
typedef packed_random_access_iterator_tag iterator_category;
|
||
typedef typename banded_matrix::difference_type difference_type;
|
||
typedef typename banded_matrix::value_type value_type;
|
||
typedef typename banded_matrix::reference reference;
|
||
typedef typename banded_matrix::pointer pointer;
|
||
typedef iterator2 dual_iterator_type;
|
||
typedef reverse_iterator2 dual_reverse_iterator_type;
|
||
|
||
// Construction and destruction
|
||
iterator1 ();
|
||
iterator1 (banded_matrix &m, size_type it1, size_type it2);
|
||
|
||
// Arithmetic
|
||
iterator1 &operator ++ ();
|
||
iterator1 &operator -- ();
|
||
iterator1 &operator += (difference_type n);
|
||
iterator1 &operator -= (difference_type n);
|
||
difference_type operator - (const iterator1 &it) const;
|
||
|
||
// Dereference
|
||
reference operator * () const;
|
||
|
||
iterator2 begin () const;
|
||
iterator2 end () const;
|
||
reverse_iterator2 rbegin () const;
|
||
reverse_iterator2 rend () const;
|
||
|
||
// Indices
|
||
size_type index1 () const;
|
||
size_type index2 () const;
|
||
|
||
// Assignment
|
||
iterator1 &operator = (const iterator1 &it);
|
||
|
||
// Comparison
|
||
bool operator == (const iterator1 &it) const;
|
||
bool operator < (const iterator1 &it) const;
|
||
};
|
||
|
||
iterator1 begin1 ();
|
||
iterator1 end1 ();
|
||
|
||
class const_iterator2:
|
||
public container_const_reference<banded_matrix>,
|
||
public random_access_iterator_base<const_iterator2, value_type> {
|
||
public:
|
||
typedef packed_random_access_iterator_tag iterator_category;
|
||
typedef typename banded_matrix::difference_type difference_type;
|
||
typedef typename banded_matrix::value_type value_type;
|
||
typedef typename banded_matrix::const_reference reference;
|
||
typedef typename banded_matrix::const_pointer pointer;
|
||
typedef const_iterator1 dual_iterator_type;
|
||
typedef const_reverse_iterator1 dual_reverse_iterator_type;
|
||
|
||
// Construction and destruction
|
||
const_iterator2 ();
|
||
const_iterator2 (const banded_matrix &m, size_type it1, size_type it2);
|
||
const_iterator2 (const iterator2 &it);
|
||
|
||
// Arithmetic
|
||
const_iterator2 &operator ++ ();
|
||
const_iterator2 &operator -- ();
|
||
const_iterator2 &operator += (difference_type n);
|
||
const_iterator2 &operator -= (difference_type n);
|
||
difference_type operator - (const const_iterator2 &it) const;
|
||
|
||
// Dereference
|
||
reference operator * () const;
|
||
|
||
const_iterator1 begin () const;
|
||
const_iterator1 end () const;
|
||
const_reverse_iterator1 rbegin () const;
|
||
const_reverse_iterator1 rend () const;
|
||
|
||
// Indices
|
||
size_type index1 () const;
|
||
size_type index2 () const;
|
||
|
||
// Assignment
|
||
const_iterator2 &operator = (const const_iterator2 &it);
|
||
|
||
// Comparison
|
||
bool operator == (const const_iterator2 &it) const;
|
||
bool operator < (const const_iterator2 &it) const;
|
||
};
|
||
|
||
const_iterator2 begin2 () const;
|
||
const_iterator2 end2 () const;
|
||
|
||
class iterator2:
|
||
public container_reference<banded_matrix>,
|
||
public random_access_iterator_base<iterator2, value_type> {
|
||
public:
|
||
typedef packed_random_access_iterator_tag iterator_category;
|
||
typedef typename banded_matrix::difference_type difference_type;
|
||
typedef typename banded_matrix::value_type value_type;
|
||
typedef typename banded_matrix::reference reference;
|
||
typedef typename banded_matrix::pointer pointer;
|
||
typedef iterator1 dual_iterator_type;
|
||
typedef reverse_iterator1 dual_reverse_iterator_type;
|
||
|
||
// Construction and destruction
|
||
iterator2 ();
|
||
iterator2 (banded_matrix &m, size_type it1, size_type it2);
|
||
|
||
// Arithmetic
|
||
iterator2 &operator ++ ();
|
||
iterator2 &operator -- ();
|
||
iterator2 &operator += (difference_type n);
|
||
iterator2 &operator -= (difference_type n);
|
||
difference_type operator - (const iterator2 &it) const;
|
||
|
||
// Dereference
|
||
reference operator * () const;
|
||
|
||
iterator1 begin () const;
|
||
iterator1 end () const;
|
||
reverse_iterator1 rbegin () const;
|
||
reverse_iterator1 rend () const;
|
||
|
||
// Indices
|
||
size_type index1 () const;
|
||
size_type index2 () const;
|
||
|
||
// Assignment
|
||
iterator2 &operator = (const iterator2 &it);
|
||
|
||
// Comparison
|
||
bool operator == (const iterator2 &it) const;
|
||
bool operator < (const iterator2 &it) const;
|
||
};
|
||
|
||
iterator2 begin2 ();
|
||
iterator2 end2 ();
|
||
|
||
// Reverse iterators
|
||
|
||
const_reverse_iterator1 rbegin1 () const;
|
||
const_reverse_iterator1 rend1 () const;
|
||
|
||
reverse_iterator1 rbegin1 ();
|
||
reverse_iterator1 rend1 ();
|
||
|
||
const_reverse_iterator2 rbegin2 () const;
|
||
const_reverse_iterator2 rend2 () const;
|
||
|
||
reverse_iterator2 rbegin2 ();
|
||
reverse_iterator2 rend2 ();
|
||
};</code></pre>
|
||
|
||
<h2><a name="banded_adaptor"></a>Banded Adaptor</h2>
|
||
|
||
<h4>Description</h4>
|
||
|
||
<p>The templated class <code>banded_adaptor<M> </code>is a
|
||
banded matrix adaptor for other matrices.</p>
|
||
|
||
<h4>Example</h4>
|
||
|
||
<pre>int main () {
|
||
using namespace boost::numeric::ublas;
|
||
matrix<double> m (3, 3);
|
||
banded_adaptor<matrix<double> > ba (m, 1, 1);
|
||
for (int i = 0; i < ba.size1 (); ++ i)
|
||
for (int j = std::max (i - 1, 0); j < std::min (i + 2, ba.size2 ()); ++ j)
|
||
ba (i, j) = 3 * i + j;
|
||
std::cout << ba << std::endl;
|
||
}</pre>
|
||
|
||
<h4>Definition</h4>
|
||
|
||
<p>Defined in the header banded.hpp.</p>
|
||
|
||
<h4>Template parameters</h4>
|
||
|
||
<table border="1">
|
||
<tr>
|
||
<th>Parameter </th>
|
||
<th>Description </th>
|
||
<th>Default </th>
|
||
</tr>
|
||
<tr>
|
||
<td><code>M</code></td>
|
||
<td>The type of the adapted matrix.</td>
|
||
<td> </td>
|
||
</tr>
|
||
</table>
|
||
|
||
<h4>Model of</h4>
|
||
|
||
<p><a href="expression.htm#matrix_expression">Matrix Expression</a>.
|
||
</p>
|
||
|
||
<h4>Type requirements</h4>
|
||
|
||
<p>None, except for those imposed by the requirements of <a
|
||
href="expression.htm#matrix_expression">Matrix Expression</a>.</p>
|
||
|
||
<h4>Public base classes</h4>
|
||
|
||
<p><code>matrix_expression<banded_adaptor<M> ></code>
|
||
</p>
|
||
|
||
<h4>Members</h4>
|
||
|
||
<table border="1">
|
||
<tr>
|
||
<th>Member </th>
|
||
<th>Description </th>
|
||
</tr>
|
||
<tr>
|
||
<td><code>banded_adaptor ()</code> </td>
|
||
<td>Constructs a <code>banded_adaptor</code> that holds
|
||
zero rows of zero elements.</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>banded_adaptor (matrix_type &data,
|
||
size_type lower = 0, size_type upper = 0)</code></td>
|
||
<td>Constructs a <code>banded_adaptor</code> that holds <code>(lower
|
||
+ 1 + upper)</code> diagonals around the main diagonal of
|
||
a matrix.</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>banded_adaptor (const banded_adaptor &m)</code></td>
|
||
<td>The copy constructor.</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>template<class AE><br>
|
||
banded_adaptor (const matrix_expression<AE>
|
||
&ae)</code></td>
|
||
<td>The extended copy constructor.</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>size_type size1 () const</code></td>
|
||
<td>Returns the number of rows. </td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>size_type size2 () const</code></td>
|
||
<td>Returns the number of columns. </td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>size_type lower () const</code></td>
|
||
<td>Returns the number of diagonals below the main
|
||
diagonal. </td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>size_type upper () const</code></td>
|
||
<td>Returns the number of diagonals above the main
|
||
diagonal. </td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>const_reference operator () (size_type i,
|
||
size_type j) const</code></td>
|
||
<td>Returns a <code>const</code> reference of the <code>j</code>-th
|
||
element in the <code>i</code>-th row. </td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>reference operator () (size_type i, size_type
|
||
j)</code></td>
|
||
<td>Returns a reference of the <code>j</code>-th element
|
||
in the <code>i</code>-th row. </td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>banded_adaptor &operator = (const
|
||
banded_adaptor &m)</code></td>
|
||
<td>The assignment operator.</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>banded_adaptor &assign_temporary
|
||
(banded_adaptor &m)</code></td>
|
||
<td>Assigns a temporary. May change the banded adaptor <code>m</code>.</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>template<class AE><br>
|
||
banded_adaptor &operator = (const
|
||
matrix_expression<AE> &ae)</code></td>
|
||
<td>The extended assignment operator.</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>template<class AE><br>
|
||
banded_adaptor &assign (const
|
||
matrix_expression<AE> &ae)</code></td>
|
||
<td>Assigns a matrix expression to the banded adaptor.
|
||
Left and right hand side of the assignment should be
|
||
independent.</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>template<class AE><br>
|
||
banded_adaptor &operator += (const
|
||
matrix_expression<AE> &ae)</code></td>
|
||
<td>A computed assignment operator. Adds the matrix
|
||
expression to the banded adaptor.</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>template<class AE><br>
|
||
banded_adaptor &plus_assign (const
|
||
matrix_expression<AE> &ae)</code></td>
|
||
<td>Adds a matrix expression to the banded adaptor. Left
|
||
and right hand side of the assignment should be
|
||
independent.</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>template<class AE><br>
|
||
banded_adaptor &operator -= (const
|
||
matrix_expression<AE> &ae)</code></td>
|
||
<td>A computed assignment operator. Subtracts the matrix
|
||
expression from the banded adaptor.</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>template<class AE><br>
|
||
banded_adaptor &minus_assign (const
|
||
matrix_expression<AE> &ae)</code></td>
|
||
<td>Subtracts a matrix expression from the banded
|
||
adaptor. Left and right hand side of the assignment
|
||
should be independent.</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>template<class AT><br>
|
||
banded_adaptor &operator *= (const AT &at)</code></td>
|
||
<td>A computed assignment operator. Multiplies the banded
|
||
adaptor with a scalar.</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>template<class AT><br>
|
||
banded_adaptor &operator /= (const AT &at)</code></td>
|
||
<td>A computed assignment operator. Divides the banded
|
||
adaptor through a scalar.</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>void swap (banded_adaptor &m)</code></td>
|
||
<td>Swaps the contents of the banded adaptors. </td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>const_iterator1 begin1 () const</code></td>
|
||
<td>Returns a <code>const_iterator1</code> pointing to
|
||
the beginning of the <code>banded_adaptor</code>. </td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>const_iterator1 end1 () const</code></td>
|
||
<td>Returns a <code>const_iterator1</code> pointing to
|
||
the end of the <code>banded_adaptor</code>. </td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>iterator1 begin1 () </code></td>
|
||
<td>Returns a <code>iterator1</code> pointing to the
|
||
beginning of the <code>banded_adaptor</code>. </td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>iterator1 end1 () </code></td>
|
||
<td>Returns a <code>iterator1</code> pointing to the end
|
||
of the <code>banded_adaptor</code>. </td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>const_iterator2 begin2 () const</code></td>
|
||
<td>Returns a <code>const_iterator2</code> pointing to
|
||
the beginning of the <code>banded_adaptor</code>. </td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>const_iterator2 end2 () const</code></td>
|
||
<td>Returns a <code>const_iterator2</code> pointing to
|
||
the end of the <code>banded_adaptor</code>. </td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>iterator2 begin2 () </code></td>
|
||
<td>Returns a <code>iterator2</code> pointing to the
|
||
beginning of the <code>banded_adaptor</code>. </td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>iterator2 end2 () </code></td>
|
||
<td>Returns a <code>iterator2</code> pointing to the end
|
||
of the <code>banded_adaptor</code>. </td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>const_reverse_iterator1 rbegin1 () const</code></td>
|
||
<td>Returns a <code>const_reverse_iterator1</code>
|
||
pointing to the beginning of the reversed <code>banded_adaptor</code>.
|
||
</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>const_reverse_iterator1 rend1 () const</code></td>
|
||
<td>Returns a <code>const_reverse_iterator1</code>
|
||
pointing to the end of the reversed <code>banded_adaptor</code>.
|
||
</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>reverse_iterator1 rbegin1 () </code></td>
|
||
<td>Returns a <code>reverse_iterator1</code> pointing to
|
||
the beginning of the reversed <code>banded_adaptor</code>.
|
||
</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>reverse_iterator1 rend1 () </code></td>
|
||
<td>Returns a <code>reverse_iterator1</code> pointing to
|
||
the end of the reversed <code>banded_adaptor</code>. </td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>const_reverse_iterator2 rbegin2 () const</code></td>
|
||
<td>Returns a <code>const_reverse_iterator2</code>
|
||
pointing to the beginning of the reversed <code>banded_adaptor</code>.
|
||
</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>const_reverse_iterator2 rend2 () const</code></td>
|
||
<td>Returns a <code>const_reverse_iterator2</code>
|
||
pointing to the end of the reversed <code>banded_adaptor</code>.
|
||
</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>reverse_iterator2 rbegin2 () </code></td>
|
||
<td>Returns a <code>reverse_iterator2</code> pointing to
|
||
the beginning of the reversed <code>banded_adaptor</code>.
|
||
</td>
|
||
</tr>
|
||
<tr>
|
||
<td><code>reverse_iterator2 rend2 () </code></td>
|
||
<td>Returns a <code>reverse_iterator2</code> pointing to
|
||
the end of the reversed <code>banded_adaptor</code>. </td>
|
||
</tr>
|
||
</table>
|
||
|
||
<h4>Interface</h4>
|
||
|
||
<pre><code> // Banded matrix adaptor class
|
||
template<class M>
|
||
class banded_adaptor:
|
||
public matrix_expression<banded_adaptor<M> > {
|
||
public:
|
||
typedef const M const_matrix_type;
|
||
typedef M matrix_type;
|
||
typedef typename M::size_type size_type;
|
||
typedef typename M::difference_type difference_type;
|
||
typedef typename M::value_type value_type;
|
||
typedef typename M::const_reference const_reference;
|
||
typedef typename M::reference reference;
|
||
typedef typename M::const_pointer const_pointer;
|
||
typedef typename M::pointer pointer;
|
||
typedef const banded_adaptor<M> const_self_type;
|
||
typedef banded_adaptor<M> self_type;
|
||
typedef const matrix_const_reference<const_self_type> const_closure_type;
|
||
typedef matrix_reference<self_type> closure_type;
|
||
typedef typename storage_restrict_traits<typename M::storage_category,
|
||
packed_proxy_tag>::storage_category storage_category;
|
||
typedef typename M::orientation_category orientation_category;
|
||
|
||
// Construction and destruction
|
||
banded_adaptor ();
|
||
banded_adaptor (matrix_type &data, size_type lower = 0, size_type upper = 0);
|
||
banded_adaptor (const banded_adaptor &m);
|
||
|
||
// Accessors
|
||
size_type size1 () const;
|
||
size_type size2 () const;
|
||
size_type lower () const;
|
||
size_type upper () const;
|
||
const_matrix_type &data () const;
|
||
matrix_type &data ();
|
||
|
||
// Element access
|
||
const_reference operator () (size_type i, size_type j) const;
|
||
reference operator () (size_type i, size_type j);
|
||
|
||
// Assignment
|
||
banded_adaptor &operator = (const banded_adaptor &m);
|
||
banded_adaptor &assign_temporary (banded_adaptor &m);
|
||
template<class AE>
|
||
banded_adaptor &operator = (const matrix_expression<AE> &ae);
|
||
template<class AE>
|
||
banded_adaptor &assign (const matrix_expression<AE> &ae);
|
||
template<class AE>
|
||
banded_adaptor& operator += (const matrix_expression<AE> &ae);
|
||
template<class AE>
|
||
banded_adaptor &plus_assign (const matrix_expression<AE> &ae);
|
||
template<class AE>
|
||
banded_adaptor& operator -= (const matrix_expression<AE> &ae);
|
||
template<class AE>
|
||
banded_adaptor &minus_assign (const matrix_expression<AE> &ae);
|
||
template<class AT>
|
||
banded_adaptor& operator *= (const AT &at);
|
||
template<class AT>
|
||
banded_adaptor& operator /= (const AT &at);
|
||
|
||
// Swapping
|
||
void swap (banded_adaptor &m);
|
||
friend void swap (banded_adaptor &m1, banded_adaptor &m2);
|
||
|
||
class const_iterator1;
|
||
class iterator1;
|
||
class const_iterator2;
|
||
class iterator2;
|
||
typedef reverse_iterator_base1<const_iterator1> const_reverse_iterator1;
|
||
typedef reverse_iterator_base1<iterator1> reverse_iterator1;
|
||
typedef reverse_iterator_base2<const_iterator2> const_reverse_iterator2;
|
||
typedef reverse_iterator_base2<iterator2> reverse_iterator2;
|
||
|
||
// Element lookup
|
||
const_iterator1 find1 (int rank, size_type i, size_type j) const;
|
||
iterator1 find1 (int rank, size_type i, size_type j);
|
||
const_iterator2 find2 (int rank, size_type i, size_type j) const;
|
||
iterator2 find2 (int rank, size_type i, size_type j);
|
||
const_iterator1 find_first1 (int rank, size_type i, size_type j) const;
|
||
iterator1 find_first1 (int rank, size_type i, size_type j);
|
||
const_iterator1 find_last1 (int rank, size_type i, size_type j) const;
|
||
iterator1 find_last1 (int rank, size_type i, size_type j);
|
||
const_iterator2 find_first2 (int rank, size_type i, size_type j) const;
|
||
iterator2 find_first2 (int rank, size_type i, size_type j);
|
||
const_iterator2 find_last2 (int rank, size_type i, size_type j) const;
|
||
iterator2 find_last2 (int rank, size_type i, size_type j);
|
||
|
||
// Iterators simply are indices.
|
||
|
||
class const_iterator1:
|
||
public container_const_reference<banded_adaptor>,
|
||
public random_access_iterator_base<const_iterator1, value_type> {
|
||
public:
|
||
typedef packed_random_access_iterator_tag iterator_category;
|
||
typedef typename banded_adaptor::difference_type difference_type;
|
||
typedef typename banded_adaptor::value_type value_type;
|
||
typedef typename banded_adaptor::const_reference reference;
|
||
typedef typename banded_adaptor::const_pointer pointer;
|
||
typedef const_iterator2 dual_iterator_type;
|
||
typedef const_reverse_iterator2 dual_reverse_iterator_type;
|
||
|
||
// Construction and destruction
|
||
const_iterator1 ();
|
||
const_iterator1 (const banded_adaptor &m, size_type it1, size_type it2);
|
||
const_iterator1 (const iterator1 &it);
|
||
|
||
// Arithmetic
|
||
const_iterator1 &operator ++ ();
|
||
const_iterator1 &operator -- ();
|
||
const_iterator1 &operator += (difference_type n);
|
||
const_iterator1 &operator -= (difference_type n);
|
||
difference_type operator - (const const_iterator1 &it) const;
|
||
|
||
// Dereference
|
||
reference operator * () const;
|
||
|
||
const_iterator2 begin () const;
|
||
const_iterator2 end () const;
|
||
const_reverse_iterator2 rbegin () const;
|
||
const_reverse_iterator2 rend () const;
|
||
|
||
// Indices
|
||
size_type index1 () const;
|
||
size_type index2 () const;
|
||
|
||
// Assignment
|
||
const_iterator1 &operator = (const const_iterator1 &it);
|
||
|
||
// Comparison
|
||
bool operator == (const const_iterator1 &it) const;
|
||
bool operator < (const const_iterator1 &it) const;
|
||
};
|
||
|
||
const_iterator1 begin1 () const;
|
||
const_iterator1 end1 () const;
|
||
|
||
class iterator1:
|
||
public container_reference<banded_adaptor>,
|
||
public random_access_iterator_base<iterator1, value_type> {
|
||
public:
|
||
typedef packed_random_access_iterator_tag iterator_category;
|
||
typedef typename banded_adaptor::difference_type difference_type;
|
||
typedef typename banded_adaptor::value_type value_type;
|
||
typedef typename banded_adaptor::reference reference;
|
||
typedef typename banded_adaptor::pointer pointer;
|
||
typedef iterator2 dual_iterator_type;
|
||
typedef reverse_iterator2 dual_reverse_iterator_type;
|
||
|
||
// Construction and destruction
|
||
iterator1 ();
|
||
iterator1 (banded_adaptor &m, size_type it1, size_type it2);
|
||
|
||
// Arithmetic
|
||
iterator1 &operator ++ ();
|
||
iterator1 &operator -- ();
|
||
iterator1 &operator += (difference_type n);
|
||
iterator1 &operator -= (difference_type n);
|
||
difference_type operator - (const iterator1 &it) const;
|
||
|
||
// Dereference
|
||
reference operator * () const;
|
||
|
||
iterator2 begin () const;
|
||
iterator2 end () const;
|
||
reverse_iterator2 rbegin () const;
|
||
reverse_iterator2 rend () const;
|
||
|
||
// Indices
|
||
size_type index1 () const;
|
||
size_type index2 () const;
|
||
|
||
// Assignment
|
||
iterator1 &operator = (const iterator1 &it);
|
||
|
||
// Comparison
|
||
bool operator == (const iterator1 &it) const;
|
||
bool operator < (const iterator1 &it) const;
|
||
};
|
||
|
||
iterator1 begin1 ();
|
||
iterator1 end1 ();
|
||
|
||
class const_iterator2:
|
||
public container_const_reference<banded_adaptor>,
|
||
public random_access_iterator_base<const_iterator2, value_type> {
|
||
public:
|
||
typedef packed_random_access_iterator_tag iterator_category;
|
||
typedef typename banded_adaptor::difference_type difference_type;
|
||
typedef typename banded_adaptor::value_type value_type;
|
||
typedef typename banded_adaptor::const_reference reference;
|
||
typedef typename banded_adaptor::const_pointer pointer;
|
||
typedef const_iterator1 dual_iterator_type;
|
||
typedef const_reverse_iterator1 dual_reverse_iterator_type;
|
||
|
||
// Construction and destruction
|
||
const_iterator2 ();
|
||
const_iterator2 (const banded_adaptor &m, size_type it1, size_type it2);
|
||
const_iterator2 (const iterator2 &it);
|
||
|
||
// Arithmetic
|
||
const_iterator2 &operator ++ ();
|
||
const_iterator2 &operator -- ();
|
||
const_iterator2 &operator += (difference_type n);
|
||
const_iterator2 &operator -= (difference_type n);
|
||
difference_type operator - (const const_iterator2 &it) const;
|
||
|
||
// Dereference
|
||
reference operator * () const;
|
||
|
||
const_iterator1 begin () const;
|
||
const_iterator1 end () const;
|
||
const_reverse_iterator1 rbegin () const;
|
||
const_reverse_iterator1 rend () const;
|
||
|
||
// Indices
|
||
size_type index1 () const;
|
||
size_type index2 () const;
|
||
|
||
// Assignment
|
||
const_iterator2 &operator = (const const_iterator2 &it);
|
||
|
||
// Comparison
|
||
bool operator == (const const_iterator2 &it) const;
|
||
bool operator < (const const_iterator2 &it) const;
|
||
};
|
||
|
||
const_iterator2 begin2 () const;
|
||
const_iterator2 end2 () const;
|
||
|
||
class iterator2:
|
||
public container_reference<banded_adaptor>,
|
||
public random_access_iterator_base<iterator2, value_type> {
|
||
public:
|
||
typedef packed_random_access_iterator_tag iterator_category;
|
||
typedef typename banded_adaptor::difference_type difference_type;
|
||
typedef typename banded_adaptor::value_type value_type;
|
||
typedef typename banded_adaptor::reference reference;
|
||
typedef typename banded_adaptor::pointer pointer;
|
||
typedef iterator1 dual_iterator_type;
|
||
typedef reverse_iterator1 dual_reverse_iterator_type;
|
||
|
||
// Construction and destruction
|
||
iterator2 ();
|
||
iterator2 (banded_adaptor &m, size_type it1, size_type it2);
|
||
|
||
// Arithmetic
|
||
iterator2 &operator ++ ();
|
||
iterator2 &operator -- ();
|
||
iterator2 &operator += (difference_type n);
|
||
iterator2 &operator -= (difference_type n);
|
||
difference_type operator - (const iterator2 &it) const;
|
||
|
||
// Dereference
|
||
reference operator * () const;
|
||
|
||
iterator1 begin () const;
|
||
iterator1 end () const;
|
||
reverse_iterator1 rbegin () const;
|
||
reverse_iterator1 rend () const;
|
||
|
||
// Indices
|
||
size_type index1 () const;
|
||
size_type index2 () const;
|
||
|
||
// Assignment
|
||
iterator2 &operator = (const iterator2 &it);
|
||
|
||
// Comparison
|
||
bool operator == (const iterator2 &it) const;
|
||
bool operator < (const iterator2 &it) const;
|
||
};
|
||
|
||
iterator2 begin2 ();
|
||
iterator2 end2 ();
|
||
|
||
// Reverse iterators
|
||
|
||
const_reverse_iterator1 rbegin1 () const;
|
||
const_reverse_iterator1 rend1 () const;
|
||
|
||
reverse_iterator1 rbegin1 ();
|
||
reverse_iterator1 rend1 ();
|
||
|
||
const_reverse_iterator2 rbegin2 () const;
|
||
const_reverse_iterator2 rend2 () const;
|
||
|
||
reverse_iterator2 rbegin2 ();
|
||
reverse_iterator2 rend2 ();
|
||
};</code></pre>
|
||
|
||
<hr>
|
||
|
||
<p>Copyright (<28>) 2000-2002 Joerg Walter, Mathias Koch <br>
|
||
Permission to copy, use, modify, sell and distribute this
|
||
document is granted provided this copyright notice appears in all
|
||
copies. This document is provided ``as is'' without express or
|
||
implied warranty, and with no claim as to its suitability for any
|
||
purpose.</p>
|
||
|
||
<p>Last revised: 8/3/2002</p>
|
||
</body>
|
||
</html>
|