Lines Matching refs:m_node
834 Node* m_node; \
840 iterator(Node* node, Node* init) : m_node(node), m_init(init) {}\
841 iterator() : m_node(NULL), m_init(NULL) { } \
843 { return *(pointer_type)m_node->GetDataPtr(); } \
845 itor& operator++() { m_node = m_node->GetNext(); return *this; }\
847 { itor tmp = *this; m_node = m_node->GetNext(); return tmp; }\
850 m_node = m_node ? m_node->GetPrevious() : m_init; \
856 m_node = m_node ? m_node->GetPrevious() : m_init; \
860 { return it.m_node != m_node; } \
862 { return it.m_node == m_node; } \
874 Node* m_node; \
881 : m_node(node), m_init(init) { } \
882 const_iterator() : m_node(NULL), m_init(NULL) { } \
884 : m_node(it.m_node), m_init(it.m_init) { } \
886 { return *(pointer_type)m_node->GetDataPtr(); } \
888 itor& operator++() { m_node = m_node->GetNext(); return *this; }\
890 { itor tmp = *this; m_node = m_node->GetNext(); return tmp; }\
893 m_node = m_node ? m_node->GetPrevious() : m_init; \
899 m_node = m_node ? m_node->GetPrevious() : m_init; \
903 { return it.m_node != m_node; } \
905 { return it.m_node == m_node; } \
917 Node* m_node; \
924 : m_node(node), m_init(init) { } \
925 reverse_iterator() : m_node(NULL), m_init(NULL) { } \
927 { return *(pointer_type)m_node->GetDataPtr(); } \
930 { m_node = m_node->GetPrevious(); return *this; } \
932 { itor tmp = *this; m_node = m_node->GetPrevious(); return tmp; }\
934 { m_node = m_node ? m_node->GetNext() : m_init; return *this; } \
938 m_node = m_node ? m_node->GetNext() : m_init; \
942 { return it.m_node != m_node; } \
944 { return it.m_node == m_node; } \
956 Node* m_node; \
963 : m_node(node), m_init(init) { } \
964 const_reverse_iterator() : m_node(NULL), m_init(NULL) { } \
966 : m_node(it.m_node), m_init(it.m_init) { } \
968 { return *(pointer_type)m_node->GetDataPtr(); } \
971 { m_node = m_node->GetPrevious(); return *this; } \
973 { itor tmp = *this; m_node = m_node->GetPrevious(); return tmp; }\
975 { m_node = m_node ? m_node->GetNext() : m_init; return *this;}\
979 m_node = m_node ? m_node->GetNext() : m_init; \
983 { return it.m_node != m_node; } \
985 { return it.m_node == m_node; } \
1041 Insert(it.m_node, (const_base_reference)v); \
1057 iterator next = iterator(it.m_node->GetNext(), GetLast()); \
1058 DeleteNode(it.m_node); return next; \
1065 DeleteNodes(first.m_node, last.m_node); \
1097 { return (pointer_type)m_node->GetDataPtr(); }