AutoAccessSSkipList< K, T, A, Pr, R >::T0 Class Reference

iterator More...

#include <CSAutoAccessSSkipList.h>

List of all members.

Public Types
typedef std::iterator < std::random_access_iterator_tag, value_type >	baseclass
typedef std::random_acces_iterator_tag	iterator_category
typedef baseclass::value_type	value_type
typedef const baseclass::value_type *	pointer
typedef const baseclass::value_type &	reference
typedef ptrdiff_t	difference_type
Public Member Functions
	T0 ()
	Default constructor. O(1) (Trivial Iterator)
	T0 (const T0 &t0)
	Copy constructor. O(1) (Output Iterator)
	T0 (const T1 &t1)
	Copy constructor. O(1) (Output Iterator)
	T0 (container_type *container, node_type *p)
	Custom constructor. O(logn)
	T0 (container_type *container, node_type *p, size_type index)
	Custom constructor. O(1)
bool	operator== (const T0 &other) const
	Equality Operator. O(1) (Trivial Iterator)
bool	operator!= (const T0 &other) const
	Not Equal Operator. O(1) (Trivial Iterator)
bool	operator== (const T1 &other) const
	Equality Operator. O(1) (Trivial Iterator)
bool	operator!= (const T1 &other) const
	Not Equal Operator. O(1) (Trivial Iterator)
T0 &	operator++ ()
	Pre Increment Operator. O(1) (Forward Iterator)
T0	operator++ (int)
	Post Increment Operator. O(1) (Forward Iterator)
T0 &	operator-- ()
	Pre Decrement Operator. O(logn) (Bidirectional Iterator LOGN)
T0	operator-- (int)
	Post Decrement Operator. O(logn) (Bidirectional Iterator LOGN)
reference	operator* () const
	Dereference Operator. O(1) (Trivial Iterator)
pointer	operator-> () const
	Pointer Operator. O(1) (Trivial Iterator)
bool	operator< (const T0 &other) const
	LessThan Operator. O(1) (Arbitrary Access Iterator LOGN)
bool	operator<= (const T0 &other) const
	LessThanOrEqual Operator. O(1) (Arbitrary Access Iterator LOGN)
bool	operator> (const T0 &other) const
	GreaterThan Operator. O(1) (Arbitrary Access Iterator LOGN)
bool	operator>= (const T0 &other) const
	GreaterThanOrEqual Operator. O(1) (Arbitrary Access Iterator LOGN)
bool	operator< (const T1 &other) const
	LessThan Operator. O(1) (Arbitrary Access Iterator LOGN)
bool	operator<= (const T1 &other) const
	LessThanOrEqual Operator. O(1) (Arbitrary Access Iterator LOGN)
bool	operator> (const T1 &other) const
	GreaterThan Operator. O(1) (Arbitrary Access Iterator LOGN)
bool	operator>= (const T1 &other) const
	GreaterThanOrEqual Operator. O(1) (Arbitrary Access Iterator LOGN)
T0	operator+ (difference_type off) const
	Add Operator. O(logn) (Arbitrary Access Iterator LOGN)
T0	operator- (difference_type off) const
	Subtract Operator. O(logn) (Arbitrary Access Iterator LOGN)
T0 &	operator+= (difference_type off)
	AddEqual Operator. O(logn) (Arbitrary Access Iterator LOGN)
T0 &	operator-= (difference_type off)
	SubtractEqual Operator. O(logn) (Arbitrary Access Iterator LOGN)
difference_type	operator- (const T0 &other) const
	Subtract iterator Operator. O(1) (Arbitrary Access Iterator LOGN)
difference_type	operator- (const T1 &other) const
	Subtract iterator Operator. O(1) (Arbitrary Access Iterator LOGN)
int	refresh ()
	Recalculates iterator index. O(logn)
value_type &	operator[] (difference_type off) const
	Array Operator. O(logn) (Arbitrary Access Iterator LOGN)
size_type	getIndex () const
	Get current index. O(1)
Public Attributes
friend	T1
friend	container_type
Private Attributes
container_type *	container
	SkipList container.
size_type	Findex
	Index of this iterator.
node_type *	node
	Node pointed to by this iterator.

---

Detailed Description

template<class K, class T, class A = XAccessSelf<K,T>, class Pr = std::less<K>, class R = RNG>
class AutoAccessSSkipList< K, T, A, Pr, R >::T0

iterator

iterator for AutoAccessSSkipList

---

Constructor & Destructor Documentation

template<class K, class T, class A = XAccessSelf<K,T>, class Pr = std::less<K>, class R = RNG>

AutoAccessSSkipList< K, T, A, Pr, R >::T0::T0

(

const T0 &

t0

)

[inline]

Copy constructor. O(1) (Output Iterator)

Parameters:

t0	iterator to copy.

template<class K, class T, class A = XAccessSelf<K,T>, class Pr = std::less<K>, class R = RNG>

AutoAccessSSkipList< K, T, A, Pr, R >::T0::T0

(

const T1 &

t1

)

[inline]

Copy constructor. O(1) (Output Iterator)

Parameters:

t1	const_iterator to copy.

template<class K, class T, class A = XAccessSelf<K,T>, class Pr = std::less<K>, class R = RNG>

AutoAccessSSkipList< K, T, A, Pr, R >::T0::T0	(	container_type *	container,
		node_type *	p
	)		[inline]

Custom constructor. O(logn)

Perfarmance: Index is automatically generated in O(logn).

Parameters:

container	SkipList that contains the current node.
p	Node pointed to by this iterator.

template<class K, class T, class A = XAccessSelf<K,T>, class Pr = std::less<K>, class R = RNG>

AutoAccessSSkipList< K, T, A, Pr, R >::T0::T0	(	container_type *	container,
		node_type *	p,
		size_type	index
	)		[inline]

Custom constructor. O(1)

Parameters:

container	SkipList that contains the current node.
p	Node pointed to by this iterator.
index	Indexd of the current node.

---

Member Function Documentation

template<class K, class T, class A = XAccessSelf<K,T>, class Pr = std::less<K>, class R = RNG>

bool AutoAccessSSkipList< K, T, A, Pr, R >::T0::operator==

(

const T0 &

other

)

const [inline]

Equality Operator. O(1) (Trivial Iterator)

Parameters:

other

iterator to compare against.

template<class K, class T, class A = XAccessSelf<K,T>, class Pr = std::less<K>, class R = RNG>

bool AutoAccessSSkipList< K, T, A, Pr, R >::T0::operator!=

(

const T0 &

other

)

const [inline]

Not Equal Operator. O(1) (Trivial Iterator)

Parameters:

other

iterator to compare against.

template<class K, class T, class A = XAccessSelf<K,T>, class Pr = std::less<K>, class R = RNG>

bool AutoAccessSSkipList< K, T, A, Pr, R >::T0::operator==

(

const T1 &

other

)

const [inline]

Equality Operator. O(1) (Trivial Iterator)

Parameters:

other

const_iterator to compare against.

template<class K, class T, class A = XAccessSelf<K,T>, class Pr = std::less<K>, class R = RNG>

bool AutoAccessSSkipList< K, T, A, Pr, R >::T0::operator!=

(

const T1 &

other

)

const [inline]

Not Equal Operator. O(1) (Trivial Iterator)

Parameters:

other

const_iterator to compare against.

template<class K, class T, class A = XAccessSelf<K,T>, class Pr = std::less<K>, class R = RNG>

T0& AutoAccessSSkipList< K, T, A, Pr, R >::T0::operator++

(

)

[inline]

Pre Increment Operator. O(1) (Forward Iterator)

iterator points to next node in the list.

Returns:

self reference to iterator after being incremented.

template<class K, class T, class A = XAccessSelf<K,T>, class Pr = std::less<K>, class R = RNG>

T0 AutoAccessSSkipList< K, T, A, Pr, R >::T0::operator++

(

int

)

[inline]

Post Increment Operator. O(1) (Forward Iterator)

iterator points to next node in the list.

Returns:

incremented copy of iterator.

template<class K, class T, class A = XAccessSelf<K,T>, class Pr = std::less<K>, class R = RNG>

T0& AutoAccessSSkipList< K, T, A, Pr, R >::T0::operator--

(

)

[inline]

Pre Decrement Operator. O(logn) (Bidirectional Iterator LOGN)

iterator points to previous node in the list.

Returns:

self reference to iterator after being decremented.

template<class K, class T, class A = XAccessSelf<K,T>, class Pr = std::less<K>, class R = RNG>

T0 AutoAccessSSkipList< K, T, A, Pr, R >::T0::operator--

(

int

)

[inline]

Post Decrement Operator. O(logn) (Bidirectional Iterator LOGN)

iterator points to previous node in the list.

Returns:

decremented copy of iterator.

template<class K, class T, class A = XAccessSelf<K,T>, class Pr = std::less<K>, class R = RNG>

reference AutoAccessSSkipList< K, T, A, Pr, R >::T0::operator*

(

)

const [inline]

Dereference Operator. O(1) (Trivial Iterator)

Gain access to value that the iterator points to.

Returns:

Value reference pointed to by this iterator.

template<class K, class T, class A = XAccessSelf<K,T>, class Pr = std::less<K>, class R = RNG>

pointer AutoAccessSSkipList< K, T, A, Pr, R >::T0::operator->

(

)

const [inline]

Pointer Operator. O(1) (Trivial Iterator)

Gain access to members of of the value pointed to by this iterator.

Returns:

Value pointer pointed to by this iterator.

template<class K, class T, class A = XAccessSelf<K,T>, class Pr = std::less<K>, class R = RNG>

bool AutoAccessSSkipList< K, T, A, Pr, R >::T0::operator<

(

const T0 &

other

)

const [inline]

LessThan Operator. O(1) (Arbitrary Access Iterator LOGN)

Parameters:

other

iterator to compare against.

template<class K, class T, class A = XAccessSelf<K,T>, class Pr = std::less<K>, class R = RNG>

bool AutoAccessSSkipList< K, T, A, Pr, R >::T0::operator<=

(

const T0 &

other

)

const [inline]

LessThanOrEqual Operator. O(1) (Arbitrary Access Iterator LOGN)

Parameters:

other

iterator to compare against.

template<class K, class T, class A = XAccessSelf<K,T>, class Pr = std::less<K>, class R = RNG>

bool AutoAccessSSkipList< K, T, A, Pr, R >::T0::operator>

(

const T0 &

other

)

const [inline]

GreaterThan Operator. O(1) (Arbitrary Access Iterator LOGN)

Parameters:

other

iterator to compare against.

template<class K, class T, class A = XAccessSelf<K,T>, class Pr = std::less<K>, class R = RNG>

bool AutoAccessSSkipList< K, T, A, Pr, R >::T0::operator>=

(

const T0 &

other

)

const [inline]

GreaterThanOrEqual Operator. O(1) (Arbitrary Access Iterator LOGN)

Parameters:

other

iterator to compare against.

template<class K, class T, class A = XAccessSelf<K,T>, class Pr = std::less<K>, class R = RNG>

bool AutoAccessSSkipList< K, T, A, Pr, R >::T0::operator<

(

const T1 &

other

)

const [inline]

LessThan Operator. O(1) (Arbitrary Access Iterator LOGN)

Parameters:

other

const_iterator to compare against.

template<class K, class T, class A = XAccessSelf<K,T>, class Pr = std::less<K>, class R = RNG>

bool AutoAccessSSkipList< K, T, A, Pr, R >::T0::operator<=

(

const T1 &

other

)

const [inline]

LessThanOrEqual Operator. O(1) (Arbitrary Access Iterator LOGN)

Parameters:

other

const_iterator to compare against.

template<class K, class T, class A = XAccessSelf<K,T>, class Pr = std::less<K>, class R = RNG>

bool AutoAccessSSkipList< K, T, A, Pr, R >::T0::operator>

(

const T1 &

other

)

const [inline]

GreaterThan Operator. O(1) (Arbitrary Access Iterator LOGN)

Parameters:

other

const_iterator to compare against.

template<class K, class T, class A = XAccessSelf<K,T>, class Pr = std::less<K>, class R = RNG>

bool AutoAccessSSkipList< K, T, A, Pr, R >::T0::operator>=

(

const T1 &

other

)

const [inline]

GreaterThanOrEqual Operator. O(1) (Arbitrary Access Iterator LOGN)

Parameters:

other

const_iterator to compare against.

template<class K, class T, class A = XAccessSelf<K,T>, class Pr = std::less<K>, class R = RNG>

T0 AutoAccessSSkipList< K, T, A, Pr, R >::T0::operator+

(

difference_type

off

)

const [inline]

Add Operator. O(logn) (Arbitrary Access Iterator LOGN)

Parameters:

off	offset from current index.

Returns:

iterator that points to the new location.

template<class K, class T, class A = XAccessSelf<K,T>, class Pr = std::less<K>, class R = RNG>

T0 AutoAccessSSkipList< K, T, A, Pr, R >::T0::operator-

(

difference_type

off

)

const [inline]

Subtract Operator. O(logn) (Arbitrary Access Iterator LOGN)

Parameters:

off	negative offset from current index.

Returns:

iterator that points to the new location.

template<class K, class T, class A = XAccessSelf<K,T>, class Pr = std::less<K>, class R = RNG>

T0& AutoAccessSSkipList< K, T, A, Pr, R >::T0::operator+=

(

difference_type

off

)

[inline]

AddEqual Operator. O(logn) (Arbitrary Access Iterator LOGN)

Parameters:

off	offset from current index.

Returns:

iterator that points to the new location.

template<class K, class T, class A = XAccessSelf<K,T>, class Pr = std::less<K>, class R = RNG>

T0& AutoAccessSSkipList< K, T, A, Pr, R >::T0::operator-=

(

difference_type

off

)

[inline]

SubtractEqual Operator. O(logn) (Arbitrary Access Iterator LOGN)

Parameters:

off	negative offset from current index.

Returns:

iterator that points to the new location.

template<class K, class T, class A = XAccessSelf<K,T>, class Pr = std::less<K>, class R = RNG>

difference_type AutoAccessSSkipList< K, T, A, Pr, R >::T0::operator-

(

const T0 &

other

)

const [inline]

Subtract iterator Operator. O(1) (Arbitrary Access Iterator LOGN)

Parameters:

other

iterator position to subtract.

Returns:

Distance between iterators.

template<class K, class T, class A = XAccessSelf<K,T>, class Pr = std::less<K>, class R = RNG>

difference_type AutoAccessSSkipList< K, T, A, Pr, R >::T0::operator-

(

const T1 &

other

)

const [inline]

Subtract iterator Operator. O(1) (Arbitrary Access Iterator LOGN)

Parameters:

other

const_iterator position to subtract.

Returns:

Distance between iterators.

template<class K, class T, class A = XAccessSelf<K,T>, class Pr = std::less<K>, class R = RNG>

int AutoAccessSSkipList< K, T, A, Pr, R >::T0::refresh

(

)

[inline]

Recalculates iterator index. O(logn)

Use refresh() to recalculate index after performing a destructive operation on the SkipList.

Returns:

Corrected index.

template<class K, class T, class A = XAccessSelf<K,T>, class Pr = std::less<K>, class R = RNG>

value_type& AutoAccessSSkipList< K, T, A, Pr, R >::T0::operator[]

(

difference_type

off

)

const [inline]

Array Operator. O(logn) (Arbitrary Access Iterator LOGN)

Parameters:

off	offset from current index.

Returns:

reference to value at the new location.

template<class K, class T, class A = XAccessSelf<K,T>, class Pr = std::less<K>, class R = RNG>

size_type AutoAccessSSkipList< K, T, A, Pr, R >::T0::getIndex

(

)

const [inline]

Get current index. O(1)

Returns:

Current index.

---

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

• CSAutoAccessSSkipList.h