SourcePro® 2024.1 |
SourcePro® API Reference Guide |
A pointer-based collection of values, implemented as a doubly-linked list. More...
#include <rw/tpdlist.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 const T * | const_value |
typedef std::list< T *, A > | container_type |
typedef container_type::difference_type | difference_type |
typedef container_type::iterator | iterator |
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 container_type::value_type | value_type |
Friends | |
class | RWTPtrDlistConstIterator< T, A > |
class | RWTPtrDlistIterator< T, A > |
Related Symbols | |
(Note that these are not member symbols.) | |
template<class T , class A > | |
bool | operator!= (const RWTPtrDlist< T, A > &lhs, const RWTPtrDlist< T, A > &rhs) |
template<class T , class A > | |
bool | operator!= (const RWTPtrDlist< T, A > &lhs, const typename RWTPtrDlist< T, A >::container_type &rhs) |
template<class T , class A > | |
bool | operator!= (const typename RWTPtrDlist< T, A >::container_type &lhs, const RWTPtrDlist< T, A > &rhs) |
template<class T , class A > | |
bool | operator< (const RWTPtrDlist< T, A > &lhs, const RWTPtrDlist< T, A > &rhs) |
template<class T , class A > | |
bool | operator< (const RWTPtrDlist< T, A > &lhs, const typename RWTPtrDlist< T, A >::container_type &rhs) |
template<class T , class A > | |
bool | operator< (const typename RWTPtrDlist< T, A >::container_type &lhs, const RWTPtrDlist< T, A > &rhs) |
template<class T , class A > | |
RWFile & | operator<< (RWFile &strm, const RWTPtrDlist< T, A > &coll) |
template<class T , class A > | |
RWvostream & | operator<< (RWvostream &strm, const RWTPtrDlist< T, A > &coll) |
template<class T , class A > | |
bool | operator<= (const RWTPtrDlist< T, A > &lhs, const RWTPtrDlist< T, A > &rhs) |
template<class T , class A > | |
bool | operator<= (const RWTPtrDlist< T, A > &lhs, const typename RWTPtrDlist< T, A >::container_type &rhs) |
template<class T , class A > | |
bool | operator<= (const typename RWTPtrDlist< T, A >::container_type &lhs, const RWTPtrDlist< T, A > &rhs) |
template<class T , class A > | |
bool | operator== (const RWTPtrDlist< T, A > &lhs, const RWTPtrDlist< T, A > &rhs) |
template<class T , class A > | |
bool | operator== (const RWTPtrDlist< T, A > &lhs, const typename RWTPtrDlist< T, A >::container_type &rhs) |
template<class T , class A > | |
bool | operator== (const typename RWTPtrDlist< T, A >::container_type &lhs, const RWTPtrDlist< T, A > &rhs) |
template<class T , class A > | |
bool | operator> (const RWTPtrDlist< T, A > &lhs, const RWTPtrDlist< T, A > &rhs) |
template<class T , class A > | |
bool | operator> (const RWTPtrDlist< T, A > &lhs, const typename RWTPtrDlist< T, A >::container_type &rhs) |
template<class T , class A > | |
bool | operator> (const typename RWTPtrDlist< T, A >::container_type &lhs, const RWTPtrDlist< T, A > &rhs) |
template<class T , class A > | |
bool | operator>= (const RWTPtrDlist< T, A > &lhs, const RWTPtrDlist< T, A > &rhs) |
template<class T , class A > | |
bool | operator>= (const RWTPtrDlist< T, A > &lhs, const typename RWTPtrDlist< T, A >::container_type &rhs) |
template<class T , class A > | |
bool | operator>= (const typename RWTPtrDlist< T, A >::container_type &lhs, const RWTPtrDlist< T, A > &rhs) |
template<class T , class A > | |
RWFile & | operator>> (RWFile &strm, RWTPtrDlist< T, A > &coll) |
template<class T , class A > | |
RWFile & | operator>> (RWFile &strm, RWTPtrDlist< T, A > *&p) |
template<class T , class A > | |
RWvistream & | operator>> (RWvistream &strm, RWTPtrDlist< T, A > &coll) |
template<class T , class A > | |
RWvistream & | operator>> (RWvistream &strm, RWTPtrDlist< T, A > *&p) |
This class maintains a pointer-based collection of values, implemented as a doubly-linked list. Class T
is the type pointed to by the 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.
Classes RWTPtrDeque, RWTPtrSlist, and RWTPtrOrderedVector also provide a Rogue Wave pointer-based interface to C++ Standard Library sequence collections.
Class std::list<T*,A> is the C++ Standard Library collection that serves as the underlying implementation for this class.
In this example, a pointer-based doubly-linked list of user type Dog
is exercised.
Program Output:
typedef container_type::allocator_type RWTPtrDlist< T, A >::allocator_type |
A type representing the allocator type for the container.
typedef container_type::const_iterator RWTPtrDlist< T, A >::const_iterator |
A type that provides a const
bidirectional iterator over the elements in the container.
typedef container_type::const_pointer RWTPtrDlist< T, A >::const_pointer |
A type that provides a const
pointer to an element in the container.
typedef container_type::const_reference RWTPtrDlist< T, A >::const_reference |
A type that provides a const
reference to an element in the container.
typedef container_type::const_reverse_iterator RWTPtrDlist< T, A >::const_reverse_iterator |
A type that provides a const
bidirectional, reverse-order iterator over the elements in the container.
typedef const T* RWTPtrDlist< T, A >::const_value |
const T*
instead. A type representing the container's const
data type. typedef std::list<T*, A> RWTPtrDlist< T, A >::container_type |
A type representing the underlying implementation container.
typedef container_type::difference_type RWTPtrDlist< T, A >::difference_type |
A signed integral type used to indicate the distance between two valid iterators on the same container.
typedef container_type::iterator RWTPtrDlist< T, A >::iterator |
A type that provides a bidirectional iterator over the elements in the container.
typedef container_type::pointer RWTPtrDlist< T, A >::pointer |
A type that provides a pointer to an element in the container.
typedef container_type::reference RWTPtrDlist< T, A >::reference |
A type that provides a reference to an element in the container.
typedef container_type::reverse_iterator RWTPtrDlist< T, A >::reverse_iterator |
A type that provides a bidirectional, reverse-order iterator over the elements in the container.
typedef container_type::size_type RWTPtrDlist< T, A >::size_type |
An unsigned integral type used for counting the number of elements in the container.
typedef container_type::value_type RWTPtrDlist< T, A >::value_type |
A type representing the container's data type.
|
inline |
Constructs an empty, doubly-linked list.
|
inline |
Constructs a pointer-based doubly linked list by copying all elements of lst.
|
inline |
Copy constructor.
|
inline |
Move constructor. The constructed list takes ownership of the data owned by lst.
|
inline |
Move constructor. The constructed list takes ownership of the data owned by lst.
|
inline |
Constructs a doubly-linked list with n elements, each initialized to a.
|
inline |
Constructs a double-ended queue 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.
|
inline |
Adds the item a to the end of the collection.
|
inline |
Invokes the function pointer fn on each item in the collection. Client data may be passed through parameter d.
|
inline |
Invokes the function pointer fn on each item in the collection. Client data may be passed through parameter d.
|
inline |
Invokes the function pointer fn on each item in the collection. Client data may be passed through parameter d.
|
inline |
Copies each element in the range [first, last) into self, replacing any existing items.
InputIterator
is an input iterator type that points to elements that are convertible to value_type objects.
|
inline |
Returns a reference to the i th element of self.
RWBoundsErr | Thrown if index i is not between 0 and one less than the number of entries in self. |
|
inline |
Returns a reference to the i th element of self.
RWBoundsErr | Thrown if index i is not between 0 and one less than the number of entries in self. |
|
inline |
Returns an iterator referring to the first element in the container.
If the container is empty, returns end().
|
inline |
Returns an iterator referring to the first element in the container.
If the container is empty, returns end().
|
inline |
Returns an iterator referring to the first element in the container.
If the container is empty, returns 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.
|
inline |
Clears the collection by removing all items from self.
|
inline |
Removes all items from the collection and uses operator delete
to destroy the objects pointed to by those items. Do not use this method if multiple pointers to the same object are stored.
|
inline |
Returns true
if there exists an element t
in self such that the expression ((*fn)(t,d))
is true
, otherwise false
. Client data may be passed through parameter d.
|
inline |
Returns true
if there exists an element t
in self such that the expression (*t == *a)
is true
, otherwise false
.
|
inline |
Returns an iterator referring to the last element in the container.
If the container is empty, returns 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.
|
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.
|
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.
|
inline |
Returns the number of elements in self.
|
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.
|
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.
|
inline |
If there exists an element t
in self such that the expression ((*fn)(t,d))
is true
, returns t
, otherwise returns rwnil. Client data may be passed through parameter d.
|
inline |
If there exists an element t
in self such that the expression (*t == *a)
is true
, returns t
, otherwise returns rwnil.
|
inline |
Returns a reference to the first item in the collection.
Calling this function on an empty collection results in undefined behavior.
|
inline |
Returns a reference to the first item in the collection.
Calling this function on an empty collection results in undefined behavior.
|
inline |
Removes and returns the first item in the collection.
Calling this function on an empty collection results in undefined behavior.
size_type RWTPtrDlist< T, A >::index | ( | bool(* | fn )(const T *, void *), |
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.
size_type RWTPtrDlist< T, A >::index | ( | const T * | 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.
|
inline |
Inserts the elements in the range [first, last) into self before the element at position pos.
InputIterator
is an input iterator type that points to elements that are convertible to value_type objects.
|
inline |
Inserts n instances of val into self before the element at position pos.
|
inline |
Inserts val into self before the element at position pos. Returns an iterator for the newly inserted element.
|
inline |
Adds the item a to the end of the collection. Returns true
.
|
inline |
Inserts the item a in front of the item at position i in self.
RWBoundsErr | Thrown if this position is not between zero and the number of entries in the collection. |
|
inline |
Returns true
if there are no items in the collection, false
otherwise.
|
inline |
Returns a reference to the last item in the collection.
Calling this function on an empty collection results in undefined behavior.
|
inline |
Returns a reference to the last item in the collection.
Calling this function on an empty collection results in undefined behavior.
|
inline |
Returns a reference to the maximum element in self.
|
inline |
Returns a reference to the maximum element in self.
|
inline |
Returns a reference to the minimum element in self.
|
inline |
Returns a reference to the minimum element in self.
|
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.
|
inline |
Returns the number of elements t
in self such that the expression (*t == *a)
is true
.
|
inline |
Returns a reference to the i th element of self. Index i must be between 0
and one less than the number of entries, otherwise the results are undefined. Note that no bounds checking is performed.
|
inline |
Returns a reference to the i th element of self. Index i must be between 0
and one less than the number of entries, otherwise the results are undefined. Note that no bounds checking is performed.
|
inline |
Clears all elements of self and replaces them by copying all elements of rhs.
|
inline |
Clears all elements of self and replaces them by copying all elements of rhs.
|
inline |
Move assignment. Self takes ownership of the data owned by rhs.
|
inline |
Move assignment. Self takes ownership of the data owned by rhs.
|
inline |
Returns a reference to the i th element of self.
RWBoundsErr | Thrown if index i is not between 0 and one less than the number of entries in self. |
|
inline |
Returns a reference to the i th element of self.
RWBoundsErr | Thrown if index i is not between 0 and one less than the number of entries in self. |
|
inline |
Adds the item a to the beginning of the collection.
|
inline |
Returns an iterator referring to the last element in the container.
If the container is empty, returns rend().
|
inline |
Returns an iterator referring to the last element in the container.
If the container is empty, returns rend().
|
inline |
Removes and returns the first element t
in self such that the expression ((*fn)(t,d))
is true
. Returns rwnil if there is no such element. Client data may be passed through parameter d.
|
inline |
Removes and returns the first element t
in self such that the expression (*t == *a)
is true
. Returns rwnil if there is no such element.
|
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.
|
inline |
Removes all elements t
in self such that the expression (*t == *a)
is true
. Returns the number of items removed.
|
inline |
Removes and returns the item at position i in self.
RWBoundsErr | Thrown if this position is not between zero and one less than the number of entries in the collection. |
|
inline |
Removes and returns the first item in the collection.
Calling this function on an empty collection results in undefined behavior.
|
inline |
Removes and returns the last item in the collection.
Calling this function on an empty collection results in undefined behavior.
|
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.
|
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.
|
inline |
Replaces with newVal all elements t
in self such that the expression ((*fn)(t,d))
is true
. Returns the number of items replaced. Client data may be passed through parameter d.
|
inline |
Replaces with newVal all elements t
in self such that the expression (*t == *oldVal)
is true
. Returns the number of items replaced.
|
inline |
Sorts the collection using the less-than operator to compare elements. Elements are dereferenced before being compared.
|
inline |
Returns a reference to the underlying C++ Standard Library collection that serves as the implementation for self.
|
inline |
Returns a reference to the underlying C++ Standard Library collection that serves as the implementation for self.
|
inline |
Swaps the data owned by self with the data owned by rhs.
|
related |
Equivalent to !(lhs == rhs)
.
|
related |
Equivalent to !(lhs == rhs)
.
|
related |
Equivalent to !(lhs == rhs)
.
|
related |
Returns true
if lhs is lexicographically less than rhs, otherwise false
. Items in each collection are dereferenced before being compared. Assumes that type T
has well-defined less-than semantics.
|
related |
Returns true
if lhs is lexicographically less than rhs, otherwise false
. Items in each collection are dereferenced before being compared. Assumes that type T
has well-defined less-than semantics.
|
related |
Returns true
if lhs is lexicographically less than rhs, otherwise false
. Items in each collection are dereferenced before being compared. Assumes that type T
has well-defined less-than semantics.
|
related |
Saves the collection coll onto the RWFile strm, or a reference to it if it has already been saved.
|
related |
Saves the collection coll onto the output stream strm, or a reference to it if it has already been saved.
|
related |
Equivalent to !(rhs < lhs)
.
|
related |
Equivalent to !(rhs < lhs)
.
|
related |
Equivalent to !(rhs < lhs)
.
|
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. Elements are dereferenced before being compared.
|
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. Elements are dereferenced before being compared.
|
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. Elements are dereferenced before being compared.
|
related |
Equivalent to (rhs < lhs)
.
|
related |
Equivalent to (rhs < lhs)
.
|
related |
Equivalent to (rhs < lhs)
.
|
related |
Equivalent to !(lhs < rhs)
.
|
related |
Equivalent to !(lhs < rhs)
.
|
related |
Equivalent to !(lhs < rhs)
.
|
related |
Restores the contents of the collection coll from the RWFile strm.
|
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.
|
related |
Restores the contents of the collection coll from the input stream strm.
|
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.
Copyright © 2024 Rogue Wave Software, Inc., a Perforce company. All Rights Reserved. |