version 1.14, 2008/09/02 17:23:33 |
version 1.17, 2011/09/14 06:41:20 |
|
|
* 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/pf.c,v 1.13 2008/09/01 07:53:59 ohara Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/builtin/pf.c,v 1.16 2009/07/23 01:04:29 ohara Exp $ |
*/ |
*/ |
#include "ca.h" |
#include "ca.h" |
#include "math.h" |
#include "math.h" |
Line 588 void Pcall(NODE arg,Obj *rp) |
|
Line 588 void Pcall(NODE arg,Obj *rp) |
|
MKLIST(list,n); |
MKLIST(list,n); |
/* falling next case */ |
/* falling next case */ |
case O_LIST: |
case O_LIST: |
*rp = (Obj)bevalf((FUNC)v->priv,BDY(list)); |
*rp = (Obj)bevalf_with_opts((FUNC)v->priv,BDY(list),current_option); |
return; |
return; |
default: |
default: |
break; |
break; |
Line 613 void Pmapat(NODE arg,Obj *rp) |
|
Line 613 void Pmapat(NODE arg,Obj *rp) |
|
int len,row,col,i,j,pos; |
int len,row,col,i,j,pos; |
Obj iter; |
Obj iter; |
pointer val; |
pointer val; |
|
NODE option; |
|
|
|
option = current_option; |
|
|
if ( argc(arg) < 3 ) |
if ( argc(arg) < 3 ) |
error("mapat : too few arguments"); |
error("mapat : too few arguments"); |
|
|
Line 638 void Pmapat(NODE arg,Obj *rp) |
|
Line 641 void Pmapat(NODE arg,Obj *rp) |
|
NEXTNODE(r0,r); |
NEXTNODE(r0,r); |
iter = BDY(t); rest = NEXT(t); |
iter = BDY(t); rest = NEXT(t); |
if ( !iter ) { |
if ( !iter ) { |
*rp = bevalf(f,node); |
*rp = bevalf_with_opts(f,node,option); |
return; |
return; |
} |
} |
switch ( OID(iter) ) { |
switch ( OID(iter) ) { |
Line 646 void Pmapat(NODE arg,Obj *rp) |
|
Line 649 void Pmapat(NODE arg,Obj *rp) |
|
v = (VECT)iter; len = v->len; MKVECT(rv,len); |
v = (VECT)iter; len = v->len; MKVECT(rv,len); |
for ( i = 0; i < len; i++ ) { |
for ( i = 0; i < len; i++ ) { |
BDY(r) = BDY(v)[i]; NEXT(r) = rest; |
BDY(r) = BDY(v)[i]; NEXT(r) = rest; |
BDY(rv)[i] = bevalf(f,r0); |
BDY(rv)[i] = bevalf_with_opts(f,r0,option); |
} |
} |
*rp = (Obj)rv; |
*rp = (Obj)rv; |
break; |
break; |
Line 655 void Pmapat(NODE arg,Obj *rp) |
|
Line 658 void Pmapat(NODE arg,Obj *rp) |
|
for ( i = 0; i < row; i++ ) |
for ( i = 0; i < row; i++ ) |
for ( j = 0; j < col; j++ ) { |
for ( j = 0; j < col; j++ ) { |
BDY(r) = BDY(m)[i][j]; NEXT(r) = rest; |
BDY(r) = BDY(m)[i][j]; NEXT(r) = rest; |
BDY(rm)[i][j] = bevalf(f,r0); |
BDY(rm)[i][j] = bevalf_with_opts(f,r0,option); |
} |
} |
*rp = (Obj)rm; |
*rp = (Obj)rm; |
break; |
break; |
Line 663 void Pmapat(NODE arg,Obj *rp) |
|
Line 666 void Pmapat(NODE arg,Obj *rp) |
|
n = BDY((LIST)iter); |
n = BDY((LIST)iter); |
for ( t0 = t = 0; n; n = NEXT(n) ) { |
for ( t0 = t = 0; n; n = NEXT(n) ) { |
BDY(r) = BDY(n); NEXT(r) = rest; |
BDY(r) = BDY(n); NEXT(r) = rest; |
NEXTNODE(t0,t); BDY(t) = bevalf(f,r0); |
NEXTNODE(t0,t); BDY(t) = bevalf_with_opts(f,r0,option); |
} |
} |
if ( t0 ) |
if ( t0 ) |
NEXT(t) = 0; |
NEXT(t) = 0; |
Line 671 void Pmapat(NODE arg,Obj *rp) |
|
Line 674 void Pmapat(NODE arg,Obj *rp) |
|
*rp = (Obj)rl; |
*rp = (Obj)rl; |
break; |
break; |
default: |
default: |
*rp = bevalf(f,node); |
*rp = bevalf_with_opts(f,node,option); |
break; |
break; |
} |
} |
} |
} |
Line 690 void Pmap(NODE arg,Obj *rp) |
|
Line 693 void Pmap(NODE arg,Obj *rp) |
|
int len,row,col,i,j; |
int len,row,col,i,j; |
Obj iter; |
Obj iter; |
pointer val; |
pointer val; |
|
NODE option; |
|
|
|
option = current_option; |
|
|
if ( argc(arg) < 2 ) |
if ( argc(arg) < 2 ) |
error("mapat : too few arguments"); |
error("mapat : too few arguments"); |
|
|
Line 707 void Pmap(NODE arg,Obj *rp) |
|
Line 713 void Pmap(NODE arg,Obj *rp) |
|
error("evalmapf : invalid position"); |
error("evalmapf : invalid position"); |
r0 = 0; |
r0 = 0; |
NEXTNODE(r0,r); |
NEXTNODE(r0,r); |
iter = BDY(t); rest = NEXT(t); |
iter = BDY(node); rest = NEXT(node); |
if ( !iter ) { |
if ( !iter ) { |
*rp = bevalf(f,node); |
*rp = bevalf_with_opts(f,node,option); |
return; |
return; |
} |
} |
switch ( OID(iter) ) { |
switch ( OID(iter) ) { |
Line 717 void Pmap(NODE arg,Obj *rp) |
|
Line 723 void Pmap(NODE arg,Obj *rp) |
|
v = (VECT)iter; len = v->len; MKVECT(rv,len); |
v = (VECT)iter; len = v->len; MKVECT(rv,len); |
for ( i = 0; i < len; i++ ) { |
for ( i = 0; i < len; i++ ) { |
BDY(r) = BDY(v)[i]; NEXT(r) = rest; |
BDY(r) = BDY(v)[i]; NEXT(r) = rest; |
BDY(rv)[i] = bevalf(f,r0); |
BDY(rv)[i] = bevalf_with_opts(f,r0,option); |
} |
} |
*rp = (Obj)rv; |
*rp = (Obj)rv; |
break; |
break; |
Line 726 void Pmap(NODE arg,Obj *rp) |
|
Line 732 void Pmap(NODE arg,Obj *rp) |
|
for ( i = 0; i < row; i++ ) |
for ( i = 0; i < row; i++ ) |
for ( j = 0; j < col; j++ ) { |
for ( j = 0; j < col; j++ ) { |
BDY(r) = BDY(m)[i][j]; NEXT(r) = rest; |
BDY(r) = BDY(m)[i][j]; NEXT(r) = rest; |
BDY(rm)[i][j] = bevalf(f,r0); |
BDY(rm)[i][j] = bevalf_with_opts(f,r0,option); |
} |
} |
*rp = (Obj)rm; |
*rp = (Obj)rm; |
break; |
break; |
Line 734 void Pmap(NODE arg,Obj *rp) |
|
Line 740 void Pmap(NODE arg,Obj *rp) |
|
n = BDY((LIST)iter); |
n = BDY((LIST)iter); |
for ( t0 = t = 0; n; n = NEXT(n) ) { |
for ( t0 = t = 0; n; n = NEXT(n) ) { |
BDY(r) = BDY(n); NEXT(r) = rest; |
BDY(r) = BDY(n); NEXT(r) = rest; |
NEXTNODE(t0,t); BDY(t) = bevalf(f,r0); |
NEXTNODE(t0,t); BDY(t) = bevalf_with_opts(f,r0,option); |
} |
} |
if ( t0 ) |
if ( t0 ) |
NEXT(t) = 0; |
NEXT(t) = 0; |
Line 742 void Pmap(NODE arg,Obj *rp) |
|
Line 748 void Pmap(NODE arg,Obj *rp) |
|
*rp = (Obj)rl; |
*rp = (Obj)rl; |
break; |
break; |
default: |
default: |
*rp = bevalf(f,node); |
*rp = bevalf_with_opts(f,node,option); |
break; |
break; |
} |
} |
} |
} |