diff options
| author | bkoz <bkoz@138bc75d-0d04-0410-961f-82ee72b054a4> | 2011-06-10 17:10:42 +0000 |
|---|---|---|
| committer | bkoz <bkoz@138bc75d-0d04-0410-961f-82ee72b054a4> | 2011-06-10 17:10:42 +0000 |
| commit | 3f2eba6f19a1edad1aaf47f80ed29f9a7a0d7c76 (patch) | |
| tree | 74446e56ccc71502be50a655826c2c14ac161381 /libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/pat_trie_.hpp | |
| parent | eae7682a77cf0722e7a0372407b1780e6c978eb0 (diff) | |
| download | gcc-3f2eba6f19a1edad1aaf47f80ed29f9a7a0d7c76.tar.gz | |
2011-06-10 Benjamin Kosnik <bkoz@redhat.com>
* include/ext/pb_ds/*: Doxygen markup redo.
* include/Makefile.am: Fold in constructors_destructor_fn_imps.hpp.
* include/Makefile.in: Regenerate.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@174917 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/pat_trie_.hpp')
| -rw-r--r-- | libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/pat_trie_.hpp | 17 |
1 files changed, 13 insertions, 4 deletions
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/pat_trie_.hpp b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/pat_trie_.hpp index 46bb016e25e..66272b3119e 100644 --- a/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/pat_trie_.hpp +++ b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/pat_trie_.hpp @@ -90,11 +90,12 @@ namespace __gnu_pbds /** * @brief PATRICIA trie. + * @ingroup branch-detail * - * This implementation loosely borrows ideas from: - * 1) Fast Mergeable Integer Maps, Okasaki, Gill 1998 - * 2) Ptset: Sets of integers implemented as Patricia trees, - * Jean-Christophe Filliatr, 2000 + * This implementation loosely borrows ideas from: + * 1) Fast Mergeable Integer Maps, Okasaki, Gill 1998 + * 2) Ptset: Sets of integers implemented as Patricia trees, + * Jean-Christophe Filliatr, 2000 */ template<typename Key, typename Mapped, typename Node_And_It_Traits, typename _Alloc> @@ -388,15 +389,23 @@ namespace __gnu_pbds inline const_reverse_iterator rend() const; + /// Returns a const node_iterator corresponding to the node at the + /// root of the tree. inline node_const_iterator node_begin() const; + /// Returns a node_iterator corresponding to the node at the + /// root of the tree. inline node_iterator node_begin(); + /// Returns a const node_iterator corresponding to a node just + /// after a leaf of the tree. inline node_const_iterator node_end() const; + /// Returns a node_iterator corresponding to a node just + /// after a leaf of the tree. inline node_iterator node_end(); |