_static/doxygen/list_8h_source.html

#ifndef LIST_H

#define LIST_H

#include "offload.h"


typedef struct list_int_node {

    struct list_int_node* next;

    int data;

} list_int_node;


DECLARE_TARGET

void list_int_create(list_int_node** list);

DECLARE_TARGET_END

DECLARE_TARGET

void list_int_free(list_int_node** list);

DECLARE_TARGET_END

DECLARE_TARGET

void list_int_add(list_int_node* list, int data);

DECLARE_TARGET_END

DECLARE_TARGET

int list_int_get(list_int_node* list, int index);

DECLARE_TARGET_END

DECLARE_TARGET

int list_int_size(list_int_node* list);

DECLARE_TARGET_END


#endif

list_int_size
int list_int_size(list_int_node *list)
Get list size.
Definition list.c:86

list_int_create
void list_int_create(list_int_node **list)
Create an empty list.
Definition list.c:16

list_int_free
void list_int_free(list_int_node **list)
Deallocate this list and all lists it is linked to.
Definition list.c:28

list_int_get
int list_int_get(list_int_node *list, int index)
Retrieve the data stored in a list node.
Definition list.c:69

list_int_add
void list_int_add(list_int_node *list, int data)
Add new node to the end of the chain.
Definition list.c:48

list_int_node
Linked list node that stores int data.
Definition list.h:12

list_int_node::next
struct list_int_node * next
Definition list.h:13

list_int_node::data
int data
Definition list.h:14