kaspar/RIOT
1
0
Fork 0
mirror of https://github.com/RIOT-OS/RIOT.git synced 2025-12-25 14:33:52 +01:00
Code Releases Activity

core:queue: remove ancient example

Browse Source
This commit is contained in:
René Kijewski 2014-05-07 00:04:37 +02:00
parent 23e125463d
commit dacbc0043e
1 changed files with 0 additions and 40 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

40
core/queue.c
View File

@ -17,7 +17,6 @@
* @}
*/
#include <stddef.h>
#include <inttypes.h>
#include <stdio.h>
@ -115,42 +114,3 @@ void queue_print_node(queue_node_t *node)
printf("Data: %u Priority: %" PRIu32 " Next: %u\n", (unsigned int)node->data, node->priority, (unsigned int)node->next);
}
#endif
/*
int main() {
queue_node_t root, a, b, c,d;
memset(&d, '\0', sizeof(queue_node_t));
memset(&a, '\0', sizeof(queue_node_t));
memset(&b, '\0', sizeof(queue_node_t));
memset(&c, '\0', sizeof(queue_node_t));
root.data = 0;
root.next = NULL;
a.data = 1;
a.priority = 1;
b.data = 2;
b.priority = 2;
c.data = 0;
c.priority = 5;
d.data = 4;
d.priority = 4;
queue_add_tail(&root, &a);
queue_add_tail(&root, &b);
queue_add_tail(&root, &c);
queue_add_tail(&root, &d);
queue_print(&root);
queue_remove(&root, &c);
queue_print(&root);
queue_priority_add(&root, &c);
queue_print(&root);
return 0;
}*/