=================================================================== RCS file: /home/cvs/OpenXM_contrib2/asir2000/builtin/list.c,v retrieving revision 1.2 retrieving revision 1.7 diff -u -p -r1.2 -r1.7 --- OpenXM_contrib2/asir2000/builtin/list.c 2000/08/21 08:31:20 1.2 +++ OpenXM_contrib2/asir2000/builtin/list.c 2003/07/29 01:50:56 1.7 @@ -23,7 +23,7 @@ * shall be made on your publication or presentation in any form of the * results obtained by use of the SOFTWARE. * (4) In the event that you modify the SOFTWARE, you shall notify FLL by - * e-mail at risa-admin@flab.fujitsu.co.jp of the detailed specification + * e-mail at risa-admin@sec.flab.fujitsu.co.jp of the detailed specification * for such modification or the source code of the modified part of the * SOFTWARE. * @@ -45,12 +45,13 @@ * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. * - * $OpenXM: OpenXM_contrib2/asir2000/builtin/list.c,v 1.1.1.1 1999/12/03 07:39:07 noro Exp $ + * $OpenXM: OpenXM_contrib2/asir2000/builtin/list.c,v 1.6 2003/01/20 17:44:51 saito Exp $ */ #include "ca.h" #include "parse.h" void Pcar(), Pcdr(), Pcons(), Pappend(), Preverse(), Plength(); +void Pnconc(), Preplcd(), Preplca(); struct ftab list_tab[] = { {"car",Pcar,1}, @@ -59,6 +60,9 @@ struct ftab list_tab[] = { {"append",Pappend,2}, {"reverse",Preverse,1}, {"length",Plength,1}, + {"nconc",Pnconc,2}, + {"replcd",Preplcd,2}, + {"replca",Preplca,2}, {0,0,0}, }; @@ -130,6 +134,7 @@ LIST *rp; } } +#if 0 void Plength(arg,rp) NODE arg; Q *rp; @@ -141,4 +146,78 @@ Q *rp; n = BDY((LIST)ARG0(arg)); for ( i = 0; n; i++, n = NEXT(n) ); STOQ(i,*rp); +} +#endif + +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 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); + } }