63 				Element *element = fCurrent;  in Remove()  local
68 				return element;  in Remove()
112 				Element *element = fNext;  in Next()  local
115 				return element;  in Next()
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);
158 	inline Element *GetPrevious(Element *element) const;
159 	inline Element *GetNext(Element *element) const;
179 DOUBLY_LINKED_QUEUE_CLASS_NAME::Insert(Element *element)  in Insert()  argument
181 	if (element) {  in Insert()
182 		Link *elLink = sGetLink(element);  in Insert()
186 			sGetLink(fFirst)->previous = element;  in Insert()
187 		fFirst = element;  in Insert()
194 DOUBLY_LINKED_QUEUE_CLASS_NAME::InsertBefore(Element *before, Element *element)  in InsertBefore()  argument
197 		Insert(element);  in InsertBefore()
200 	if (element == NULL)  in InsertBefore()
204 	Link *link = sGetLink(element);  in InsertBefore()
209 		sGetLink(link->previous)->next = element;  in InsertBefore()
210 	beforeLink->previous = element;  in InsertBefore()
213 		fFirst = element;  in InsertBefore()
219 DOUBLY_LINKED_QUEUE_CLASS_NAME::Add(Element *element)  in Add()  argument
221 	Insert(element);  in Add()
227 DOUBLY_LINKED_QUEUE_CLASS_NAME::Remove(Element *element)  in Remove()  argument
229 	if (element == NULL)  in Remove()
234 		"queue: %p, element: %p\n", this, element);  in Remove()
237 	Link *elLink = sGetLink(element);  in Remove()
238 	if (element == fFirst)  in Remove()
291 			Element *element = fFirst;  in MoveFrom()  local
293 			while ((elLink = sGetLink(element))->next) {  in MoveFrom()
294 				element = elLink->next;  in MoveFrom()
309 	Element *element = fFirst;  in RemoveAll()  local
310 	while (element) {  in RemoveAll()
311 		Link *elLink = sGetLink(element);  in RemoveAll()
312 		element = elLink->next;  in RemoveAll()
324 	Element *element = Head();  in RemoveHead()  local
325 	Remove(element);  in RemoveHead()
326 	return element;  in RemoveHead()
332 DOUBLY_LINKED_QUEUE_CLASS_NAME::GetPrevious(Element *element) const  in GetPrevious()  argument
335 	if (element)  in GetPrevious()
336 		result = sGetLink(element)->previous;  in GetPrevious()
343 DOUBLY_LINKED_QUEUE_CLASS_NAME::GetNext(Element *element) const  in GetNext()  argument
346 	if (element)  in GetNext()
347 		result = sGetLink(element)->next;  in GetNext()
357 	for (Element* element = First(); element; element = GetNext(element))  in Size()  local