private/fs_shell/DoublyLinkedList.h

55 	inline Link *operator()(Element *element) const
57 		return element->GetDoublyLinkedListLink();
60 	inline const Link *operator()(const Element *element) const
62 		return element->GetDoublyLinkedListLink();
74 	inline Link *operator()(Element *element) const
76 		return &(element->*LinkMember);
79 	inline const Link *operator()(const Element *element) const
81 		return &(element->*LinkMember);
92 		inline Link *operator()(Element *element) const
94 			return (Link *)&element->link;
97 		inline const Link *operator()(const Element *element) const
99 			return (const Link *)&element->link;
151 			Element *element = fCurrent;
156 			return element;
200 			Element *element = fNext;
203 			return element;
252 			Element *element = fCurrent;
257 			return element;
301 			Element *element = fNext;
304 			return element;
330 	inline void InsertBefore(Element* insertBefore, Element* element);
331 	inline void InsertAfter(Element* insertAfter, Element* element);
332 	inline void Insert(Element* element, bool back = true);
333 	inline void Add(Element *element, bool back = true);
334 	inline void Remove(Element *element);
351 	inline Element *GetPrevious(Element *element) const;
352 	inline Element *GetNext(Element *element) const;
366 	inline void Insert(Element* before, Element* element);
382 DOUBLY_LINKED_LIST_CLASS_NAME::Insert(Element *element, bool back)
384 	if (element) {
387 			Link *elLink = sGetLink(element);
391 				sGetLink(fLast)->next = element;
393 				fFirst = element;
394 			fLast = element;
397 			Link *elLink = sGetLink(element);
401 				sGetLink(fFirst)->previous = element;
403 				fLast = element;
404 			fFirst = element;
412 DOUBLY_LINKED_LIST_CLASS_NAME::InsertBefore(Element* before, Element* element)
415 		Insert(element);
418 	if (element == NULL)
422 	Link *link = sGetLink(element);
427 		sGetLink(link->previous)->next = element;
428 	beforeLink->previous = element;
431 		fFirst = element;
437 DOUBLY_LINKED_LIST_CLASS_NAME::InsertAfter(Element* after, Element* element)
439 	ASSERT(element != NULL);
442 		Insert(element, false);
447 	Link* link = sGetLink(element);
451 	afterLink->next = element;
454 		sGetLink(link->next)->previous = element;
456 		fLast = element;
462 DOUBLY_LINKED_LIST_CLASS_NAME::Insert(Element* before, Element* element)
464 	InsertBefore(before, element);
471 DOUBLY_LINKED_LIST_CLASS_NAME::Add(Element *element, bool back)
473 	Insert(element, back);
479 DOUBLY_LINKED_LIST_CLASS_NAME::Remove(Element *element)
481 	if (element) {
482 		Link *elLink = sGetLink(element);
543 	Element *element = fFirst;
544 	while (element) {
545 		Link *elLink = sGetLink(element);
546 		element = elLink->next;
559 	Element *element = Head();
560 	Remove(element);
561 	return element;
567 DOUBLY_LINKED_LIST_CLASS_NAME::GetPrevious(Element *element) const
570 	if (element)
571 		result = sGetLink(element)->previous;
578 DOUBLY_LINKED_LIST_CLASS_NAME::GetNext(Element *element) const
581 	if (element)
582 		result = sGetLink(element)->next;
592 	for (Element* element = First(); element; element = GetNext(element))