rlist_remove(3)

Usage

#include <roy.h>

void rlist_remove (RList * list, RListEntry * entry);

Overview

Remove/unlink entry from list. The rlist_remove(3) api is implmented using a macro so using the RListEntry * as the entry is only advisorial. See rlist(3) on how to create RListEntry compatible entry structs.

This call does NOT free the entry's memory or call any destructors. See rlist_free(3) to see how to free the entire list. =item EXAMPLE

The correct way to fully free entry.

        rlist_remove (entry);
        rmem_free (entry);      /* My entry destructor. */

Return value

This call doesn't return any value.

Errors

A call to rlist_remove(3) will never fail.

Macro

The rlist_remove(3) api is implemented using a macro.

Releases

2 releases since Debian 3.0 (Woody); the text changed 1 time.

3.0
3.1

rlist(3) Roy doublely linked list implementation rlist_append(3) add an entry to the end of an rlist rlist_compare(3) compare two lists for equality rlist_first(3) get the head or tail entry in the list rlist_free(3) free a dynamicly allocated rlist rlist_last(3) get the head or tail entry in the list rlist_new(3) allocate a new rlist head rlist_next(3) follow the next pointer of an rlist entry rlist_nth(3) get the nth entry in the list rlist_prepend(3) add an entry to the beginning of an rlist rlist_prev(3) follow the prev pointer of an rlist entry roy(3) the roy library

Mentioned on this page

rlist_remove(3) remove an entry from an rlist

Referred to by

rlist(3) Roy doublely linked list implementation rlist_new(3) allocate a new rlist head rlist_nth(3) get the nth entry in the list rlist_free(3) free a dynamicly allocated rlist rlist_last(3) get the head or tail entry in the list rlist_next(3) follow the next pointer of an rlist entry rlist_prev(3) follow the prev pointer of an rlist entry rlist_first(3) get the head or tail entry in the list rlist_append(3) add an entry to the end of an rlist rlist_compare(3) compare two lists for equality rlist_prepend(3) add an entry to the beginning of an rlist