RWTPtrSlist<T,A>

Module:  Essential Tools Module   Group:  STL Extension-based Collection Classes

Does not inherit

• Local Index
• Synopsis
• Description
• Persistence
• Example
• Related Classes
• Public Typedefs
• Public Constructors
• Public Member Operators
• Public Member Functions
• Related Global Operators

Members

append() apply() at() begin() clear() clearAndDestroy() const_iterator const_reference container_type contains() difference_type

end() entries() find() first() get() index() insert() insertAt() isEmpty() iterator last()

maxElement() minElement() occurrencesOf() operator<() operator()() operator=() operator==() operator[]() prepend() reference remove()

removeAll() removeAt() removeFirst() removeLast() replaceAll() RWTPtrSlist<T,A>() size_type sort() std() value_type

Non-Members

operator>>()

operator<<()

#include <rw/tpslist.h> 
RWTPtrSlist<T,A> slist;

This class maintains a pointer-based collection of values, implemented as a singly-linked list. Class T is the type pointed to by the items in the collection.

Isomorphic

//
// tpslist.cpp
//
#include <rw/tpslist.h>
#include <rw/tools/datetime.h>

int main ()
{
    RWTPtrSlist<RWDateTime> dates;

    dates.insert(new RWDateTime("June 2, 52", RWDateTime::setDate));    // 6/2/52
    dates.insert(new RWDateTime("March 30, 46", RWDateTime::setDate));  // 3/30/46
    dates.insert(new RWDateTime("April 1, 90", RWDateTime::setDate));   // 4/1/90

    // Now look for one of the dates:
    RWDateTime key("June 2, 52", RWDateTime::setDate);

    RWDateTime* d = dates.find(&key);

    if (d) 
        std::cout << "Found date is: " << d->asString('x') << std::endl;

    // Remove in reverse order:
    while (!dates.isEmpty()) {
        d = dates.removeLast();
        std::cout << d->asString('x') << "\n";
        delete d;
    }
    return 0;
}

Program Output:

Found date is: 6/02/52
4/01/90
3/30/46
6/02/52

Classes RWTPtrDlist<T,A>, RWTPtrDeque<T,A>, and RWTPtrOrderedVector<T,A> also provide a Rogue Wave pointer-based interface to C++-standard sequence collections.

Class rw_slist<T*,A> is the C++-standard collection that serves as the underlying implementation for this class.

typedef rw_slist<T*,A> container_type; 
typedef typename container_type::size_type size_type;
typedef typename container_type::difference_type
  difference_type;
typedef typename container_type::iterator iterator;
typedef typename container_type::const_iterator
  const_iterator;
typedef T* value_type; 
typedef T*& reference; 
typedef T*const& const_reference; 

RWTPtrSlist<T,A>();

Constructs an empty, singly-linked list.

RWTPtrSlist<T,A>(const RWTPtrSlist<T,A>& rwlst);

Copy constructor.

RWTPtrSlist<T,A>(const rw_slist<T*,A>& lst);

Construct a singly linked list by copying all elements of lst.

RWTPtrSlist<T,A>(size_type n, const T* a=0);

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

RWTPtrSlist<T,A>(T* const* first, T* const* last);

Constructs a singly-linked list by copying elements from the array of T*s pointed to by first, up to, but not including, the element pointed to by last.

RWTPtrSlist<T,A>&
operator=(const RWTPtrSlist<T,A>& lst); 
RWTPtrSlist<T,A>&
operator=(const rw_slist<T*,A>& lst);

Empties self then inserts all elements of lst.

bool
operator<(const RWTPtrSlist<T,A>& lst) const; 

Returns true if self compares lexicographically less than lst, otherwise returns false. Items in each collection are dereferenced before being compared.

bool
operator==(const RWTPtrSlist<T,A>& lst) const; 

Returns true if self compares equal to lst, otherwise returns false. Two collections are equal if both have the same number of entries, and iterating through both collections produces, in turn, individual elements that compare equal to each other. Elements are dereferenced before being compared.

reference
operator()(size_type i); 
const_reference
operator()(size_type i) const;

Returns a reference to the ith element of self. Index i must be between 0 and one less then the number of entries, otherwise the results are undefined -- no bounds checking is performed.

reference
operator[](size_type i); 
const_reference
operator[](size_type i) const;

Returns a reference to the ith element of self. Index i must be between 0 and one less then the number of entries in self, otherwise the function throws an exception of type RWBoundsErr.

void
append(T* a); 

Adds the item a to the end of the collection.

void
apply(void (*fn)(T*,void*), void* d); 
void
apply(void (*fn)(T*&,void*), void* d);
void
apply(void (*fn)(const T*,void*), void* d) const;

Applies the user-defined function pointed to by fn to every item in the collection. This function must have one of the prototypes:

void yourfun(T* a, void* d);
void yourfun(reference a, void* d);
void yourfun(const T* a, void* d); 

Client data may be passed through parameter d.

reference
at(size_type i); 
const_reference
at(size_type i) const;

Returns a reference to the ith element of self. Index i must be between 0 and one less then the number of entries in self, otherwise the function throws an exception of type RWBoundsErr.

iterator
begin();
const_iterator
begin() const;

Returns an iterator positioned at the first element of self.

void
clear();

Clears the collection by removing all items from self.

void
clearAndDestroy();

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.

bool
contains(const T* a) const; 

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

bool
contains(bool (*fn)(T*,void*), void* d) const; 
bool
contains(bool (*fn)(const T*,void*), void* d) const;

Returns true if there exists an element t in self such that the expression ((*fn)(t,d)) is true, otherwise returns false. fn points to a user-defined tester function which must have one of the prototypes:

bool yourTester(T* a, void* d);
bool yourTester(const T* a, void* d);

Client data may be passed through parameter d.

iterator
end();
const_iterator
end() const;

Returns an iterator positioned "just past" the last element in self.

size_type
entries() const; 

Returns the number of items in self.

T*
find(const T* a) const; 

If there exists an element t in self such that the expression (*t == *a) is true, returns t. Otherwise, returns rwnil.

T*
find(bool (*fn)(T*,void*),void* d) const;
T*
find(bool (*fn)(const T*,void*),void* d) const;

If there exists an element t in self such that the expression ((*fn)(t,d)) is true, returns t. Otherwise, returns rwnil. fn points to a user-defined tester function which must have one of the prototypes:

bool yourTester(const T* a, void* d);
bool yourTester(const T* a, void* d);

Client data may be passed through parameter d.

reference
first();
const_reference
first() const;

Returns a reference to the first element of self.

T*
get();

Removes and returns the first element in the collection.

size_type
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.

size_type
index(bool (*fn)(T*,void*), void* d) const;
size_type
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. fn points to a user-defined tester function which must have one of the prototypes:

bool yourTester(T* a, void* d);
bool yourTester(const T* a, void* d);

Client data may be passed through parameter d.

bool
insert(T* a); 

Adds the item a to the end of the collection. Returns true.

void
insertAt(size_type i, T* a); 

Inserts the item a in front of the item at position i in self. This position must be between zero and the number of entries in the collection, otherwise the function throws an exception of type RWBoundsErr.

bool
isEmpty() const; 

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

T*&
last();
T*const&
last() const;

Returns a reference to the last item in the collection.

reference
maxElement();
const_reference
maxElement() const;
reference
minElement();
const_reference
minElement() const;

Returns a reference to the maximum or minimum element in self.

size_type
occurrencesOf(const T* a) const; 

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

size_type
occurrencesOf(bool (*fn)(T*,void*), void* d) const;
size_type
occurrencesOf(bool (*fn)(const T*,void*), void* d) const;

Returns the number of elements t in self such that the expression((*fn)(t,d)) is true. fn points to a user-defined tester function which must have one of the prototypes:

bool yourTester(T* a, void* d);
bool yourTester(const T* a, void* d);

Client data may be passed through parameter d.

void
prepend(T* a); 

Adds the item a to the beginning of the collection.

T*
remove(const T* a); 

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.

T*
remove(bool (*fn)(T*,void*), void* d); 
T*
remove(bool (*fn)(const T*,void*), void* d);

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. fn points to a user-defined tester function which must have one of the prototypes:

bool yourTester(T* a, void* d);
bool yourTester(const T* a, void* d);

Client data may be passed through parameter d.

size_type
removeAll(const T* a); 

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

size_type
removeAll(bool (*fn)(T*,void*), void* d);
size_type
removeAll(bool (*fn)(const T*,void*), void* d);

Removes all elements t in self such that the expression ((*fn)(t,d))is true. Returns the number of items removed. fn points to a user-defined tester function which must have one of the prototypes:

bool yourTester(T* a, void* d);
bool yourTester(const T* a, void* d);

Client data may be passed through parameter d.

T*
removeAt(size_type i); 

Removes and returns the item at position i in self. This position must be between zero and one less then the number of entries in the collection, otherwise the function throws an exception of type RWBoundsErr.

T*
removeFirst();

Removes and returns the first item in the collection.

T*
removeLast();

Removes and returns the last item in the collection.

size_type
replaceAll(const T* oldVal,T* newVal); 

Replaces with newVal all elements t in self such that the expression (*t == *oldVal) is true. Returns the number of items replaced.

size_type
replaceAll(bool (*fn)(T*, void*),void* x,T* newVal);
size_type
replaceAll(bool (*fn)(const T*, void*),void* x,T* newVal);

Replaces with newVal all elements t in self such that the expression ((*fn)(t,d))is true. Returns the number of items replaced. fn points to a user-defined tester function which must have one of the prototypes:

bool yourTester(T* a, void* d);
bool yourTester(const T* a, void* d);

Client data may be passed through parameter d.

void
sort();

Sorts the collection using the greater-than operator to compare elements so that the elements are sorted from smallest to largest. Elements are dereferenced before being compared.

rw_slist<T*,A>&
std();
const rw_slist<T*,A>&
std() const;

Returns a reference to the underlying C++-standard collection that serves as the implementation for self.

RWvostream&
operator<<(RWvostream& strm, const RWTPtrSlist<T,A>& coll); 
RWFile&
operator<<(RWFile& strm, const RWTPtrSlist<T,A>& coll);

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

RWvistream&
operator>>(RWvistream& strm, RWTPtrSlist<T,A>& coll); 
RWFile&
operator>>(RWFile& strm, RWTPtrSlist<T,A>& coll);

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

RWvistream&
operator>>(RWvistream& strm, RWTPtrSlist<T,A>*& p);
RWFile&
operator>>(RWFile& strm, RWTPtrSlist<T,A>*& p);

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 you are responsible for deleting it.

© Copyright Rogue Wave Software, Inc. All Rights Reserved.
Rogue Wave and SourcePro are registered trademarks of Rogue Wave Software, Inc. in the United States and other countries. All other trademarks are the property of their respective owners.
Contact Rogue Wave about documentation or support issues.