version 1.5, 2003/01/16 16:20:12 |
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.4 2003/01/16 04:44:19 saito 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(), Pconcat(), 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}, |
{"cdr",Pcdr,1}, |
{"cdr",Pcdr,1}, |
{"cons",Pcons,2}, |
{"cons",Pcons,2}, |
{"append",Pappend,2}, |
{"append",Pappend,2}, |
{"concat",Pconcat,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}, |
}; |
}; |
|
|
|
|
} |
} |
} |
} |
|
|
void Pconcat(arg,rp) |
void Preverse(arg,rp) |
NODE arg; |
NODE arg; |
LIST *rp; |
LIST *rp; |
{ |
{ |
|
NODE t,t1,n; |
|
|
|
asir_assert(ARG0(arg),O_LIST,"reverse"); |
|
if ( !(n = BDY((LIST)ARG0(arg))) ) |
|
*rp = (LIST)ARG0(arg); |
|
else { |
|
for ( t = 0; n; n = NEXT(n) ) { |
|
MKNODE(t1,BDY(n),t); t = t1; |
|
} |
|
MKLIST(*rp,t); |
|
} |
|
} |
|
|
|
void Plength(arg,rp) |
|
NODE arg; |
|
Q *rp; |
|
{ |
|
NODE n; |
|
int i; |
|
|
|
switch (OID(ARG0(arg))) { |
|
case O_VECT: |
|
i = ((VECT)ARG0(arg))->len; |
|
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; |
NODE a1,a2,n; |
|
|
asir_assert(ARG0(arg),O_LIST,"concat"); |
asir_assert(ARG0(arg),O_LIST,"nconc"); |
asir_assert(ARG1(arg),O_LIST,"concat"); |
asir_assert(ARG1(arg),O_LIST,"nconc"); |
a1 = (LIST)ARG0(arg); |
a1 = BDY((LIST)ARG0(arg)); |
if ( !a1 ) |
if ( !a1 ) |
*rp = (LIST)ARG1(arg); |
*rp = (LIST)ARG1(arg); |
else { |
else { |
|
|
a2 = n; |
a2 = n; |
} |
} |
NEXT(a2) = BDY((LIST)ARG1(arg)); |
NEXT(a2) = BDY((LIST)ARG1(arg)); |
*rp = (LIST)a1; |
*rp = (LIST)ARG0(arg); |
} |
} |
} |
} |
|
|
void Preverse(arg,rp) |
void Preplcd(arg,rp) |
NODE arg; |
NODE arg; |
LIST *rp; |
LIST *rp; |
{ |
{ |
NODE t,t1,n; |
NODE a0,a1; |
|
|
asir_assert(ARG0(arg),O_LIST,"reverse"); |
asir_assert(ARG0(arg),O_LIST,"replcd"); |
if ( !(n = BDY((LIST)ARG0(arg))) ) |
asir_assert(ARG1(arg),O_LIST,"replcd"); |
|
a0 = BDY((LIST)ARG0(arg)); |
|
if ( !a0 ) |
*rp = (LIST)ARG0(arg); |
*rp = (LIST)ARG0(arg); |
else { |
else { |
for ( t = 0; n; n = NEXT(n) ) { |
NEXT(a0) = BDY((LIST)ARG1(arg)); |
MKNODE(t1,BDY(n),t); t = t1; |
*rp = (LIST)ARG0(arg); |
} |
|
MKLIST(*rp,t); |
|
} |
} |
} |
} |
|
|
void Plength(arg,rp) |
void Preplca(arg,rp) |
NODE arg; |
NODE arg; |
Q *rp; |
LIST *rp; |
{ |
{ |
NODE n; |
NODE n; |
int i; |
|
|
asir_assert(ARG0(arg),O_LIST,"replca"); |
asir_assert(ARG0(arg),O_LIST,"length"); |
if ( !(n = BDY((LIST)ARG0(arg)) ) ) |
n = BDY((LIST)ARG0(arg)); |
*rp = (LIST)ARG0(arg); |
for ( i = 0; n; i++, n = NEXT(n) ); |
else { |
STOQ(i,*rp); |
BDY(BDY((LIST)ARG0(arg))) = (LIST)ARG1(arg); |
|
*rp = (LIST)ARG0(arg); |
|
} |
} |
} |