Xalan-C++ API Documentation
Go to the documentation of this file.
19 #if !defined(XALANLIST_HEADER_GUARD_1357924680)
20 #define XALANLIST_HEADER_GUARD_1357924680
42 XALAN_CPP_NAMESPACE_BEGIN
46 template <
class Value>
54 template <
class Value>
62 template<
class XalanListTraits,
class Node>
66 typedef typename XalanListTraits::reference
reference;
67 typedef typename XalanListTraits::pointer
pointer;
107 while (decrement > 0)
154 template <
class Type>
189 #if defined(XALAN_HAS_STD_ITERATORS)
192 #elif defined(XALAN_RW_NO_CLASS_PARTIAL_SPEC)
222 MemoryManager& theManager) :
332 while (item !=
end())
379 assert(pos !=
end());
397 Node & posNode = pos.
node();
398 Node & toInsertNode = toInsert.node();
404 toInsertNode.
next = &posNode;
407 posNode.
prev = &toInsertNode;
424 if (toInsertFirst != toInsertLast)
426 Node & posNode = pos.
node();
427 Node & toInsertFirstNode = toInsertFirst.node();
428 Node & toInsertLastNode = *(toInsertLast.
node().
prev);
433 toInsertFirstNode.
prev = posNode.
prev;
434 toInsertLastNode.
next = &posNode;
436 posNode.
prev->
next = &toInsertFirstNode;
437 posNode.
prev = &toInsertLastNode;
453 #if defined(XALAN_NO_STD_NAMESPACE)
470 Node * nextFreeNode = 0;
484 new (&newNode->prev) Node*(pos.
node().
prev);
485 new (&newNode->next) Node*(&(pos.
node()));
497 node.prev->next = node.next;
498 node.next->prev = node.prev;
570 XALAN_CPP_NAMESPACE_END
572 #endif // XALANLIST_HEADER_GUARD_1357924680
Node & constructNode(const value_type &data, iterator pos)
reverse_iterator_ reverse_iterator
XalanListIteratorBase< XalanListConstIteratorTraits< value_type >, Node > const_iterator
const XalanListIteratorBase & operator=(const XalanListIteratorBase &theRhs)
Node(const value_type &theValue, Node &prevNode, Node &nextNode)
const typedef value_type & const_reference
Node & getListHead() const
XalanListIteratorBase(Node &node)
XALAN_STD_QUALIFIER reverse_iterator< const_iterator, value_type, const_reference > const_reverse_iterator_
iterator insert(const iterator &pos, const value_type &value)
MemoryManager & getMemoryManager()
XALAN_STD_QUALIFIER bidirectional_iterator_tag iterator_category
XalanListIteratorBase< XalanListIteratorTraits< value_type >, Node > iterator
XalanListIteratorBase operator-(difference_type decrement) const
const_reverse_iterator rbegin() const
XalanListIteratorBase operator++()
reference operator*() const
const_iterator end() const
reverse_iterator rbegin()
XalanListTraits::value_type value_type
MemoryManagedConstructionTraits< value_type >::Constructor Constructor
void splice(iterator pos, ThisType &list, iterator toInsert)
const_iterator begin() const
static C * construct(C *address, MemoryManager &)
const MemoryManager & getMemoryManager() const
XalanListTraits::pointer pointer
XalanListIteratorBase operator++(int)
MemoryManager * m_memoryManager
void destroyNode(Node &node)
XalanListIteratorBase(const iterator &theRhs)
bool operator==(const XalanListIteratorBase &theRhs) const
const_reverse_iterator_ const_reverse_iterator
void splice(iterator pos, ThisType &list, iterator toInsertFirst, iterator toInsertLast)
Xalan implementation of a doubly linked list.
void freeNode(Node &node)
XalanListIteratorBase operator--()
const typedef value_type * const_pointer
void swap(ThisType &theRHS)
XALAN_STD_QUALIFIER reverse_iterator< iterator, value_type > reverse_iterator_
void push_back(const value_type &data)
Node * allocate(size_type size)
XalanList< value_type > ThisType
ptrdiff_t difference_type
XalanListIteratorBase< XalanListIteratorTraits< value_type >, Node > iterator
bool operator!=(const XalanListIteratorBase &theRhs) const
const typedef Value * pointer
const typedef Value & reference
void push_front(const value_type &data)
const_reverse_iterator rend() const
void deallocate(Node *pointer)
XalanList(MemoryManager &theManager)
XalanListTraits::reference reference
pointer operator->() const
Interpreting class diagrams
Doxygen and
GraphViz are
used to generate this API documentation from the Xalan-C header files.
Xalan-C++ XSLT Processor Version 1.11
Copyright © 1999-2012 The Apache Software Foundation.
All Rights Reserved.
|
|