diff --git a/doc/index.html.sss b/doc/index.html.sss index 3e2b005..9e277a0 100644 --- a/doc/index.html.sss +++ b/doc/index.html.sss @@ -2600,7 +2600,7 @@ echo "${sglib_define_list_functions_parameters}" function -type *sglib_type_find_member(type **list, type *elem) +type *sglib_type_find_member(type *list, type *elem)

find an element in the list. The element is searched using comparator equality. @@ -3159,7 +3159,7 @@ echo "${sglib_define_sorted_list_functions_parameters}" function -type *sglib_type_find_member(type **list, type *elem) +type *sglib_type_find_member(type *list, type *elem)

find an element in the list. The element is searched using comparator equality. @@ -3804,7 +3804,7 @@ echo "${sglib_define_dl_list_functions_parameters}" function -type *sglib_type_find_member(type **list, type *elem) +type *sglib_type_find_member(type *list, type *elem)

find an element in the list. The element is searched using comparator equality. @@ -4409,7 +4409,7 @@ echo "${sglib_define_rbtree_functions_parameters}" function -type *sglib_type_find_member(type **tree, type *elem) +type *sglib_type_find_member(type *tree, type *elem)

find an element in the tree. The element is searched using comparator equality. diff --git a/samples/Makefile b/samples/Makefile index 45d0bbb..525520d 100644 --- a/samples/Makefile +++ b/samples/Makefile @@ -2,7 +2,7 @@ runall: arraysort arraysort1 arraybinsearch listsort listinsertsort listinsertso +make clean %.exe: %.c ../sglib.h - $(CC) -std=gnu89 -Wall -Wextra -pedantic -Wno-unused-function -I.. $*.c -o $*.exe + $(CC) -std=gnu89 -Wall -Werror -Wextra -pedantic -Wno-unused-function -I.. $*.c -o $*.exe arraysort: arraysort.exe ../sglib.h ./$< 6 7 3 4 1 4 1 3 5 diff --git a/sglib.h b/sglib.h index eb832fb..e1edf46 100644 --- a/sglib.h +++ b/sglib.h @@ -851,7 +851,7 @@ return(SGLIB_QUEUE_IS_EMPTY(elem_type, q->afield, q->ifield, q->jfield));\ }\ int sglib_##queue_type##_is_full(queue_type *q) {\ - return(SGLIB_QUEUE_IS_FULL(elem_type, q->afield, q->ifield, q->jfield));\ + return(SGLIB_QUEUE_IS_FULL(elem_type, q->afield, q->ifield, q->jfield, dim));\ }\ elem_type sglib_##queue_type##_first_element(queue_type *q) {\ return(SGLIB_QUEUE_FIRST_ELEMENT(elem_type, q->afield, q->ifield, q->jfield));\