1*40411Sbostic /*- 2*40411Sbostic * LstSucc.c -- 3*40411Sbostic * return the successor to a given node 4*40411Sbostic * 5*40411Sbostic * Copyright (c) 1988 by University of California Regents 6*40411Sbostic * 7*40411Sbostic * Permission to use, copy, modify, and distribute this 8*40411Sbostic * software and its documentation for any purpose and without 9*40411Sbostic * fee is hereby granted, provided that the above copyright 10*40411Sbostic * notice appears in all copies. Neither the University of California nor 11*40411Sbostic * Adam de Boor makes any representations about the suitability of this 12*40411Sbostic * software for any purpose. It is provided "as is" without 13*40411Sbostic * express or implied warranty. 14*40411Sbostic */ 15*40411Sbostic #ifndef lint 16*40411Sbostic static char *rcsid = 17*40411Sbostic "$Id: lstSucc.c,v 1.4 88/11/17 20:54:07 adam Exp $ SPRITE (Berkeley)"; 18*40411Sbostic #endif lint 19*40411Sbostic 20*40411Sbostic #include "lstInt.h" 21*40411Sbostic 22*40411Sbostic /*- 23*40411Sbostic *----------------------------------------------------------------------- 24*40411Sbostic * Lst_Succ -- 25*40411Sbostic * Return the sucessor to the given node on its list. 26*40411Sbostic * 27*40411Sbostic * Results: 28*40411Sbostic * The successor of the node, if it exists (note that on a circular 29*40411Sbostic * list, if the node is the only one in the list, it is its own 30*40411Sbostic * successor). 31*40411Sbostic * 32*40411Sbostic * Side Effects: 33*40411Sbostic * None. 34*40411Sbostic * 35*40411Sbostic *----------------------------------------------------------------------- 36*40411Sbostic */ 37*40411Sbostic LstNode 38*40411Sbostic Lst_Succ (ln) 39*40411Sbostic LstNode ln; 40*40411Sbostic { 41*40411Sbostic if (ln == NILLNODE) { 42*40411Sbostic return (NILLNODE); 43*40411Sbostic } else { 44*40411Sbostic return ((LstNode) ((ListNode) ln)->nextPtr); 45*40411Sbostic } 46*40411Sbostic } 47*40411Sbostic 48