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

Now uses new SinglyLinkedList template parameters.

Browse Source 
git-svn-id: file:///srv/svn/repos/haiku/trunk/current@4602 a95241bf-73f2-0310-859d-f6bbb57e9c96
This commit is contained in:
Tyler Dauwalder
2003-09-09 06:22:27 +00:00
parent 6d14aa1a4b
commit a64f0e9fc2
2 changed files with 8 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/add-ons/kernel/file_systems/udf/Icb.h
+1 -1
View File
@@ -116,7 +116,7 @@ private:
CachedBlock fData;
status_t fInitStatus;
vnode_id fId;
SinglyLinkedList<Strategy::SinglyLinkedList::Auto<DirectoryIterator*> > fIteratorList;
SinglyLinkedList<DirectoryIterator*> fIteratorList;
FileEntry<udf_file_icb_entry> fFileEntry;
FileEntry<udf_extended_file_icb_entry> fExtendedEntry;
};
src/tests/kernel/core/util/SinglyLinkedListTest.cpp
+7 -5
View File
@@ -63,9 +63,11 @@ SinglyLinkedListTest::TestList(List &list, typename List::ValueType *values, int
CHK(list.Count() == i+1);
}
{
// Prefix increment
int preIndex = valueCount-1;
for (typename List::Iterator iterator = list.Begin(); iterator != list.End(); --preIndex) {
typename List::Iterator iterator;
for (iterator = list.Begin(); iterator != list.End(); --preIndex) {
NextSubTest();
// printf("(%p, %ld) %s (%p, %ld)\n", iterator->next, iterator->data, ((*iterator == values[preIndex]) ? "==" : "!="), values[preIndex].next, values[preIndex].data);
CHK(*iterator == values[preIndex]);
@@ -74,7 +76,7 @@ SinglyLinkedListTest::TestList(List &list, typename List::ValueType *values, int
CHK(copy != ++iterator);
}
CHK(preIndex == -1);
}
list.MakeEmpty();
// PushBack
@@ -102,7 +104,7 @@ SinglyLinkedListTest::TestList(List &list, typename List::ValueType *values, int
//! Test using the User strategy with the default NextMember.
void
SinglyLinkedListTest::UserDefaultTest() {
SinglyLinkedList<User<Link> > list;
SinglyLinkedList<Link, User<Link> > list;
const int valueCount = 10;
Link values[valueCount];
for (int i = 0; i < valueCount; i++) {
@@ -117,7 +119,7 @@ SinglyLinkedListTest::UserDefaultTest() {
//! Test using the User strategy with a custom NextMember.
void
SinglyLinkedListTest::UserCustomTest() {
SinglyLinkedList<User<MyLink, &MyLink::mynext> > list;
SinglyLinkedList<MyLink, User<MyLink, &MyLink::mynext> > list;
const int valueCount = 10;
MyLink values[valueCount];
for (int i = 0; i < valueCount; i++) {
@@ -132,7 +134,7 @@ SinglyLinkedListTest::UserCustomTest() {
//! Test using the Auto strategy.
void
SinglyLinkedListTest::AutoTest() {
SinglyLinkedList<Auto<long> > list;
SinglyLinkedList<long> list;
const int valueCount = 10;
long values[valueCount];
for (int i = 0; i < valueCount; i++) {