---
name: "ACE_Unbounded_Stack_Iterator"
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_Unbounded_Stack_Iterator"
---

# ACE\_Unbounded\_Stack\_Iterator(3)

Implement an iterator over an unbounded Stack.

## NAME

ACE\_Unbounded\_Stack\_Iterator -  Implement an iterator over an unbounded Stack.

## SYNOPSIS

```
#include <ace/Containers.h>
template<class T>
class ACE_Unbounded_Stack_Iterator
{
  public:
    ACE_Unbounded_Stack_Iterator (ACE_Unbounded_Stack<T> &stack);
    int next (T *&next_item);
    int advance (void);
    int first (void);
    int done (void) const;
    void dump (void) const;
    ACE_ALLOC_HOOK_DECLARE;
  private:
    ACE_Node<T> *current_;
    ACE_Unbounded_Stack<T> &stack_;
};
```

## DESCRIPTION

This implementation of an unordered set uses a fixed array. This implementation does not allow duplicates...

## Initialization method.

```
ACE_Unbounded_Stack_Iterator (ACE_Unbounded_Stack<T> &stack);
```

Move to the first element in the stack.

## Iteration methods.

```
int next (T *&next_item);
```

Pass back the next\_item that hasn't been seen in the Stack. Returns 0 when all items have been seen, else 1.

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

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

```
int first (void);
```

Move to the first element in the Stack.  Returns 0 if the Stack is empty, else 1.

```
int done (void) const;
```

Returns 1 when all items have been seen, else 0.

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

Dump the state of an object.

```
ACE_ALLOC_HOOK_DECLARE;
```

Declare the dynamic allocation hooks.

## AUTHOR

Doug Schmidt

## Initialization and termination methods.

## Check boundary conditions.

## Classic unordered set operations.

## LIBRARY

ace