admin/mlib
1
0 Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Add _push_back_raw & _push_front_raw

Browse Source
This commit is contained in:
Patrick Pelissier committed 2017-08-17 20:58:02 +02:00
1 parent d97741b6a9
commit c926456bcd
1 file changed
+29 -9
Download Patch File Download Diff File Expand all files Collapse all files
m-deque.h
+29 -9
View File
@@ -159,8 +159,8 @@
d->count = 0; \ d->count = 0; \
} \ } \
\ \
static inline void \ static inline type * \
M_C(name, _push_back)(deque_t d, type const x) \ M_C(name, _push_back_raw)(deque_t d) \
{ \ { \
DEQUEI_CONTRACT(d); \ DEQUEI_CONTRACT(d); \
deque_node_t *n = d->back->node; \ deque_node_t *n = d->back->node; \
@@ -169,21 +169,31 @@
n = M_C(name, _node_list_next_obj)(d->list, n); \ n = M_C(name, _node_list_next_obj)(d->list, n); \
if (n == NULL) { \ if (n == NULL) { \
n = M_C(name, _int_new_node)(d); \ n = M_C(name, _int_new_node)(d); \
if (n == NULL) return; \ if (n == NULL) return NULL; \
M_C(name, _node_list_push_back)(d->list, n); \ M_C(name, _node_list_push_back)(d->list, n); \
} \ } \
d->back->node = n; \ d->back->node = n; \
index = 0; \ index = 0; \
} \ } \
M_GET_INIT_SET oplist (n->data[index], x); \ type *ret = &n->data[index]; \
index++; \ index++; \
d->count ++; \ d->count ++; \
d->back->index = index; \ d->back->index = index; \
DEQUEI_CONTRACT(d); \ DEQUEI_CONTRACT(d); \
return ret; \
} \ } \
\ \
static inline void \ static inline void \
M_C(name, _push_front)(deque_t d, type const x) \ M_C(name, _push_back)(deque_t d, type const x) \
{ \
type *p = M_C(name, _push_back_raw)(d); \
if (M_LIKELY(p != NULL)) { \
M_GET_INIT_SET oplist (*p, x); \
} \
} \
\
static inline type* \
M_C(name, _push_front_raw)(deque_t d) \
{ \ { \
DEQUEI_CONTRACT(d); \ DEQUEI_CONTRACT(d); \
deque_node_t *n = d->front->node; \ deque_node_t *n = d->front->node; \
@@ -194,16 +204,26 @@
n = M_C(name, _node_list_previous_obj)(d->list, n); \ n = M_C(name, _node_list_previous_obj)(d->list, n); \
if (n == NULL) { \ if (n == NULL) { \
n = M_C(name, _int_new_node)(d); \ n = M_C(name, _int_new_node)(d); \
if (n == NULL) return; \ if (n == NULL) return NULL; \
M_C(name, _node_list_push_front)(d->list, n); \ M_C(name, _node_list_push_front)(d->list, n); \
} \ } \
d->front->node = n; \ d->front->node = n; \
index = n->size -1; \ index = n->size -1; \
} \ } \
M_GET_INIT_SET oplist (n->data[index], x); \ type *ret = &n->data[index]; \
d->count ++; \ d->count ++; \
d->front->index = index; \ d->front->index = index; \
DEQUEI_CONTRACT(d); \ DEQUEI_CONTRACT(d); \
return ret; \
} \
\
static inline void \
M_C(name, _push_front)(deque_t d, type const x) \
{ \
type *p = M_C(name, _push_front_raw)(d); \
if (M_LIKELY(p != NULL)) { \
M_GET_INIT_SET oplist (*p, x); \
} \
} \ } \
\ \
static inline void \ static inline void \
@@ -480,8 +500,8 @@
} \ } \
// TODO: set, equal_p, _hash, _get, _cget, _set_at, _push_back_raw, // TODO: set, equal_p, _hash, _get, _cget, _set_at,
// _pop_front_raw, _push_back_new, _push_front_new, // _push_back_new, _push_front_new,
// _swap_at, IO [like array] // _swap_at, IO [like array]