csRedBlackTree< K, Allocator, Ordering >::ConstReverseIterator Class Reference (Crystal Space 2.0 Public API Reference)

| ## Public API Reference

- Main Page
- Related Pages
- Modules
- Namespaces
- Classes
- Files

- Class List
- Class Index
- Class Hierarchy
- Class Members

Public Member Functions | Friends
csRedBlackTree< K, Allocator, Ordering >::ConstReverseIterator Class Reference

Const reverse iterator for tree. More...

`#include <csutil/redblacktree.h>`

List of all members.

## Public Member Functions
bool | HasNext () const
| Returns a boolean indicating whether or not the tree has more elements.
const K & | Next ()
| Get the next element's value.
## Friends
class | csRedBlackTree

## Detailed Description

### template<typename K, typename Allocator = CS::Container::DefaultRedBlackTreeAllocator<K>, template< typename K, typename K2 > class Ordering = CS::Container::RedBlackTreeOrderingTotal>
class csRedBlackTree< K, Allocator, Ordering >::ConstReverseIterator

Const reverse iterator for tree.

Definition at line 929 of file redblacktree.h.

## Member Function Documentation

template<typename K, typename Allocator = CS::Container::DefaultRedBlackTreeAllocator<K>, template< typename K, typename K2 > class Ordering = CS::Container::RedBlackTreeOrderingTotal>

bool csRedBlackTree< K, Allocator, Ordering >::ConstReverseIterator::HasNext | ( |  | ) | const`[inline]`

Returns a boolean indicating whether or not the tree has more elements.

Definition at line 933 of file redblacktree.h.

template<typename K, typename Allocator = CS::Container::DefaultRedBlackTreeAllocator<K>, template< typename K, typename K2 > class Ordering = CS::Container::RedBlackTreeOrderingTotal>

const K& csRedBlackTree< K, Allocator, Ordering >::ConstReverseIterator::Next | ( |  | ) | `[inline]`

Get the next element's value.

Definition at line 939 of file redblacktree.h.

The documentation for this class was generated from the following file:

- csutil/redblacktree.h