Aren/haiku
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Added MoveFrom().

Browse Source 
git-svn-id: file:///srv/svn/repos/haiku/haiku/trunk@28284 a95241bf-73f2-0310-859d-f6bbb57e9c96
This commit is contained in:
Ingo Weinhold 2008-10-22 14:43:46 +00:00
parent 950eeadd92
commit 63a9f18f31
1 changed files with 29 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

30
headers/private/kernel/util/SinglyLinkedList.h
View File

@ -1,6 +1,6 @@
/*
* Copyright 2008, Axel Dörfler, axeld@pinc-software.de. All rights reserved.
* Copyright 2005-2006, Ingo Weinhold, bonefish@users.sf.net. All rights reserved.
* Copyright 2005-2008, Ingo Weinhold, ingo_weinhold@gmx.de.
*
* Distributed under the terms of the MIT License.
*/
@ -144,6 +144,9 @@ class SinglyLinkedList {
inline void Add(Element* element);
inline void Remove(Element* element);
inline void MoveFrom(SINGLY_LINKED_LIST_CLASS_NAME* fromList);
// O(1) if either list is empty, otherwise O(n).
inline void RemoveAll();
inline void MakeEmpty() { RemoveAll(); }
@ -203,6 +206,31 @@ SINGLY_LINKED_LIST_CLASS_NAME::Remove(Element* element)
elementLink->next = NULL;
}
SINGLY_LINKED_LIST_TEMPLATE_LIST
void
SINGLY_LINKED_LIST_CLASS_NAME::MoveFrom(SINGLY_LINKED_LIST_CLASS_NAME* fromList)
{
if (fromList->fFirst == NULL)
return;
if (fFirst == NULL) {
// This list is empty -- just transfer the head.
fFirst = fromList->fFirst;
fromList->fFirst = NULL;
return;
}
// Neither list is empty -- find the tail of this list.
Element* tail = fFirst;
while (Element* next = sGetLink(tail)->next)
tail = next;
sGetLink(tail)->next = fromList->fFirst;
fromList->fFirst = NULL;
}
// RemoveAll
SINGLY_LINKED_LIST_TEMPLATE_LIST
void