- Data structures
- \ref XBT_dynar
- \ref XBT_dict
- - \ref XBT_set
- Data are associated to both an ID (0(1) search) and a name
- - \ref XBT_fifo
- \ref XBT_swag
- \ref XBT_heap
- - \ref XBT_peer
- @ref xbt_strbuff
- \ref XBT_misc
- \ref XBT_graph
Here are the basic data containers that every C programmer rewrites one day.
You won't need to do so yourself, you lucky one, because we did it for you.
+ However, if you are programming in C++ you might want to use C++ containers
+ instead.
@{ */
/** @defgroup XBT_dynar Dynar: generic dynamic array */
/** @defgroup XBT_dict Dict: generic dictionnary */
- /** @defgroup XBT_set Set: generic set datatype */
- /** @defgroup XBT_fifo Fifo: generic workqueue */
/** @defgroup XBT_swag Swag: O(1) set datatype */
/** @defgroup XBT_heap Heap: generic heap data structure */
- /** @defgroup XBT_dd Data description */
/** @} */
@{ */
/** @defgroup XBT_graph General purpose graph library */
/** @defgroup XBT_parmap Parallel map */
- /** @defgroup XBT_peer Peer */
- /** @defgroup XBT_synchro Synchro stuff */
+ /** @defgroup XBT_synchro Simulated Synchronization */
/** @defgroup XBT_thread Thread stuff */
/** @defgroup XBT_context Portable context implementation */
/** @defgroup XBT_replay Replay */
