kernel/util/SinglyLinkedList.h

52 	inline Link* operator()(Element* element) const
54 		return element->GetSinglyLinkedListLink();
57 	inline const Link* operator()(const Element* element) const
59 		return element->GetSinglyLinkedListLink();
71 	inline Link* operator()(Element* element) const
73 		return &(element->*LinkMember);
76 	inline const Link* operator()(const Element* element) const
78 		return &(element->*LinkMember);
118 					Element* element = fNext;
121 					return element;
147 		inline void Add(Element* element);
148 		inline bool Remove(Element* element);
149 		inline void Remove(Element* previous, Element* element);
162 		inline Element* GetNext(Element* element) const;
181 SINGLY_LINKED_LIST_CLASS_NAME::Add(Element* element)
183 	if (element != NULL) {
184 		sGetLink(element)->next = fFirst;
185 		fFirst = element;
190 /*!	Removes \a element from the list.
191 	It is safe to call the list with a \c NULL element or an element that isn't
193 	\param element The element to be removed.
194 	\return \c true, if the element was in the list and has been removed,
199 SINGLY_LINKED_LIST_CLASS_NAME::Remove(Element* element)
201 	if (element == NULL)
206 	while (element != next) {
213 	Link* elementLink = sGetLink(element);
226 SINGLY_LINKED_LIST_CLASS_NAME::Remove(Element* previous, Element* element)
229 //		? fFirst == element : sGetLink(previous)->next == element);
231 	Link* elementLink = sGetLink(element);
270 	Element* element = fFirst;
271 	while (element) {
272 		Link* elLink = sGetLink(element);
273 		element = elLink->next;
284 	Element* element = Head();
285 	Remove(element);
286 	return element;
292 SINGLY_LINKED_LIST_CLASS_NAME::GetNext(Element* element) const
295 	if (element)
296 		result = sGetLink(element)->next;
306 	for (Element* element = First(); element; element = GetNext(element))