No longer export IT_REF for map containers (See API changes)
This commit is contained in:
1 parent
3735704c95
commit
fca1120990
3 files changed
+10
-6
No files matched your search
+4
-2
@@ -82,7 +82,10 @@
|
|||||||
(__VA_ARGS__ )))
|
(__VA_ARGS__ )))
|
||||||
|
|
||||||
/* Define the oplist of a rbtree of type (from BPTREE_DEF2).
|
/* Define the oplist of a rbtree of type (from BPTREE_DEF2).
|
||||||
USAGE: BPTREE_OPLIST2(name, key_oplist, value_oplist) */
|
USAGE: BPTREE_OPLIST2(name, key_oplist, value_oplist)
|
||||||
|
NOTE: IT_REF is not exported so that the contained appears as not modifiable
|
||||||
|
by algorithm.
|
||||||
|
*/
|
||||||
#define BPTREE_OPLIST2(name, key_oplist, value_oplist) \
|
#define BPTREE_OPLIST2(name, key_oplist, value_oplist) \
|
||||||
(INIT(M_C(name, _init)), \
|
(INIT(M_C(name, _init)), \
|
||||||
INIT_SET(M_C(name, _init_set)), \
|
INIT_SET(M_C(name, _init_set)), \
|
||||||
@@ -101,7 +104,6 @@
|
|||||||
IT_END_P(M_C(name,_end_p)), \
|
IT_END_P(M_C(name,_end_p)), \
|
||||||
IT_EQUAL_P(M_C(name,_it_equal_p)), \
|
IT_EQUAL_P(M_C(name,_it_equal_p)), \
|
||||||
IT_NEXT(M_C(name,_next)), \
|
IT_NEXT(M_C(name,_next)), \
|
||||||
IT_REF(M_C(name,_ref)), \
|
|
||||||
IT_CREF(M_C(name,_cref)), \
|
IT_CREF(M_C(name,_cref)), \
|
||||||
CLEAN(M_C(name,_clean)), \
|
CLEAN(M_C(name,_clean)), \
|
||||||
GET_MIN(M_C(name,_min)), \
|
GET_MIN(M_C(name,_min)), \
|
||||||
|
|||||||
@@ -917,7 +917,9 @@
|
|||||||
so that all arguments are evaluated before further expansion */
|
so that all arguments are evaluated before further expansion */
|
||||||
#define DICTI_OPLIST_P1(arg) DICTI_OPLIST_P2 arg
|
#define DICTI_OPLIST_P1(arg) DICTI_OPLIST_P2 arg
|
||||||
|
|
||||||
/* Define the oplist of a dictionnary */
|
/* Define the oplist of a dictionnary
|
||||||
|
NOTE: IT_REF is not exported so that the contained appears as not modifiable
|
||||||
|
by algorithm.*/
|
||||||
#define DICTI_OPLIST_P2(name, key_oplist, value_oplist) \
|
#define DICTI_OPLIST_P2(name, key_oplist, value_oplist) \
|
||||||
(INIT(M_C(name, _init)), \
|
(INIT(M_C(name, _init)), \
|
||||||
INIT_SET(M_C(name, _init_set)), \
|
INIT_SET(M_C(name, _init_set)), \
|
||||||
@@ -938,7 +940,6 @@
|
|||||||
IT_END_P(M_C(name,_end_p)), \
|
IT_END_P(M_C(name,_end_p)), \
|
||||||
IT_LAST_P(M_C(name,_last_p)), \
|
IT_LAST_P(M_C(name,_last_p)), \
|
||||||
IT_NEXT(M_C(name,_next)), \
|
IT_NEXT(M_C(name,_next)), \
|
||||||
IT_REF(M_C(name,_ref)), \
|
|
||||||
IT_CREF(M_C(name,_cref)) \
|
IT_CREF(M_C(name,_cref)) \
|
||||||
,KEY_TYPE(M_C(name, _key_type_t)) \
|
,KEY_TYPE(M_C(name, _key_type_t)) \
|
||||||
,VALUE_TYPE(M_C(name, _value_type_t)) \
|
,VALUE_TYPE(M_C(name, _value_type_t)) \
|
||||||
|
|||||||
+3
-2
@@ -50,7 +50,9 @@
|
|||||||
so that all arguments are evaluated before further expansion */
|
so that all arguments are evaluated before further expansion */
|
||||||
#define RBTREEI_OPLIST_P1(arg) RBTREEI_OPLIST_P2 arg
|
#define RBTREEI_OPLIST_P1(arg) RBTREEI_OPLIST_P2 arg
|
||||||
|
|
||||||
/* OPLIST definition of a rbtree */
|
/* OPLIST definition of a rbtree
|
||||||
|
NOTE: IT_REF is not exported so that the contained appears as not modifiable
|
||||||
|
by algorithm.*/
|
||||||
#define RBTREEI_OPLIST_P2(name, oplist) \
|
#define RBTREEI_OPLIST_P2(name, oplist) \
|
||||||
(INIT(M_C(name, _init)), \
|
(INIT(M_C(name, _init)), \
|
||||||
INIT_SET(M_C(name, _init_set)), \
|
INIT_SET(M_C(name, _init_set)), \
|
||||||
@@ -73,7 +75,6 @@
|
|||||||
IT_LAST_P(M_C(name,_last_p)), \
|
IT_LAST_P(M_C(name,_last_p)), \
|
||||||
IT_EQUAL_P(M_C(name,_it_equal_p)), \
|
IT_EQUAL_P(M_C(name,_it_equal_p)), \
|
||||||
IT_NEXT(M_C(name,_next)), \
|
IT_NEXT(M_C(name,_next)), \
|
||||||
IT_REF(M_C(name,_ref)), \
|
|
||||||
IT_CREF(M_C(name,_cref)), \
|
IT_CREF(M_C(name,_cref)), \
|
||||||
CLEAN(M_C(name,_clean)), \
|
CLEAN(M_C(name,_clean)), \
|
||||||
PUSH(M_C(name,_push)), \
|
PUSH(M_C(name,_push)), \
|
||||||
|
|||||||
Reference in new issue
Block a user