RWTValOrderedVector<T,A>

Module:  Essential Tools Module   Group:  STL-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() const_iterator const_reference container_type contains() data() end()

entries() find() first() index() insert() insertAt() isEmpty() iterator last() length() maxElement()

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

removeAt() removeFirst() removeLast() replaceAll() resize() RWTValOrderedVector<T,A>() size_type sort() std() value_type

Non-Members

operator>>()

operator<<()

#include <rw/tvordvec.h> 
RWTValOrderedVector<T,A> ordvec;

This class maintains a collection of values, implemented as a vector.

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

Isomorphic

In this example, a vector of type double is exercised.

//
// tvordvec.cpp
//
#include <iostream>
#include <rw/tvordvec.h>

int main ()
{
    RWTValOrderedVector<double> vec;

    vec.insert(22.0);
    vec.insert(5.3);
    vec.insert(-102.5);
    vec.insert(15.0);
    vec.insert(5.3);


    std::cout << "There are " << vec.entries() 
              << " entries, they are: \n\n"; // Prints "5"

    for (size_t i = 0; i < vec.length(); ++i)
        std::cout << vec[i] << std::endl;

    return 0;
}

Program Output:

There are 5 entries, they are:
22
5.3
-102.5
15
5.3

Classes RWTValDeque<T,A>, RWTValSlist<T,A>, and RWTValDlist<T,A> also provide a Rogue Wave interface to C++-standard sequence collections.

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

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

RWTValOrderedVector<T,A>();

Constructs an empty vector.

RWTValOrderedVector<T,A>(const vector<T,A<T> >& vec);

Constructs a vector by copying all elements of vec.

RWTValOrderedVector<T,A>(const RWTValOrderedVector<T,A>& rwvec);

Copy constructor.

RWTValOrderedVector<T,A>(size_type n, const T& val);

Constructs a vector with n elements, each initialized to val.

RWTValOrderedVector<T,A>(size_type n);

Constructs an empty vector with a capacity of n elements.

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

Constructs a vector by copying elements from the array of Ts pointed to by first, up to, but not including, the element pointed to by last.

RWTValOrderedVector<T,A>&
operator=(const RWTValOrderedVector<T,A>& vec); 
RWTValOrderedVector<T,A>&
operator=(const vector<T,A>& vec);

Calls the destructor on all elements of self and replaces them by copying all elements of vec.

bool
operator<(const RWTValOrderedVector<T,A>& vec); 
bool
operator<(const vector<T>& vec);

Returns true if self compares lexicographically less than vec, otherwise returns false. Type T must have well-defined less-than semantics (T::operator<(const T&) or equivalent).

bool
operator==(const RWTValOrderedVector<T,A>& vec) const; 
bool
operator==(const vector<T>& vec) const;

Returns true if self compares equal to vec, 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.

T&
operator()(size_type i); 
const T&
operator()(size_type i) const;

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

T&
operator[](size_type i); 
const T&
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(const_reference a); 

Adds the item a to the end of the collection.

void
apply(void (*fn)(reference,void*), void* d); 
void
apply(void (*fn)(const_reference,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(const_reference a, void* d); 
void yourfun(reference 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. Each item will have its destructor called.

bool
contains(const_reference 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)(const_reference,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 prototype:

bool yourTester(const_reference a, void* d);

Client data may be passed through parameter d.

const T*
data() const; 

Returns a pointer to the first element of the vector.

iterator
end();
const_iterator
end() const;

Returns a past-the-end valued iterator of self.

size_type
entries() const; 

Returns the number of elements in self.

bool
find(const_reference a, value_type& k) const; 

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.

bool
find(bool (*fn)(const_reference,void*), void* d, 
     value_type& k) const;

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

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.

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

size_type
index(bool (*fn)(const_reference,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 prototype:

bool yourTester(const_reference a, void* d);

Client data may be passed through parameter d.

bool
insert(const_reference a); 

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

void
insertAt(size_type i, const_reference a); 

Inserts the item a in front of the item at position i in self. This position must be between 0 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.

reference
last();
const_reference
last() const;

Returns a reference to the last item in the collection.

size_type
length() const; 

Returns the number of elements in self.

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

Returns a reference to the minimum or maximum element in the collection. Type T must have well-defined less-than semantics (T::operator<(const T&) or equivalent).

size_type 
occurrencesOf(const_reference a) const; 

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

size_type
occurrencesOf
  (bool (*fn)(const_reference,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 prototype:

bool yourTester(const_reference a, void* d);

Client data may be passed through parameter d.

void
prepend(const_reference a); 

Adds the item a to the beginning of the collection.

bool
remove(const_reference a); 

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.

bool
remove(bool (*fn)(const_reference,void*), void* d);

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

bool yourTester(const_reference a, void* d);

Client data may be passed through parameter d.

size_type
removeAll(const_reference 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)(const_reference,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 prototype:

bool yourTester(const_reference a, void* d);

Client data may be passed through parameter d.

value_type
removeAt(size_type i); 

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

value_type
removeFirst();

Removes and returns the first item in the collection.

value_type
removeLast();

Removes and returns the last item in the collection.

size_type
replaceAll(const_reference oldVal, const_reference newVal); 

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

size_type
replaceAll(bool (*fn)(const_reference,void*), 
           void* d, const T& newval); 

Replaces 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 prototype:

bool yourTester(const_reference a, void* d);

Client data may be passed through parameter d.

void
resize(size_type n); 

Modify the capacity of the vector to be at least as large as n. The function has no effect if the capacity is already as large as n.

void
sort();

Sorts the collection using the less-than operator to compare elements.

vector<T,A<T> >&
std();
const vector<T,A<T> >&
std() const;

Returns a reference to the underlying C++-standard collection that serves as the implementation for self. This reference may be used freely, providing access to the C++-standard interface as well as interoperability with other software components that make use of the C++-standard collections.

RWvostream&
operator<<(RWvostream& strm, 
       const RWTValOrderedVector<T,A>& coll);
RWFile&
operator<<(RWFile& strm, const RWTValOrderedVector<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, RWTValOrderedVector<T,A>& coll); 
RWFile&
operator>>(RWFile& strm, RWTValOrderedVector<T,A>& coll);

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

RWvistream&
operator>>(RWvistream& strm, RWTValOrderedVector<T,A>*& p);
RWFile&
operator>>(RWFile& strm, RWTValOrderedVector<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.