version 1.3, 2000/08/22 05:03:59 |
version 1.8, 2004/06/22 13:40:44 |
|
|
* DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, |
* DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, |
* PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. |
* PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. |
* |
* |
* $OpenXM: OpenXM_contrib2/asir2000/builtin/list.c,v 1.2 2000/08/21 08:31:20 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/builtin/list.c,v 1.7 2003/07/29 01:50:56 ohara Exp $ |
*/ |
*/ |
#include "ca.h" |
#include "ca.h" |
#include "parse.h" |
#include "parse.h" |
|
|
void Pcar(), Pcdr(), Pcons(), Pappend(), Preverse(), Plength(); |
void Pcar(), Pcdr(), Pcons(), Pappend(), Preverse(), Plength(); |
|
void Plist(); |
|
void Pnconc(), Preplcd(), Preplca(); |
|
|
struct ftab list_tab[] = { |
struct ftab list_tab[] = { |
{"car",Pcar,1}, |
{"car",Pcar,1}, |
Line 59 struct ftab list_tab[] = { |
|
Line 61 struct ftab list_tab[] = { |
|
{"append",Pappend,2}, |
{"append",Pappend,2}, |
{"reverse",Preverse,1}, |
{"reverse",Preverse,1}, |
{"length",Plength,1}, |
{"length",Plength,1}, |
|
{"nconc",Pnconc,2}, |
|
{"replcd",Preplcd,2}, |
|
{"replca",Preplca,2}, |
|
{"list", Plist, -99999999}, |
{0,0,0}, |
{0,0,0}, |
}; |
}; |
|
|
Line 134 void Plength(arg,rp) |
|
Line 140 void Plength(arg,rp) |
|
NODE arg; |
NODE arg; |
Q *rp; |
Q *rp; |
{ |
{ |
NODE n; |
NODE n; |
int i; |
int i; |
|
|
asir_assert(ARG0(arg),O_LIST,"length"); |
switch (OID(ARG0(arg))) { |
n = BDY((LIST)ARG0(arg)); |
case O_VECT: |
for ( i = 0; n; i++, n = NEXT(n) ); |
i = ((VECT)ARG0(arg))->len; |
STOQ(i,*rp); |
break; |
|
case O_LIST: |
|
n = BDY((LIST)ARG0(arg)); |
|
for ( i = 0; n; i++, n = NEXT(n) ); |
|
break; |
|
default: |
|
error("length : invalid argument"); break; |
|
} |
|
STOQ(i,*rp); |
|
} |
|
|
|
void Plist(NODE arg, LIST *rp) |
|
{ |
|
MKLIST(*rp,arg); |
|
} |
|
|
|
void Pnconc(arg,rp) |
|
NODE arg; |
|
LIST *rp; |
|
{ |
|
NODE a1,a2,n; |
|
|
|
asir_assert(ARG0(arg),O_LIST,"nconc"); |
|
asir_assert(ARG1(arg),O_LIST,"nconc"); |
|
a1 = BDY((LIST)ARG0(arg)); |
|
if ( !a1 ) |
|
*rp = (LIST)ARG1(arg); |
|
else { |
|
for ( n = a1; n; n = NEXT(n) ) { |
|
a2 = n; |
|
} |
|
NEXT(a2) = BDY((LIST)ARG1(arg)); |
|
*rp = (LIST)ARG0(arg); |
|
} |
|
} |
|
|
|
void Preplcd(arg,rp) |
|
NODE arg; |
|
LIST *rp; |
|
{ |
|
NODE a0,a1; |
|
|
|
asir_assert(ARG0(arg),O_LIST,"replcd"); |
|
asir_assert(ARG1(arg),O_LIST,"replcd"); |
|
a0 = BDY((LIST)ARG0(arg)); |
|
if ( !a0 ) |
|
*rp = (LIST)ARG0(arg); |
|
else { |
|
NEXT(a0) = BDY((LIST)ARG1(arg)); |
|
*rp = (LIST)ARG0(arg); |
|
} |
|
} |
|
|
|
void Preplca(arg,rp) |
|
NODE arg; |
|
LIST *rp; |
|
{ |
|
NODE n; |
|
|
|
asir_assert(ARG0(arg),O_LIST,"replca"); |
|
if ( !(n = BDY((LIST)ARG0(arg)) ) ) |
|
*rp = (LIST)ARG0(arg); |
|
else { |
|
BDY(BDY((LIST)ARG0(arg))) = (LIST)ARG1(arg); |
|
*rp = (LIST)ARG0(arg); |
|
} |
} |
} |