83 template<
class T,
class TAlloc = XnLinkedNodeDefaultAllocatorT<T> >
268 for (ConstIterator it = other.
Begin(); it != other.
End(); ++it)
295 return ConstIterator(const_cast<LinkedNode*>(
m_anchor.
pNext));
311 return ConstIterator(const_cast<LinkedNode*>(&
m_anchor));
327 return ConstIterator(const_cast<LinkedNode*>(
m_anchor.
pPrev));
343 return ConstIterator(const_cast<LinkedNode*>(&
m_anchor));
359 return XN_STATUS_ILLEGAL_POSITION;
378 return XN_STATUS_ILLEGAL_POSITION;
381 return InsertAfter(where.m_pCurrent->pPrev, value);
415 ConstIterator
Find(T
const& value)
const
417 ConstIterator iter =
Begin();
418 for (; iter !=
End(); ++iter)
435 ConstIterator iter =
const_cast<const XnListT<T>*
>(
this)->
Find(value);
436 return Iterator(iter.m_pCurrent);
451 return XN_STATUS_ILLEGAL_POSITION;
463 TAlloc::Deallocate(pToRemove);
477 ConstIterator it =
Find(value);
484 return XN_STATUS_NO_MATCH;
523 XN_ASSERT(pArray != NULL);
526 for (ConstIterator iter =
Begin(); iter !=
End(); ++iter, ++i)
545 if (pNewNode == NULL)
548 return XN_STATUS_ALLOC_FAILED;
550 pNewNode->
pPrev = pAfter;
555 pAfter->
pNext = pNewNode;
576 #endif // _XNLISTT_H_