LIST_DATA_TYPE
Description
Get data type stored by this list
Usage example (Cross-references)
Usage examples (Cross-references)
- In
Init.h:72:
/// TAGS: List, Deinit, Lifecycle
///
#define ListDeinit(v) deinit_list(GENERIC_LIST(v), sizeof(LIST_DATA_TYPE(v)))
#endif // MISRA_STD_CONTAINER_LIST_INIT_H
- In
Ops.h:28:
/// TAGS: List, Ops, Clear
///
#define ListClear(l) clear_list(GENERIC_LIST(l), sizeof(LIST_DATA_TYPE(l)))
///
- In
Ops.h:46:
/// TAGS: List, Ops, Sort
///
#define ListSort(l, compare) list_sort(GENERIC_LIST(l), sizeof(LIST_DATA_TYPE(l)), (compare))
///
- In
Ops.h:76:
/// TAGS: List, Ops, Reverse
///
#define ListReverse(l) reverse_list(GENERIC_LIST(l), sizeof(LIST_DATA_TYPE(l)))
#endif // MISRA_STD_CONTAINER_LIST_OPS_H
- In
Access.h:112:
/// TAGS: List, Access, Swap
///
#define ListSwapItems(l, idx1, idx2) swap_list(GENERIC_LIST(l), sizeof(LIST_DATA_TYPE(l)), (idx1), (idx2))
///
- In
Access.h:125:
/// TAGS: List, Access, API
///
#define ListPtrAt(l, idx) ((LIST_DATA_TYPE(l) *)item_ptr_at_list(GENERIC_LIST(l), sizeof(LIST_DATA_TYPE(l)), (idx)))
#ifdef __cplusplus- In
Access.h:128:
#ifdef __cplusplus
# define ListAt(l, idx) (ListPtrAt((l), (idx)) ? *ListPtrAt((l), (idx)) : (LIST_DATA_TYPE(l) {0}))
#else
///
- In
Access.h:143:
/// TAGS: List, Access, API
///
# define ListAt(l, idx) (ListPtrAt((l), (idx)) ? *ListPtrAt((l), (idx)) : ((LIST_DATA_TYPE(l)) {0}))
#endif- In
Access.h:161:
/// TAGS: List, Find, Search, Compare
///
#define ListFind(l, item_ptr, compare) find_idx_list(GENERIC_LIST(l), (item_ptr), sizeof(LIST_DATA_TYPE(l)), (compare))
///
- In
Access.h:212:
/// TAGS: List, Node, Access
///
#define ListNodePtrAt(l, idx) ((LIST_NODE_TYPE(l) *)(node_at_list(GENERIC_LIST(l), sizeof(LIST_DATA_TYPE(l)), (idx))))
///
- In
Access.h:249:
/// TAGS: List, Node, Access
///
#define ListNodeAt(l, idx) (*((LIST_NODE_TYPE(l) *)(node_at_list(GENERIC_LIST(l), sizeof(LIST_DATA_TYPE(l)), (idx)))))
///
- In
Remove.h:30:
/// TAGS: List, Remove
///
#define ListRemove(l, val, idx) remove_range_list(GENERIC_LIST(l), (val), sizeof(LIST_DATA_TYPE(l)), (idx), 1)
///
- In
Remove.h:88:
///
#define ListRemoveRange(l, rd, start, count) \
remove_range_list(GENERIC_LIST(l), (rd), sizeof(LIST_DATA_TYPE(l)), (start), (count))
///
- In
Foreach.h:41:
((void *)UNPL(node)->prev != (void *)UNPL(node)) && (UNPL(node)->data)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) var = *((LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data)); \
UNPL(_once); \
UNPL(_once) = false)- In
Foreach.h:75:
((void *)UNPL(node)->prev != (void *)UNPL(node)) && (UNPL(node)->data)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) *var = (LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data); \
UNPL(_once); \
UNPL(_once) = false)- In
Foreach.h:108:
((void *)UNPL(node)->prev != (void *)UNPL(node)) && (UNPL(node)->data)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) var = *((LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data)); \
UNPL(_once); \
UNPL(_once) = false)- In
Foreach.h:142:
((void *)UNPL(node)->prev != (void *)UNPL(node)) && (UNPL(node)->data)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) *var = (LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data); \
UNPL(_once); \
UNPL(_once) = false)- In
Foreach.h:179:
if (UNPL(i) >= (start) && (UNPL(node)->data)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) var = *((LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data)); \
UNPL(_once); \
UNPL(_once) = false)- In
Foreach.h:214:
if (UNPL(i) >= (start) && (UNPL(node)->data)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) *var = (LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data); \
UNPL(_once); \
UNPL(_once) = false)- In
Foreach.h:250:
if (UNPL(i) >= (start) && (UNPL(node)->data)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) var = *((LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data)); \
UNPL(_once); \
UNPL(_once) = false)- In
Foreach.h:288:
if (UNPL(i) >= (start) && (UNPL(node)->data)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) *var = (LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data); \
UNPL(_once); \
UNPL(_once) = false)- In
Foreach.h:332:
((UNPL(resolved_idx) = idx), 1) && UNPL(node)->data) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) var = *((LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data)); \
UNPL(_once); \
UNPL(_once) = false)- In
Foreach.h:376:
((UNPL(resolved_idx) = idx), 1) && UNPL(node)->data) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) *var = (LIST_DATA_TYPE(UNPL(pl)) *)UNPL(node)->data; \
UNPL(_once); \
UNPL(_once) = false)- In
Foreach.h:420:
((UNPL(resolved_idx) = idx), 1) && UNPL(node)->data) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) var = *((LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data)); \
UNPL(_once); \
UNPL(_once) = false)- In
Foreach.h:465:
((UNPL(resolved_idx) = idx), 1) && UNPL(node)->data) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) *var = (LIST_DATA_TYPE(UNPL(pl)) *)UNPL(node)->data; \
UNPL(_once); \
UNPL(_once) = false)- In
Insert.h:35:
#define ListInsertL(l, lval, idx) \
(ValidateList(l), \
CHECK_TYPE_EQUIVALENCE(TYPE_OF(lval), LIST_DATA_TYPE(l)), \
list_insert_one_l(GENERIC_LIST(l), &LVAL_AS(LIST_DATA_TYPE(l), lval), &(lval), sizeof(LIST_DATA_TYPE(l)), (idx)))- In
Insert.h:36:
(ValidateList(l), \
CHECK_TYPE_EQUIVALENCE(TYPE_OF(lval), LIST_DATA_TYPE(l)), \
list_insert_one_l(GENERIC_LIST(l), &LVAL_AS(LIST_DATA_TYPE(l), lval), &(lval), sizeof(LIST_DATA_TYPE(l)), (idx)))
///
- In
Insert.h:55:
#define ListInsertR(l, rval, idx) \
(ValidateList(l), \
CHECK_TYPE_CONVERTIBLE(LIST_DATA_TYPE(l), rval), \
list_insert_one_r(GENERIC_LIST(l), &LVAL_AS(LIST_DATA_TYPE(l), rval), sizeof(LIST_DATA_TYPE(l)), (idx)))- In
Insert.h:56:
(ValidateList(l), \
CHECK_TYPE_CONVERTIBLE(LIST_DATA_TYPE(l), rval), \
list_insert_one_r(GENERIC_LIST(l), &LVAL_AS(LIST_DATA_TYPE(l), rval), sizeof(LIST_DATA_TYPE(l)), (idx)))
///
- In
Insert.h:183:
#define ListPushArrL(l, arr, count) \
(ValidateList(l), \
CHECK_TYPE_EQUIVALENCE(TYPE_OF(*(arr)), LIST_DATA_TYPE(l)), \
list_insert_range_l(GENERIC_LIST(l), (void *)(arr), sizeof(LIST_DATA_TYPE(l)), (count)))- In
Insert.h:184:
(ValidateList(l), \
CHECK_TYPE_EQUIVALENCE(TYPE_OF(*(arr)), LIST_DATA_TYPE(l)), \
list_insert_range_l(GENERIC_LIST(l), (void *)(arr), sizeof(LIST_DATA_TYPE(l)), (count)))
///
- In
Insert.h:199:
#define ListPushArrR(l, arr, count) \
(ValidateList(l), \
CHECK_TYPE_CONVERTIBLE(const LIST_DATA_TYPE(l) *, arr), \
list_insert_range_r(GENERIC_LIST(l), (const void *)(arr), sizeof(LIST_DATA_TYPE(l)), (count)))- In
Insert.h:200:
(ValidateList(l), \
CHECK_TYPE_CONVERTIBLE(const LIST_DATA_TYPE(l) *, arr), \
list_insert_range_r(GENERIC_LIST(l), (const void *)(arr), sizeof(LIST_DATA_TYPE(l)), (count)))
///
- In
Insert.h:242:
(ValidateList(l), \
ValidateList(l2), \
CHECK_TYPE_EQUIVALENCE(LIST_DATA_TYPE(l2), LIST_DATA_TYPE(l)), \
list_merge_l(GENERIC_LIST(l), GENERIC_LIST(l2), sizeof(LIST_DATA_TYPE(l))))- In
Insert.h:243:
ValidateList(l2), \
CHECK_TYPE_EQUIVALENCE(LIST_DATA_TYPE(l2), LIST_DATA_TYPE(l)), \
list_merge_l(GENERIC_LIST(l), GENERIC_LIST(l2), sizeof(LIST_DATA_TYPE(l))))
///
- In
Insert.h:258:
(ValidateList(l), \
ValidateList(l2), \
CHECK_TYPE_EQUIVALENCE(LIST_DATA_TYPE(l2), LIST_DATA_TYPE(l)), \
list_merge_r(GENERIC_LIST(l), GENERIC_LIST(l2), sizeof(LIST_DATA_TYPE(l))))- In
Insert.h:259:
ValidateList(l2), \
CHECK_TYPE_EQUIVALENCE(LIST_DATA_TYPE(l2), LIST_DATA_TYPE(l)), \
list_merge_r(GENERIC_LIST(l), GENERIC_LIST(l2), sizeof(LIST_DATA_TYPE(l))))
///
- In
Type.h:88:
/// TAGS: List, Type, TypeOf
///
#define LIST_NODE_TYPE(list) ListNode(LIST_DATA_TYPE(list))
///
Last updated on