Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
D
dune-common
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Service Desk
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Core Modules
dune-common
Commits
09b91d86
Commit
09b91d86
authored
20 years ago
by
Oliver Sander
Browse files
Options
Downloads
Patches
Plain Diff
slightly better documentation
[[Imported from SVN: r1245]]
parent
4abfa65c
No related branches found
Branches containing commit
No related tags found
Tags containing commit
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
istl/bcrsmatrix.hh
+24
-17
24 additions, 17 deletions
istl/bcrsmatrix.hh
with
24 additions
and
17 deletions
istl/bcrsmatrix.hh
+
24
−
17
View file @
09b91d86
...
...
@@ -12,18 +12,20 @@
#include
"bvector.hh"
/*! \file
* \brief
???
* \brief
Implementation of the BCRSMatrix class
*/
namespace
Dune
{
/**
@defgroup ISTL Iterative Solvers Template Library
/**
@addtogroup ISTL
@{
*/
/**! implements a block compressed row storage scheme. The block
/** \brief A sparse block matrix with compressed row storage
Implements a block compressed row storage scheme. The block
type B can be any type implementing the matrix interface.
Different ways to build up a compressed row
...
...
@@ -104,7 +106,7 @@ namespace Dune {
// forward declaration
class
ConstIterator
;
//! Iterator access to rows
//! Iterator access to
matrix
rows
class
Iterator
{
public:
...
...
@@ -178,36 +180,38 @@ namespace Dune {
int
i
;
};
//!
begin
iterator
//!
Get
iterator
to first row
Iterator
begin
()
{
return
Iterator
(
r
,
0
);
}
//!
end
iterator
//!
Get
iterator
to one beyond last row
Iterator
end
()
{
return
Iterator
(
r
,
n
);
}
//!
begin iterator
//!
Get Iterator to last row
Iterator
rbegin
()
{
return
Iterator
(
r
,
n
-
1
);
}
//!
end i
terator
//!
Get I
terator
to one before first row
Iterator
rend
()
{
return
Iterator
(
r
,
-
1
);
}
//! rename the iterators for easier access
(no const iterators?)
//! rename the iterators for easier access
typedef
Iterator
RowIterator
;
/** \brief Iterator for the entries of each row */
typedef
typename
row_type
::
Iterator
ColIterator
;
//!
I
terator access to rows
//!
Const i
terator access to rows
class
ConstIterator
{
public:
...
...
@@ -285,32 +289,34 @@ namespace Dune {
int
i
;
};
//!
begin iterator
//!
Get const iterator to first row
ConstIterator
begin
()
const
{
return
ConstIterator
(
r
,
0
);
}
//!
end iterator
//!
Get const iterator to one beyond last row
ConstIterator
end
()
const
{
return
ConstIterator
(
r
,
n
);
}
//!
begin iterator
//!
Get const iterator to last row
ConstIterator
rbegin
()
const
{
return
ConstIterator
(
r
,
n
-
1
);
}
//!
end iterator
//!
Get const iterator to one before first row
ConstIterator
rend
()
const
{
return
ConstIterator
(
r
,
-
1
);
}
//! rename the iterator
s
for easier access
//! rename the
const row
iterator for easier access
typedef
ConstIterator
ConstRowIterator
;
//! Const iterator to the entries of a row
typedef
typename
row_type
::
ConstIterator
ConstColIterator
;
//===== constructors & resizers
...
...
@@ -578,6 +584,7 @@ namespace Dune {
return
*
this
;
}
//! Assignment from a scalar
BCRSMatrix
&
operator
=
(
const
field_type
&
k
)
{
for
(
int
i
=
0
;
i
<
n
;
i
++
)
r
[
i
]
=
k
;
...
...
@@ -897,7 +904,7 @@ namespace Dune {
return
*
this
;
}
//! vector space
multiplication with
scalar
//! vector space
division by
scalar
BCRSMatrix
&
operator
/=
(
const
field_type
&
k
)
{
if
(
nnz
>
0
)
...
...
@@ -1202,7 +1209,7 @@ namespace Dune {
//===== query
// return true
when
(i,j) is in pattern
//
!
return true
if
(i,j) is in pattern
bool
exists
(
int
i
,
int
j
)
const
{
#ifdef DUNE_ISTL_WITH_CHECKING
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment