56 	inline Link* operator()(Element* element) const  in operator()
58 		return element->GetDoublyLinkedListLink();  in operator()
61 	inline const Link* operator()(const Element* element) const  in operator()
63 		return element->GetDoublyLinkedListLink();  in operator()
75 	inline Link* operator()(Element* element) const  in operator()
77 		return &(element->*LinkMember);  in operator()
80 	inline const Link* operator()(const Element* element) const  in operator()
82 		return &(element->*LinkMember);  in operator()
93 		inline Link* operator()(Element* element) const  in operator()
95 			return (Link*)&element->link;  in operator()
98 		inline const Link* operator()(const Element* element) const  in operator()
100 			return (const Link*)&element->link;  in operator()
156 			Element* element = fCurrent;  in Remove()  local
161 			return element;  in Remove()
205 			Element* element = fNext;  in Next()  local
208 			return element;  in Next()
257 			Element* element = fCurrent;  in Remove()  local
262 			return element;  in Remove()
306 			Element* element = fNext;  in Next()  local
309 			return element;  in Next()
335 	inline void InsertBefore(Element* insertBefore, Element* element);
336 	inline void InsertAfter(Element* insertAfter, Element* element);
337 	inline void Insert(Element* element, bool back = true);
338 	inline void Add(Element* element, bool back = true);
339 	inline void Remove(Element* element);
357 	static inline Element* GetPrevious(Element* element);
358 	static inline Element* GetNext(Element* element);
360 	inline bool Contains(Element* element) const;
379 	inline void Insert(Element* before, Element* element);
395 DOUBLY_LINKED_LIST_CLASS_NAME::Insert(Element* element, bool back)  in Insert()  argument
397 	if (element) {  in Insert()
403 		Link* elLink = sGetLink(element);  in Insert()
409 				sGetLink(fLast)->next = element;  in Insert()
411 				fFirst = element;  in Insert()
412 			fLast = element;  in Insert()
418 				sGetLink(fFirst)->previous = element;  in Insert()
420 				fLast = element;  in Insert()
421 			fFirst = element;  in Insert()
429 DOUBLY_LINKED_LIST_CLASS_NAME::InsertBefore(Element* before, Element* element)  in InsertBefore()  argument
431 	ASSERT(element != NULL);  in InsertBefore()
434 		Insert(element);  in InsertBefore()
444 	Link* link = sGetLink(element);  in InsertBefore()
448 	beforeLink->previous = element;  in InsertBefore()
451 		sGetLink(link->previous)->next = element;  in InsertBefore()
453 		fFirst = element;  in InsertBefore()
459 DOUBLY_LINKED_LIST_CLASS_NAME::InsertAfter(Element* after, Element* element)  in InsertAfter()  argument
461 	ASSERT(element != NULL);  in InsertAfter()
464 		Insert(element, false);  in InsertAfter()
474 	Link* link = sGetLink(element);  in InsertAfter()
478 	afterLink->next = element;  in InsertAfter()
481 		sGetLink(link->next)->previous = element;  in InsertAfter()
483 		fLast = element;  in InsertAfter()
489 DOUBLY_LINKED_LIST_CLASS_NAME::Insert(Element* before, Element* element)  in Insert()  argument
491 	InsertBefore(before, element);  in Insert()
498 DOUBLY_LINKED_LIST_CLASS_NAME::Add(Element* element, bool back)  in Add()  argument
500 	Insert(element, back);  in Add()
506 DOUBLY_LINKED_LIST_CLASS_NAME::Remove(Element* element)  in Remove()  argument
508 	if (element == NULL)  in Remove()
513 		&& (fFirst != fLast || element == fFirst),  in Remove()
514 		"list: %p, element: %p\n", this, element);  in Remove()
517 	Link* elLink = sGetLink(element);  in Remove()
519 	if (element == fFirst)  in Remove()
524 	if (element == fLast)  in Remove()
588 	Element* element = Head();  in RemoveHead()  local
589 	Remove(element);  in RemoveHead()
590 	return element;  in RemoveHead()
598 	Element* element = Tail();  in RemoveTail()  local
599 	Remove(element);  in RemoveTail()
600 	return element;  in RemoveTail()
606 DOUBLY_LINKED_LIST_CLASS_NAME::GetPrevious(Element* element)  in GetPrevious()  argument
609 	if (element)  in GetPrevious()
610 		result = sGetLink(element)->previous;  in GetPrevious()
617 DOUBLY_LINKED_LIST_CLASS_NAME::GetNext(Element* element)  in GetNext()  argument
620 	if (element)  in GetNext()
621 		result = sGetLink(element)->next;  in GetNext()
630 	for (Element* element = First(); element; element = GetNext(element)) {  in Contains()  local
631 		if (element == _element)  in Contains()
645 	for (Element* element = First(); element; element = GetNext(element))  in Count()  local
660 		Element* element = tail;  in Sort()  local
661 		while ((element = GetNext(element)) != NULL) {  in Sort()
662 			if (less(element, leastElement))  in Sort()
663 				leastElement = element;  in Sort()