This is the mail archive of the
mailing list for the glibc project.
Re: Linked List Implementation
- From: Florian Weimer <fweimer at redhat dot com>
- To: Charlie Sale <chucks dot 8090 at gmail dot com>
- Cc: libc-help <libc-help at sourceware dot org>
- Date: Mon, 27 Nov 2017 13:02:13 +0100
- Subject: Re: Linked List Implementation
- Authentication-results: sourceware.org; auth=none
- References: <CAPzG3iajbq4y=tOXMpzPuN67Z2A8U4Vh8guwhH-_HQpKv7hQDQ@mail.gmail.com>
On 11/27/2017 02:26 AM, Charlie Sale wrote:
I was wondering why glibc does not have any sort of linked list or related
data structures implemented?
In fact, there is an implementation of doubly-linked lists, see insque
and remque. Balanced binary search trees are provided with tsearch and
related functions. For hash tables, see hsearch_r.
These interfaces are old and somewhat difficult to use, but I expect it
will be difficult to get consensus for a new set of interfaces because
everyone looks for something different in a container library.