i2p/haiku-beta6
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Removed the DoublyLinkedListLink constructor and destructor. They are not

Browse Source 
necessary and prevent the structures from being used in a union.


git-svn-id: file:///srv/svn/repos/haiku/haiku/trunk@34525 a95241bf-73f2-0310-859d-f6bbb57e9c96
This commit is contained in:
Ingo Weinhold
2009-12-06 15:47:34 +00:00
parent 6490c5b621
commit 4fb60da357
1 changed files with 7 additions and 10 deletions
Download Patch File Download Diff File Expand all files Collapse all files
headers/private/kernel/util/DoublyLinkedList.h
+7 -10
View File
@@ -1,5 +1,5 @@
/* /*
* Copyright 2005-2007, Ingo Weinhold, [email protected]. * Copyright 2005-2009, Ingo Weinhold, [email protected].
* Copyright 2006-2009, Axel Dörfler, [email protected]. * Copyright 2006-2009, Axel Dörfler, [email protected].
* *
* Distributed under the terms of the MIT License. * Distributed under the terms of the MIT License.
@@ -25,9 +25,6 @@
template<typename Element> template<typename Element>
class DoublyLinkedListLink { class DoublyLinkedListLink {
public: public:
DoublyLinkedListLink() : next(NULL), previous(NULL) {}
~DoublyLinkedListLink() {}
Element* next; Element* next;
Element* previous; Element* previous;
}; };
@@ -42,7 +39,7 @@ public:
DoublyLinkedListLinkImpl() : fDoublyLinkedListLink() {} DoublyLinkedListLinkImpl() : fDoublyLinkedListLink() {}
~DoublyLinkedListLinkImpl() {} ~DoublyLinkedListLinkImpl() {}
DLL_Link* GetDoublyLinkedListLink() DLL_Link* GetDoublyLinkedListLink()
{ return &fDoublyLinkedListLink; } { return &fDoublyLinkedListLink; }
const DLL_Link* GetDoublyLinkedListLink() const const DLL_Link* GetDoublyLinkedListLink() const
{ return &fDoublyLinkedListLink; } { return &fDoublyLinkedListLink; }
@@ -541,7 +538,7 @@ DOUBLY_LINKED_LIST_CLASS_NAME::RemoveAll()
// RemoveHead // RemoveHead
DOUBLY_LINKED_LIST_TEMPLATE_LIST DOUBLY_LINKED_LIST_TEMPLATE_LIST
Element* Element*
DOUBLY_LINKED_LIST_CLASS_NAME::RemoveHead() DOUBLY_LINKED_LIST_CLASS_NAME::RemoveHead()
{ {
Element* element = Head(); Element* element = Head();
@@ -551,7 +548,7 @@ DOUBLY_LINKED_LIST_CLASS_NAME::RemoveHead()
// RemoveTail // RemoveTail
DOUBLY_LINKED_LIST_TEMPLATE_LIST DOUBLY_LINKED_LIST_TEMPLATE_LIST
Element* Element*
DOUBLY_LINKED_LIST_CLASS_NAME::RemoveTail() DOUBLY_LINKED_LIST_CLASS_NAME::RemoveTail()
{ {
Element* element = Tail(); Element* element = Tail();
@@ -561,7 +558,7 @@ DOUBLY_LINKED_LIST_CLASS_NAME::RemoveTail()
// GetPrevious // GetPrevious
DOUBLY_LINKED_LIST_TEMPLATE_LIST DOUBLY_LINKED_LIST_TEMPLATE_LIST
Element* Element*
DOUBLY_LINKED_LIST_CLASS_NAME::GetPrevious(Element* element) const DOUBLY_LINKED_LIST_CLASS_NAME::GetPrevious(Element* element) const
{ {
Element* result = NULL; Element* result = NULL;
@@ -572,7 +569,7 @@ DOUBLY_LINKED_LIST_CLASS_NAME::GetPrevious(Element* element) const
// GetNext // GetNext
DOUBLY_LINKED_LIST_TEMPLATE_LIST DOUBLY_LINKED_LIST_TEMPLATE_LIST
Element* Element*
DOUBLY_LINKED_LIST_CLASS_NAME::GetNext(Element* element) const DOUBLY_LINKED_LIST_CLASS_NAME::GetNext(Element* element) const
{ {
Element* result = NULL; Element* result = NULL;