kernel/util/DoublyLinkedQueue.h

23 #define DOUBLY_LINKED_QUEUE_CLASS_NAME DoublyLinkedQueue<Element, GetLink>
26 template<typename Element,
27 	typename GetLink = DoublyLinkedListStandardGetLink<Element> >
30 	typedef DoublyLinkedQueue<Element, GetLink>	Queue;
31 	typedef DoublyLinkedListLink<Element>		Link;
53 			Element *Next()
61 			Element *Remove()
63 				Element *element = fCurrent;
87 			Element	*fCurrent;
88 			Element	*fNext;
110 			Element *Next()
112 				Element *element = fNext;
132 			Element		*fNext;
141 	inline void Insert(Element *element);
142 	inline void InsertBefore(Element *before, Element *element);
143 	inline void Add(Element *element);
144 	inline void Remove(Element *element);
146 	inline void Swap(Element *a, Element *b);
153 	inline Element *First() const	{ return fFirst; }
154 	inline Element *Head() const	{ return fFirst; }
156 	inline Element *RemoveHead();
158 	inline Element *GetPrevious(Element *element) const;
159 	inline Element *GetNext(Element *element) const;
168 	Element	*fFirst;
179 DOUBLY_LINKED_QUEUE_CLASS_NAME::Insert(Element *element)
194 DOUBLY_LINKED_QUEUE_CLASS_NAME::InsertBefore(Element *before, Element *element)
219 DOUBLY_LINKED_QUEUE_CLASS_NAME::Add(Element *element)
227 DOUBLY_LINKED_QUEUE_CLASS_NAME::Remove(Element *element)
252 DOUBLY_LINKED_QUEUE_CLASS_NAME::Swap(Element *a, Element *b)
257 		Element *aPrev = aLink->previous;
258 		Element *bPrev = bLink->previous;
259 		Element *aNext = aLink->next;
260 		Element *bNext = bLink->next;
291 			Element *element = fFirst;
309 	Element *element = fFirst;
321 Element *
324 	Element *element = Head();
331 Element *
332 DOUBLY_LINKED_QUEUE_CLASS_NAME::GetPrevious(Element *element) const
334 	Element *result = NULL;
342 Element *
343 DOUBLY_LINKED_QUEUE_CLASS_NAME::GetNext(Element *element) const
345 	Element *result = NULL;
357 	for (Element* element = First(); element; element = GetNext(element))