Revision 328
increased bitrate to 115200
| list.h | ||
|---|---|---|
| 1 | 1 |
#ifndef LIST_H_INCLUDED |
| 2 | 2 |
#define LIST_H_INCLUDED |
| 3 | 3 |
|
| 4 |
struct list_node; |
|
| 5 | 4 |
/** |
| 6 |
* @brief List node. |
|
| 5 |
* @defgroup list_t list_t |
|
| 6 |
* @brief List module |
|
| 7 | 7 |
* |
| 8 |
* Can be used like a C++ std::list. |
|
| 9 |
* A list_t is a sequence of list_node_t nodes, that store void* to allow for more flexibility. |
|
| 10 |
* |
|
| 11 |
* @{
|
|
| 12 |
*/ |
|
| 13 |
|
|
| 14 |
/** |
|
| 15 |
* @defgroup list_node_t list_node_t |
|
| 16 |
* @ingroup list |
|
| 17 |
* @brief List node module |
|
| 18 |
* |
|
| 8 | 19 |
* Can be used like a C++ std::list iterator. |
| 9 | 20 |
* A list node stores a void* to allow for more flexibility. |
| 21 |
* |
|
| 22 |
* @{
|
|
| 10 | 23 |
*/ |
| 24 |
|
|
| 25 |
struct list_node; |
|
| 11 | 26 |
typedef struct list_node list_node_t; |
| 12 | 27 |
|
| 13 | 28 |
/** |
| ... | ... | |
| 42 | 57 |
*/ |
| 43 | 58 |
void** (list_node_val )(list_node_t *p); |
| 44 | 59 |
|
| 45 |
struct list; |
|
| 46 | 60 |
/** |
| 47 |
* @brief List. |
|
| 48 |
* |
|
| 49 |
* Can be used like a C++ std::list. |
|
| 50 |
* A list_t is a sequence of list_node_t nodes, that store void* to allow for more flexibility. |
|
| 61 |
* @} |
|
| 51 | 62 |
*/ |
| 63 |
|
|
| 64 |
struct list; |
|
| 65 |
|
|
| 52 | 66 |
typedef struct list list_t; |
| 53 | 67 |
|
| 54 | 68 |
/** |
| ... | ... | |
| 131 | 145 |
*/ |
| 132 | 146 |
list_node_t* (list_find) (list_t *l, void *val); |
| 133 | 147 |
|
| 148 |
/** |
|
| 149 |
* @} |
|
| 150 |
*/ |
|
| 151 |
|
|
| 134 | 152 |
#endif //LIST_H_INCLUDED |
Also available in: Unified diff