Lines Matching full:linkedlist
10 // Simple LinkedList type. (See the Q&A section to understand how this
20 // Next, to keep track of the list's head/tail, use a LinkedList instance:
22 // LinkedList<MyNodeType> list;
24 // To add elements to the list, use any of LinkedList::Append,
55 // Q. Should I use std::list or base::LinkedList?
57 // A. The main reason to use base::LinkedList over std::list is
61 // Comparing the performance of base::LinkedList<T> to std::list<T*>:
63 // * Erasing an element of type T* from base::LinkedList<T> is
68 // * Insertion operations with base::LinkedList<T> never require
71 // Q. How does base::LinkedList implementation differ from std::list?
76 // With base::LinkedList<T>, the type being inserted already reserves
142 class LinkedList {
147 LinkedList() : root_(&root_, &root_) {}
171 DISALLOW_COPY_AND_ASSIGN(LinkedList);
