gryf/wmaker
1
0
Fork 0
mirror of https://github.com/gryf/wmaker.git synced 2026-02-12 11:45:55 +01:00
Code Issues Projects Releases Wiki Activity

- the list multiple selection code is working now. it still needs some

Browse Source 
minor work and cleanup.
- made some bag and array functions to return void instead of int.
- a few new array functions.
- better handling of mouse wheel.

!!! make clean after this update before you rebuild. some enums changed.
This commit is contained in:
dan
2000-10-01 23:26:03 +00:00
parent 6de1c41865
commit b2478b634f
13 changed files with 467 additions and 157 deletions
Download Patch File Download Diff File Expand all files Collapse all files

25
WINGs/bagtree.c
View File

@@ -423,22 +423,19 @@ WMGetBagItemCount(WMBag *self)
}
int
void
WMAppendBag(WMBag *self, WMBag *bag)
{
WMBagIterator ptr;
void *data;
for (data = WMBagFirst(bag, &ptr); data != NULL; data = WMBagNext(bag, &ptr)) {
if (!WMPutInBag(self, data))
return 0;
WMPutInBag(self, data);
}
return 1;
}
int
void
WMPutInBag(WMBag *self, void *item)
{
W_Node *ptr;
@@ -454,12 +451,10 @@ WMPutInBag(WMBag *self, void *item)
rbTreeInsert(self, ptr);
self->count++;
return 1;
}
int
void
WMInsertInBag(WMBag *self, int index, void *item)
{
W_Node *ptr;
@@ -480,8 +475,6 @@ WMInsertInBag(WMBag *self, int index, void *item)
self->count++;
return 1;
}
@@ -720,9 +713,7 @@ void
WMFreeBag(WMBag *self)
{
WMEmptyBag(self);
free(self->nil);
free(self);
}
@@ -785,11 +776,9 @@ WMBagFirst(WMBag *self, WMBagIterator *ptr)
if (node == self->nil) {
*ptr = NULL;
return NULL;
} else {
*ptr = node;
return node->data;
}
}
@@ -805,11 +794,9 @@ WMBagLast(WMBag *self, WMBagIterator *ptr)
if (node == self->nil) {
*ptr = NULL;
return NULL;
} else {
*ptr = node;
return node->data;
}
}
@@ -827,11 +814,9 @@ WMBagNext(WMBag *self, WMBagIterator *ptr)
if (node == self->nil) {
*ptr = NULL;
return NULL;
} else {
*ptr = node;
return node->data;
}
}
@@ -849,11 +834,9 @@ WMBagPrevious(WMBag *self, WMBagIterator *ptr)
if (node == self->nil) {
*ptr = NULL;
return NULL;
} else {
*ptr = node;
return node->data;
}
}