[ccan] [PATCH 1/4] queue: Simple queue implementation

[Sam Watkins]

On Mon, Jul 07, 2014 at 11:13:58PM -0400, Cody P Schafer wrote:
> On Mon, Jul 7, 2014 at 8:51 AM, David Gibson
> <david at gibson.dropbear.id.au> wrote:
> > This new module provides a simple queue implementation as a singly linked
> > (circular) list.
> >
> > Signed-off-by: David Gibson <david at gibson.dropbear.id.au>
> 
> I've been looking for a singly-linked list for places where I don't
> necessarily need a doubly linked one (as provided by ccan/list).
> 
> Would it be possible to format the api for this singly-linked list
> more like the current list.h api?

here is an idea for generic singly-linked lists and other data
structures, put the link at the start of the structure instead of at the
end, then you can do generic operations on it without having to know
what kind of element it has.

e.g.

struct car {
	struct car *next;
	char *rego;
	char *make;
	char *model;
}

I rarely saw that, but I think it's a good idea.