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
a7376565
Commit
a7376565
authored
20 years ago
by
Peter Bastian
Browse files
Options
Downloads
Patches
Plain Diff
insert_after, insert_before mit Referenz als Argument
[[Imported from SVN: r661]]
parent
569ba607
No related branches found
No related tags found
No related merge requests found
Changes
2
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
common/dlist.cc
+4
-4
4 additions, 4 deletions
common/dlist.cc
common/dlist.hh
+12
-12
12 additions, 12 deletions
common/dlist.hh
with
16 additions
and
16 deletions
common/dlist.cc
+
4
−
4
View file @
a7376565
...
...
@@ -38,14 +38,14 @@ namespace Dune {
// Konstruktor
template
<
class
T
>
inline
DoubleLinkedList
<
T
>::
DoubleLinkedList
()
{
// ruft vorher Default_konstruktor fuer head, tail
{
// ruft vorher Default_konstruktor fuer head, tail
numelements
=
0
;
}
// Copy-Konstruktor
template
<
class
T
>
inline
DoubleLinkedList
<
T
>::
DoubleLinkedList
(
const
DoubleLinkedList
<
T
>&
l
)
{
// ruft vorher Default_konstruktor fuer head, tail
{
// ruft vorher Default_konstruktor fuer head, tail
numelements
=
0
;
// kopiere alle Elemente der Argumentliste
for
(
typename
DoubleLinkedList
<
T
>::
Iterator
i
=
l
.
begin
();
i
!=
l
.
end
();
i
++
)
...
...
@@ -83,7 +83,7 @@ namespace Dune {
template
<
class
T
>
inline
typename
DoubleLinkedList
<
T
>::
Iterator
DoubleLinkedList
<
T
>::
insert_after
(
Iterator
i
,
T
t
)
inline
typename
DoubleLinkedList
<
T
>::
Iterator
DoubleLinkedList
<
T
>::
insert_after
(
Iterator
i
,
T
&
t
)
{
// Teste Eingabe
if
(
i
.
p
==
0
&&
head
.
p
!=
0
)
{
std
::
cerr
<<
"wo einfuegen?"
<<
std
::
endl
;
return
end
();}
...
...
@@ -117,7 +117,7 @@ namespace Dune {
}
template
<
class
T
>
inline
typename
DoubleLinkedList
<
T
>::
Iterator
DoubleLinkedList
<
T
>::
insert_before
(
Iterator
i
,
T
t
)
inline
typename
DoubleLinkedList
<
T
>::
Iterator
DoubleLinkedList
<
T
>::
insert_before
(
Iterator
i
,
T
&
t
)
{
// Teste Eingabe
if
(
i
.
p
==
0
&&
head
.
p
!=
0
)
{
std
::
cerr
<<
"wo einfuegen?"
<<
std
::
endl
;
return
end
();}
...
...
This diff is collapsed.
Click to expand it.
common/dlist.hh
+
12
−
12
View file @
a7376565
...
...
@@ -11,17 +11,17 @@ namespace Dune {
public:
class
Iterator
{
// Iteratorklasse zum
private:
// Durchlaufen der Elemente des Containers
Element
*
p
;
// Iterator ist ein Zeiger auf ein Listenelement
Element
*
p
;
// Iterator ist ein Zeiger auf ein Listenelement
public:
Iterator
();
bool
operator
!=
(
Iterator
x
);
bool
operator
==
(
Iterator
x
);
Iterator
operator
++
();
// prefix Stroustrup p. 292
Iterator
operator
++
(
int
);
// postfix
Iterator
operator
--
();
// prefix
Iterator
operator
--
(
int
);
// postfix
Iterator
operator
++
();
// prefix Stroustrup p. 292
Iterator
operator
++
(
int
);
// postfix
Iterator
operator
--
();
// prefix
Iterator
operator
--
(
int
);
// postfix
T
&
operator
*
()
const
;
T
*
operator
->
()
const
;
// Stroustrup p. 289
T
*
operator
->
()
const
;
// Stroustrup p. 289
friend
class
DoubleLinkedList
<
T
>
;
}
;
Iterator
begin
()
const
;
...
...
@@ -34,16 +34,16 @@ namespace Dune {
~
DoubleLinkedList
();
DoubleLinkedList
<
T
>&
operator
=
(
const
DoubleLinkedList
<
T
>&
);
int
size
()
const
;
Iterator
insert_after
(
Iterator
i
,
T
t
);
Iterator
insert_before
(
Iterator
i
,
T
t
);
Iterator
insert_after
(
Iterator
i
,
T
&
t
);
Iterator
insert_before
(
Iterator
i
,
T
&
t
);
void
erase
(
Iterator
i
);
private
:
struct
Element
{
// Typ fuer das Listenelement
Element
*
next
;
// Nachfolger
Element
*
prev
;
// Vorgaenger
T
item
;
// Datum
Element
(
T
&
t
);
// setze next=prev=0
Element
*
next
;
// Nachfolger
Element
*
prev
;
// Vorgaenger
T
item
;
// Datum
Element
(
T
&
t
);
// setze next=prev=0
};
Iterator
head
;
// erstes Element der Liste
...
...
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