21 #if !defined(XALANLIST_HEADER_GUARD_1357924680)
22 #define XALANLIST_HEADER_GUARD_1357924680
44 XALAN_CPP_NAMESPACE_BEGIN
48 template <
class Value>
56 template <
class Value>
64 template<
class XalanListTraits,
class Node>
68 typedef typename XalanListTraits::reference
reference;
69 typedef typename XalanListTraits::pointer
pointer;
109 while (decrement > 0)
156 template <
class Type>
192 #if defined(XALAN_HAS_STD_ITERATORS)
195 #elif defined(XALAN_RW_NO_CLASS_PARTIAL_SPEC)
198 XALAN_STD_QUALIFIER bidirectional_iterator_tag,
202 XALAN_STD_QUALIFIER bidirectional_iterator_tag,
233 while (freeNode != 0)
235 Node * nextNode = freeNode->
next;
325 while (item !=
end())
372 assert(pos !=
end());
390 Node & posNode = pos.
node();
391 Node & toInsertNode = toInsert.node();
397 toInsertNode.
next = &posNode;
400 posNode.
prev = &toInsertNode;
417 if (toInsertFirst != toInsertLast)
419 Node & posNode = pos.
node();
420 Node & toInsertFirstNode = toInsertFirst.node();
421 Node & toInsertLastNode = *(toInsertLast.
node().
prev);
426 toInsertFirstNode.
prev = posNode.
prev;
427 toInsertLastNode.
next = &posNode;
429 posNode.
prev->
next = &toInsertFirstNode;
430 posNode.
prev = &toInsertLastNode;
446 #if defined(XALAN_NO_STD_NAMESPACE)
463 Node * nextFreeNode = 0;
477 new (&newNode->prev) Node*(pos.
node().
prev);
478 new (&newNode->next) Node*(&(pos.
node()));
490 node.prev->next = node.next;
491 node.next->prev = node.prev;
526 const size_type theBytesNeeded = size *
sizeof(Node);
532 assert( pointer != 0 );
563 XALAN_CPP_NAMESPACE_END
565 #endif // XALANLIST_HEADER_GUARD_1357924680