AlgoPlus v0.1.0
Loading...
Searching...
No Matches
splay_tree< T >::Iterator Class Reference

Iterator class. More...

#include <splay_tree.h>

Public Member Functions

 Iterator (const int64_t &index, std::vector< T > &els) noexcept
 Construct a new Iterator object.
 
Iteratoroperator= (int64_t index)
 = operator for Iterator type
 
Iteratoroperator++ ()
 operator ++ for type Iterator
 
Iterator operator++ (int)
 operator ++ for type Iterator
 
Iteratoroperator-- ()
 operator – for type Iterator
 
Iterator operator-- (int)
 operator – for type Iterator
 
bool operator!= (const Iterator &it)
 operator != for type Iterator
 
operator* ()
 operator * for type Iterator
 
 splay_tree (std::vector< T > v={}) noexcept
 Construct a new splay tree object.
 
 splay_tree (const splay_tree &s)
 Copy constructor for splay tree class.
 
splay_treeoperator= (const splay_tree &s)
 operator = for splay tree class
 
void clear ()
 clear function
 
void insert (T key)
 insert function
 
void remove (T key)
 remove function
 
bool search (T key)
 search function
 
size_t size ()
 size function
 
Iterator begin ()
 
Iterator end ()
 
std::vector< T > inorder ()
 inorder function.
 
std::vector< T > preorder ()
 preorder function.
 
std::vector< T > postorder ()
 postorder function.
 
std::vector< std::vector< T > > level_order ()
 level order function
 

Friends

std::ostream & operator<< (std::ostream &out, splay_tree< T > &t)
 visualize function
 

Detailed Description

template<typename T>
class splay_tree< T >::Iterator

Iterator class.

Constructor & Destructor Documentation

◆ Iterator()

template<typename T>
splay_tree< T >::Iterator::Iterator ( const int64_t & index,
std::vector< T > & els )
inlineexplicitnoexcept

Construct a new Iterator object.

Parameters
elsvector<T> - the elements in inorder fashion

Member Function Documentation

◆ inorder()

std::vector< T > splay_tree< T >::inorder ( )
inline

inorder function.

Returns
vector<T>, the elements inorder.

◆ insert()

void splay_tree< T >::insert ( T key)
inline

insert function

Parameters
keythe key to be inserted

◆ level_order()

std::vector< std::vector< T > > splay_tree< T >::level_order ( )
inline

level order function

Returns
vector<vector<T>>, the level order traversal of the tree

◆ operator!=()

template<typename T>
bool splay_tree< T >::Iterator::operator!= ( const Iterator & it)
inline

operator != for type Iterator

Parameters
itconst Iterator
Returns
true if index == it.index
false otherwise

◆ operator*()

template<typename T>
T splay_tree< T >::Iterator::operator* ( )
inline

operator * for type Iterator

Returns
T the value of the node

◆ operator++() [1/2]

template<typename T>
Iterator & splay_tree< T >::Iterator::operator++ ( )
inline

operator ++ for type Iterator

Returns
Iterator&

◆ operator++() [2/2]

template<typename T>
Iterator splay_tree< T >::Iterator::operator++ ( int )
inline

operator ++ for type Iterator

Returns
Iterator

◆ operator--() [1/2]

template<typename T>
Iterator & splay_tree< T >::Iterator::operator-- ( )
inline

operator – for type Iterator

Returns
Iterator&

◆ operator--() [2/2]

template<typename T>
Iterator splay_tree< T >::Iterator::operator-- ( int )
inline

operator – for type Iterator

Returns
Iterator

◆ operator=() [1/2]

splay_tree & splay_tree< T >::operator= ( const splay_tree & s)
inline

operator = for splay tree class

Parameters
sthe tree we want to copy
Returns
splay_tree&

◆ operator=() [2/2]

template<typename T>
Iterator & splay_tree< T >::Iterator::operator= ( int64_t index)
inline

= operator for Iterator type

Parameters
indexthe current index
Returns
Iterator&

◆ postorder()

std::vector< T > splay_tree< T >::postorder ( )
inline

postorder function.

Returns
vector<T>, the elements postorder.

◆ preorder()

std::vector< T > splay_tree< T >::preorder ( )
inline

preorder function.

Returns
vector<T>, the elements preorder.

◆ remove()

void splay_tree< T >::remove ( T key)
inline

remove function

Parameters
keythe key to be removed

◆ search()

bool splay_tree< T >::search ( T key)
inline

search function

Parameters
key
Returns
true if key exists in the tree
false otherwise

◆ size()

size_t splay_tree< T >::size ( )
inline

size function

Returns
size_t the size of the tree

◆ splay_tree() [1/2]

splay_tree< T >::splay_tree ( const splay_tree & s)
inlineexplicit

Copy constructor for splay tree class.

Parameters
sthe tree we want to copy

◆ splay_tree() [2/2]

splay_tree< T >::splay_tree ( std::vector< T > v = {})
inlineexplicitnoexcept

Construct a new splay tree object.

Parameters
vvector<T> initializer vector

Friends And Related Symbol Documentation

◆ operator<<

std::ostream & operator<< ( std::ostream & out,
splay_tree< T > & t )
friend

visualize function

Returns
.dot file that can be previewed using graphviz in vscode.

operator << for splay tree class


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