CommonLibSSE (Parapets fork)
RE::BSTList< T, Allocator > Class Template Reference

#include <BSTList.h>

Classes

struct  const_iterator
 
struct  iterator
 

Public Types

using value_type = T
 
using allocator_type = Allocator
 
using reference = T &
 
using const_reference = const T &
 

Public Member Functions

constexpr BSTList ()
 
 BSTList (const BSTList &)=delete
 
 BSTList (BSTList &&)=delete
 
 ~BSTList ()
 
BSTListoperator= (const BSTList &)=delete
 
BSTListoperator= (BSTList &&)=delete
 
reference front ()
 
const_reference front () const
 
reference back ()
 
const_reference back () const
 
iterator begin ()
 
const_iterator begin () const
 
const_iterator cbegin () const
 
iterator end ()
 
const_iterator end () const
 
const_iterator cend () const
 
constexpr bool empty () const
 
void clear ()
 
template<class... Args>
iterator emplace (const_iterator a_pos, Args &&... a_args)
 
iterator erase (const_iterator a_pos)
 
void push_back (const T &a_value)
 
void push_back (T &&a_value)
 
template<class... Args>
reference emplace_back (Args &&... a_args)
 
void push_front (const T &a_value)
 
void push_front (T &&a_value)
 
template<class... Args>
reference emplace_front (Args &&... a_args)
 

Member Typedef Documentation

◆ allocator_type

template<class T , class Allocator = BSTListHeapAllocator<T>>
using RE::BSTList< T, Allocator >::allocator_type = Allocator

◆ const_reference

template<class T , class Allocator = BSTListHeapAllocator<T>>
using RE::BSTList< T, Allocator >::const_reference = const T&

◆ reference

template<class T , class Allocator = BSTListHeapAllocator<T>>
using RE::BSTList< T, Allocator >::reference = T&

◆ value_type

template<class T , class Allocator = BSTListHeapAllocator<T>>
using RE::BSTList< T, Allocator >::value_type = T

Constructor & Destructor Documentation

◆ BSTList() [1/3]

template<class T , class Allocator = BSTListHeapAllocator<T>>
constexpr RE::BSTList< T, Allocator >::BSTList ( )
inlineconstexpr

◆ BSTList() [2/3]

template<class T , class Allocator = BSTListHeapAllocator<T>>
RE::BSTList< T, Allocator >::BSTList ( const BSTList< T, Allocator > &  )
delete

◆ BSTList() [3/3]

template<class T , class Allocator = BSTListHeapAllocator<T>>
RE::BSTList< T, Allocator >::BSTList ( BSTList< T, Allocator > &&  )
delete

◆ ~BSTList()

template<class T , class Allocator = BSTListHeapAllocator<T>>
RE::BSTList< T, Allocator >::~BSTList ( )
inline

Member Function Documentation

◆ back() [1/2]

template<class T , class Allocator = BSTListHeapAllocator<T>>
reference RE::BSTList< T, Allocator >::back ( )
inline

◆ back() [2/2]

template<class T , class Allocator = BSTListHeapAllocator<T>>
const_reference RE::BSTList< T, Allocator >::back ( ) const
inline

◆ begin() [1/2]

template<class T , class Allocator = BSTListHeapAllocator<T>>
iterator RE::BSTList< T, Allocator >::begin ( )
inline

◆ begin() [2/2]

template<class T , class Allocator = BSTListHeapAllocator<T>>
const_iterator RE::BSTList< T, Allocator >::begin ( ) const
inline

◆ cbegin()

template<class T , class Allocator = BSTListHeapAllocator<T>>
const_iterator RE::BSTList< T, Allocator >::cbegin ( ) const
inline

◆ cend()

template<class T , class Allocator = BSTListHeapAllocator<T>>
const_iterator RE::BSTList< T, Allocator >::cend ( ) const
inline

◆ clear()

template<class T , class Allocator = BSTListHeapAllocator<T>>
void RE::BSTList< T, Allocator >::clear ( )
inline

◆ emplace()

template<class T , class Allocator = BSTListHeapAllocator<T>>
template<class... Args>
iterator RE::BSTList< T, Allocator >::emplace ( const_iterator  a_pos,
Args &&...  a_args 
)
inline

◆ emplace_back()

template<class T , class Allocator = BSTListHeapAllocator<T>>
template<class... Args>
reference RE::BSTList< T, Allocator >::emplace_back ( Args &&...  a_args)
inline

◆ emplace_front()

template<class T , class Allocator = BSTListHeapAllocator<T>>
template<class... Args>
reference RE::BSTList< T, Allocator >::emplace_front ( Args &&...  a_args)
inline

◆ empty()

template<class T , class Allocator = BSTListHeapAllocator<T>>
constexpr bool RE::BSTList< T, Allocator >::empty ( ) const
inlineconstexpr

◆ end() [1/2]

template<class T , class Allocator = BSTListHeapAllocator<T>>
iterator RE::BSTList< T, Allocator >::end ( )
inline

◆ end() [2/2]

template<class T , class Allocator = BSTListHeapAllocator<T>>
const_iterator RE::BSTList< T, Allocator >::end ( ) const
inline

◆ erase()

template<class T , class Allocator = BSTListHeapAllocator<T>>
iterator RE::BSTList< T, Allocator >::erase ( const_iterator  a_pos)
inline

◆ front() [1/2]

template<class T , class Allocator = BSTListHeapAllocator<T>>
reference RE::BSTList< T, Allocator >::front ( )
inline

◆ front() [2/2]

template<class T , class Allocator = BSTListHeapAllocator<T>>
const_reference RE::BSTList< T, Allocator >::front ( ) const
inline

◆ operator=() [1/2]

template<class T , class Allocator = BSTListHeapAllocator<T>>
BSTList& RE::BSTList< T, Allocator >::operator= ( BSTList< T, Allocator > &&  )
delete

◆ operator=() [2/2]

template<class T , class Allocator = BSTListHeapAllocator<T>>
BSTList& RE::BSTList< T, Allocator >::operator= ( const BSTList< T, Allocator > &  )
delete

◆ push_back() [1/2]

template<class T , class Allocator = BSTListHeapAllocator<T>>
void RE::BSTList< T, Allocator >::push_back ( const T &  a_value)
inline

◆ push_back() [2/2]

template<class T , class Allocator = BSTListHeapAllocator<T>>
void RE::BSTList< T, Allocator >::push_back ( T &&  a_value)
inline

◆ push_front() [1/2]

template<class T , class Allocator = BSTListHeapAllocator<T>>
void RE::BSTList< T, Allocator >::push_front ( const T &  a_value)
inline

◆ push_front() [2/2]

template<class T , class Allocator = BSTListHeapAllocator<T>>
void RE::BSTList< T, Allocator >::push_front ( T &&  a_value)
inline

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