1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
|
/**
* @file: node_iter.h
* Declaration of iterators for node's adjacent edges traversal and related classes
*/
/*
* Graph library, internal representation of graphs in ShowGraph tool.
* Copyright (c) 2009, Boris Shurygin
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
*
* 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#pragma once
#ifndef NODE_ITER_H
#define NODE_ITER_H
/** Baseclass for implementing iterator template parameters */
class IterImplBase
{
public:
/** Get edge */
inline Edge* edge() const { return edge_p;}
/** Set edge */
inline void setEdge( Edge *e){ edge_p = e;}
/** Default constructor */
inline IterImplBase(): edge_p( NULL) {}
protected:
Edge *edge_p;
};
/** Parameter for iterator template specialization (pred traversal) */
class PredIterImpl: public IterImplBase
{
public:
inline void nextEdge(); /**< Move on to the next pred */
inline Node *node() const; /**< Get node */
inline PredIterImpl(){}; /**< Default constructor */
inline PredIterImpl( Node *n);/**< Configures iterator with node's first pred */
inline bool operator==(const PredIterImpl& o) const /**< Comparison operator */
{
return edge_p == o.edge_p;
}
};
/** Parameter for iterator template specialization (succ traversal) */
class SuccIterImpl: public IterImplBase
{
public:
inline void nextEdge(); /**< Move on to the next succ */
inline Node *node() const; /**< Get node */
inline SuccIterImpl(){}; /**< Default constructor */
inline SuccIterImpl( Node *n);/**< Configures iterator with node's first succ */
inline bool operator==(const SuccIterImpl& o) const /**< Comparison operator */
{
return edge_p == o.edge_p;
}
};
/** Parameter for iterator template specialization (undirected traversal) */
class UnDirIterImpl: public IterImplBase
{
public:
inline void nextEdge(); /**< Move on to the next edge */
inline Node *node() const; /**< Get node */
inline UnDirIterImpl():is_pred( false){}; /**< Default consturctor */
inline UnDirIterImpl( Node *n);/**< Configures iterator with node's first edge */
inline bool operator==(const UnDirIterImpl& o) const /**< Comparison operator */
{
return edge_p == o.edge_p
&& is_pred == o.is_pred;
}
private:
bool is_pred;
};
/**
* Convinience template for iterating through node's adjacent edges
*/
template < class EdgeIterImpl> class EdgeIterIface
{
public:
/** Default constructor */
inline EdgeIterIface();
/** Copy constructor */
inline EdgeIterIface( const EdgeIterIface& proto);
/** Destructor */
inline ~EdgeIterIface();
/** Preincrement operator */
inline EdgeIterIface & operator++();
/** Postincrement operator */
inline EdgeIterIface operator++( int);
/** Dereferenece operator*/
inline Edge * operator*();
/** Comparison operator */
inline bool operator==(const EdgeIterIface& o) const;
/** Not equals operator */
inline bool operator!=(const EdgeIterIface& o) const;
/** Get Edge */
inline Edge *edge() const;
/** Get node on the end of edge */
inline Node *node() const;
private:
/** Constructor from node */
inline EdgeIterIface( Node *e);
friend class Node;
/** Parameter-dependent implementation */
EdgeIterImpl impl;
};
#endif
|
