Searched refs:m_anchor (Results 1 – 2 of 2) sorted by relevance
99 Node m_anchor; // Anchor node for the linked list.104 return m_anchor.next; in Front()109 return m_anchor.prev; in Back()159 assert(pNode != &m_anchor); // We should never try to remove the anchor node. in RemoveItem()160 if (pNode == &m_anchor) in RemoveItem()191 m_anchor.next = &m_anchor; in List()192 m_anchor.prev = &m_anchor; in List()205 return InsertAfter(item, m_anchor.prev); in InsertBack()211 return InsertAfter(item, &m_anchor); in InsertFront()292 Node *n = m_anchor.next; in Clear()[all …]
1956 Node m_anchor; // Anchor node for the linked list. member in List1961 return m_anchor.next; in Front()1966 return m_anchor.prev; in Back()2016 assert(pNode != &m_anchor); // We should never try to remove the anchor node. in RemoveItem()2017 if (pNode == &m_anchor) in RemoveItem()2048 m_anchor.next = &m_anchor; in List()2049 m_anchor.prev = &m_anchor; in List()2062 return InsertAfter(item, m_anchor.prev); in InsertBack()2068 return InsertAfter(item, &m_anchor); in InsertFront()2149 Node *n = m_anchor.next; in Clear()[all …]