* This section describes the API to a dictionary structure that associates as string to a void* key. It provides the
* same functionality than an hash table.
*
- * If you are using C++, you might want to use `std::unordered_map` instead.
+ * @deprecated If you are using C++, you might want to use `std::unordered_map` instead.
*
* Here is a little example of use:
* \ref XBT_dict section). You thus have to provide the function which will be used to free the content at
* structure creation (of type void_f_ppvoid_t or void_f_pvoid_t).
*
- * If you are using C++, you might want to use `std::vector` instead.
+ * @deprecated If you are using C++, you might want to use `std::vector` instead.
*
* \section XBT_dynar_exscal Example with scalar
* \dontinclude dynar.cpp
* 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
/** @addtogroup XBT_heap
* @brief This section describes the API to generic heap with O(log(n)) access.
*
- * If you are using C++ you might want to use std::priority_queue instead.
+ * @deprecated If you are using C++ you might want to use `std::priority_queue`
+ * instead.
*
* @{
*/
* It is basically a fifo but with restrictions so that it can be used as a set. Any operation (add, remove, belongs)
* is O(1) and no call to malloc/free is done.
*
- * If you are using C++, you might want to use boost::intrusive::set instead.
+ * @deprecated If you are using C++, you might want to use
+ * `boost::intrusive::set` instead.
*/
/** @defgroup XBT_swag_type Swag types
@ingroup XBT_swag
