/** inserts new tail. * * performs call to #d_list_insert with _position = LIST_ROOT#count * * @param _root root node of the list * @param _data data to insert into new node * @param _size size of data to be inserted * * @return #true if insert was successful \n * #false otherwise (see logs for details in this case) * * @see d_list_insert */ bool d_list_insert_tail(LIST_ROOT* _root, const void* _data, const size_t _size) { /* #ifdef _DEBUG */ /* L_DEBUG( "0x%08x\n", _root ); */ /* #endif */ if ( !_root ) { L_ERROR( "_root == NULL\n", "" ); return false; } return d_list_insert(_root, _root->count, _data, _size); }
d_list_ret_t d_list_append(d_list_t* ptDlist, void* pvData) { return d_list_insert(ptDlist, -1, pvData); }
d_list_ret_t d_list_prepend(d_list_t* ptDlist, void* pvData) { return d_list_insert(ptDlist, 0, pvData); }