Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
D
dune-istl
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Model registry
Operate
Environments
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
Patrick Jaap
dune-istl
Commits
20fd8e4d
Commit
20fd8e4d
authored
9 years ago
by
Oliver Sander
Browse files
Options
Downloads
Patches
Plain Diff
[bugfix] Fix minor errors and omissions in the documentation
parent
a6f130c0
No related branches found
Branches containing commit
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
dune/istl/bcrsmatrix.hh
+10
-5
10 additions, 5 deletions
dune/istl/bcrsmatrix.hh
with
10 additions
and
5 deletions
dune/istl/bcrsmatrix.hh
+
10
−
5
View file @
20fd8e4d
...
...
@@ -472,12 +472,12 @@ namespace Dune {
*
* For general finite element implementations the number of rows n
* is known, the number of non-zeroes might also be known (e.g.
* \#edges + \#nodes for P
1
) but the size of a row and the indices of a row
* can
not be defined in sequential order.
* \#edges + \#nodes for P
2
) but the size of a row and the indices of a row
* cannot be defined in sequential order.
*/
random
,
/**
* @brief Build entries randomly with an educated guess
on
entries per row.
* @brief Build entries randomly with an educated guess
for the number of
entries per row.
*
* Allows random order generation as in random mode, but row sizes do not need
* to be given first. Instead an average number of non-zeroes per row is passed
...
...
@@ -1015,7 +1015,7 @@ namespace Dune {
return
(
i
==
it
.
i
)
&&
(
&
Mat
==&
it
.
Mat
);
}
//!
dereferencing
//!
The number of the row that the iterator currently points to
size_type
index
()
const
{
return
i
;
...
...
@@ -1069,7 +1069,12 @@ namespace Dune {
//===== random creation interface
//! set number of indices in row i to s
/** \brief Set number of indices in row i to s
*
* The number s may actually be larger than the true number of nonzero entries in row i. In that
* case, the extra memory goes wasted. You will receive run-time warnings about this, sent to
* the Dune::dwarn stream.
*/
void
setrowsize
(
size_type
i
,
size_type
s
)
{
if
(
build_mode
!=
random
)
...
...
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