Xiqual 0.9.1

In file include/lists.h:

typedef struct Node

A simple Node.

[more]struct Node *next
Next node in List.
[more]struct Node *prev
Previous Node in List.
[more]void* data
Node-specific data.



Documentation

A simple Node. Every programmer probably knows about lists and nodes, so I won't elaborate.

Xiqual List functions make no assumptions about the contents and size of a Node structure passed to them. If you have larger structures with data to be freed, the destructor callback is useful.

ostruct Node *next
Next node in List. It can be any structure starting with a Node structure, as Xiqual does not assume anything about data beyond the Node header.

ostruct Node *prev
Previous Node in List. It can be any structure starting with a Node structure, as Xiqual does not assume anything about data beyond the Node header.

ovoid* data
Node-specific data. Xiqual routines use this pointer as a string pointer to a name, or a pointer to sound/graphics data.
Author:
Ronny Bangsund
See Also:
List

Alphabetic index



This page was generated with the help of DOC++.