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
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
Timo Koch
dune-common
Commits
68083000
Commit
68083000
authored
20 years ago
by
Oliver Sander
Browse files
Options
Downloads
Patches
Plain Diff
Header für Hierarchical Iterator
[[Imported from SVN: r538]]
parent
55a3daf4
Branches
Branches containing commit
Tags
Tags containing commit
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
grid/uggrid/uggridhieriterator.hh
+91
-0
91 additions, 0 deletions
grid/uggrid/uggridhieriterator.hh
with
91 additions
and
0 deletions
grid/uggrid/uggridhieriterator.hh
0 → 100644
+
91
−
0
View file @
68083000
// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
// vi: set et ts=4 sw=2 sts=2:
#ifndef __DUNE_UGHIERITERATOR_HH__
#define __DUNE_UGHIERITERATOR_HH__
//**********************************************************************
//
// --UGGridHierarchicIterator
// --HierarchicIterator
/*!
Mesh entities of codimension 0 ("elements") allow to visit all entities of
codimension 0 obtained through nested, hierarchic refinement of the entity.
Iteration over this set of entities is provided by the HIerarchicIterator,
starting from a given entity.
This is redundant but important for memory efficient implementations of unstru
hierarchically refined meshes.
*/
template
<
int
dim
,
int
dimworld
>
class
UGGridHierarchicIterator
:
public
HierarchicIteratorDefault
<
dim
,
dimworld
,
UGCtype
,
UGGridHierarchicIterator
,
UGGridEntity
>
{
public:
#if 1
#if 0
//! the normal Constructor
UGGridHierarchicIterator(UGGrid<dim,dimworld> &grid,
ALBERT TRAVERSE_STACK *travStack, int actLevel, int maxLevel);
#endif
//! the default Constructor
UGGridHierarchicIterator
(
UGGrid
<
dim
,
dimworld
>
&
grid
,
int
actLevel
,
int
maxLevel
);
#else
//! the normal Constructor
UGGridHierarchicIterator
(
UGGrid
<
dim
,
dimworld
>
&
grid
,
ALBERT
TRAVERSE_STACK
*
travStack
,
int
travLevel
);
//! the default Constructor
UGGridHierarchicIterator
(
UGGrid
<
dim
,
dimworld
>
&
grid
);
#endif
//! prefix increment
UGGridHierarchicIterator
&
operator
++
();
//! postfix increment
UGGridHierarchicIterator
&
operator
++
(
int
i
);
//! equality
bool
operator
==
(
const
UGGridHierarchicIterator
&
i
)
const
;
//! inequality
bool
operator
!=
(
const
UGGridHierarchicIterator
&
i
)
const
;
//! dereferencing
UGGridEntity
<
0
,
dim
,
dimworld
>&
operator
*
();
//! arrow
UGGridEntity
<
0
,
dim
,
dimworld
>*
operator
->
();
private:
//! implement with virtual element
UGGridEntity
<
0
,
dim
,
dimworld
>
virtualEntity_
;
//! know the grid were im comming from
UGGrid
<
dim
,
dimworld
>
&
grid_
;
//! the actual Level of this Hierarichic Iterator
int
level_
;
//! max level to go down
//int maxlevel_;
#if 0
//! we need this for Albert traversal, and we need ManageTravStack, which
//! does count References when copied
ALBERT ManageTravStack manageStack_;
//! The nessesary things for Albert
ALBERT EL_INFO * recursiveTraverse(ALBERT TRAVERSE_STACK * stack);
#endif
//! make empty HierarchicIterator
void
makeIterator
();
};
#endif
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