HomeSort by relevance Sort by last modified time
    Searched defs:LinkedList (Results 1 - 3 of 3) sorted by null

  /bionic/linker/
linked_list.h 77 class LinkedList {
82 LinkedList() : head_(nullptr), tail_(nullptr) {}
83 ~LinkedList() {
87 LinkedList(LinkedList&& that) noexcept {
250 static LinkedList make_list(T* const element) {
251 LinkedList<T, Allocator> one_element_list;
259 DISALLOW_COPY_AND_ASSIGN(LinkedList);
  /external/libchrome/base/containers/
linked_list.h 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
    [all...]
  /external/guava/guava-tests/test/com/google/common/collect/
BenchmarkHelpers.java 88 LinkedList {

Completed in 414 milliseconds