summary |
shortlog |
changelog |
graph |
tags |
bookmarks |
branches |
files |
changeset |
file |
latest |
revisions |
annotate |
diff |
comparison |
raw |
help

doc/groups.dox

branch | 1.0 |

changeset 330 | d3a7603026a2 |

parent 329 | 2592532ee838 |

parent 318 | 1e2d6ca80793 |

child 1078 | c59bdcc8e33e |

equal
deleted
inserted
replaced

14:fa1ee8339949 | 15:5a57ba6030ce |
---|---|

133 */ |
133 */ |

134 |
134 |

135 /** |
135 /** |

136 @defgroup paths Path Structures |
136 @defgroup paths Path Structures |

137 @ingroup datas |
137 @ingroup datas |

138 \brief Path structures implemented in LEMON. |
138 \brief %Path structures implemented in LEMON. |

139 |
139 |

140 This group describes the path structures implemented in LEMON. |
140 This group describes the path structures implemented in LEMON. |

141 |
141 |

142 LEMON provides flexible data structures to work with paths. |
142 LEMON provides flexible data structures to work with paths. |

143 All of them have similar interfaces and they can be copied easily with |
143 All of them have similar interfaces and they can be copied easily with |

268 This group describes the data/algorithm skeletons and concept checking |
268 This group describes the data/algorithm skeletons and concept checking |

269 classes implemented in LEMON. |
269 classes implemented in LEMON. |

270 |
270 |

271 The purpose of the classes in this group is fourfold. |
271 The purpose of the classes in this group is fourfold. |

272 |
272 |

273 - These classes contain the documentations of the concepts. In order |
273 - These classes contain the documentations of the %concepts. In order |

274 to avoid document multiplications, an implementation of a concept |
274 to avoid document multiplications, an implementation of a concept |

275 simply refers to the corresponding concept class. |
275 simply refers to the corresponding concept class. |

276 |
276 |

277 - These classes declare every functions, <tt>typedef</tt>s etc. an |
277 - These classes declare every functions, <tt>typedef</tt>s etc. an |

278 implementation of the concepts should provide, however completely |
278 implementation of the %concepts should provide, however completely |

279 without implementations and real data structures behind the |
279 without implementations and real data structures behind the |

280 interface. On the other hand they should provide nothing else. All |
280 interface. On the other hand they should provide nothing else. All |

281 the algorithms working on a data structure meeting a certain concept |
281 the algorithms working on a data structure meeting a certain concept |

282 should compile with these classes. (Though it will not run properly, |
282 should compile with these classes. (Though it will not run properly, |

283 of course.) In this way it is easily to check if an algorithm |
283 of course.) In this way it is easily to check if an algorithm |