~laumann/C

d02ae8445fab313783331951ded4038b445041a7 — Thomas Jespersen 9 years ago fc66154
Prefer 'for (;;)' to 'while (1)'
1 files changed, 2 insertions(+), 2 deletions(-)

M linkedlist/linkedlist.c
M linkedlist/linkedlist.c => linkedlist/linkedlist.c +2 -2
@@ 95,7 95,7 @@ int linked_list_insert(struct linked_list *list, struct linked_list_node *item)
		;
	*/

	while (1) {
	for (;;) {
		if (n==NULL)
			break;
		last = n;


@@ 124,7 124,7 @@ struct linked_list_node* linked_list_pop(struct linked_list* l)
		;
	*/

	while (1) {
	for (;;) {
		if (n->next)
			n = n->next;
		else