X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/blobdiff_plain/268981d54533fb025d1353582cf229d235eb2fb2..1e18ccad74ce3d49299f1da9022c5d5e4ee76918:/include/xbt/fifo.h diff --git a/include/xbt/fifo.h b/include/xbt/fifo.h index 46becae17e..1da1eb44b8 100644 --- a/include/xbt/fifo.h +++ b/include/xbt/fifo.h @@ -14,11 +14,6 @@ SG_BEGIN_DECL() /** @addtogroup XBT_fifo * @brief This section describes the API to generic workqueue. * - *
Top [\ref index]::[\ref XBT_API] - *
Prev [\ref XBT_set] - *
Next [\ref XBT_swag] - *
Down [\ref XBT_fifo_cons]
- * * These functions provide the same kind of functionnality as dynamic arrays but in time O(1). * However these functions use malloc/free way too much often. */ @@ -26,9 +21,6 @@ SG_BEGIN_DECL() /** @defgroup XBT_fifo_cons Fifo constructor and destructor * @ingroup XBT_fifo * - *
Top [\ref index]::[\ref XBT_API]::[\ref XBT_fifo] - *
Prev - *
Next [\ref XBT_fifo_perl]
* @{ */ @@ -47,9 +39,6 @@ void xbt_fifo_free(xbt_fifo_t); /** @defgroup XBT_fifo_perl Fifo perl-like functions * @ingroup XBT_fifo * - *
Top [\ref index]::[\ref XBT_API]::[\ref XBT_fifo] - *
Prev [\ref XBT_fifo_cons] - *
Next [\ref XBT_fifo_direct]
* @{ */ xbt_fifo_item_t xbt_fifo_push(xbt_fifo_t, void *); @@ -63,10 +52,6 @@ int xbt_fifo_is_in(xbt_fifo_t, void *); /** @defgroup XBT_fifo_direct Direct access to fifo elements * @ingroup XBT_fifo * - *
Top [\ref index]::[\ref XBT_API]::[\ref XBT_fifo] - *
Prev [\ref XBT_fifo_perl] - *
Next [\ref XBT_fifo_misc]
- * * @{ */ @@ -108,10 +93,6 @@ xbt_fifo_item_t xbt_fifo_get_prev_item(xbt_fifo_item_t i); /** @defgroup XBT_fifo_misc Misc fifo functions * @ingroup XBT_fifo * - *
Top [\ref index]::[\ref XBT_API]::[\ref XBT_fifo] - *
Prev [\ref XBT_fifo_direct] - *
Next
- * * @{ */ void **xbt_fifo_to_array(xbt_fifo_t);