* These functions provide the same kind of functionality as dynamic arrays
* but in time O(1). However these functions use malloc/free way too much often.
*
- * If you are using C++, you might want to used std::list, std::deque or
- * std::queue instead.
+ * @deprecated If you are using C++, you might want to used `std::list`,
+ * `std::deque` or `std::queue instead`.
*/
/** @defgroup XBT_fifo_cons Fifo constructor and destructor
*/
typedef struct xbt_fifo *xbt_fifo_t;
-XBT_PUBLIC(xbt_fifo_t) xbt_fifo_new(void);
+XBT_PUBLIC(xbt_fifo_t) xbt_fifo_new();
XBT_PUBLIC(void) xbt_fifo_free(xbt_fifo_t l);
XBT_PUBLIC(void) xbt_fifo_reset(xbt_fifo_t l);
/** @} */
* @{
*/
-XBT_PUBLIC(xbt_fifo_item_t) xbt_fifo_new_item(void);
+XBT_PUBLIC(xbt_fifo_item_t) xbt_fifo_new_item();
XBT_PUBLIC(void) xbt_fifo_set_item_content(xbt_fifo_item_t i, void *v);
XBT_PUBLIC(void *) xbt_fifo_get_item_content(xbt_fifo_item_t i);
XBT_PUBLIC(void) xbt_fifo_free_item(xbt_fifo_item_t i);
/** @} */
/* Deprecated functions: don't use! */
-XBT_PUBLIC(xbt_fifo_item_t) xbt_fifo_newitem(void);
+XBT_PUBLIC(xbt_fifo_item_t) xbt_fifo_newitem();
XBT_PUBLIC(void) xbt_fifo_freeitem(xbt_fifo_item_t l);
XBT_PUBLIC(xbt_fifo_item_t) xbt_fifo_getFirstItem(xbt_fifo_t l);