Changeset 1996:5dc13b93f8b4 in lemon-0.x
- Timestamp:
- 03/03/06 13:35:32 (18 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2601
- Files:
-
- 10 edited
-
doc/groups.dox (modified) (1 diff)
-
lemon/bits/alteration_notifier.h (modified) (2 diffs)
-
lemon/bits/array_map.h (modified) (4 diffs)
-
lemon/bits/default_map.h (modified) (1 diff)
-
lemon/bits/edge_set_extender.h (modified) (3 diffs)
-
lemon/bits/graph_adaptor_extender.h (modified) (2 diffs)
-
lemon/bits/graph_extender.h (modified) (7 diffs)
-
lemon/bits/map_extender.h (modified) (1 diff)
-
lemon/bits/traits.h (modified) (1 diff)
-
lemon/bits/vector_map.h (modified) (2 diffs)
Legend:
- Unmodified
- Added
- Removed
-
doc/groups.dox
r1914 r1996 92 92 93 93 /** 94 @defgroup graph mapfactory Tools to Make It Easier to Make Graph Maps94 @defgroup graphbits Tools to Make It Easier to Make Graphs 95 95 @ingroup auxdat 96 \brief Tools to Make It Easier to Make Graph Maps.97 98 This group describes the tools that makes it easier to make graph maps that99 dynamically update with the graph changes.96 \brief Tools to Make It Easier to Make Graphs. 97 98 This group describes the tools that makes it easier to make graphs and 99 the maps that dynamically update with the graph changes. 100 100 */ 101 101 -
lemon/bits/alteration_notifier.h
r1989 r1996 23 23 #include <algorithm> 24 24 25 ///\ingroup graph mapfactory25 ///\ingroup graphbits 26 26 ///\file 27 27 ///\brief Observer registry for graph alteration observers. … … 29 29 namespace lemon { 30 30 31 /// \addtogroup graph mapfactory31 /// \addtogroup graphbits 32 32 /// @{ 33 33 -
lemon/bits/array_map.h
r1956 r1996 17 17 */ 18 18 19 #ifndef LEMON_ ARRAY_MAP_H20 #define LEMON_ ARRAY_MAP_H19 #ifndef LEMON_BITS_ARRAY_MAP_H 20 #define LEMON_BITS_ARRAY_MAP_H 21 21 22 22 #include <memory> … … 26 26 #include <lemon/concept/maps.h> 27 27 28 /// \ingroup graph mapfactory28 /// \ingroup graphbits 29 29 /// \file 30 30 /// \brief Graph maps that construct and destruct … … 33 33 namespace lemon { 34 34 35 /// \ingroup graph mapfactory35 /// \ingroup graphbits 36 36 /// 37 37 /// \brief Graph map based on the array storage. … … 305 305 } 306 306 307 #endif //LEMON_ARRAY_MAP_H307 #endif -
lemon/bits/default_map.h
r1979 r1996 25 25 #include <lemon/bits/static_map.h> 26 26 27 ///\ingroup graph mapfactory27 ///\ingroup graphbits 28 28 ///\file 29 29 ///\brief Graph maps that construct and destruct -
lemon/bits/edge_set_extender.h
r1991 r1996 17 17 */ 18 18 19 19 #ifndef LEMON_BITS_EDGE_SET_EXTENDER_H 20 #define LEMON_BITS_EDGE_SET_EXTENDER_H 21 22 #include <lemon/bits/invalid.h> 23 #include <lemon/error.h> 24 25 #include <lemon/bits/default_map.h> 26 27 ///\ingroup graphbits 28 ///\file 29 ///\brief Extenders for the edge set types 20 30 namespace lemon { 21 31 32 /// \ingroup graphbits 33 /// 34 /// \brief Extender for the EdgeSets 22 35 template <typename Base> 23 36 class EdgeSetExtender : public Base { … … 260 273 261 274 275 /// \ingroup graphbits 276 /// 277 /// \brief Extender for the UEdgeSets 262 278 template <typename Base> 263 279 class UEdgeSetExtender : public Base { … … 608 624 609 625 }; 626 610 627 } 628 629 #endif -
lemon/bits/graph_adaptor_extender.h
r1979 r1996 17 17 */ 18 18 19 #ifndef LEMON_GRAPH_ADAPTOR_EXTENDER_H 20 #define LEMON_GRAPH_ADAPTOR_EXTENDER_H 21 22 19 #ifndef LEMON_BITS_GRAPH_ADAPTOR_EXTENDER_H 20 #define LEMON_BITS_GRAPH_ADAPTOR_EXTENDER_H 21 22 #include <lemon/bits/invalid.h> 23 #include <lemon/error.h> 24 25 #include <lemon/bits/default_map.h> 26 27 28 ///\ingroup graphbits 29 ///\file 30 ///\brief Extenders for the graph adaptor types 23 31 namespace lemon { 24 32 33 /// \ingroup graphbits 34 /// 35 /// \brief Extender for the GraphAdaptors 25 36 template <typename Base> 26 37 class GraphAdaptorExtender : public Base { … … 184 195 185 196 197 /// \ingroup graphbits 198 /// 199 /// \brief Extender for the UGraphAdaptors 186 200 template <typename Base> 187 201 class UGraphAdaptorExtender : public Base { -
lemon/bits/graph_extender.h
r1993 r1996 17 17 */ 18 18 19 #ifndef LEMON_ GRAPH_EXTENDER_H20 #define LEMON_ GRAPH_EXTENDER_H19 #ifndef LEMON_BITS_GRAPH_EXTENDER_H 20 #define LEMON_BITS_GRAPH_EXTENDER_H 21 21 22 22 #include <lemon/bits/invalid.h> … … 25 25 #include <lemon/bits/default_map.h> 26 26 27 ///\ingroup graphbits 28 ///\file 29 ///\brief Extenders for the graph types 27 30 namespace lemon { 28 31 32 /// \ingroup graphbits 33 /// 34 /// \brief Extender for the Graphs 29 35 template <typename Base> 30 36 class GraphExtender : public Base { … … 321 327 }; 322 328 329 /// \ingroup graphbits 330 /// 331 /// \brief BaseExtender for the UGraphs 323 332 template <typename Base> 324 333 class UGraphBaseExtender : public Base { … … 561 570 562 571 572 /// \ingroup graphbits 573 /// 574 /// \brief Extender for the UGraphs 563 575 template <typename Base> 564 576 class UGraphExtender : public Base { … … 979 991 980 992 993 /// \ingroup graphbits 994 /// 995 /// \brief BaseExtender for the BpUGraphs 981 996 template <typename Base> 982 997 class BpUGraphBaseExtender : public Base { … … 1168 1183 }; 1169 1184 1185 /// \ingroup graphbits 1186 /// 1187 /// \brief Extender for the BpUGraphs 1170 1188 template <typename Base> 1171 1189 class BpUGraphExtender : public Base { … … 1797 1815 } 1798 1816 1799 #endif // LEMON_UNDIR_GRAPH_EXTENDER_H1817 #endif -
lemon/bits/map_extender.h
r1993 r1996 29 29 namespace lemon { 30 30 31 /// \ingroup graphbits 31 32 template <typename _Map> 32 33 class IterableMapExtender : public _Map { -
lemon/bits/traits.h
r1993 r1996 298 298 } 299 299 300 #endif // LEMON_MAPS_H300 #endif -
lemon/bits/vector_map.h
r1993 r1996 29 29 #include <lemon/concept/maps.h> 30 30 31 /// \ingroup graph mapfactory31 /// \ingroup graphbits 32 32 /// 33 33 ///\file … … 36 36 namespace lemon { 37 37 38 /// \ingroup graph mapfactory38 /// \ingroup graphbits 39 39 /// 40 40 /// \brief Graph map based on the std::vector storage.
Note: See TracChangeset
for help on using the changeset viewer.
