 SourcePro® 2023.1 |
SourcePro® API Reference Guide |
Maintains a collection of boolean values implemented as a vector. More...
#include <rw/tvordvec.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::vector< bool, 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 |
This class maintains a collection of boolean values, implemented as a vector.
Class A is an allocator of objects of type bool. For more information about using custom allocators, please see the Essential Tools Module User's Guide.
The specialization of RWTValOrderedVector<bool,A> differs from the primary template in that it provides a more efficient memory representation of the boolean array and it does not provide a data() member function.
Classes RWTValDeque, RWTValSlist, and RWTValDlist also provide a Rogue Wave interface to C++ Standard Library sequence collections.
Class RWTValOrderedVector provides a generic vector for non-boolean types.
Class std::vector<bool,A> is the C++ Standard Library collection that serves as the underlying implementation for this class.
| typedef container_type::allocator_type RWTValOrderedVector< bool, A >::allocator_type |
A type representing the allocator type for the container.
| typedef container_type::const_iterator RWTValOrderedVector< bool, A >::const_iterator |
A type that provides a const random-access iterator over the elements in the container.
| typedef container_type::const_pointer RWTValOrderedVector< bool, A >::const_pointer |
A type that provides a const pointer to an element in the container.
| typedef container_type::const_reference RWTValOrderedVector< bool, A >::const_reference |
A type that provides a const reference to an element in the container.
| typedef container_type::const_reverse_iterator RWTValOrderedVector< bool, A >::const_reverse_iterator |
A type that provides a const random-access, reverse-order iterator over the elements in the container.
| typedef std::vector<bool, A> RWTValOrderedVector< bool, A >::container_type |
A type representing the underlying implementation container.
| typedef container_type::difference_type RWTValOrderedVector< bool, A >::difference_type |
A signed integral type used to indicate the distance between two valid iterators on the same container.
| typedef container_type::iterator RWTValOrderedVector< bool, A >::iterator |
A type that provides a random-access iterator over the elements in the container.
| typedef container_type::pointer RWTValOrderedVector< bool, A >::pointer |
A type that provides a pointer to an element in the container.
| typedef container_type::reference RWTValOrderedVector< bool, A >::reference |
A type that provides a reference to an element in the container.
| typedef container_type::reverse_iterator RWTValOrderedVector< bool, A >::reverse_iterator |
A type that provides a random-access, reverse-order iterator over the elements in the container.
| typedef container_type::size_type RWTValOrderedVector< bool, A >::size_type |
An unsigned integral type used for counting the number of elements in the container.
| typedef container_type::value_type RWTValOrderedVector< bool, A >::value_type |
A type representing the container's data type.
|
inline |
Constructs an empty vector.
|
inline |
Copy constructor.
|
inline |
Move constructor. The constructed vector takes ownership of the data owned by t.
|
inline |
Move constructor. The constructed vector takes ownership of the data owned by t.
|
inline |
Constructs a vector by copying all elements of vec.
|
inline |
Constructs a vector with n elements, each initialized to val.
|
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 |
Constructs an empty vector with a capacity of n elements.
|
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 |
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 the maximum number of elements that can be stored in self without first resizing.
|
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. Each item has its destructor called.
|
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.
|
inline |
Returns true if there exists an element t in self such that the expression (t == a) is true, otherwise returns 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 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 |
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 |
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.
|
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.
|
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 |
Returns the position of the first item t in self such that (t == a), or returns RW_NPOS if no such item exists.
|
inline |
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.
|
inline |
Adds the item a to the end of the collection. Returns true.
|
inline |
Inserts val into self at position pos. Returns an iterator for the newly inserted element.
|
inline |
Inserts n instances of val into self at position pos. Returns an iterator to the first of the newly inserted elements.
|
inline |
Inserts the elements in the range [first, last) into self at position pos. Returns an iterator to the first of the newly inserted elements.
InputIterator is an input iterator type that points to elements that are convertible to value_type objects.
|
inline |
Inserts the item a in front of the item at position i in self.
| RWBoundsErr | Thrown if this position is not between 0 and the number of entries in the collection. |
|
inline |
Returns true if there are no items in the collection, otherwise false.
|
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 the number of elements in self.
|
inline |
Returns a reference to the maximum element in the collection. Type T must have well-defined less-than semantics (T::operator<(const T&) or equivalent).
|
inline |
Returns a reference to the maximum element in the collection. Type T must have well-defined less-than semantics (T::operator<(const T&) or equivalent).
|
inline |
Returns a reference to the minimum element in the collection. Type T must have well-defined less-than semantics (T::operator<(const T&) or equivalent).
|
inline |
Returns a reference to the minimum element in the collection. Type T must have well-defined less-than semantics (T::operator<(const T&) or equivalent).
|
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 should be between 0 and one less than the number of entries, otherwise the results are undefined.
|
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.
|
inline |
Calls the destructor on all elements of self and replaces them by copying all elements of vec.
|
inline |
Calls the destructor on all elements of self and replaces them by copying all elements of vec.
|
inline |
Move assignment. Self takes ownership of the data owned by vec.
|
inline |
Move assignment. Self takes ownership of the data owned by vec.
|
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 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.
|
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.
|
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.
| value_type RWTValOrderedVector< bool, A >::removeAt | ( | size_type | i | ) |
Removes and returns the item at position i in self.
| RWBoundsErr | Thrown if this position is not between 0 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 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 all elements t in self with newVal such that the expression (t == oldVal) is true. Returns the number of items replaced.
|
inline |
Modifies 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.
|
inline |
Sorts the collection using the less-than operator to compare elements.
|
inline |
Returns a reference to the underlying C++ Standard Library collection that serves as the implementation for self. This reference may be used freely, providing access to the C++ Standard Library interface as well as interoperability with other software components that make use of the C++ Standard Library collections.
|
inline |
Returns a reference to the underlying C++ Standard Library collection that serves as the implementation for self. This reference may be used freely, providing access to the C++ Standard Library interface as well as interoperability with other software components that make use of the C++ Standard Library collections.
|
inline |
Swaps the data owned by self with the data owned by rhs.
|
Copyright © 2023 Rogue Wave Software, Inc., a Perforce company. All Rights Reserved. |
