Lines Matching defs:previous
14 // list, as extending LinkNode (this gives it next/previous pointers).
48 // node = node->previous()) {
74 // "previous" pointers that reference other nodes in the list.
77 // space for the "next" and "previous" pointers (base::LinkNode<T>*).
79 // needs to glue on the "next" and "previous" pointers using
88 LinkNode(LinkNode<T>* previous, LinkNode<T>* next)
89 : previous_(previous), next_(next) {}
111 // next() and previous() return non-NULL if and only this node is not in any
117 LinkNode<T>* previous() const {
146 // and root_->previous() wraps around to the end of the list).
159 return root_.previous();