2 .\" Initial implementation:
3 .\" Copyright (c) 2002 Robert Drehmel
4 .\" All rights reserved.
6 .\" As long as the above copyright statement and this notice remain
7 .\" unchanged, you can do what ever you want with this file.
15 .Nd doubly-linked list management
21 .Fn insque "void *element1" "void *pred"
23 .Fn remque "void *element"
29 functions encapsulate the ever-repeating task of doing insertion and
30 removal operations on doubly linked lists.
31 The functions expect their
32 arguments to point to a structure whose first and second members are
33 pointers to the next and previous element, respectively.
36 function also allows the
40 pointer for the initialization of a new list's
58 they reappeared conforming to