-#ifndef LINKEDLIST_H
-#define LINKEDLIST_H
+#pragma once
CLASS(LinkedListNode, Object)
ATTRIB(LinkedListNode, ll_data, entity, NULL)
return e;
}
-#define LL_CLEAR(...) EVAL(OVERLOAD(LL_CLEAR, __VA_ARGS__))
+#define LL_CLEAR(...) EVAL_LL_CLEAR(OVERLOAD(LL_CLEAR, __VA_ARGS__))
+#define EVAL_LL_CLEAR(...) __VA_ARGS__
#define LL_CLEAR_1(this) LL_CLEAR_2(this, LAMBDA())
#define LL_CLEAR_2(this, dtor) \
- do \
+ MACRO_BEGIN \
{ \
LinkedList _ll = this; \
assert(_ll); \
dtor \
remove(it); \
} \
- } \
- while (0)
+ } MACRO_END
-#define LL_DELETE(...) EVAL(OVERLOAD(LL_DELETE, __VA_ARGS__))
+#define LL_DELETE(...) EVAL_LL_DELETE(OVERLOAD(LL_DELETE, __VA_ARGS__))
+#define EVAL_LL_DELETE(...) __VA_ARGS__
#define LL_DELETE_1(this) LL_DELETE_2(this, LAMBDA())
#define LL_DELETE_2(this, dtor) \
- do \
+ MACRO_BEGIN \
{ \
- LL_CLEAR(this, dtor); \
+ LL_CLEAR_2(this, dtor); \
remove(this); \
this = NULL; \
- } \
- while (0)
+ } MACRO_END
#define LL_EACH(list, cond, body) \
- do \
+ MACRO_BEGIN \
{ \
noref int i = 0; \
for (entity _it = list.ll_head; _it; (_it = _it.ll_next, ++i)) \
{ \
- noref entity it = _it.ll_data; \
+ ITER_CONST noref entity it = _it.ll_data; \
if (cond) { body } \
} \
- } \
- while (0)
-
-#endif
+ } MACRO_END