version 1.77, 2005/10/15 07:40:59 |
version 1.79, 2005/10/19 10:31:18 |
|
|
* 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/strobj.c,v 1.76 2005/10/15 02:34:13 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/builtin/strobj.c,v 1.78 2005/10/17 00:38:11 noro Exp $ |
*/ |
*/ |
#include "ca.h" |
#include "ca.h" |
#include "parse.h" |
#include "parse.h" |
Line 663 void Pquote_match_rewrite(NODE arg,Obj *rp) |
|
Line 663 void Pquote_match_rewrite(NODE arg,Obj *rp) |
|
NEXTNODE(s0,s); |
NEXTNODE(s0,s); |
pair = BDY((LIST)BDY(t)); |
pair = BDY((LIST)BDY(t)); |
ind = (int)FA0((FNODE)BDY((QUOTE)BDY(pair))); |
ind = (int)FA0((FNODE)BDY((QUOTE)BDY(pair))); |
value = mkfnode(1,I_FORMULA,BDY(NEXT(pair))); |
value = BDY((QUOTE)(BDY(NEXT(pair)))); |
BDY(s) = mknode(2,ind,value); |
BDY(s) = mknode(2,ind,value); |
} |
} |
if ( s0 ) NEXT(s) = 0; |
if ( s0 ) NEXT(s) = 0; |
switch ( ac = argc(arg) ) { |
switch ( ac = argc(arg) ) { |
case 3: |
case 3: |
h = rewrite_fnode(BDY((QUOTE)ARG2(arg)),s0); |
h = rewrite_fnode(BDY((QUOTE)ARG2(arg)),s0); |
*rp = eval(h); |
MKQUOTE(q,h); *rp = (Obj)q; |
break; |
break; |
case 4: |
case 4: |
c = rewrite_fnode(BDY((QUOTE)ARG2(arg)),s0); |
c = rewrite_fnode(BDY((QUOTE)ARG2(arg)),s0); |
if ( eval(c) ) { |
if ( eval(c) ) { |
h = rewrite_fnode(BDY((QUOTE)ARG3(arg)),s0); |
h = rewrite_fnode(BDY((QUOTE)ARG3(arg)),s0); |
*rp = eval(h); |
MKQUOTE(q,h); *rp = (Obj)q; |
} else |
} else |
*rp = VOIDobj; |
*rp = VOIDobj; |
break; |
break; |
Line 2182 FNODE fnode_apply(FNODE f,FNODE (*func)(),int expand) |
|
Line 2182 FNODE fnode_apply(FNODE f,FNODE (*func)(),int expand) |
|
for ( i = 0; i < n; i++ ) { |
for ( i = 0; i < n; i++ ) { |
switch ( spec->type[i] ) { |
switch ( spec->type[i] ) { |
case A_fnode: |
case A_fnode: |
r->arg[i] = func(f->arg[i]); |
r->arg[i] = func(f->arg[i],expand); |
break; |
break; |
case A_node: |
case A_node: |
s = (NODE)f->arg[i]; |
s = (NODE)f->arg[i]; |