SourcePro® API Reference Guide

  
List of all members | Public Types | Public Member Functions | Related Functions
RWTValSortedDlist< T, C, A > Class Template Reference
SourcePro Core » Essential Tools Module » STL-based Collections

Maintains a sorted collection of values implemented as a doubly-linked list. More...

#include <rw/tvsrtdli.h>

Public Types

typedef container_type::allocator_type allocator_type
 
typedef container_type::const_iterator const_iterator
 
typedef container_type::const_pointer const_pointer
 
typedef container_type::const_reference const_reference
 
typedef container_type::const_reverse_iterator const_reverse_iterator
 
typedef std::list< T, A > container_type
 
typedef container_type::difference_type difference_type
 
typedef container_type::iterator iterator
 
typedef C key_compare
 
typedef container_type::pointer pointer
 
typedef container_type::reference reference
 
typedef container_type::reverse_iterator reverse_iterator
 
typedef container_type::size_type size_type
 
typedef C value_compare
 
typedef container_type::value_type value_type
 

Public Member Functions

 RWTValSortedDlist ()
 
 RWTValSortedDlist (const RWTValSortedDlist< T, C, A > &t)
 
 RWTValSortedDlist (const container_type &lst)
 
 RWTValSortedDlist (size_type n, const_reference val=value_type())
 
template<typename InputIterator >
 RWTValSortedDlist (InputIterator first, InputIterator last)
 
 RWTValSortedDlist (RWTValSortedDlist &&rhs)
 
 RWTValSortedDlist (container_type &&rhs)
 
void apply (void(*fn)(const_reference, void *), void *d) const
 
const_reference at (size_type i) const
 
iterator begin ()
 
const_iterator begin () const
 
const_iterator cbegin () const
 
const_iterator cend () const
 
void clear ()
 
bool contains (bool(*fn)(const_reference, void *), void *d) const
 
bool contains (const_reference a) const
 
const_reverse_iterator crbegin () const
 
const_reverse_iterator crend () const
 
iterator end ()
 
const_iterator end () const
 
size_type entries () const
 
iterator erase (iterator pos)
 
iterator erase (iterator first, iterator last)
 
bool find (bool(*fn)(const_reference, void *), void *d, reference k) const
 
bool find (const_reference a, reference k) const
 
reference first ()
 
const_reference first () const
 
size_type index (const_reference a) const
 
size_type index (bool(*fn)(const_reference, void *), void *d) const
 
bool insert (const_reference a)
 
iterator insert (iterator hint, const_reference val)
 
template<typename InputIterator >
void insert (InputIterator first, InputIterator last)
 
bool insert (value_type &&a)
 
iterator insert (iterator hint, value_type &&val)
 
size_type insert (const container_type &a)
 
bool isEmpty () const
 
bool isSorted () const
 
const_reference last () const
 
size_type merge (const RWTValSortedDlist< T, C, A > &coll)
 
size_type occurrencesOf (bool(*fn)(const_reference, void *), void *d) const
 
size_type occurrencesOf (const_reference a) const
 
const_reference operator() (size_type i) const
 
RWTValSortedDlist< T, C, A > & operator= (const RWTValSortedDlist< T, C, A > &rhs)
 
RWTValSortedDlist< T, C, A > & operator= (const container_type &rhs)
 
RWTValSortedDlist & operator= (RWTValSortedDlist &&rhs)
 
RWTValSortedDlist< T, C, A > & operator= (container_type &&rhs)
 
const_reference operator[] (size_type i) const
 
reverse_iterator rbegin ()
 
const_reverse_iterator rbegin () const
 
bool remove (bool(*fn)(const_reference, void *), void *d)
 
bool remove (const_reference a)
 
size_type removeAll (bool(*fn)(const_reference, void *), void *d)
 
size_type removeAll (const_reference a)
 
value_type removeAt (size_type i)
 
value_type removeFirst ()
 
value_type removeLast ()
 
reverse_iterator rend ()
 
const_reverse_iterator rend () const
 
container_type & std ()
 
const container_type & std () const
 
void swap (RWTValSortedDlist &rhs)
 

Related Functions

(Note that these are not member functions.)

template<class T , class C , class A >
bool operator!= (const RWTValSortedDlist< T, C, A > &lhs, const RWTValSortedDlist< T, C, A > &rhs)
 
template<class T , class C , class A >
bool operator!= (const RWTValSortedDlist< T, C, A > &lhs, const typename RWTValSortedDlist< T, C, A >::container_type &rhs)
 
template<class T , class C , class A >
bool operator!= (const typename RWTValSortedDlist< T, C, A >::container_type &lhs, const RWTValSortedDlist< T, C, A > &rhs)
 
template<class T , class C , class A >
bool operator< (const RWTValSortedDlist< T, C, A > &lhs, const RWTValSortedDlist< T, C, A > &rhs)
 
template<class T , class C , class A >
bool operator< (const RWTValSortedDlist< T, C, A > &lhs, const typename RWTValSortedDlist< T, C, A >::container_type &rhs)
 
template<class T , class C , class A >
bool operator< (const typename RWTValSortedDlist< T, C, A >::container_type &lhs, const RWTValSortedDlist< T, C, A > &rhs)
 
template<class T , class C , class A >
RWvostream & operator<< (RWvostream &strm, const RWTValSortedDlist< T, C, A > &coll)
 
template<class T , class C , class A >
RWFile & operator<< (RWFile &strm, const RWTValSortedDlist< T, C, A > &coll)
 
template<class T , class C , class A >
bool operator<= (const RWTValSortedDlist< T, C, A > &lhs, const RWTValSortedDlist< T, C, A > &rhs)
 
template<class T , class C , class A >
bool operator<= (const RWTValSortedDlist< T, C, A > &lhs, const typename RWTValSortedDlist< T, C, A >::container_type &rhs)
 
template<class T , class C , class A >
bool operator<= (const typename RWTValSortedDlist< T, C, A >::container_type &lhs, const RWTValSortedDlist< T, C, A > &rhs)
 
template<class T , class C , class A >
bool operator== (const RWTValSortedDlist< T, C, A > &lhs, const RWTValSortedDlist< T, C, A > &rhs)
 
template<class T , class C , class A >
bool operator== (const RWTValSortedDlist< T, C, A > &lhs, const typename RWTValSortedDlist< T, C, A >::container_type &rhs)
 
template<class T , class C , class A >
bool operator== (const typename RWTValSortedDlist< T, C, A >::container_type &lhs, const RWTValSortedDlist< T, C, A > &rhs)
 
template<class T , class C , class A >
bool operator> (const RWTValSortedDlist< T, C, A > &lhs, const RWTValSortedDlist< T, C, A > &rhs)
 
template<class T , class C , class A >
bool operator> (const RWTValSortedDlist< T, C, A > &lhs, const typename RWTValSortedDlist< T, C, A >::container_type &rhs)
 
template<class T , class C , class A >
bool operator> (const typename RWTValSortedDlist< T, C, A >::container_type &lhs, const RWTValSortedDlist< T, C, A > &rhs)
 
template<class T , class C , class A >
bool operator>= (const RWTValSortedDlist< T, C, A > &lhs, const RWTValSortedDlist< T, C, A > &rhs)
 
template<class T , class C , class A >
bool operator>= (const RWTValSortedDlist< T, C, A > &lhs, const typename RWTValSortedDlist< T, C, A >::container_type &rhs)
 
template<class T , class C , class A >
bool operator>= (const typename RWTValSortedDlist< T, C, A >::container_type &lhs, const RWTValSortedDlist< T, C, A > &rhs)
 
template<class T , class C , class A >
RWvistream & operator>> (RWvistream &strm, RWTValSortedDlist< T, C, A > &coll)
 
template<class T , class C , class A >
RWFile & operator>> (RWFile &strm, RWTValSortedDlist< T, C, A > &coll)
 
template<class T , class C , class A >
RWvistream & operator>> (RWvistream &strm, RWTValSortedDlist< T, C, A > *&p)
 
template<class T , class C , class A >
RWFile & operator>> (RWFile &strm, RWTValSortedDlist< T, C, A > *&p)
 

Detailed Description

template<class T, class C = std::less<T>, class A = std::allocator<T>>
class RWTValSortedDlist< T, C, A >

This class maintains an always-sorted collection of values, implemented as a doubly-linked list.

Class T is the type of items in the collection. Class A is an allocator of objects of class T. For more information about using custom allocators, please see the Essential Tools Module User's Guide.

The value type must have operator== and operator< defined. This requirement is imposed by the C++ Standard Library.

Synopsis
#include <rw/tvsrtdli.h>
RWTValSortedDlist<T,C,A> srtdlist;
See also

RWTValSortedVector is an alternative always-sorted collections. RWTValDlist is an unsorted doubly-linked list of values.

Class std::list<T,A> is the C++ Standard Library collection that serves as the underlying implementation for this class.

Persistence
Isomorphic
Example
//
// tvsdldat.cpp
//
#include <iostream>
#include <functional>
#include <rw/tvsrtdli.h>
#include <rw/tools/datetime.h>
int main ()
{
RWTValSortedDlist<RWDateTime, std::less<RWDateTime> > lst;
lst.insert(RWDateTime("Aug 10, 1991", RWDateTime::setDate));
lst.insert(RWDateTime("Aug 9, 1991", RWDateTime::setDate));
lst.insert(RWDateTime("Sep 1, 1991", RWDateTime::setDate));
lst.insert(RWDateTime("May 14, 1990", RWDateTime::setDate));
lst.insert(RWDateTime("Sep 1, 1991", RWDateTime::setDate)); // Add a duplicate
lst.insert(RWDateTime("June 2, 1991", RWDateTime::setDate));
for (size_t i = 0; i < lst.entries (); ++i)
std::cout << lst[i].asString('x') << " ";
std::cout << "\n\n";
return 0;
}

Program Output:

05/14/90 06/02/91 08/09/91 08/10/91 09/01/91 09/01/91

Member Typedef Documentation

template<class T, class C = std::less<T>, class A = std::allocator<T>>
typedef container_type::allocator_type RWTValSortedDlist< T, C, A >::allocator_type

A type representing the allocator type for the container.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
typedef container_type::const_iterator RWTValSortedDlist< T, C, A >::const_iterator

A type that provides a const bidirectional iterator over the elements in the container.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
typedef container_type::const_pointer RWTValSortedDlist< T, C, A >::const_pointer

A type that provides a const pointer to an element in the container.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
typedef container_type::const_reference RWTValSortedDlist< T, C, A >::const_reference

A type that provides a const reference to an element in the container.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
typedef container_type::const_reverse_iterator RWTValSortedDlist< T, C, A >::const_reverse_iterator

A type that provides a const bidirectional, reverse-order iterator over the elements in the container.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
typedef std::list<T, A> RWTValSortedDlist< T, C, A >::container_type

A type representing the underlying implementation container.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
typedef container_type::difference_type RWTValSortedDlist< T, C, A >::difference_type

A signed integral type used to indicate the distance between two valid iterators on the same container.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
typedef container_type::iterator RWTValSortedDlist< T, C, A >::iterator

A type that provides a bidirectional iterator over the elements in the container.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
typedef C RWTValSortedDlist< T, C, A >::key_compare

A type representing the comparison function.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
typedef container_type::pointer RWTValSortedDlist< T, C, A >::pointer

A type that provides a pointer to an element in the container.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
typedef container_type::reference RWTValSortedDlist< T, C, A >::reference

A type that provides a reference to an element in the container.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
typedef container_type::reverse_iterator RWTValSortedDlist< T, C, A >::reverse_iterator

A type that provides a bidirectional, reverse-order iterator over the elements in the container.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
typedef container_type::size_type RWTValSortedDlist< T, C, A >::size_type

An unsigned integral type used for counting the number of elements in the container.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
typedef C RWTValSortedDlist< T, C, A >::value_compare

A type representing the comparison function.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
typedef container_type::value_type RWTValSortedDlist< T, C, A >::value_type

A type representing the container's data type.

Constructor & Destructor Documentation

template<class T, class C = std::less<T>, class A = std::allocator<T>>
RWTValSortedDlist< T, C, A >::RWTValSortedDlist ( )
inline

Constructs an empty doubly-linked list.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
RWTValSortedDlist< T, C, A >::RWTValSortedDlist ( const RWTValSortedDlist< T, C, A > &  t)
inline

Copy constructor.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
RWTValSortedDlist< T, C, A >::RWTValSortedDlist ( const container_type &  lst)
inline

Constructs a doubly-linked list by copying and sorting all elements of lst.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
RWTValSortedDlist< T, C, A >::RWTValSortedDlist ( size_type  n,
const_reference  val = value_type() 
)
inline

Constructs a doubly-linked list with n elements, each initialized to val.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
template<typename InputIterator >
RWTValSortedDlist< T, C, A >::RWTValSortedDlist ( InputIterator  first,
InputIterator  last 
)
inline

Constructs a doubly-linked list by copying elements from the range [first, last).

InputIterator is an input iterator type that points to elements that are convertible to value_type objects.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
RWTValSortedDlist< T, C, A >::RWTValSortedDlist ( RWTValSortedDlist< T, C, A > &&  rhs)
inline

Move constructor. The constructed instance takes ownership of the data owned by rhs.

Condition:
This method is available only on platforms with rvalue reference support.
template<class T, class C = std::less<T>, class A = std::allocator<T>>
RWTValSortedDlist< T, C, A >::RWTValSortedDlist ( container_type &&  rhs)
inline

Move constructor. The constructed instance sorts and takes ownership of the data owned by rhs.

Condition:
This method is available only on platforms with rvalue reference support.

Member Function Documentation

template<class T, class C = std::less<T>, class A = std::allocator<T>>
void RWTValSortedDlist< T, C, A >::apply ( void(*)(const_reference, void *)  fn,
void *  d 
) const
inline

Invokes the function pointer fn on each item in the collection. Client data may be passed through parameter d.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
const_reference RWTValSortedDlist< T, C, A >::at ( size_type  i) const
inline

Returns a reference to the i th element of self.

Exceptions
RWBoundsErrThrown if index i is not between 0 and one less than the number of entries in self.
template<class T, class C = std::less<T>, class A = std::allocator<T>>
iterator RWTValSortedDlist< T, C, A >::begin ( )
inline

Returns an iterator referring to the first element in the container.

If the container is empty, returns end().

template<class T, class C = std::less<T>, class A = std::allocator<T>>
const_iterator RWTValSortedDlist< T, C, A >::begin ( ) const
inline

Returns an iterator referring to the first element in the container.

If the container is empty, returns end().

template<class T, class C = std::less<T>, class A = std::allocator<T>>
const_iterator RWTValSortedDlist< T, C, A >::cbegin ( ) const
inline

Returns an iterator referring to the first element in the container.

If the container is empty, returns end().

template<class T, class C = std::less<T>, class A = std::allocator<T>>
const_iterator RWTValSortedDlist< T, C, A >::cend ( ) const
inline

Returns an iterator referring to the element after the last element in the container.

Dereferencing the iterator returned by this function results in undefined behavior.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
void RWTValSortedDlist< T, C, A >::clear ( void  )
inline

Clears the collection by removing all items from self. Each item has its destructor called.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
bool RWTValSortedDlist< T, C, A >::contains ( bool(*)(const_reference, void *)  fn,
void *  d 
) const
inline

Returns true if there exists an element t in self such that the expression ((*fn)(t,d)) is true, otherwise returns false. Client data may be passed through parameter d.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
bool RWTValSortedDlist< T, C, A >::contains ( const_reference  a) const
inline

Returns true if there exists an element t in self such that the expression (t == a) is true, otherwise returns false.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
const_reverse_iterator RWTValSortedDlist< T, C, A >::crbegin ( ) const
inline

Returns an iterator referring to the last element in the container.

If the container is empty, returns rend().

template<class T, class C = std::less<T>, class A = std::allocator<T>>
const_reverse_iterator RWTValSortedDlist< T, C, A >::crend ( ) const
inline

Returns an iterator referring to the element before the first element in the container.

Dereferencing the iterator returned by this function results in undefined behavior.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
iterator RWTValSortedDlist< T, C, A >::end ( )
inline

Returns an iterator referring to the element after the last element in the container.

Dereferencing the iterator returned by this function results in undefined behavior.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
const_iterator RWTValSortedDlist< T, C, A >::end ( ) const
inline

Returns an iterator referring to the element after the last element in the container.

Dereferencing the iterator returned by this function results in undefined behavior.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
size_type RWTValSortedDlist< T, C, A >::entries ( void  ) const
inline

Returns the number of elements in self.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
iterator RWTValSortedDlist< T, C, A >::erase ( iterator  pos)
inline

Removes the item pointed to by pos from the collection. Returns an iterator that points to the next item in the collection, or end() if the last item in the collection was removed.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
iterator RWTValSortedDlist< T, C, A >::erase ( iterator  first,
iterator  last 
)
inline

Removes the items in the range [first, last) from the collection. Returns an iterator that points to the next item in the collection, or end() if the last item in the collection was removed.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
bool RWTValSortedDlist< T, C, A >::find ( bool(*)(const_reference, void *)  fn,
void *  d,
reference  k 
) const
inline

If there exists an element t in self such that the expression ((*fn)(t,d)) is true, assigns t to k and returns true. Otherwise, returns false and leaves the value of k unchanged. Client data may be passed through parameter d.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
bool RWTValSortedDlist< T, C, A >::find ( const_reference  a,
reference  k 
) const
inline

If there exists an element t in self such that the expression (t == a) is true, assigns t to k and returns true. Otherwise, returns false and leaves the value of k unchanged.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
reference RWTValSortedDlist< T, C, A >::first ( void  )
inline

Returns a reference to the first element of self.

Calling this function on an empty collection results in undefined behavior.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
const_reference RWTValSortedDlist< T, C, A >::first ( void  ) const
inline

Returns a reference to the first element of self.

Calling this function on an empty collection results in undefined behavior.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
size_type RWTValSortedDlist< T, C, A >::index ( const_reference  a) const

Returns the position of the first item t in self such that (t == a), or returns RW_NPOS if no such item exists.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
size_type RWTValSortedDlist< T, C, A >::index ( bool(*)(const_reference, void *)  fn,
void *  d 
) const

Returns the position of the first item t in self such that ((*fn)(t,d)) is true, or returns RW_NPOS if no such item exists. Client data may be passed through parameter d.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
bool RWTValSortedDlist< T, C, A >::insert ( const_reference  a)
inline

Adds the item a to self. The collection remains sorted. Returns true.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
iterator RWTValSortedDlist< T, C, A >::insert ( iterator  hint,
const_reference  val 
)
inline

Inserts val into self. Returns an iterator to the new item.

The hint parameter indicates where in the collection the new value should be inserted. This value is only a hint, and will be ignored if the value should be inserted at a different location according to the containers comparison object.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
template<typename InputIterator >
void RWTValSortedDlist< T, C, A >::insert ( InputIterator  first,
InputIterator  last 
)
inline

Inserts the elements in the range [first, last) into self.

InputIterator is an input iterator type that points to elements that are convertible to value_type objects.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
bool RWTValSortedDlist< T, C, A >::insert ( value_type &&  a)
inline

Adds the item a to self. The collection remains sorted. Returns true.

Condition:
This method is available only on platforms with rvalue reference support.
template<class T, class C = std::less<T>, class A = std::allocator<T>>
iterator RWTValSortedDlist< T, C, A >::insert ( iterator  hint,
value_type &&  val 
)
inline

Inserts val into self. Returns an iterator to the new item.

The hint parameter indicates where in the collection the new value should be inserted. This value is only a hint, and will be ignored if the value should be inserted at a different location according to the containers comparison object.

Condition:
This method is available only on platforms with rvalue reference support.
template<class T, class C = std::less<T>, class A = std::allocator<T>>
size_type RWTValSortedDlist< T, C, A >::insert ( const container_type &  a)

Adds the items from a to self, preserving order. Returns the number of items inserted into self.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
bool RWTValSortedDlist< T, C, A >::isEmpty ( ) const
inline

Returns true if there are no items in the collection, otherwise false.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
bool RWTValSortedDlist< T, C, A >::isSorted ( ) const
inline

Returns true if the collection is sorted relative to the supplied comparator object, otherwise false.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
const_reference RWTValSortedDlist< T, C, A >::last ( void  ) const
inline

Returns a reference to the last item in the collection.

Calling this function on an empty collection results in undefined behavior.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
size_type RWTValSortedDlist< T, C, A >::merge ( const RWTValSortedDlist< T, C, A > &  coll)

Inserts all elements of dl into self, preserving sorted order.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
size_type RWTValSortedDlist< T, C, A >::occurrencesOf ( bool(*)(const_reference, void *)  fn,
void *  d 
) const
inline

Returns the number of elements t in self such that the expression ((*fn)(t,d)) is true. Client data may be passed through parameter d.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
size_type RWTValSortedDlist< T, C, A >::occurrencesOf ( const_reference  a) const
inline

Returns the number of elements t in self such that the expression (t == a) is true.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
const_reference RWTValSortedDlist< T, C, A >::operator() ( size_type  i) const
inline

Returns a reference to the i th element of self. Index i should be between 0 and one less than the number of entries, otherwise the results are undefined.

Note
No bounds checking is performed.
template<class T, class C = std::less<T>, class A = std::allocator<T>>
RWTValSortedDlist<T, C, A>& RWTValSortedDlist< T, C, A >::operator= ( const RWTValSortedDlist< T, C, A > &  rhs)
inline

Destroys all elements of self and replaces them by copying (and sorting, if necessary) all elements of rhs.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
RWTValSortedDlist<T, C, A>& RWTValSortedDlist< T, C, A >::operator= ( const container_type &  rhs)
inline

Destroys all elements of self and replaces them by copying (and sorting, if necessary) all elements of rhs.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
RWTValSortedDlist& RWTValSortedDlist< T, C, A >::operator= ( RWTValSortedDlist< T, C, A > &&  rhs)
inline

Move assignment. Self takes ownership of the data owned by rhs.

Condition:
This method is available only on platforms with rvalue reference support.
template<class T, class C = std::less<T>, class A = std::allocator<T>>
RWTValSortedDlist<T, C, A>& RWTValSortedDlist< T, C, A >::operator= ( container_type &&  rhs)
inline

Move assignment. Self sorts and takes ownership of the data owned by rhs.

Condition:
This method is available only on platforms with rvalue reference support.
template<class T, class C = std::less<T>, class A = std::allocator<T>>
const_reference RWTValSortedDlist< T, C, A >::operator[] ( size_type  i) const
inline

Returns a reference to the i th element of self.

Exceptions
RWBoundsErrThrown if index i is not between 0 and one less than the number of entries in self.
template<class T, class C = std::less<T>, class A = std::allocator<T>>
reverse_iterator RWTValSortedDlist< T, C, A >::rbegin ( )
inline

Returns an iterator referring to the last element in the container.

If the container is empty, returns rend().

template<class T, class C = std::less<T>, class A = std::allocator<T>>
const_reverse_iterator RWTValSortedDlist< T, C, A >::rbegin ( ) const
inline

Returns an iterator referring to the last element in the container.

If the container is empty, returns rend().

template<class T, class C = std::less<T>, class A = std::allocator<T>>
bool RWTValSortedDlist< T, C, A >::remove ( bool(*)(const_reference, void *)  fn,
void *  d 
)
inline

Removes the first element t in self such that the expression ((*fn)(t,d)) is true and returns true. Returns false if there is no such element. Client data may be passed through parameter d.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
bool RWTValSortedDlist< T, C, A >::remove ( const_reference  a)
inline

Removes the first element t in self such that the expression (t == a) is true and returns true. Returns false if there is no such element.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
size_type RWTValSortedDlist< T, C, A >::removeAll ( bool(*)(const_reference, void *)  fn,
void *  d 
)
inline

Removes all elements t in self such that the expression ((*fn)(t,d)) is true. Returns the number of items removed. Client data may be passed through parameter d.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
size_type RWTValSortedDlist< T, C, A >::removeAll ( const_reference  a)

Removes all elements t in self such that the expression (t == a) is true. Returns the number of items removed.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
value_type RWTValSortedDlist< T, C, A >::removeAt ( size_type  i)

Removes and returns the item at position i in self.

Exceptions
RWBoundsErrThrown if index i is not between 0 and one less than the number of entries in the collection.
template<class T, class C = std::less<T>, class A = std::allocator<T>>
value_type RWTValSortedDlist< T, C, A >::removeFirst ( )
inline

Removes and returns the first item in the collection.

Calling this function on an empty collection results in undefined behavior.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
value_type RWTValSortedDlist< T, C, A >::removeLast ( )
inline

Removes and returns the last item in the collection.

Calling this function on an empty collection results in undefined behavior.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
reverse_iterator RWTValSortedDlist< T, C, A >::rend ( )
inline

Returns an iterator referring to the element before the first element in the container.

Dereferencing the iterator returned by this function results in undefined behavior.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
const_reverse_iterator RWTValSortedDlist< T, C, A >::rend ( ) const
inline

Returns an iterator referring to the element before the first element in the container.

Dereferencing the iterator returned by this function results in undefined behavior.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
container_type& RWTValSortedDlist< T, C, A >::std ( )
inline

Returns a reference to the underlying C++ Standard Library collection that serves as the implementation for self. It is the application's responsibility to not violate the ordering of the elements within the collection.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
const container_type& RWTValSortedDlist< T, C, A >::std ( ) const
inline

Returns a reference to the underlying C++ Standard Library collection that serves as the implementation for self. It is the application's responsibility to not violate the ordering of the elements within the collection.

template<class T, class C = std::less<T>, class A = std::allocator<T>>
void RWTValSortedDlist< T, C, A >::swap ( RWTValSortedDlist< T, C, A > &  rhs)
inline

Swaps the data owned by self with the data owned by rhs.

Friends And Related Function Documentation

template<class T , class C , class A >
bool operator!= ( const RWTValSortedDlist< T, C, A > &  lhs,
const RWTValSortedDlist< T, C, A > &  rhs 
)
related

Equivalent to !(lhs == rhs).

template<class T , class C , class A >
bool operator!= ( const RWTValSortedDlist< T, C, A > &  lhs,
const typename RWTValSortedDlist< T, C, A >::container_type &  rhs 
)
related

Equivalent to !(lhs == rhs).

template<class T , class C , class A >
bool operator!= ( const typename RWTValSortedDlist< T, C, A >::container_type &  lhs,
const RWTValSortedDlist< T, C, A > &  rhs 
)
related

Equivalent to !(lhs == rhs).

template<class T , class C , class A >
bool operator< ( const RWTValSortedDlist< T, C, A > &  lhs,
const RWTValSortedDlist< T, C, A > &  rhs 
)
related

Returns true if lhs is lexicographically less than rhs, otherwise false. Assumes that type T has well-defined less-than semantics.

template<class T , class C , class A >
bool operator< ( const RWTValSortedDlist< T, C, A > &  lhs,
const typename RWTValSortedDlist< T, C, A >::container_type &  rhs 
)
related

Returns true if lhs is lexicographically less than rhs, otherwise false. Assumes that type T has well-defined less-than semantics.

template<class T , class C , class A >
bool operator< ( const typename RWTValSortedDlist< T, C, A >::container_type &  lhs,
const RWTValSortedDlist< T, C, A > &  rhs 
)
related

Returns true if lhs is lexicographically less than rhs, otherwise false. Assumes that type T has well-defined less-than semantics.

template<class T , class C , class A >
RWvostream & operator<< ( RWvostream &  strm,
const RWTValSortedDlist< T, C, A > &  coll 
)
related

Saves the collection coll onto the output stream strm, or a reference to it if it has already been saved.

template<class T , class C , class A >
RWFile & operator<< ( RWFile &  strm,
const RWTValSortedDlist< T, C, A > &  coll 
)
related

Saves the collection coll onto the RWFile strm, or a reference to it if it has already been saved.

template<class T , class C , class A >
bool operator<= ( const RWTValSortedDlist< T, C, A > &  lhs,
const RWTValSortedDlist< T, C, A > &  rhs 
)
related

Equivalent to !(rhs < lhs).

template<class T , class C , class A >
bool operator<= ( const RWTValSortedDlist< T, C, A > &  lhs,
const typename RWTValSortedDlist< T, C, A >::container_type &  rhs 
)
related

Equivalent to !(rhs < lhs).

template<class T , class C , class A >
bool operator<= ( const typename RWTValSortedDlist< T, C, A >::container_type &  lhs,
const RWTValSortedDlist< T, C, A > &  rhs 
)
related

Equivalent to !(rhs < lhs).

template<class T , class C , class A >
bool operator== ( const RWTValSortedDlist< T, C, A > &  lhs,
const RWTValSortedDlist< T, C, A > &  rhs 
)
related

Returns true if lhs and rhs are equal, otherwise false. Two collections are equal if both have the same number of entries, and iterating through both collections produces individual elements that, in turn, compare equal to each other.

template<class T , class C , class A >
bool operator== ( const RWTValSortedDlist< T, C, A > &  lhs,
const typename RWTValSortedDlist< T, C, A >::container_type &  rhs 
)
related

Returns true if lhs and rhs are equal, otherwise false. Two collections are equal if both have the same number of entries, and iterating through both collections produces individual elements that, in turn, compare equal to each other.

template<class T , class C , class A >
bool operator== ( const typename RWTValSortedDlist< T, C, A >::container_type &  lhs,
const RWTValSortedDlist< T, C, A > &  rhs 
)
related

Returns true if lhs and rhs are equal, otherwise false. Two collections are equal if both have the same number of entries, and iterating through both collections produces individual elements that, in turn, compare equal to each other.

template<class T , class C , class A >
bool operator> ( const RWTValSortedDlist< T, C, A > &  lhs,
const RWTValSortedDlist< T, C, A > &  rhs 
)
related

Equivalent to (rhs < lhs).

template<class T , class C , class A >
bool operator> ( const RWTValSortedDlist< T, C, A > &  lhs,
const typename RWTValSortedDlist< T, C, A >::container_type &  rhs 
)
related

Equivalent to (rhs < lhs).

template<class T , class C , class A >
bool operator> ( const typename RWTValSortedDlist< T, C, A >::container_type &  lhs,
const RWTValSortedDlist< T, C, A > &  rhs 
)
related

Equivalent to (rhs < lhs).

template<class T , class C , class A >
bool operator>= ( const RWTValSortedDlist< T, C, A > &  lhs,
const RWTValSortedDlist< T, C, A > &  rhs 
)
related

Equivalent to !(lhs < rhs).

template<class T , class C , class A >
bool operator>= ( const RWTValSortedDlist< T, C, A > &  lhs,
const typename RWTValSortedDlist< T, C, A >::container_type &  rhs 
)
related

Equivalent to !(lhs < rhs).

template<class T , class C , class A >
bool operator>= ( const typename RWTValSortedDlist< T, C, A >::container_type &  lhs,
const RWTValSortedDlist< T, C, A > &  rhs 
)
related

Equivalent to !(lhs < rhs).

template<class T , class C , class A >
RWvistream & operator>> ( RWvistream &  strm,
RWTValSortedDlist< T, C, A > &  coll 
)
related

Restores the contents of the collection coll from the input stream strm.

template<class T , class C , class A >
RWFile & operator>> ( RWFile &  strm,
RWTValSortedDlist< T, C, A > &  coll 
)
related

Restores the contents of the collection coll from the RWFile strm.

template<class T , class C , class A >
RWvistream & operator>> ( RWvistream &  strm,
RWTValSortedDlist< T, C, A > *&  p 
)
related

Looks at the next object on the input stream strm and either creates a new collection off the heap and sets p to point to it, or sets p to point to a previously read instance. If a collection is created off the heap, then the application is responsible for deleting it.

template<class T , class C , class A >
RWFile & operator>> ( RWFile &  strm,
RWTValSortedDlist< T, C, A > *&  p 
)
related

Looks at the next object on the RWFile strm and either creates a new collection off the heap and sets p to point to it, or sets p to point to a previously read instance. If a collection is created off the heap, then the application is responsible for deleting it.

Copyright © 2023 Rogue Wave Software, Inc., a Perforce company. All Rights Reserved.