Lines Matching full:linknode
14 // list, as extending LinkNode (this gives it next/previous pointers).
16 // class MyNodeType : public LinkNode<MyNodeType> {
25 // LinkNode::InsertBefore, or LinkNode::InsertAfter:
27 // LinkNode<MyNodeType>* n1 = ...;
28 // LinkNode<MyNodeType>* n2 = ...;
29 // LinkNode<MyNodeType>* n3 = ...;
37 // for (LinkNode<MyNodeType>* node = list.head();
46 // for (LinkNode<MyNodeType>* node = list.tail();
77 // space for the "next" and "previous" pointers (base::LinkNode<T>*).
85 class LinkNode {
87 LinkNode() : previous_(NULL), next_(NULL) {}
88 LinkNode(LinkNode<T>* previous, LinkNode<T>* next)
92 void InsertBefore(LinkNode<T>* e) {
100 void InsertAfter(LinkNode<T>* e) {
117 LinkNode<T>* previous() const {
121 LinkNode<T>* next() const {
135 LinkNode<T>* previous_;
136 LinkNode<T>* next_;
138 DISALLOW_COPY_AND_ASSIGN(LinkNode);
150 void Append(LinkNode<T>* e) {
154 LinkNode<T>* head() const {
158 LinkNode<T>* tail() const {
162 const LinkNode<T>* end() const {
169 LinkNode<T> root_;
