#include <Sequence.hpp>
Inheritance diagram for Sequence:

Public Types | |
| typedef VectorOfItems::iterator | iterator |
| typedef VectorOfItems::const_iterator | const_iterator |
| typedef VectorOfItems::reverse_iterator | reverse_iterator |
| typedef VectorOfItems::const_reverse_iterator | const_reverse_iterator |
Public Member Functions | |
| Sequence (const Item::Ptr &item, xercesc::MemoryManager *memMgr=xercesc::XMLPlatformUtils::fgMemoryManager) | |
| Sequence (xercesc::MemoryManager *memMgr=xercesc::XMLPlatformUtils::fgMemoryManager) | |
| Sequence (size_t n, xercesc::MemoryManager *memMgr=xercesc::XMLPlatformUtils::fgMemoryManager) | |
| construct and reserve space for n elements | |
| Sequence (const Sequence &, xercesc::MemoryManager *memMgr) | |
| Sequence (const Sequence &) | |
| Sequence & | operator= (const Sequence &) |
| ~Sequence () | |
| void | clear () |
| const Item::Ptr & | first () const |
| const Item::Ptr & | second () const |
| Sequence::iterator | begin (void) |
| Begin an iterator. | |
| Sequence::const_iterator | begin (void) const |
| Sequence::iterator | end (void) |
| Find the end of the iterator. | |
| Sequence::const_iterator | end (void) const |
| Sequence::reverse_iterator | rbegin (void) |
| Reverse iterator methods. | |
| Sequence::const_reverse_iterator | rbegin (void) const |
| Sequence::reverse_iterator | rend (void) |
| Sequence::const_reverse_iterator | rend (void) const |
| size_t | getLength (void) const |
| Returns the number of nodes in the list. | |
| const Item::Ptr & | item (size_t index) const |
| Return the indexth item in the collection. | |
| const Item::Ptr & | item (const ATDecimalOrDerived::Ptr &index) const |
| Return the indexth item in the collection - takes ATDecimalOrDerived. | |
| void | addItem (const Item::Ptr &item) |
| add an item to this sequence | |
| void | addItemFront (const Item::Ptr &item) |
| add an item to this sequence | |
| void | joinSequence (const Sequence &s) |
| combine another sequence onto this sequence | |
| bool | isEmpty () const |
| Returns true if the list is empty. | |
| void | sortIntoDocumentOrder (const DynamicContext *context) |
| sort into document order (only works for Sequences containing only Nodes) | |
| void | sortWithCollation (const Collation *collation, const DynamicContext *context) |
| sort as strings, using the given collation | |
|
|
|
|
|
|
|
|
|
|
|
|
|
||||||||||||
|
|
|
|
|
|
||||||||||||
|
construct and reserve space for n elements
|
|
||||||||||||
|
|
|
|
|
|
|
|
|
|
add an item to this sequence
|
|
|
add an item to this sequence
|
|
|
|
|
|
Begin an iterator.
|
|
|
|
|
|
|
|
|
Find the end of the iterator.
|
|
|
|
|
|
Returns the number of nodes in the list.
|
|
|
Returns true if the list is empty.
|
|
|
Return the indexth item in the collection - takes ATDecimalOrDerived.
|
|
|
Return the indexth item in the collection.
|
|
|
combine another sequence onto this sequence
|
|
|
|
|
|
|
|
|
Reverse iterator methods.
|
|
|
|
|
|
|
|
|
|
|
|
sort into document order (only works for Sequences containing only Nodes)
|
|
||||||||||||
|
sort as strings, using the given collation
|
1.3.9.1