TwiceAsNice  2019-02-18
Public Types | Public Member Functions | Private Attributes | List of all members
Nice::List< T, Allocator > Class Template Reference

#include <List.h>

Collaboration diagram for Nice::List< T, Allocator >:
Collaboration graph

Public Types

typedef std::list< T, Allocator >::iterator iterator
 
typedef std::list< T, Allocator >::const_iterator const_iterator
 
typedef std::list< T, Allocator >::reverse_iterator reverse_iterator
 
typedef std::list< T, Allocator >::const_reverse_iterator const_reverse_iterator
 
typedef std::list< T, Allocator >::allocator_type allocator_type
 
typedef std::list< T, Allocator >::value_type value_type
 
typedef std::list< T, Allocator >::size_type size_type
 
typedef std::list< T, Allocator >::difference_type difference_type
 
typedef std::list< T, Allocator >::iterator iterator
 
typedef std::list< T, Allocator >::const_iterator const_iterator
 
typedef std::list< T, Allocator >::reverse_iterator reverse_iterator
 
typedef std::list< T, Allocator >::const_reverse_iterator const_reverse_iterator
 
typedef std::list< T, Allocator >::allocator_type allocator_type
 
typedef std::list< T, Allocator >::value_type value_type
 
typedef std::list< T, Allocator >::size_type size_type
 
typedef std::list< T, Allocator >::difference_type difference_type
 

Public Member Functions

 List (const Allocator &alloc=Allocator())
 
 List (size_type n, const T &value=T(), const Allocator &alloc=Allocator())
 
template<class InputIterator >
 List (InputIterator first, InputIterator last, const Allocator &alloc=Allocator())
 
 List (const Nice::List< T, Allocator > &x)
 
Nice::List< T, Allocator > & operator= (const Nice::List< T, Allocator > &x)
 
 ~List (void)
 
iterator begin (void)
 
const_iterator begin (void) const
 
iterator end (void)
 
const_iterator end (void) const
 
reverse_iterator rbegin (void)
 
const_reverse_iterator rbegin (void) const
 
reverse_iterator rend (void)
 
const_reverse_iterator rend (void) const
 
size_type size (void) const
 
size_type max_size (void) const
 
void resize (size_type n, T c=T())
 
bool empty (void) const
 
T & front (void)
 
const T & front (void) const
 
T & back (void)
 
const T & back (void) const
 
void assign (size_type n, T &u)
 
template<class InputIterator >
void assign (InputIterator begin, InputIterator end)
 
void push_back (const T &u)
 
void pop_back (void)
 
void push_front (const T &u)
 
void pop_front (void)
 
iterator insert (iterator pos, const T &u)
 
void insert (iterator pos, size_type n, const T &u)
 
template<class InputIterator >
void insert (iterator pos, InputIterator begin, InputIterator end)
 
void erase (iterator pos)
 
void erase (iterator begin, iterator end)
 
void swap (Nice::List< T, Allocator > &x)
 
void clear (void)
 
void splice (iterator position, Nice::List< T, Allocator > &x)
 
void splice (iterator position, Nice::List< T, Allocator > &x, iterator i)
 
void splice (iterator position, Nice::List< T, Allocator > &x, iterator first, iterator last)
 
void remove (const T &value)
 
template<class Predicate >
void remove_if (Predicate pred)
 
void unique (void)
 
template<class BinaryPredicate >
void unique (BinaryPredicate binary_pred)
 
void merge (Nice::List< T, Allocator > &x)
 
template<class Compare >
void merge (Nice::List< T, Allocator > &x, Compare comp)
 
void sort (void)
 
template<class Compare >
void sort (Compare comp)
 
void reverse (void)
 
allocator_type get_allocator (void) const
 
 operator std::list< T, Allocator > ()
 
 List (const Allocator &alloc=Allocator())
 
 List (size_type n, const T &value=T(), const Allocator &alloc=Allocator())
 
template<class InputIterator >
 List (InputIterator first, InputIterator last, const Allocator &alloc=Allocator())
 
 List (const Nice::List< T, Allocator > &x)
 
Nice::List< T, Allocator > & operator= (const Nice::List< T, Allocator > &x)
 
 ~List (void)
 
iterator begin (void)
 
const_iterator begin (void) const
 
iterator end (void)
 
const_iterator end (void) const
 
reverse_iterator rbegin (void)
 
const_reverse_iterator rbegin (void) const
 
reverse_iterator rend (void)
 
const_reverse_iterator rend (void) const
 
size_type size (void) const
 
size_type max_size (void) const
 
void resize (size_type n, T c=T())
 
bool empty (void) const
 
T & front (void)
 
const T & front (void) const
 
T & back (void)
 
const T & back (void) const
 
void assign (size_type n, T &u)
 
template<class InputIterator >
void assign (InputIterator begin, InputIterator end)
 
void push_back (const T &u)
 
void pop_back (void)
 
void push_front (const T &u)
 
void pop_front (void)
 
iterator insert (iterator pos, const T &u)
 
void insert (iterator pos, size_type n, const T &u)
 
template<class InputIterator >
void insert (iterator pos, InputIterator begin, InputIterator end)
 
void erase (iterator pos)
 
void erase (iterator begin, iterator end)
 
void swap (Nice::List< T, Allocator > &x)
 
void clear (void)
 
void splice (iterator position, Nice::List< T, Allocator > &x)
 
void splice (iterator position, Nice::List< T, Allocator > &x, iterator i)
 
void splice (iterator position, Nice::List< T, Allocator > &x, iterator first, iterator last)
 
void remove (const T &value)
 
template<class Predicate >
void remove_if (Predicate pred)
 
void unique (void)
 
template<class BinaryPredicate >
void unique (BinaryPredicate binary_pred)
 
void merge (Nice::List< T, Allocator > &x)
 
template<class Compare >
void merge (Nice::List< T, Allocator > &x, Compare comp)
 
void sort (void)
 
template<class Compare >
void sort (Compare comp)
 
void reverse (void)
 
allocator_type get_allocator (void) const
 
 operator std::list< T, Allocator > ()
 

Private Attributes

std::list< T, Allocator > m_storage
 
Nice::Mutex m_mutex
 

Member Typedef Documentation

◆ allocator_type [1/2]

template<class T, class Allocator = std::allocator<T>>
typedef std::list<T, Allocator>::allocator_type Nice::List< T, Allocator >::allocator_type

◆ allocator_type [2/2]

template<class T, class Allocator = std::allocator<T>>
typedef std::list<T, Allocator>::allocator_type Nice::List< T, Allocator >::allocator_type

◆ const_iterator [1/2]

template<class T, class Allocator = std::allocator<T>>
typedef std::list<T, Allocator>::const_iterator Nice::List< T, Allocator >::const_iterator

◆ const_iterator [2/2]

template<class T, class Allocator = std::allocator<T>>
typedef std::list<T, Allocator>::const_iterator Nice::List< T, Allocator >::const_iterator

◆ const_reverse_iterator [1/2]

template<class T, class Allocator = std::allocator<T>>
typedef std::list<T, Allocator>::const_reverse_iterator Nice::List< T, Allocator >::const_reverse_iterator

◆ const_reverse_iterator [2/2]

template<class T, class Allocator = std::allocator<T>>
typedef std::list<T, Allocator>::const_reverse_iterator Nice::List< T, Allocator >::const_reverse_iterator

◆ difference_type [1/2]

template<class T, class Allocator = std::allocator<T>>
typedef std::list<T, Allocator>::difference_type Nice::List< T, Allocator >::difference_type

◆ difference_type [2/2]

template<class T, class Allocator = std::allocator<T>>
typedef std::list<T, Allocator>::difference_type Nice::List< T, Allocator >::difference_type

◆ iterator [1/2]

template<class T, class Allocator = std::allocator<T>>
typedef std::list<T, Allocator>::iterator Nice::List< T, Allocator >::iterator

◆ iterator [2/2]

template<class T, class Allocator = std::allocator<T>>
typedef std::list<T, Allocator>::iterator Nice::List< T, Allocator >::iterator

◆ reverse_iterator [1/2]

template<class T, class Allocator = std::allocator<T>>
typedef std::list<T, Allocator>::reverse_iterator Nice::List< T, Allocator >::reverse_iterator

◆ reverse_iterator [2/2]

template<class T, class Allocator = std::allocator<T>>
typedef std::list<T, Allocator>::reverse_iterator Nice::List< T, Allocator >::reverse_iterator

◆ size_type [1/2]

template<class T, class Allocator = std::allocator<T>>
typedef std::list<T, Allocator>::size_type Nice::List< T, Allocator >::size_type

◆ size_type [2/2]

template<class T, class Allocator = std::allocator<T>>
typedef std::list<T, Allocator>::size_type Nice::List< T, Allocator >::size_type

◆ value_type [1/2]

template<class T, class Allocator = std::allocator<T>>
typedef std::list<T, Allocator>::value_type Nice::List< T, Allocator >::value_type

◆ value_type [2/2]

template<class T, class Allocator = std::allocator<T>>
typedef std::list<T, Allocator>::value_type Nice::List< T, Allocator >::value_type

Constructor & Destructor Documentation

◆ List() [1/8]

template<class T, class Allocator = std::allocator<T>>
Nice::List< T, Allocator >::List ( const Allocator &  alloc = Allocator())
inlineexplicit

◆ List() [2/8]

template<class T, class Allocator = std::allocator<T>>
Nice::List< T, Allocator >::List ( size_type  n,
const T &  value = T(),
const Allocator &  alloc = Allocator() 
)
inlineexplicit

◆ List() [3/8]

template<class T, class Allocator = std::allocator<T>>
template<class InputIterator >
Nice::List< T, Allocator >::List ( InputIterator  first,
InputIterator  last,
const Allocator &  alloc = Allocator() 
)
inline

◆ List() [4/8]

template<class T, class Allocator = std::allocator<T>>
Nice::List< T, Allocator >::List ( const Nice::List< T, Allocator > &  x)
inline

◆ ~List() [1/2]

template<class T, class Allocator = std::allocator<T>>
Nice::List< T, Allocator >::~List ( void  )
inline

◆ List() [5/8]

template<class T, class Allocator = std::allocator<T>>
Nice::List< T, Allocator >::List ( const Allocator &  alloc = Allocator())
inlineexplicit

◆ List() [6/8]

template<class T, class Allocator = std::allocator<T>>
Nice::List< T, Allocator >::List ( size_type  n,
const T &  value = T(),
const Allocator &  alloc = Allocator() 
)
inlineexplicit

◆ List() [7/8]

template<class T, class Allocator = std::allocator<T>>
template<class InputIterator >
Nice::List< T, Allocator >::List ( InputIterator  first,
InputIterator  last,
const Allocator &  alloc = Allocator() 
)
inline

◆ List() [8/8]

template<class T, class Allocator = std::allocator<T>>
Nice::List< T, Allocator >::List ( const Nice::List< T, Allocator > &  x)
inline

◆ ~List() [2/2]

template<class T, class Allocator = std::allocator<T>>
Nice::List< T, Allocator >::~List ( void  )
inline

Member Function Documentation

◆ assign() [1/4]

template<class T, class Allocator = std::allocator<T>>
void Nice::List< T, Allocator >::assign ( size_type  n,
T &  u 
)
inline

◆ assign() [2/4]

template<class T, class Allocator = std::allocator<T>>
void Nice::List< T, Allocator >::assign ( size_type  n,
T &  u 
)
inline

◆ assign() [3/4]

template<class T, class Allocator = std::allocator<T>>
template<class InputIterator >
void Nice::List< T, Allocator >::assign ( InputIterator  begin,
InputIterator  end 
)
inline

◆ assign() [4/4]

template<class T, class Allocator = std::allocator<T>>
template<class InputIterator >
void Nice::List< T, Allocator >::assign ( InputIterator  begin,
InputIterator  end 
)
inline

◆ back() [1/4]

template<class T, class Allocator = std::allocator<T>>
T& Nice::List< T, Allocator >::back ( void  )
inline

◆ back() [2/4]

template<class T, class Allocator = std::allocator<T>>
T& Nice::List< T, Allocator >::back ( void  )
inline

◆ back() [3/4]

template<class T, class Allocator = std::allocator<T>>
const T& Nice::List< T, Allocator >::back ( void  ) const
inline

◆ back() [4/4]

template<class T, class Allocator = std::allocator<T>>
const T& Nice::List< T, Allocator >::back ( void  ) const
inline

◆ begin() [1/4]

template<class T, class Allocator = std::allocator<T>>
iterator Nice::List< T, Allocator >::begin ( void  )
inline

◆ begin() [2/4]

template<class T, class Allocator = std::allocator<T>>
iterator Nice::List< T, Allocator >::begin ( void  )
inline

◆ begin() [3/4]

template<class T, class Allocator = std::allocator<T>>
const_iterator Nice::List< T, Allocator >::begin ( void  ) const
inline

◆ begin() [4/4]

template<class T, class Allocator = std::allocator<T>>
const_iterator Nice::List< T, Allocator >::begin ( void  ) const
inline

◆ clear() [1/2]

template<class T, class Allocator = std::allocator<T>>
void Nice::List< T, Allocator >::clear ( void  )
inline

◆ clear() [2/2]

template<class T, class Allocator = std::allocator<T>>
void Nice::List< T, Allocator >::clear ( void  )
inline

◆ empty() [1/2]

template<class T, class Allocator = std::allocator<T>>
bool Nice::List< T, Allocator >::empty ( void  ) const
inline

◆ empty() [2/2]

template<class T, class Allocator = std::allocator<T>>
bool Nice::List< T, Allocator >::empty ( void  ) const
inline

◆ end() [1/4]

template<class T, class Allocator = std::allocator<T>>
iterator Nice::List< T, Allocator >::end ( void  )
inline

◆ end() [2/4]

template<class T, class Allocator = std::allocator<T>>
iterator Nice::List< T, Allocator >::end ( void  )
inline

◆ end() [3/4]

template<class T, class Allocator = std::allocator<T>>
const_iterator Nice::List< T, Allocator >::end ( void  ) const
inline

◆ end() [4/4]

template<class T, class Allocator = std::allocator<T>>
const_iterator Nice::List< T, Allocator >::end ( void  ) const
inline

◆ erase() [1/4]

template<class T, class Allocator = std::allocator<T>>
void Nice::List< T, Allocator >::erase ( iterator  pos)
inline

◆ erase() [2/4]

template<class T, class Allocator = std::allocator<T>>
void Nice::List< T, Allocator >::erase ( iterator  pos)
inline

◆ erase() [3/4]

template<class T, class Allocator = std::allocator<T>>
void Nice::List< T, Allocator >::erase ( iterator  begin,
iterator  end 
)
inline

◆ erase() [4/4]

template<class T, class Allocator = std::allocator<T>>
void Nice::List< T, Allocator >::erase ( iterator  begin,
iterator  end 
)
inline

◆ front() [1/4]

template<class T, class Allocator = std::allocator<T>>
T& Nice::List< T, Allocator >::front ( void  )
inline

◆ front() [2/4]

template<class T, class Allocator = std::allocator<T>>
T& Nice::List< T, Allocator >::front ( void  )
inline

◆ front() [3/4]

template<class T, class Allocator = std::allocator<T>>
const T& Nice::List< T, Allocator >::front ( void  ) const
inline

◆ front() [4/4]

template<class T, class Allocator = std::allocator<T>>
const T& Nice::List< T, Allocator >::front ( void  ) const
inline

◆ get_allocator() [1/2]

template<class T, class Allocator = std::allocator<T>>
allocator_type Nice::List< T, Allocator >::get_allocator ( void  ) const
inline

◆ get_allocator() [2/2]

template<class T, class Allocator = std::allocator<T>>
allocator_type Nice::List< T, Allocator >::get_allocator ( void  ) const
inline

◆ insert() [1/6]

template<class T, class Allocator = std::allocator<T>>
iterator Nice::List< T, Allocator >::insert ( iterator  pos,
const T &  u 
)
inline

◆ insert() [2/6]

template<class T, class Allocator = std::allocator<T>>
iterator Nice::List< T, Allocator >::insert ( iterator  pos,
const T &  u 
)
inline

◆ insert() [3/6]

template<class T, class Allocator = std::allocator<T>>
void Nice::List< T, Allocator >::insert ( iterator  pos,
size_type  n,
const T &  u 
)
inline

◆ insert() [4/6]

template<class T, class Allocator = std::allocator<T>>
void Nice::List< T, Allocator >::insert ( iterator  pos,
size_type  n,
const T &  u 
)
inline

◆ insert() [5/6]

template<class T, class Allocator = std::allocator<T>>
template<class InputIterator >
void Nice::List< T, Allocator >::insert ( iterator  pos,
InputIterator  begin,
InputIterator  end 
)
inline

◆ insert() [6/6]

template<class T, class Allocator = std::allocator<T>>
template<class InputIterator >
void Nice::List< T, Allocator >::insert ( iterator  pos,
InputIterator  begin,
InputIterator  end 
)
inline

◆ max_size() [1/2]

template<class T, class Allocator = std::allocator<T>>
size_type Nice::List< T, Allocator >::max_size ( void  ) const
inline

◆ max_size() [2/2]

template<class T, class Allocator = std::allocator<T>>
size_type Nice::List< T, Allocator >::max_size ( void  ) const
inline

◆ merge() [1/4]

template<class T, class Allocator = std::allocator<T>>
void Nice::List< T, Allocator >::merge ( Nice::List< T, Allocator > &  x)
inline

◆ merge() [2/4]

template<class T, class Allocator = std::allocator<T>>
void Nice::List< T, Allocator >::merge ( Nice::List< T, Allocator > &  x)
inline

◆ merge() [3/4]

template<class T, class Allocator = std::allocator<T>>
template<class Compare >
void Nice::List< T, Allocator >::merge ( Nice::List< T, Allocator > &  x,
Compare  comp 
)
inline

◆ merge() [4/4]

template<class T, class Allocator = std::allocator<T>>
template<class Compare >
void Nice::List< T, Allocator >::merge ( Nice::List< T, Allocator > &  x,
Compare  comp 
)
inline

◆ operator std::list< T, Allocator >() [1/2]

template<class T, class Allocator = std::allocator<T>>
Nice::List< T, Allocator >::operator std::list< T, Allocator > ( )
inline

◆ operator std::list< T, Allocator >() [2/2]

template<class T, class Allocator = std::allocator<T>>
Nice::List< T, Allocator >::operator std::list< T, Allocator > ( )
inline

◆ operator=() [1/2]

template<class T, class Allocator = std::allocator<T>>
Nice::List<T,Allocator>& Nice::List< T, Allocator >::operator= ( const Nice::List< T, Allocator > &  x)
inline

◆ operator=() [2/2]

template<class T, class Allocator = std::allocator<T>>
Nice::List<T,Allocator>& Nice::List< T, Allocator >::operator= ( const Nice::List< T, Allocator > &  x)
inline

◆ pop_back() [1/2]

template<class T, class Allocator = std::allocator<T>>
void Nice::List< T, Allocator >::pop_back ( void  )
inline

◆ pop_back() [2/2]

template<class T, class Allocator = std::allocator<T>>
void Nice::List< T, Allocator >::pop_back ( void  )
inline

◆ pop_front() [1/2]

template<class T, class Allocator = std::allocator<T>>
void Nice::List< T, Allocator >::pop_front ( void  )
inline

◆ pop_front() [2/2]

template<class T, class Allocator = std::allocator<T>>
void Nice::List< T, Allocator >::pop_front ( void  )
inline

◆ push_back() [1/2]

template<class T, class Allocator = std::allocator<T>>
void Nice::List< T, Allocator >::push_back ( const T &  u)
inline

◆ push_back() [2/2]

template<class T, class Allocator = std::allocator<T>>
void Nice::List< T, Allocator >::push_back ( const T &  u)
inline

◆ push_front() [1/2]

template<class T, class Allocator = std::allocator<T>>
void Nice::List< T, Allocator >::push_front ( const T &  u)
inline

◆ push_front() [2/2]

template<class T, class Allocator = std::allocator<T>>
void Nice::List< T, Allocator >::push_front ( const T &  u)
inline

◆ rbegin() [1/4]

template<class T, class Allocator = std::allocator<T>>
reverse_iterator Nice::List< T, Allocator >::rbegin ( void  )
inline

◆ rbegin() [2/4]

template<class T, class Allocator = std::allocator<T>>
reverse_iterator Nice::List< T, Allocator >::rbegin ( void  )
inline

◆ rbegin() [3/4]

template<class T, class Allocator = std::allocator<T>>
const_reverse_iterator Nice::List< T, Allocator >::rbegin ( void  ) const
inline

◆ rbegin() [4/4]

template<class T, class Allocator = std::allocator<T>>
const_reverse_iterator Nice::List< T, Allocator >::rbegin ( void  ) const
inline

◆ remove() [1/2]

template<class T, class Allocator = std::allocator<T>>
void Nice::List< T, Allocator >::remove ( const T &  value)
inline

◆ remove() [2/2]

template<class T, class Allocator = std::allocator<T>>
void Nice::List< T, Allocator >::remove ( const T &  value)
inline

◆ remove_if() [1/2]

template<class T, class Allocator = std::allocator<T>>
template<class Predicate >
void Nice::List< T, Allocator >::remove_if ( Predicate  pred)
inline

◆ remove_if() [2/2]

template<class T, class Allocator = std::allocator<T>>
template<class Predicate >
void Nice::List< T, Allocator >::remove_if ( Predicate  pred)
inline

◆ rend() [1/4]

template<class T, class Allocator = std::allocator<T>>
reverse_iterator Nice::List< T, Allocator >::rend ( void  )
inline

◆ rend() [2/4]

template<class T, class Allocator = std::allocator<T>>
reverse_iterator Nice::List< T, Allocator >::rend ( void  )
inline

◆ rend() [3/4]

template<class T, class Allocator = std::allocator<T>>
const_reverse_iterator Nice::List< T, Allocator >::rend ( void  ) const
inline

◆ rend() [4/4]

template<class T, class Allocator = std::allocator<T>>
const_reverse_iterator Nice::List< T, Allocator >::rend ( void  ) const
inline

◆ resize() [1/2]

template<class T, class Allocator = std::allocator<T>>
void Nice::List< T, Allocator >::resize ( size_type  n,
T  c = T() 
)
inline

◆ resize() [2/2]

template<class T, class Allocator = std::allocator<T>>
void Nice::List< T, Allocator >::resize ( size_type  n,
T  c = T() 
)
inline

◆ reverse() [1/2]

template<class T, class Allocator = std::allocator<T>>
void Nice::List< T, Allocator >::reverse ( void  )
inline

◆ reverse() [2/2]

template<class T, class Allocator = std::allocator<T>>
void Nice::List< T, Allocator >::reverse ( void  )
inline

◆ size() [1/2]

template<class T, class Allocator = std::allocator<T>>
size_type Nice::List< T, Allocator >::size ( void  ) const
inline

◆ size() [2/2]

template<class T, class Allocator = std::allocator<T>>
size_type Nice::List< T, Allocator >::size ( void  ) const
inline

◆ sort() [1/4]

template<class T, class Allocator = std::allocator<T>>
void Nice::List< T, Allocator >::sort ( void  )
inline

◆ sort() [2/4]

template<class T, class Allocator = std::allocator<T>>
void Nice::List< T, Allocator >::sort ( void  )
inline

◆ sort() [3/4]

template<class T, class Allocator = std::allocator<T>>
template<class Compare >
void Nice::List< T, Allocator >::sort ( Compare  comp)
inline

◆ sort() [4/4]

template<class T, class Allocator = std::allocator<T>>
template<class Compare >
void Nice::List< T, Allocator >::sort ( Compare  comp)
inline

◆ splice() [1/6]

template<class T, class Allocator = std::allocator<T>>
void Nice::List< T, Allocator >::splice ( iterator  position,
Nice::List< T, Allocator > &  x 
)
inline

◆ splice() [2/6]

template<class T, class Allocator = std::allocator<T>>
void Nice::List< T, Allocator >::splice ( iterator  position,
Nice::List< T, Allocator > &  x 
)
inline

◆ splice() [3/6]

template<class T, class Allocator = std::allocator<T>>
void Nice::List< T, Allocator >::splice ( iterator  position,
Nice::List< T, Allocator > &  x,
iterator  i 
)
inline

◆ splice() [4/6]

template<class T, class Allocator = std::allocator<T>>
void Nice::List< T, Allocator >::splice ( iterator  position,
Nice::List< T, Allocator > &  x,
iterator  i 
)
inline

◆ splice() [5/6]

template<class T, class Allocator = std::allocator<T>>
void Nice::List< T, Allocator >::splice ( iterator  position,
Nice::List< T, Allocator > &  x,
iterator  first,
iterator  last 
)
inline

◆ splice() [6/6]

template<class T, class Allocator = std::allocator<T>>
void Nice::List< T, Allocator >::splice ( iterator  position,
Nice::List< T, Allocator > &  x,
iterator  first,
iterator  last 
)
inline

◆ swap() [1/2]

template<class T, class Allocator = std::allocator<T>>
void Nice::List< T, Allocator >::swap ( Nice::List< T, Allocator > &  x)
inline

◆ swap() [2/2]

template<class T, class Allocator = std::allocator<T>>
void Nice::List< T, Allocator >::swap ( Nice::List< T, Allocator > &  x)
inline

◆ unique() [1/4]

template<class T, class Allocator = std::allocator<T>>
void Nice::List< T, Allocator >::unique ( void  )
inline

◆ unique() [2/4]

template<class T, class Allocator = std::allocator<T>>
void Nice::List< T, Allocator >::unique ( void  )
inline

◆ unique() [3/4]

template<class T, class Allocator = std::allocator<T>>
template<class BinaryPredicate >
void Nice::List< T, Allocator >::unique ( BinaryPredicate  binary_pred)
inline

◆ unique() [4/4]

template<class T, class Allocator = std::allocator<T>>
template<class BinaryPredicate >
void Nice::List< T, Allocator >::unique ( BinaryPredicate  binary_pred)
inline

Member Data Documentation

◆ m_mutex

template<class T, class Allocator = std::allocator<T>>
Nice::Mutex Nice::List< T, Allocator >::m_mutex
mutableprivate

◆ m_storage

template<class T, class Allocator = std::allocator<T>>
std::list< T, Allocator > Nice::List< T, Allocator >::m_storage
private
The documentation for this class was generated from the following file:
Generated on Mon Feb 18 2019 14:18:37 for TwiceAsNice by   doxygen 1.8.14