cocos2d-x
3.3
|
#include <assert.h>
Macros | |
#define | UTLIST_VERSION 1.9.8 |
#define | LDECLTYPE(x) __typeof(x) |
#define | _SV(elt, list) |
#define | _NEXT(elt, list, next) ((elt)->next) |
#define | _NEXTASGN(elt, list, to, next) ((elt)->next)=(to) |
#define | _PREVASGN(elt, list, to, prev) ((elt)->prev)=(to) |
#define | _RS(list) |
#define | _CASTASGN(a, b) (a)=(b) |
#define | LL_SORT(list, cmp) LL_SORT2(list, cmp, next) |
#define | LL_SORT2(list, cmp, next) |
#define | DL_SORT(list, cmp) DL_SORT2(list, cmp, prev, next) |
#define | DL_SORT2(list, cmp, prev, next) |
#define | CDL_SORT(list, cmp) CDL_SORT2(list, cmp, prev, next) |
#define | CDL_SORT2(list, cmp, prev, next) |
#define | LL_PREPEND(head, add) LL_PREPEND2(head,add,next) |
#define | LL_PREPEND2(head, add, next) |
#define | LL_CONCAT(head1, head2) LL_CONCAT2(head1,head2,next) |
#define | LL_CONCAT2(head1, head2, next) |
#define | LL_APPEND(head, add) LL_APPEND2(head,add,next) |
#define | LL_APPEND2(head, add, next) |
#define | LL_DELETE(head, del) LL_DELETE2(head,del,next) |
#define | LL_DELETE2(head, del, next) |
#define | LL_APPEND_VS2008(head, add) LL_APPEND2_VS2008(head,add,next) |
#define | LL_APPEND2_VS2008(head, add, next) |
#define | LL_DELETE_VS2008(head, del) LL_DELETE2_VS2008(head,del,next) |
#define | LL_DELETE2_VS2008(head, del, next) |
#define | LL_FOREACH(head, el) LL_FOREACH2(head,el,next) |
#define | LL_FOREACH2(head, el, next) for(el=head;el;el=(el)->next) |
#define | LL_FOREACH_SAFE(head, el, tmp) LL_FOREACH_SAFE2(head,el,tmp,next) |
#define | LL_FOREACH_SAFE2(head, el, tmp, next) for((el)=(head);(el) && (tmp = (el)->next, 1); (el) = tmp) |
#define | LL_SEARCH_SCALAR(head, out, field, val) LL_SEARCH_SCALAR2(head,out,field,val,next) |
#define | LL_SEARCH_SCALAR2(head, out, field, val, next) |
#define | LL_SEARCH(head, out, elt, cmp) LL_SEARCH2(head,out,elt,cmp,next) |
#define | LL_SEARCH2(head, out, elt, cmp, next) |
#define | LL_REPLACE_ELEM(head, el, add) |
#define | LL_PREPEND_ELEM(head, el, add) |
#define | DL_PREPEND(head, add) DL_PREPEND2(head,add,prev,next) |
#define | DL_PREPEND2(head, add, prev, next) |
#define | DL_APPEND(head, add) DL_APPEND2(head,add,prev,next) |
#define | DL_APPEND2(head, add, prev, next) |
#define | DL_CONCAT(head1, head2) DL_CONCAT2(head1,head2,prev,next) |
#define | DL_CONCAT2(head1, head2, prev, next) |
#define | DL_DELETE(head, del) DL_DELETE2(head,del,prev,next) |
#define | DL_DELETE2(head, del, prev, next) |
#define | DL_FOREACH(head, el) DL_FOREACH2(head,el,next) |
#define | DL_FOREACH2(head, el, next) for(el=head;el;el=(el)->next) |
#define | DL_FOREACH_SAFE(head, el, tmp) DL_FOREACH_SAFE2(head,el,tmp,next) |
#define | DL_FOREACH_SAFE2(head, el, tmp, next) for((el)=(head);(el) && (tmp = (el)->next, 1); (el) = tmp) |
#define | DL_SEARCH_SCALAR LL_SEARCH_SCALAR |
#define | DL_SEARCH LL_SEARCH |
#define | DL_SEARCH_SCALAR2 LL_SEARCH_SCALAR2 |
#define | DL_SEARCH2 LL_SEARCH2 |
#define | DL_REPLACE_ELEM(head, el, add) |
#define | DL_PREPEND_ELEM(head, el, add) |
#define | CDL_PREPEND(head, add) CDL_PREPEND2(head,add,prev,next) |
#define | CDL_PREPEND2(head, add, prev, next) |
#define | CDL_DELETE(head, del) CDL_DELETE2(head,del,prev,next) |
#define | CDL_DELETE2(head, del, prev, next) |
#define | CDL_FOREACH(head, el) CDL_FOREACH2(head,el,next) |
#define | CDL_FOREACH2(head, el, next) for(el=head;el;el=((el)->next==head ? 0L : (el)->next)) |
#define | CDL_FOREACH_SAFE(head, el, tmp1, tmp2) CDL_FOREACH_SAFE2(head,el,tmp1,tmp2,prev,next) |
#define | CDL_FOREACH_SAFE2(head, el, tmp1, tmp2, prev, next) |
#define | CDL_SEARCH_SCALAR(head, out, field, val) CDL_SEARCH_SCALAR2(head,out,field,val,next) |
#define | CDL_SEARCH_SCALAR2(head, out, field, val, next) |
#define | CDL_SEARCH(head, out, elt, cmp) CDL_SEARCH2(head,out,elt,cmp,next) |
#define | CDL_SEARCH2(head, out, elt, cmp, next) |
#define | CDL_REPLACE_ELEM(head, el, add) |
#define | CDL_PREPEND_ELEM(head, el, add) |
#define _CASTASGN | ( | a, | |
b | |||
) | (a)=(b) |
#define _NEXT | ( | elt, | |
list, | |||
next | |||
) | ((elt)->next) |
#define _NEXTASGN | ( | elt, | |
list, | |||
to, | |||
next | |||
) | ((elt)->next)=(to) |
#define _PREVASGN | ( | elt, | |
list, | |||
to, | |||
prev | |||
) | ((elt)->prev)=(to) |
#define _RS | ( | list | ) |
#define _SV | ( | elt, | |
list | |||
) |
#define CDL_DELETE | ( | head, | |
del | |||
) | CDL_DELETE2(head,del,prev,next) |
#define CDL_DELETE2 | ( | head, | |
del, | |||
prev, | |||
next | |||
) |
#define CDL_FOREACH | ( | head, | |
el | |||
) | CDL_FOREACH2(head,el,next) |
#define CDL_FOREACH2 | ( | head, | |
el, | |||
next | |||
) | for(el=head;el;el=((el)->next==head ? 0L : (el)->next)) |
#define CDL_FOREACH_SAFE | ( | head, | |
el, | |||
tmp1, | |||
tmp2 | |||
) | CDL_FOREACH_SAFE2(head,el,tmp1,tmp2,prev,next) |
#define CDL_FOREACH_SAFE2 | ( | head, | |
el, | |||
tmp1, | |||
tmp2, | |||
prev, | |||
next | |||
) |
#define CDL_PREPEND | ( | head, | |
add | |||
) | CDL_PREPEND2(head,add,prev,next) |
#define CDL_PREPEND2 | ( | head, | |
add, | |||
prev, | |||
next | |||
) |
#define CDL_PREPEND_ELEM | ( | head, | |
el, | |||
add | |||
) |
#define CDL_REPLACE_ELEM | ( | head, | |
el, | |||
add | |||
) |
#define CDL_SEARCH | ( | head, | |
out, | |||
elt, | |||
cmp | |||
) | CDL_SEARCH2(head,out,elt,cmp,next) |
#define CDL_SEARCH2 | ( | head, | |
out, | |||
elt, | |||
cmp, | |||
next | |||
) |
#define CDL_SEARCH_SCALAR | ( | head, | |
out, | |||
field, | |||
val | |||
) | CDL_SEARCH_SCALAR2(head,out,field,val,next) |
#define CDL_SEARCH_SCALAR2 | ( | head, | |
out, | |||
field, | |||
val, | |||
next | |||
) |
#define CDL_SORT | ( | list, | |
cmp | |||
) | CDL_SORT2(list, cmp, prev, next) |
#define CDL_SORT2 | ( | list, | |
cmp, | |||
prev, | |||
next | |||
) |
#define DL_APPEND | ( | head, | |
add | |||
) | DL_APPEND2(head,add,prev,next) |
#define DL_APPEND2 | ( | head, | |
add, | |||
prev, | |||
next | |||
) |
#define DL_CONCAT | ( | head1, | |
head2 | |||
) | DL_CONCAT2(head1,head2,prev,next) |
#define DL_CONCAT2 | ( | head1, | |
head2, | |||
prev, | |||
next | |||
) |
#define DL_DELETE | ( | head, | |
del | |||
) | DL_DELETE2(head,del,prev,next) |
#define DL_DELETE2 | ( | head, | |
del, | |||
prev, | |||
next | |||
) |
#define DL_FOREACH | ( | head, | |
el | |||
) | DL_FOREACH2(head,el,next) |
#define DL_FOREACH2 | ( | head, | |
el, | |||
next | |||
) | for(el=head;el;el=(el)->next) |
#define DL_FOREACH_SAFE | ( | head, | |
el, | |||
tmp | |||
) | DL_FOREACH_SAFE2(head,el,tmp,next) |
#define DL_FOREACH_SAFE2 | ( | head, | |
el, | |||
tmp, | |||
next | |||
) | for((el)=(head);(el) && (tmp = (el)->next, 1); (el) = tmp) |
#define DL_PREPEND | ( | head, | |
add | |||
) | DL_PREPEND2(head,add,prev,next) |
#define DL_PREPEND2 | ( | head, | |
add, | |||
prev, | |||
next | |||
) |
#define DL_PREPEND_ELEM | ( | head, | |
el, | |||
add | |||
) |
#define DL_REPLACE_ELEM | ( | head, | |
el, | |||
add | |||
) |
#define DL_SEARCH LL_SEARCH |
#define DL_SEARCH2 LL_SEARCH2 |
#define DL_SEARCH_SCALAR LL_SEARCH_SCALAR |
#define DL_SEARCH_SCALAR2 LL_SEARCH_SCALAR2 |
#define DL_SORT | ( | list, | |
cmp | |||
) | DL_SORT2(list, cmp, prev, next) |
#define DL_SORT2 | ( | list, | |
cmp, | |||
prev, | |||
next | |||
) |
#define LDECLTYPE | ( | x | ) | __typeof(x) |
#define LL_APPEND | ( | head, | |
add | |||
) | LL_APPEND2(head,add,next) |
#define LL_APPEND2 | ( | head, | |
add, | |||
next | |||
) |
#define LL_APPEND2_VS2008 | ( | head, | |
add, | |||
next | |||
) |
#define LL_APPEND_VS2008 | ( | head, | |
add | |||
) | LL_APPEND2_VS2008(head,add,next) |
#define LL_CONCAT | ( | head1, | |
head2 | |||
) | LL_CONCAT2(head1,head2,next) |
#define LL_CONCAT2 | ( | head1, | |
head2, | |||
next | |||
) |
#define LL_DELETE | ( | head, | |
del | |||
) | LL_DELETE2(head,del,next) |
#define LL_DELETE2 | ( | head, | |
del, | |||
next | |||
) |
#define LL_DELETE2_VS2008 | ( | head, | |
del, | |||
next | |||
) |
#define LL_DELETE_VS2008 | ( | head, | |
del | |||
) | LL_DELETE2_VS2008(head,del,next) |
#define LL_FOREACH | ( | head, | |
el | |||
) | LL_FOREACH2(head,el,next) |
#define LL_FOREACH2 | ( | head, | |
el, | |||
next | |||
) | for(el=head;el;el=(el)->next) |
#define LL_FOREACH_SAFE | ( | head, | |
el, | |||
tmp | |||
) | LL_FOREACH_SAFE2(head,el,tmp,next) |
#define LL_FOREACH_SAFE2 | ( | head, | |
el, | |||
tmp, | |||
next | |||
) | for((el)=(head);(el) && (tmp = (el)->next, 1); (el) = tmp) |
#define LL_PREPEND | ( | head, | |
add | |||
) | LL_PREPEND2(head,add,next) |
#define LL_PREPEND2 | ( | head, | |
add, | |||
next | |||
) |
#define LL_PREPEND_ELEM | ( | head, | |
el, | |||
add | |||
) |
#define LL_REPLACE_ELEM | ( | head, | |
el, | |||
add | |||
) |
#define LL_SEARCH | ( | head, | |
out, | |||
elt, | |||
cmp | |||
) | LL_SEARCH2(head,out,elt,cmp,next) |
#define LL_SEARCH2 | ( | head, | |
out, | |||
elt, | |||
cmp, | |||
next | |||
) |
#define LL_SEARCH_SCALAR | ( | head, | |
out, | |||
field, | |||
val | |||
) | LL_SEARCH_SCALAR2(head,out,field,val,next) |
#define LL_SEARCH_SCALAR2 | ( | head, | |
out, | |||
field, | |||
val, | |||
next | |||
) |
#define LL_SORT | ( | list, | |
cmp | |||
) | LL_SORT2(list, cmp, next) |
#define LL_SORT2 | ( | list, | |
cmp, | |||
next | |||
) |
#define UTLIST_VERSION 1.9.8 |