headers/shared/SLList.h

44 	inline Link *operator()(Element *element) const
46 		return element->GetSLListLink();
49 	inline const Link *operator()(const Element *element) const
51 		return element->GetSLListLink();
102 			Element *element = fCurrent;
107 			return element;
146 			Element *element = fNext;
149 			return element;
172 	inline void Insert(Element *element, bool back = true);
173 	inline void InsertAfter(Element *previous, Element *element);
174 	inline void Remove(Element *element);
187 	inline Element *GetNext(Element *element) const;
198 	inline void _Remove(Element *previous, Element *element);
218 SL_LIST_CLASS_NAME::Insert(Element *element, bool back)
220 	InsertAfter((back ? fLast : NULL), element);
226 SL_LIST_CLASS_NAME::InsertAfter(Element *previous, Element *element)
228 	if (element) {
229 		Link *elLink = fGetLink(element);
231 			// insert after previous element
234 			prevLink->next = element;
236 			// no previous element given: prepend
238 			fFirst = element;
241 		// element may be new last element
243 			fLast = element;
250 SL_LIST_CLASS_NAME::Remove(Element *element)
252 	if (!element)
256 		if (element == it.Next()) {
286 	Element *element = fFirst;
287 	while (element) {
288 		Link *elLink = fGetLink(element);
289 		element = elLink->next;
299 SL_LIST_CLASS_NAME::GetNext(Element *element) const
301 	return (element ? fGetLink(element)->next : NULL);
307 SL_LIST_CLASS_NAME::_Remove(Element *previous, Element *element)
309 	Link *elLink = fGetLink(element);
315 	if (element == fLast)
327 	for (Element* element = GetFirst(); element; element = GetNext(element))