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 the above copyright notice and this paragraph are
10  * duplicated in all such forms and that any documentation,
11  * advertising materials, and other materials related to such
12  * distribution and use acknowledge that the software was developed
13  * by the University of California, Berkeley.  The name of the
14  * University may not be used to endorse or promote products derived
15  * from this software without specific prior written permission.
16  * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
17  * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
18  * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
19  */
20 
21 #ifndef lint
22 static char sccsid[] = "@(#)lstReplace.c	5.2 (Berkeley) 03/11/90";
23 #endif /* not lint */
24 
25 /*-
26  * LstReplace.c --
27  *	Replace the datum in a node with a new datum
28  */
29 
30 #include	"lstInt.h"
31 
32 /*-
33  *-----------------------------------------------------------------------
34  * Lst_Replace --
35  *	Replace the datum in the given node with the new datum
36  *
37  * Results:
38  *	SUCCESS or FAILURE.
39  *
40  * Side Effects:
41  *	The datum field fo the node is altered.
42  *
43  *-----------------------------------------------------------------------
44  */
45 ReturnStatus
46 Lst_Replace (ln, d)
47     register LstNode	ln;
48     ClientData	  	d;
49 {
50     if (ln == NILLNODE) {
51 	return (FAILURE);
52     } else {
53 	((ListNode) ln)->datum = d;
54 	return (SUCCESS);
55     }
56 }
57 
58