Home
last modified time | relevance | path

Searched refs:ListHead (Results 1 – 4 of 4) sorted by relevance

/third_party/node/src/
Dutil-inl.h91 ListHead<T, M>::Iterator::Iterator(ListNode<T>* node) : node_(node) {} in Iterator()
94 T* ListHead<T, M>::Iterator::operator*() const {
99 const typename ListHead<T, M>::Iterator&
100 ListHead<T, M>::Iterator::operator++() {
106 bool ListHead<T, M>::Iterator::operator!=(const Iterator& that) const {
111 ListHead<T, M>::~ListHead() { in ~ListHead()
117 void ListHead<T, M>::PushBack(T* element) { in PushBack()
126 void ListHead<T, M>::PushFront(T* element) { in PushFront()
135 bool ListHead<T, M>::IsEmpty() const { in IsEmpty()
140 T* ListHead<T, M>::PopFront() { in PopFront()
[all …]
Dutil.h209 class ListHead; variable
223 template <typename U, ListNode<U> (U::*M)> friend class ListHead;
230 class ListHead {
239 friend class ListHead;
244 inline ListHead() = default;
245 inline ~ListHead();
253 ListHead(const ListHead&) = delete;
254 ListHead& operator=(const ListHead&) = delete;
Denv.h1183 typedef ListHead<HandleWrap, &HandleWrap::handle_wrap_queue_> HandleWrapQueue;
1184 typedef ListHead<ReqWrapBase, &ReqWrapBase::req_wrap_queue_> ReqWrapQueue;
/third_party/node/test/cctest/
Dtest_util.cc16 TEST(UtilTest, ListHead) { in TEST() argument
18 typedef node::ListHead<Item, &Item::node_> List; in TEST()