Searched refs:LinkedList (Results 1 – 2 of 2) sorted by relevance
21 class LinkedList {23 LinkedList() : next_(this), prev_(this), data_() {} in LinkedList() function24 LinkedList(T data) : LinkedList() { in LinkedList() function27 ~LinkedList() {} in ~LinkedList()28 void insert(LinkedList<T>& node) { in insert()43 LinkedList<T> *next() { return next_; } in next()45 LinkedList<T> *next_;46 LinkedList<T> *prev_;57 LinkedList<T> node_;
88 LinkedList<Chunk*> free_chunks_[kNumBuckets];89 LinkedList<Chunk*> full_chunks_[kNumBuckets];91 void MoveToList(Chunk* chunk, LinkedList<Chunk*>* head);194 LinkedList<Chunk*> node_; // linked list sorted by minimum free count337 for (LinkedList<Chunk*> *it = free_chunks_[i].next(); it->data() != NULL; it = it->next()) { in Empty()342 for (LinkedList<Chunk*> *it = full_chunks_[i].next(); it->data() != NULL; it = it->next()) { in Empty()438 void HeapImpl::MoveToList(Chunk *chunk, LinkedList<Chunk*>* head) { in MoveToList()442 LinkedList<Chunk*> *node = head; in MoveToList()