Searched refs:LinkedList (Results 1 – 5 of 5) sorted by relevance
23 class LinkedList {25 LinkedList() : next_(this), prev_(this), data_() {} in LinkedList() function26 explicit LinkedList(T data) : LinkedList() { data_ = data; } in LinkedList() function27 ~LinkedList() {} in ~LinkedList()28 void insert(LinkedList<T>& node) { in insert()43 LinkedList<T>* next() { return next_; } in next()46 LinkedList<T>* next_;47 LinkedList<T>* prev_;58 LinkedList<T> node_;
87 LinkedList<Chunk*> free_chunks_[kNumBuckets];88 LinkedList<Chunk*> full_chunks_[kNumBuckets];90 void MoveToList(Chunk* chunk, LinkedList<Chunk*>* head);185 LinkedList<Chunk*> node_; // linked list sorted by minimum free count325 for (LinkedList<Chunk*>* it = free_chunks_[i].next(); it->data() != NULL; it = it->next()) { in Empty()330 for (LinkedList<Chunk*>* it = full_chunks_[i].next(); it->data() != NULL; it = it->next()) { in Empty()424 void HeapImpl::MoveToList(Chunk* chunk, LinkedList<Chunk*>* head) { in MoveToList()428 LinkedList<Chunk*>* node = head; in MoveToList()
23 import java.util.LinkedList;39 private final LinkedList<String> scopes = new LinkedList<>();
24 import java.util.LinkedList;64 LinkedList<File> dirs = new LinkedList<>(); in ensureDirectoriesExist()
26 import java.util.LinkedList;85 LinkedList<String> searchIdQueue = new LinkedList<>(); in getAllAlternativeIds()