Lines Matching full:linkedlist
9 // Simple LinkedList type. (See the Q&A section to understand how this
19 // Next, to keep track of the list's head/tail, use a LinkedList instance:
21 // LinkedList<MyNodeType> list;
23 // To add elements to the list, use any of LinkedList::Append,
54 // Q. Should I use std::list or base::LinkedList?
56 // A. The main reason to use base::LinkedList over std::list is
60 // Comparing the performance of base::LinkedList<T> to std::list<T*>:
62 // * Erasing an element of type T* from base::LinkedList<T> is
67 // * Insertion operations with base::LinkedList<T> never require
70 // Q. How does base::LinkedList implementation differ from std::list?
75 // With base::LinkedList<T>, the type being inserted already reserves
142 class LinkedList {
147 LinkedList() { root_.set(&root_, &root_); }
