table: simplify StrategyChoice iterator with Boost.Range
This commit also improves Doxygen in NameTree, Fib, and Pit enumeration.
refs #3738
Change-Id: Ibb56f958df4d1bc2564192d905cfc2e499a7875e
diff --git a/daemon/table/name-tree.hpp b/daemon/table/name-tree.hpp
index 5c31103..c4b8b27 100644
--- a/daemon/table/name-tree.hpp
+++ b/daemon/table/name-tree.hpp
@@ -174,7 +174,7 @@
* ...
* }
* \endcode
- * \note Iteration order is implementation-specific and is undefined.
+ * \note Iteration order is implementation-defined.
* \warning If a name tree entry whose name is a prefix of \p name is inserted
* during the enumeration, it may or may not be visited.
* If a name tree entry whose name is a prefix of \p name is deleted
@@ -197,7 +197,7 @@
* ...
* }
* \endcode
- * \note Iteration order is implementation-specific and is undefined.
+ * \note Iteration order is implementation-defined.
* \warning If a name tree entry is inserted or deleted during the enumeration,
* it may cause the enumeration to skip entries or visit some entries twice.
*/
@@ -217,7 +217,7 @@
* ...
* }
* \endcode
- * \note Iteration order is implementation-specific and is undefined.
+ * \note Iteration order is implementation-defined.
* \warning If a name tree entry under \p prefix is inserted or deleted during the enumeration,
* it may cause the enumeration to skip entries or visit some entries twice.
*/
@@ -225,7 +225,7 @@
partialEnumerate(const Name& prefix,
const EntrySubTreeSelector& entrySubTreeSelector = AnyEntrySubTree()) const;
- /** \return an iterator to enumerate all entries
+ /** \return an iterator to the beginning
* \sa fullEnumerate
*/
const_iterator
@@ -234,7 +234,8 @@
return fullEnumerate().begin();
}
- /** \return a past-the-end iterator
+ /** \return an iterator to the end
+ * \sa begin()
*/
const_iterator
end() const