node_relink

SFL
Version 2.11

`node_relink_after`

#include "sflnode.h"
void *
node_relink_after (
    void *node,
    void *after)

Synopsis

Links a node into a doubly-linked list after a point in the list. Generally a linked list is attached to a 'head': an empty list consists of just the head node. To attach a node to the start of the list, link after the head. To attach a node to the end of the list, link before the head using node relink before(). In this way you can build doubly- ended queues, fifo queue, lists, etc. Returns the address of the node.

Source Code - (sflnode.c)

{
    return (node relink (after, node, ((NODE *) after)-> next));
}

| << | < | > | >>