---
name: "ACE_Hash_Map_Reverse_Iterator_Ex"
section: "3"
platform: "linux"
package: "libace-doc"
version: "5.0.7-4"
release: "Debian 2.2 (Potato)"
platforms: ["linux"]
url: "https://new.carta.tech/ACE_Hash_Map_Reverse_Iterator_Ex"
---

# ACE\_Hash\_Map\_Reverse\_Iterator\_Ex(3)

Reverse iterator for the ACE\_Hash\_Map\_Manager\_Ex.

## NAME

ACE\_Hash\_Map\_Reverse\_Iterator\_Ex -  Reverse iterator for the ACE\_Hash\_Map\_Manager\_Ex.

## SYNOPSIS

```
#include <ace/Hash_Map_Manager_T.h>
template<class EXT_ID, class INT_ID, class HASH_KEY, class COMPARE_KEYS, class ACE_LOCK>
class ACE_Hash_Map_Reverse_Iterator_Ex :
  public ACE_Hash_Map_Iterator_Base_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK>
{
  public:
    ACE_Hash_Map_Reverse_Iterator_Ex (
        ACE_Hash_Map_Manager_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> &mm,
        int head = 0
        );
    int advance (void);
    void dump (void) const;
    ACE_Hash_Map_Reverse_Iterator_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> &operator++ (
        void
        );
    ACE_Hash_Map_Reverse_Iterator_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> operator++ (
        int
        );
    ACE_Hash_Map_Reverse_Iterator_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> &operator-- (
        void
        );
    ACE_Hash_Map_Reverse_Iterator_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> operator-- (
        int
        );
    ACE_ALLOC_HOOK_DECLARE;
};
```

## DESCRIPTION

This class does not perform any internal locking of the ACE\_Hash\_Map\_Manager\_Ex 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 ACE\_Guard or ACE\_Read\_Guard on the ACE\_Hash\_Map\_Manager\_Ex's internal lock, which is accessible via its mutex method.

## Initialization method.

```
ACE_Hash_Map_Reverse_Iterator_Ex (
    ACE_Hash_Map_Manager_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> &mm,
    int head = 0
    );
```

```
int advance (void);
```

Move forward by one element in the set.  Returns 0 when all the items in the set have been seen, else 1.

```
void dump (void) const;
```

Dump the state of an object.

## STL styled iteration, compare, and reference functions.

```
ACE_Hash_Map_Reverse_Iterator_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> &operator++ (
    void
    );
```

Prefix reverse.

```
ACE_Hash_Map_Reverse_Iterator_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> operator++ (
    int
    );
```

Postfix reverse.

```
ACE_Hash_Map_Reverse_Iterator_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> &operator-- (
    void
    );
```

Prefix advance.

```
ACE_Hash_Map_Reverse_Iterator_Ex<EXT_ID, INT_ID, HASH_KEY, COMPARE_KEYS, ACE_LOCK> operator-- (
    int
    );
```

Postfix advance.

```
ACE_ALLOC_HOOK_DECLARE;
```

Declare the dynamic allocation hooks.

## AUTHOR

Doug Schmidt

## LIBRARY

ace