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
|
.TH ACE_Map_Reverse_Iterator 3 "1 Dec 2001" "ACE" \" -*- nroff -*-
.ad l
.nh
.SH NAME
ACE_Map_Reverse_Iterator \- Reverse Iterator for the .
.SH SYNOPSIS
.br
.PP
\fC#include <Map_Manager.h>\fR
.PP
Inherits \fBACE_Map_Iterator_Base< EXT_ID,INT_ID,ACE_LOCK >\fR.
.PP
.SS Public Methods
.in +1c
.ti -1c
.RI "\fBACE_Map_Reverse_Iterator\fR (\fBACE_Map_Manager\fR <EXT_ID, INT_ID, ACE_LOCK> &mm, int pass_end = 0)"
.br
.ti -1c
.RI "int \fBadvance\fR (void)"
.br
.RI "\fIMove forward by one element in the set. Returns 0 when all the items in the set have been seen, else 1.\fR"
.ti -1c
.RI "void \fBdump\fR (void) const"
.br
.RI "\fIDump the state of an object.\fR"
.ti -1c
.RI "ACE_Map_Reverse_Iterator<EXT_ID, INT_ID, ACE_LOCK>& \fBoperator++\fR (void)"
.br
.RI "\fIPrefix reverse.\fR"
.ti -1c
.RI "ACE_Map_Reverse_Iterator<EXT_ID, INT_ID, ACE_LOCK> \fBoperator++\fR (int)"
.br
.RI "\fIPostfix reverse.\fR"
.ti -1c
.RI "ACE_Map_Reverse_Iterator<EXT_ID, INT_ID, ACE_LOCK>& \fBoperator--\fR (void)"
.br
.RI "\fIPrefix advance.\fR"
.ti -1c
.RI "ACE_Map_Reverse_Iterator<EXT_ID, INT_ID, ACE_LOCK> \fBoperator--\fR (int)"
.br
.RI "\fIPostfix advance.\fR"
.in -1c
.SS Public Attributes
.in +1c
.ti -1c
.RI "\fBACE_ALLOC_HOOK_DECLARE\fR"
.br
.RI "\fIDeclare the dynamic allocation hooks.\fR"
.in -1c
.SH DETAILED DESCRIPTION
.PP
.SS template<class EXT_ID, class INT_ID, class ACE_LOCK> template class ACE_Map_Reverse_Iterator
Reverse Iterator for the .
.PP
.PP
This class does not perform any internal locking of the it is iterating upon since locking is inherently inefficient and/or error-prone within an STL-style iterator. If you require locking, you can explicitly use an or on the 's internal lock, which is accessible via its <mutex> method.
.PP
.SH CONSTRUCTOR & DESTRUCTOR DOCUMENTATION
.PP
.SS template<classEXT_ID, classINT_ID, classACE_LOCK> ACE_Map_Reverse_Iterator<EXT_ID, INT_ID, ACE_LOCK>::ACE_Map_Reverse_Iterator<EXT_ID, INT_ID, ACE_LOCK> (\fBACE_Map_Manager\fR< EXT_ID,INT_ID,ACE_LOCK >& mm, int pass_end = 0)
.PP
.SH MEMBER FUNCTION DOCUMENTATION
.PP
.SS template<classEXT_ID, classINT_ID, classACE_LOCK> int ACE_Map_Reverse_Iterator<EXT_ID, INT_ID, ACE_LOCK>::advance (void)
.PP
Move forward by one element in the set. Returns 0 when all the items in the set have been seen, else 1.
.PP
.SS template<classEXT_ID, classINT_ID, classACE_LOCK> void ACE_Map_Reverse_Iterator<EXT_ID, INT_ID, ACE_LOCK>::dump (void) const
.PP
Dump the state of an object.
.PP
.SS template<classEXT_ID, classINT_ID, classACE_LOCK> ACE_Map_Reverse_Iterator< EXT_ID,INT_ID,ACE_LOCK > ACE_Map_Reverse_Iterator<EXT_ID, INT_ID, ACE_LOCK>::operator++ (int)
.PP
Postfix reverse.
.PP
.SS template<classEXT_ID, classINT_ID, classACE_LOCK> ACE_Map_Reverse_Iterator< EXT_ID,INT_ID,ACE_LOCK >& ACE_Map_Reverse_Iterator<EXT_ID, INT_ID, ACE_LOCK>::operator++ (void)
.PP
Prefix reverse.
.PP
.SS template<classEXT_ID, classINT_ID, classACE_LOCK> ACE_Map_Reverse_Iterator< EXT_ID,INT_ID,ACE_LOCK > ACE_Map_Reverse_Iterator<EXT_ID, INT_ID, ACE_LOCK>::operator-- (int)
.PP
Postfix advance.
.PP
.SS template<classEXT_ID, classINT_ID, classACE_LOCK> ACE_Map_Reverse_Iterator< EXT_ID,INT_ID,ACE_LOCK >& ACE_Map_Reverse_Iterator<EXT_ID, INT_ID, ACE_LOCK>::operator-- (void)
.PP
Prefix advance.
.PP
.SH MEMBER DATA DOCUMENTATION
.PP
.SS template<classEXT_ID, classINT_ID, classACE_LOCK> ACE_Map_Reverse_Iterator<EXT_ID, INT_ID, ACE_LOCK>::ACE_ALLOC_HOOK_DECLARE
.PP
Declare the dynamic allocation hooks.
.PP
Reimplemented from \fBACE_Map_Iterator_Base\fR.
.SH AUTHOR
.PP
Generated automatically by Doxygen for ACE from the source code.
|
