blt_treenodeid(3) [debian man page]

Blt_TreeNodeId(3)					      BLT Library Procedures						 Blt_TreeNodeId(3)

__________________________________________________________________________________________________________________________________________________

NAME

       Blt_TreeNodeId - Returns the node serial number.

SYNOPSIS

       #include <bltTree.h>

       unsigned int
       Blt_TreeNodeId(node)

ARGUMENTS

       Blt_TreeNode   node   (in)      Node whose ID is to be returned.
_________________________________________________________________

DESCRIPTION

       This  procedure	returns the node serial number.  The node serial number is useful for programs that export the tree data object to the Tcl
       programming level.  Since node labels (and therefore pathnames) are not unique, the ID can be used to uniquely identify a node.

       The arguments are as follows:

       node	 The node whose serial number is returned.  The serial number of the root node for example is always 0.

RETURNS

       The serial number of the node.  Nodes are given a unique serial number when they are created.  You can use the ID  to  later  retrieve  the
       node using Blt_TreeGetNode.

EXAMPLE

       The following example prints the ID of a node.

	      printf("root ID is %s
", Blt_TreeNodeId(node));

KEYWORDS

       Tcl_TreeCreateNode, Tcl_TreeDeleteNode

BLT
									2.4							 Blt_TreeNodeId(3)

list(3) 						    InterNetNews Documentation							   list(3)

NAME

       list - list routines

SYNOPSIS

	   #include <inn/list.h>

	   struct node {
	       struct node *succ;
	       struct node *pred;
	   };

	   struct list {
	       struct node *head;
	       struct node *tail;
	       struct node *tailpred;
	   };

	   void list_new(struct list *list);

	   struct node *list_addhead(struct list *list, struct node *node);

	   struct node *list_addtail(struct list *list, struct node *node);

	   struct node *list_head(struct list *list);

	   struct node *list_tail(struct list *list);

	   struct node *list_succ(struct node *node);

	   struct node *list_pred(struct node *node);

	   struct node *list_remhead(struct list *list);

	   struct node *list_remtail(struct list *list);

	   struct node *list_remove(struct node *node);

	   struct node *list_insert(struct list *list, struct node *node, struct node *pred);

	   bool list_isempty(struct list *list);

DESCRIPTION

       list_new initialises the list header list so as to create an empty list.

       list_addhead adds node to the head of list, returning the node just added.

       list_addtail adds node to the tail of list, returning the node just added.

       list_head returns a pointer to the the node at the head of list or NULL if the list is empty.

       list_tail returns a pointer to the the node at the tail of list or NULL if the list is empty.

       list_succ returns the next (successor) node on the list after node or NULL if node was the final node.

       list_pred returns the previous (predecessor) node on the list before node or NULL if node was the first node.

       list_remhead removes the first node from list and returns it to the caller. If the list is empty NULL is returned.

       list_remtail removes the last node from list and returns it to the caller. If the list is empty NULL is returned.

       list_remove removes node from the list it is on and returns it to the caller.

       list_insert inserts node onto list after the node pred. If pred is NULL then node is added to the head of list.

HISTORY

       Written by Alex Kiernan <alex.kiernan@thus.net> for InterNetNews 2.4.0.

       $Id: list.pod 9074 2010-05-31 19:01:32Z iulius $

INN 2.5.3							    2011-06-10								   list(3)