102 lines
3.3 KiB
C
102 lines
3.3 KiB
C
/*
|
|
* Copyright (c) 1988, 1989, 1990, 1993
|
|
* The Regents of the University of California. All rights reserved.
|
|
*
|
|
* This code is derived from software contributed to Berkeley by
|
|
* Adam de Boor.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* This product includes software developed by the University of
|
|
* California, Berkeley and its contributors.
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*
|
|
* $Id$
|
|
*/
|
|
|
|
#ifndef lint
|
|
static char sccsid[] = "@(#)lstDupl.c 8.1 (Berkeley) 6/6/93";
|
|
#endif /* not lint */
|
|
|
|
/*-
|
|
* listDupl.c --
|
|
* Duplicate a list. This includes duplicating the individual
|
|
* elements.
|
|
*/
|
|
|
|
#include "lstInt.h"
|
|
|
|
/*-
|
|
*-----------------------------------------------------------------------
|
|
* Lst_Duplicate --
|
|
* Duplicate an entire list. If a function to copy a ClientData is
|
|
* given, the individual client elements will be duplicated as well.
|
|
*
|
|
* Results:
|
|
* The new Lst structure or NILLST if failure.
|
|
*
|
|
* Side Effects:
|
|
* A new list is created.
|
|
*-----------------------------------------------------------------------
|
|
*/
|
|
Lst
|
|
Lst_Duplicate (l, copyProc)
|
|
Lst l; /* the list to duplicate */
|
|
/* A function to duplicate each ClientData */
|
|
ClientData (*copyProc) __P((ClientData));
|
|
{
|
|
register Lst nl;
|
|
register ListNode ln;
|
|
register List list = (List)l;
|
|
|
|
if (!LstValid (l)) {
|
|
return (NILLST);
|
|
}
|
|
|
|
nl = Lst_Init (list->isCirc);
|
|
if (nl == NILLST) {
|
|
return (NILLST);
|
|
}
|
|
|
|
ln = list->firstPtr;
|
|
while (ln != NilListNode) {
|
|
if (copyProc != NOCOPY) {
|
|
if (Lst_AtEnd (nl, (*copyProc) (ln->datum)) == FAILURE) {
|
|
return (NILLST);
|
|
}
|
|
} else if (Lst_AtEnd (nl, ln->datum) == FAILURE) {
|
|
return (NILLST);
|
|
}
|
|
|
|
if (list->isCirc && ln == list->lastPtr) {
|
|
ln = NilListNode;
|
|
} else {
|
|
ln = ln->nextPtr;
|
|
}
|
|
}
|
|
|
|
return (nl);
|
|
}
|