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