Detailed Description

template<typename Key, typename Value, typename KeyOfValue, typename Compare = std::less<Key>, typename Traits = btree_default_traits<Key, Value>, bool Duplicates = false, typename Allocator = std::allocator<Value>>
class tlx::BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::const_reverse_iterator

STL-like read-only reverse iterator object for B+ tree items. The iterator points to a specific slot number in a leaf.

Definition at line 853 of file btree.hpp.

Collaboration diagram for BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::const_reverse_iterator:

#include <btree.hpp>

Public Types
typedef ptrdiff_t	difference_type
	STL-magic. More...

typedef std::bidirectional_iterator_tag	iterator_category
	STL-magic iterator category. More...

typedef BTree::key_type	key_type
	The key type of the btree. Returned by key(). More...

typedef const value_type *	pointer
	Pointer to the value_type. STL required. More...

typedef const value_type &	reference
	Reference to the value_type. STL required. More...

typedef const_reverse_iterator	self
	Our own type. More...

typedef BTree::value_type	value_type
	The value type of the btree. Returned by operator*(). More...

Public Member Functions
	const_reverse_iterator ()
	Default-Constructor of a const reverse iterator. More...

	const_reverse_iterator (const typename BTree::LeafNode *l, unsigned short s)
	Initializing-Constructor of a const reverse iterator. More...

	const_reverse_iterator (const iterator &it)
	Copy-constructor from a mutable iterator. More...

	const_reverse_iterator (const const_iterator &it)
	Copy-constructor from a const iterator. More...

	const_reverse_iterator (const reverse_iterator &it)
	Copy-constructor from a mutable reverse iterator. More...

const key_type &	key () const
	Key of the current slot. More...

bool	operator!= (const const_reverse_iterator &x) const
	Inequality of iterators. More...

reference	operator* () const
	Dereference the iterator. More...

const_reverse_iterator &	operator++ ()
	Prefix++ advance the iterator to the previous slot. More...

const_reverse_iterator	operator++ (int)
	Postfix++ advance the iterator to the previous slot. More...

const_reverse_iterator &	operator-- ()
	Prefix– backstep the iterator to the next slot. More...

const_reverse_iterator	operator-- (int)
	Postfix– backstep the iterator to the next slot. More...

pointer	operator-> () const
	Dereference the iterator. More...

bool	operator== (const const_reverse_iterator &x) const
	Equality of iterators. More...

Private Attributes
const BTree::LeafNode *	curr_leaf
	The currently referenced leaf node of the tree. More...

unsigned short	curr_slot
	One slot past the current key/data slot referenced. More...

Member Typedef Documentation

◆ difference_type

typedef ptrdiff_t difference_type

STL-magic.

Definition at line 874 of file btree.hpp.

◆ iterator_category

typedef std::bidirectional_iterator_tag iterator_category

STL-magic iterator category.

Definition at line 871 of file btree.hpp.

◆ key_type

typedef BTree::key_type key_type

The key type of the btree. Returned by key().

Definition at line 859 of file btree.hpp.

◆ pointer

typedef const value_type* pointer

Pointer to the value_type. STL required.

Definition at line 868 of file btree.hpp.

◆ reference

typedef const value_type& reference

Reference to the value_type. STL required.

Definition at line 865 of file btree.hpp.

◆ self

typedef const_reverse_iterator self

Our own type.

Definition at line 877 of file btree.hpp.

◆ value_type

typedef BTree::value_type value_type

The value type of the btree. Returned by operator*().

Definition at line 862 of file btree.hpp.

Constructor & Destructor Documentation

◆ const_reverse_iterator() [1/5]

const_reverse_iterator ( )

inline

Default-Constructor of a const reverse iterator.

Definition at line 901 of file btree.hpp.

◆ const_reverse_iterator() [2/5]

const_reverse_iterator	(	const typename BTree::LeafNode *	l,
		unsigned short	s
	)

inline

Initializing-Constructor of a const reverse iterator.

Definition at line 906 of file btree.hpp.

◆ const_reverse_iterator() [3/5]

const_reverse_iterator ( const iterator & it )

inline

Copy-constructor from a mutable iterator.

Definition at line 912 of file btree.hpp.

◆ const_reverse_iterator() [4/5]

const_reverse_iterator ( const const_iterator & it )

inline

Copy-constructor from a const iterator.

Definition at line 917 of file btree.hpp.

◆ const_reverse_iterator() [5/5]

const_reverse_iterator ( const reverse_iterator & it )

inline

Copy-constructor from a mutable reverse iterator.

Definition at line 922 of file btree.hpp.

Member Function Documentation

◆ key()

const key_type& key ( ) const

inline

Key of the current slot.

Definition at line 939 of file btree.hpp.

References BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::LeafNode::key(), and TLX_BTREE_ASSERT.

◆ operator!=()

bool operator!= ( const const_reverse_iterator & x ) const

inline

Inequality of iterators.

Definition at line 1022 of file btree.hpp.

References BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::const_reverse_iterator::curr_leaf, and BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::const_reverse_iterator::curr_slot.

◆ operator*()

reference operator* ( ) const

inline

Dereference the iterator.

Definition at line 927 of file btree.hpp.

References BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::LeafNode::slotdata, and TLX_BTREE_ASSERT.

◆ operator++() [1/2]

const_reverse_iterator& operator++ ( )

inline

Prefix++ advance the iterator to the previous slot.

Definition at line 945 of file btree.hpp.

References BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::LeafNode::prev_leaf, and BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::node::slotuse.

◆ operator++() [2/2]

const_reverse_iterator operator++ ( int )

inline

Postfix++ advance the iterator to the previous slot.

Definition at line 962 of file btree.hpp.

References BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::LeafNode::prev_leaf, and BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::node::slotuse.

◆ operator--() [1/2]

const_reverse_iterator& operator-- ( )

inline

Prefix– backstep the iterator to the next slot.

Definition at line 981 of file btree.hpp.

References BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::LeafNode::next_leaf, and BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::node::slotuse.

◆ operator--() [2/2]

const_reverse_iterator operator-- ( int )

inline

Postfix– backstep the iterator to the next slot.

Definition at line 998 of file btree.hpp.

References BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::LeafNode::next_leaf, and BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::node::slotuse.

◆ operator->()

pointer operator-> ( ) const

inline

Dereference the iterator.

Definition at line 933 of file btree.hpp.

References BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::LeafNode::slotdata, and TLX_BTREE_ASSERT.

◆ operator==()

bool operator== ( const const_reverse_iterator & x ) const

inline

Equality of iterators.

Definition at line 1017 of file btree.hpp.

References BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::const_reverse_iterator::curr_leaf, and BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::const_reverse_iterator::curr_slot.

Member Data Documentation

◆ curr_leaf

const BTree::LeafNode* curr_leaf

private

The currently referenced leaf node of the tree.

Definition at line 883 of file btree.hpp.

Referenced by BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::const_reverse_iterator::operator!=(), and BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::const_reverse_iterator::operator==().

◆ curr_slot

unsigned short curr_slot

private

One slot past the current key/data slot referenced.

Definition at line 886 of file btree.hpp.

Referenced by BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::const_reverse_iterator::operator!=(), and BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::const_reverse_iterator::operator==().

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

extlib/tlx/tlx/container/btree.hpp

Detailed Description

Public Types

Public Member Functions

Private Attributes

Member Typedef Documentation

◆ difference_type

◆ iterator_category

◆ key_type

◆ pointer

◆ reference

◆ self

◆ value_type

Constructor & Destructor Documentation

◆ const_reverse_iterator() [1/5]

◆ const_reverse_iterator() [2/5]

◆ const_reverse_iterator() [3/5]

◆ const_reverse_iterator() [4/5]

◆ const_reverse_iterator() [5/5]

Member Function Documentation

◆ key()

◆ operator!=()

◆ operator*()

◆ operator++() [1/2]

◆ operator++() [2/2]

◆ operator--() [1/2]

◆ operator--() [2/2]

◆ operator->()

◆ operator==()

Member Data Documentation

◆ curr_leaf

◆ curr_slot