|
|
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[] = "@(#)lstMember.c 5.3 (Berkeley) 6/1/90"; ! 25: #endif /* not lint */ ! 26: ! 27: /*- ! 28: * lstMember.c -- ! 29: * See if a given datum is on a given list. ! 30: */ ! 31: ! 32: #include "lstInt.h" ! 33: ! 34: LstNode ! 35: Lst_Member (l, d) ! 36: Lst l; ! 37: ClientData d; ! 38: { ! 39: List list = (List) l; ! 40: register ListNode lNode; ! 41: ! 42: lNode = list->firstPtr; ! 43: if (lNode == NilListNode) { ! 44: return NILLNODE; ! 45: } ! 46: ! 47: do { ! 48: if (lNode->datum == d) { ! 49: return (LstNode)lNode; ! 50: } ! 51: lNode = lNode->nextPtr; ! 52: } while (lNode != NilListNode && lNode != list->firstPtr); ! 53: ! 54: return NILLNODE; ! 55: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.