i've implement linked-lists about a million times, but i'm still confused.
The GList structure is stored separately from the data. What is the
rationale for this organization? Is it mainly for GINT_TO_POINTER & friends?
To contrast, here is a linked-list implementation that must be embedded in
the data object (see MIME attachment). For example,
struct mydata {
pe_ring peer;
pe_ring queue;
gint hits;
gint priority;
};
In some cases, this organization seems like a better fit for the problem.
Ignoring the question of API freezes, would such an embedded list be appropriate
for inclusion in glib? Or is this style of design generally a bad idea?
--
Get self-realization at <http://sahajayoga.org> ... <http://why-compete.org> ?
Victory to the Divine Mother!!
Attachment:
ring
Description: Text document