|
|
1.1 ! root 1: /* ! 2: * Copyright (c) 1988, 1989, 1990 The Regents of the University of California. ! 3: * All rights reserved. ! 4: * ! 5: * This code is derived from software contributed to Berkeley by ! 6: * Adam de Boor. ! 7: * ! 8: * Redistribution and use in source and binary forms are permitted ! 9: * provided that: (1) source distributions retain this entire copyright ! 10: * notice and comment, and (2) distributions including binaries display ! 11: * the following acknowledgement: ``This product includes software ! 12: * developed by the University of California, Berkeley and its contributors'' ! 13: * in the documentation or other materials provided with the distribution ! 14: * and in all advertising materials mentioning features or use of this ! 15: * software. Neither the name of the University nor the names of its ! 16: * contributors may be used to endorse or promote products derived ! 17: * from this software without specific prior written permission. ! 18: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR ! 19: * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED ! 20: * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. ! 21: */ ! 22: ! 23: #ifndef lint ! 24: static char sccsid[] = "@(#)lstSucc.c 5.3 (Berkeley) 6/1/90"; ! 25: #endif /* not lint */ ! 26: ! 27: /*- ! 28: * LstSucc.c -- ! 29: * return the successor to a given node ! 30: */ ! 31: ! 32: #include "lstInt.h" ! 33: ! 34: /*- ! 35: *----------------------------------------------------------------------- ! 36: * Lst_Succ -- ! 37: * Return the sucessor to the given node on its list. ! 38: * ! 39: * Results: ! 40: * The successor of the node, if it exists (note that on a circular ! 41: * list, if the node is the only one in the list, it is its own ! 42: * successor). ! 43: * ! 44: * Side Effects: ! 45: * None. ! 46: * ! 47: *----------------------------------------------------------------------- ! 48: */ ! 49: LstNode ! 50: Lst_Succ (ln) ! 51: LstNode ln; ! 52: { ! 53: if (ln == NILLNODE) { ! 54: return (NILLNODE); ! 55: } else { ! 56: return ((LstNode) ((ListNode) ln)->nextPtr); ! 57: } ! 58: } ! 59:
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.