/***** Autogenerated from runtime.in; changes will be overwritten *****/ #line 1 "runtime.in" /***** * runtime.in * Tom Prince 2005/4/15 * * Generate the runtime functions used by the vm::stack machine. * *****/ /* Autogenerated routines are specified like this (separated by a formfeed): type asyname:cname(cparams) { C code } */ // Use Void f() instead of void f() to force an explicit Stack argument. #line 63 "runtime.in" #include #include #include #include #include #include #include "angle.h" #include "pair.h" #include "triple.h" #include "transform.h" #include "path.h" #include "path3.h" #include "pen.h" #include "guide.h" #include "picture.h" #include "drawpath.h" #include "drawpath3.h" #include "drawsurface.h" #include "drawfill.h" #include "drawclipbegin.h" #include "drawclipend.h" #include "drawlabel.h" #include "drawverbatim.h" #include "drawgsave.h" #include "drawgrestore.h" #include "drawlayer.h" #include "drawimage.h" #include "drawgroup.h" #include "fileio.h" #include "genv.h" #include "builtin.h" #include "texfile.h" #include "pipestream.h" #include "parser.h" #include "stack.h" #include "util.h" #include "locate.h" #include "mathop.h" #include "callable.h" #include "stm.h" #include "lexical.h" #include "process.h" #include "arrayop.h" #include "predicates.h" #include "Delaunay.h" #ifdef HAVE_LIBFFTW3 #include "fftw++.h" #endif #if defined(HAVE_LIBREADLINE) && defined(HAVE_LIBCURSES) #include #include #endif #if defined(USEGC) && defined(GC_DEBUG) && defined(GC_BACKTRACE) extern "C" { void *GC_generate_random_valid_address(void); void GC_debug_print_heap_obj_proc(void *); } #endif using namespace vm; using namespace camp; using namespace settings; namespace run { using camp::pair; using vm::array; using vm::frame; using vm::stack; using camp::transform; using absyntax::runnable; typedef double real; #define CURRENTPEN processData().currentpen typedef array boolarray; typedef array Intarray; typedef array Intarray2; typedef array realarray; typedef array realarray2; typedef array pairarray; typedef array pairarray2; typedef array triplearray; typedef array triplearray2; typedef array patharray; typedef array patharray2; typedef array guidearray; typedef array transformarray; typedef array penarray; typedef array penarray2; typedef array stringarray; typedef array stringarray2; typedef callable callableBp; typedef callable callableReal; typedef callable callableTransform; } using vm::array; using types::function; #define PRIMITIVE(name,Name,asyName) using types::prim##Name; #include #undef PRIMITIVE using types::boolArray; using types::IntArray; using types::IntArray2; using types::realArray; using types::realArray2; using types::pairArray; using types::pairArray2; using types::tripleArray; using types::tripleArray2; using types::pathArray; using types::pathArray2; using types::guideArray; using types::transformArray; using types::penArray; using types::penArray2; using types::stringArray; using types::stringArray2; using types::formal; function *voidFunction() { return new function(primVoid()); } function *breakpointFunction() { return new function(primString(),primString(),primInt(),primInt(), primCode()); } function *realRealFunction() { return new function(primReal(),primReal()); } function *transformFunction() { return new function(primTransform()); } function *realTripleFunction() { return new function(primReal(),primTriple()); } const size_t camp::ColorComponents[]={0,0,1,3,4,0}; namespace vm { } namespace run { const char *invalidargument="invalid argument"; const char *arrayempty="cannot take min or max of empty array"; // Return the factorial of a non-negative integer using a lookup table. Int factorial(Int n) { static Int *table; static Int size=0; if(size == 0) { Int f=1; size=2; while(f <= Int_MAX/size) f *= (size++); table=new Int[size]; table[0]=f=1; for(Int i=1; i < size; ++i) { f *= i; table[i]=f; } } if(n >= size) integeroverflow(0); return table[n]; } static inline Int Round(double x) { return Int(x+((x >= 0) ? 0.5 : -0.5)); } inline Int sgn(double x) { return (x > 0.0 ? 1 : (x < 0.0 ? -1 : 0)); } void outOfBounds(const char *op, size_t len, Int n) { ostringstream buf; buf << op << " array of length " << len << " with out-of-bounds index " << n; error(buf); } inline item& arrayRead(array *a, Int n) { size_t len=checkArray(a); bool cyclic=a->cyclic(); if(cyclic && len > 0) n=imod(n,len); else if(n < 0 || n >= (Int) len) outOfBounds("reading",len,n); return (*a)[(unsigned) n]; } // Helper function to create deep arrays. static array* deepArray(Int depth, Int *dims) { assert(depth > 0); if (depth == 1) { return new array(dims[0]); } else { Int length = dims[0]; depth--; dims++; array *a = new array(length); for (Int index = 0; index < length; index++) { (*a)[index] = deepArray(depth, dims); } return a; } } array *nop(array *a) { return a; } array *Identity(Int n) { size_t N=(size_t) n; array *c=new array(N); for(size_t i=0; i < N; ++i) { array *ci=new array(N); (*c)[i]=ci; for(size_t j=0; j < N; ++j) (*ci)[j]=0.0; (*ci)[i]=1.0; } return c; } array *copyArray(array *a) { size_t size=checkArray(a); array *c=new array(size); for(size_t i=0; i < size; i++) (*c)[i]=(*a)[i]; return c; } inline size_t checkdimension(array *a, size_t dim) { size_t size=checkArray(a); if(dim && size != dim) { ostringstream buf; buf << "array of length " << dim << " expected" << endl; error(buf); } return size; } double *copyArrayC(array *a, size_t dim=0) { size_t size=checkdimension(a,dim); double *c=new double[size]; for(size_t i=0; i < size; i++) c[i]=read(a,i); return c; } triple *copyTripleArrayC(array *a, size_t dim=0) { size_t size=checkdimension(a,dim); triple *c=new triple[size]; for(size_t i=0; i < size; i++) c[i]=read(a,i); return c; } array *copyArray2(array *a) { size_t size=checkArray(a); array *c=new array(size); for(size_t i=0; i < size; i++) { array *ai=read(a,i); size_t aisize=checkArray(ai); array *ci=new array(aisize); (*c)[i]=ci; for(size_t j=0; j < aisize; j++) (*ci)[j]=(*ai)[j]; } return c; } array *copyArray3(array *a) { size_t size=checkArray(a); array *c=new array(size); for(size_t i=0; i < size; i++) { array *ai=read(a,i); size_t aisize=checkArray(ai); array *ci=new array(aisize); (*c)[i]=ci; for(size_t j=0; j < aisize; j++) { array *aij=read(ai,j); size_t aijsize=checkArray(aij); array *cij=new array(aijsize); (*ci)[j]=cij; for(size_t k=0; k < aijsize; k++) (*cij)[k]=(*aij)[k]; } } return c; } double *copyArray2C(array *a, bool square=true, size_t dim2=0) { size_t n=checkArray(a); size_t m=(square || n == 0) ? n : checkArray(read(a,0)); if(n > 0 && dim2 && m != dim2) { ostringstream buf; buf << "second matrix dimension must be " << dim2 << endl; error(buf); } double *c=new double[n*m]; for(size_t i=0; i < n; i++) { array *ai=read(a,i); size_t aisize=checkArray(ai); if(aisize == m) { double *ci=c+i*m; for(size_t j=0; j < m; j++) ci[j]=read(ai,j); } else error(square ? "matrix must be square" : "matrix must be rectangular"); } return c; } triple *copyTripleArray2C(array *a, bool square=true, size_t dim2=0) { size_t n=checkArray(a); size_t m=(square || n == 0) ? n : checkArray(read(a,0)); if(n > 0 && dim2 && m != dim2) { ostringstream buf; buf << "second matrix dimension must be " << dim2 << endl; error(buf); } triple *c=new triple[n*m]; for(size_t i=0; i < n; i++) { array *ai=read(a,i); size_t aisize=checkArray(ai); if(aisize == m) { triple *ci=c+i*m; for(size_t j=0; j < m; j++) ci[j]=read(ai,j); } else error(square ? "matrix must be square" : "matrix must be rectangular"); } return c; } double *copyTripleArray2Components(array *a, bool square=true, size_t dim2=0) { size_t n=checkArray(a); size_t m=(square || n == 0) ? n : checkArray(read(a,0)); if(n > 0 && dim2 && m != dim2) { ostringstream buf; buf << "second matrix dimension must be " << dim2 << endl; error(buf); } size_t nm=n*m; double *cx=new double[3*nm]; double *cy=cx+nm; double *cz=cx+2*nm; for(size_t i=0; i < n; i++) { array *ai=read(a,i); size_t aisize=checkArray(ai); if(aisize == m) { double *xi=cx+i*m; double *yi=cy+i*m; double *zi=cz+i*m; for(size_t j=0; j < m; j++) { triple v=read(ai,j); xi[j]=v.getx(); yi[j]=v.gety(); zi[j]=v.getz(); } } else error(square ? "matrix must be square" : "matrix must be rectangular"); } return cx; } double norm(double *a, size_t n) { if(n == 0) return 0.0; double M=fabs(a[0]); for(size_t i=1; i < n; ++i) M=::max(M,fabs(a[i])); return M; } double norm(triple *a, size_t n) { if(n == 0) return 0.0; double M=a[0].abs2(); for(size_t i=1; i < n; ++i) M=::max(M,a[i].abs2()); return sqrt(M); } static const char *incommensurate="Incommensurate matrices"; static const char *singular="Singular matrix"; static size_t *pivot,*Row,*Col; triple operator *(const array& t, const triple& v) { size_t n=checkArray(&t); if(n != 4) error(incommensurate); array *t0=read(t,0); array *t1=read(t,1); array *t2=read(t,2); array *t3=read(t,3); if(checkArray(t0) != 4 || checkArray(t1) != 4 || checkArray(t2) != 4 || checkArray(t3) != 4) error(incommensurate); double x=v.getx(); double y=v.gety(); double z=v.getz(); double f=read(t3,0)*x+read(t3,1)*y+read(t3,2)*z+ read(t3,3); if(f == 0.0) run::dividebyzero(); f=1.0/f; return triple((read(t0,0)*x+read(t0,1)*y+read(t0,2)*z+ read(t0,3))*f, (read(t1,0)*x+read(t1,1)*y+read(t1,2)*z+ read(t1,3))*f, (read(t2,0)*x+read(t2,1)*y+read(t2,2)*z+ read(t2,3))*f); } triple multshiftless(const array& t, const triple& v) { size_t n=checkArray(&t); if(n != 4) error(incommensurate); array *t0=read(t,0); array *t1=read(t,1); array *t2=read(t,2); array *t3=read(t,3); if(checkArray(t0) != 4 || checkArray(t1) != 4 || checkArray(t2) != 4 || checkArray(t3) != 4) error(incommensurate); double x=v.getx(); double y=v.gety(); double z=v.getz(); double f=read(t3,0)*x+read(t3,1)*y+read(t3,2)*z+ read(t3,3); if(f == 0.0) run::dividebyzero(); f=1.0/f; return triple((read(t0,0)*x+read(t0,1)*y+read(t0,2)*z)*f, (read(t1,0)*x+read(t1,1)*y+read(t1,2)*z)*f, (read(t2,0)*x+read(t2,1)*y+read(t2,2)*z)*f); } static inline void inverseAllocate(size_t n) { pivot=new size_t[n]; Row=new size_t[n]; Col=new size_t[n]; } static inline void inverseDeallocate() { delete[] pivot; delete[] Row; delete[] Col; } void writestring(stack *s) { callable *suffix=pop(s,NULL); string S=pop(s); vm::item it=pop(s); bool defaultfile=isdefault(it); camp::file *f=defaultfile ? &camp::Stdout : vm::get(it); if(!f->isOpen()) return; if(S != "") f->write(S); if(f->text()) { if(suffix) { s->push(f); suffix->call(s); } else if(defaultfile) f->writeline(); } } void checkSquare(array *a) { size_t n=checkArray(a); for(size_t i=0; i < n; i++) if(checkArray(read(a,i)) != n) error("matrix a must be square"); } // Crout's algorithm for computing the LU decomposition of a square matrix. // cf. routine ludcmp (Press et al., Numerical Recipes, 1991). Int LUdecompose(double *a, size_t n, size_t* index, bool warn=true) { double *vv=new double[n]; Int swap=1; for(size_t i=0; i < n; ++i) { double big=0.0; double *ai=a+i*n; for(size_t j=0; j < n; ++j) { double temp=fabs(ai[j]); if(temp > big) big=temp; } if(big == 0.0) { delete[] vv; if(warn) error(singular); else return 0; } vv[i]=1.0/big; } for(size_t j=0; j < n; ++j) { for(size_t i=0; i < j; ++i) { double *ai=a+i*n; double sum=ai[j]; for(size_t k=0; k < i; ++k) { sum -= ai[k]*a[k*n+j]; } ai[j]=sum; } double big=0.0; size_t imax=j; for(size_t i=j; i < n; ++i) { double *ai=a+i*n; double sum=ai[j]; for(size_t k=0; k < j; ++k) sum -= ai[k]*a[k*n+j]; ai[j]=sum; double temp=vv[i]*fabs(sum); if(temp >= big) { big=temp; imax=i; } } double *aj=a+j*n; double *aimax=a+imax*n; if(j != imax) { for(size_t k=0; k < n; ++k) { double temp=aimax[k]; aimax[k]=aj[k]; aj[k]=temp; } swap *= -1; vv[imax]=vv[j]; } if(index) index[j]=imax; if(j != n) { double denom=aj[j]; if(denom == 0.0) { delete[] vv; if(warn) error(singular); else return 0; } for(size_t i=j+1; i < n; ++i) a[i*n+j] /= denom; } } delete[] vv; return swap; } void dividebyzero(size_t i) { ostringstream buf; if(i > 0) buf << "array element " << i << ": "; buf << "Divide by zero"; error(buf); } void integeroverflow(size_t i) { ostringstream buf; if(i > 0) buf << "array element " << i << ": "; buf << "Integer overflow"; error(buf); } #if defined(HAVE_LIBREADLINE) && defined(HAVE_LIBCURSES) struct historyState { bool store; HISTORY_STATE state; }; typedef mem::map historyMap_t; historyMap_t historyMap; static HISTORY_STATE history_save; // Store a deep copy of the current readline history in dest. void store_history(HISTORY_STATE *dest) { HISTORY_STATE *src=history_get_history_state(); if(src) { *dest=*src; for(Int i=0; i < src->length; ++i) dest->entries[i]=src->entries[i]; free(src); } } stringarray* get_history(Int n) { int N=intcast(n); if(N <= 0) N=history_length; else N=Min(N,history_length); array *a=new array((size_t) N); int offset=history_length-N+1; for(int i=0; i < N; ++i) { HIST_ENTRY *last=history_get(offset+i); string s=last ? last->line : ""; (*a)[i]=s; } return a; } string historyfilename(const string &name) { return historyname+"_"+name; } #endif #if defined(HAVE_LIBREADLINE) && defined(HAVE_LIBCURSES) int readline_startup_hook() { #ifdef __CYGWIN__ rl_set_key("\\M-[3~",rl_delete,rl_get_keymap()); rl_set_key("\\M-[2~",rl_overwrite_mode,rl_get_keymap()); #endif return 0; } void init_readline(bool tabcompletion=true) { static bool first=true; if(first) { first=false; #ifdef __CYGWIN__ rl_startup_hook=readline_startup_hook; #endif } rl_bind_key('\t',tabcompletion ? rl_complete : rl_insert); } #endif void cleanup() { processDataStruct &pd=processData(); pd.atExitFunction=NULL; pd.atUpdateFunction=NULL; pd.atBreakpointFunction=NULL; #if defined(HAVE_LIBREADLINE) && defined(HAVE_LIBCURSES) store_history(&history_save); int nlines=intcast(getSetting("historylines")); for(historyMap_t::iterator h=historyMap.begin(); h != historyMap.end(); ++h) { history_set_history_state(&h->second.state); stifle_history(nlines); if(h->second.store) write_history(historyfilename(h->first).c_str()); } history_set_history_state(&history_save); #endif } void purge(Int divisor=0) { #ifdef USEGC if(divisor > 0) GC_set_free_space_divisor((GC_word) divisor); GC_gcollect(); #endif } void updateFunction(stack *Stack) { callable *atUpdateFunction=processData().atUpdateFunction; if(atUpdateFunction && !nullfunc::instance()->compare(atUpdateFunction)) atUpdateFunction->call(Stack); } void exitFunction(stack *Stack) { callable *atExitFunction=processData().atExitFunction; if(atExitFunction && !nullfunc::instance()->compare(atExitFunction)) atExitFunction->call(Stack); cleanup(); } default_t def; string emptystring; array *emptyarray=new array(0); string commentchar="#"; pair zero; void breakpoint(stack *Stack, runnable *r) { callable *atBreakpointFunction=processData().atBreakpointFunction; if(atBreakpointFunction && !nullfunc::instance()->compare(atBreakpointFunction)) { position curPos=getPos(); Stack->push(curPos.filename()); Stack->push((Int) curPos.Line()); Stack->push((Int) curPos.Column()); Stack->push(r ? r : item(def)); atBreakpointFunction->call(Stack); // returns a string } else Stack->push(""); } } namespace types { extern const char *names[]; } void checkformat(const char *ptr, bool intformat) { while(*ptr != '\0') { if(*ptr != '%') /* While we have regular characters, print them. */ ptr++; else { /* We've got a format specifier. */ ptr++; while(*ptr && strchr ("-+ #0'I", *ptr)) /* Move past flags. */ *ptr++; if(*ptr == '*') ptr++; else while(isdigit(*ptr)) /* Handle explicit numeric value. */ ptr++; if(*ptr == '.') { *ptr++; /* Go past the period. */ if(*ptr == '*') { ptr++; } else while(isdigit(*ptr)) /* Handle explicit numeric value. */ *ptr++; } while(*ptr && strchr ("hlL", *ptr)) *ptr++; if(*ptr == '%') ++ptr; else if(*ptr != '\0') { if(intformat) { switch(*ptr) { case 'd': case 'i': case 'o': case 'u': case 'x': case 'X': case 'c': break; default: ostringstream buf; buf << "Invalid format '" << *ptr << "' for type " << types::names[types::ty_Int]; error(buf); break; } } else { switch(*ptr) { case 'f': case 'F': case 'e': case 'E': case 'g': case 'G': break; default: ostringstream buf; buf << "Invalid format '" << *ptr << "' for type " << types::names[types::ty_real]; error(buf); break; } } } } /* End of else statement */ } } // Return an angle in the interval [0,360). inline double principalBranch(double deg) { if(deg < 0) deg += 360; return deg; } static string defaulttransparency=string("Compatible"); static const string defaulttimeformat=string("%a %b %d %T %Z %Y"); #ifdef HAVE_STRFTIME static const size_t nTime=256; static char Time[nTime]; #endif void clear(string file, Int line, bool warn=false) { bpinfo bp(file,line); for(mem::list::iterator p=bplist.begin(); p != bplist.end(); ++p) { if(*p == bp) { cout << "cleared breakpoint at " << file << ": " << line << endl; bplist.remove(bp); return; } } if(warn) cout << "No such breakpoint at " << file << ": " << line << endl; } Int windingnumber(array *p, camp::pair z) { size_t size=checkArray(p); Int count=0; for(size_t i=0; i < size; i++) count += read(p,i)->windingnumber(z); return count; } string convertname(string name, const string& format, bool check=true) { if(name.empty()) return buildname(outname(),format,""); else if(check) checkLocal(name); return format.empty() ? name : format+":"+name; } callable *Func; stack *FuncStack; double wrapFunction(double x) { FuncStack->push(x); Func->call(FuncStack); return pop(FuncStack); } callable *compareFunc; bool compareFunction(const vm::item& i, const vm::item& j) { FuncStack->push(i); FuncStack->push(j); compareFunc->call(FuncStack); return pop(FuncStack); } void unused(void *) { } static const double twelvepercent=0.12; static const double tenpercent=0.1; pair readpair(stringstream& s, double hscale=1.0, double vscale=1.0) { double x,y; s >> y; s >> x; return pair(hscale*x,vscale*y); } // Ignore unclosed begingroups but not spurious endgroups. const char *nobegin="endgroup without matching begingroup"; // Return the component of vector v perpendicular to a unit vector u. inline triple perp(triple v, triple u) { return v-dot(v,u)*u; } string ASYo="/ASYo {( ) print 12 string cvs print} bind def"; string pathforall="{(M) print ASYo ASYo} {(L) print ASYo ASYo} {(C) print ASYo ASYo ASYo ASYo ASYo ASYo} {(c) print} pathforall"; string currentpoint="print currentpoint ASYo ASYo "; array *readpath(const string& psname, bool keep, double hscale=1.0, double vscale=1.0) { array *P=new array(0); ostringstream pipe; pipe << "'" << getSetting("gs") << "' -q -dNOPAUSE -dBATCH"; if(safe) pipe << " -dSAFER"; #ifdef __CYGWIN__ const string null="NUL"; #else const string null="/dev/null"; #endif pipe << " -sDEVICE=epswrite -sOutputFile="+null+" '" << psname << "'"; iopipestream gs(pipe.str().c_str(),"gs","Ghostscript"); stringstream buf; while(true) { string out; gs >> out; if(out.empty() && !gs.running()) break; buf << out; } if(verbose > 2) cout << endl; mem::vector nodes; solvedKnot node; bool cyclic=false; bool active=false; pair offset; while(!buf.eof()) { char c; buf >> c; switch(c) { case 'M': { if(active) { if(cyclic) { if(node.point == nodes[0].point) nodes[0].pre=node.pre; else { pair delta=(nodes[0].point-node.point)*third; node.post=node.point+delta; nodes[0].pre=nodes[0].point-delta; node.straight=true; nodes.push_back(node); } } else { node.post=node.point; node.straight=false; nodes.push_back(node); } P->push(path(nodes,nodes.size(),cyclic)); nodes.clear(); } active=false; cyclic=false; node.pre=node.point=readpair(buf,hscale,vscale)-offset; node.straight=false; break; } case 'L': { pair point=readpair(buf,hscale,vscale)-offset; pair delta=(point-node.point)*third; node.post=node.point+delta; node.straight=true; nodes.push_back(node); active=true; node.pre=point-delta; node.point=point; break; } case 'C': { pair point=readpair(buf,hscale,vscale)-offset; pair pre=readpair(buf,hscale,vscale)-offset; node.post=readpair(buf,hscale,vscale)-offset; node.straight=false; nodes.push_back(node); active=true; node.pre=pre; node.point=point; break; } case 'c': { cyclic=true; break; } case 'Z': { offset=readpair(buf,hscale,vscale); break; } } } if(!keep) unlink(psname.c_str()); return P; } pair sin(pair z) { return pair(sin(z.getx())*cosh(z.gety()),cos(z.getx())*sinh(z.gety())); } pair exp(pair z) { return exp(z.getx())*expi(z.gety()); } pair gamma(pair z) { static double p[]={0.99999999999980993,676.5203681218851,-1259.1392167224028, 771.32342877765313,-176.61502916214059,12.507343278686905, -0.13857109526572012,9.9843695780195716e-6, 1.5056327351493116e-7}; static int n=sizeof(p)/sizeof(double); static double root2pi=sqrt(2*PI); if(z.getx() < 0.5) return PI/(sin(PI*z)*gamma(1.0-z)); z -= 1.0; pair x=p[0]; for(int i=1; i < n; ++i) x += p[i]/(z+i); pair t=n-1.5+z; return root2pi*pow(t,z+0.5)*exp(-t)*x; } void cannotread(const string& s) { ostringstream buf; buf << "Cannot read from " << s << endl; error(buf); } void cannotwrite(const string& s) { ostringstream buf; buf << "Cannot write to " << s << endl; error(buf); } // Autogenerated routines: namespace run { // Initializers #line 1119 "runtime.in" void IntZero(stack *Stack) { #line 1120 "runtime.in" {Stack->push(0); return;} } #line 1125 "runtime.in" void realZero(stack *Stack) { #line 1126 "runtime.in" {Stack->push(0.0); return;} } #line 1130 "runtime.in" void boolFalse(stack *Stack) { #line 1131 "runtime.in" {Stack->push(false); return;} } #line 1135 "runtime.in" void pushNullArray(stack *Stack) { #line 1136 "runtime.in" {Stack->push(0); return;} } #line 1140 "runtime.in" void pushNullRecord(stack *Stack) { #line 1141 "runtime.in" {Stack->push(0); return;} } #line 1145 "runtime.in" void pushNullFunction(stack *Stack) { #line 1146 "runtime.in" {Stack->push(nullfunc::instance()); return;} } // Default operations // Put the default value token on the stack (in place of an argument when // making a function call). #line 1155 "runtime.in" void pushDefault(stack *Stack) { #line 1156 "runtime.in" {Stack->push(def); return;} } // Test if the value on the stack is the default value token. #line 1162 "runtime.in" void isDefault(stack *Stack) { item i=vm::pop(Stack); #line 1163 "runtime.in" {Stack->push(isdefault(i)); return;} } // Logical operations #line 1169 "runtime.in" // bool !(bool b); void gen8(stack *Stack) { bool b=vm::pop(Stack); #line 1170 "runtime.in" {Stack->push(!b); return;} } #line 1175 "runtime.in" void boolMemEq(stack *Stack) { frame * b=vm::pop(Stack); frame * a=vm::pop(Stack); #line 1176 "runtime.in" {Stack->push(a == b); return;} } #line 1180 "runtime.in" void boolMemNeq(stack *Stack) { frame * b=vm::pop(Stack); frame * a=vm::pop(Stack); #line 1181 "runtime.in" {Stack->push(a != b); return;} } #line 1185 "runtime.in" void boolFuncEq(stack *Stack) { callable * b=vm::pop(Stack); callable * a=vm::pop(Stack); #line 1186 "runtime.in" {Stack->push(a->compare(b)); return;} } #line 1190 "runtime.in" void boolFuncNeq(stack *Stack) { callable * b=vm::pop(Stack); callable * a=vm::pop(Stack); #line 1191 "runtime.in" {Stack->push(!(a->compare(b))); return;} } // Bit operations #line 1197 "runtime.in" // Int AND(Int a, Int b); void gen13(stack *Stack) { Int b=vm::pop(Stack); Int a=vm::pop(Stack); #line 1198 "runtime.in" {Stack->push(a & b); return;} } #line 1203 "runtime.in" // Int OR(Int a, Int b); void gen14(stack *Stack) { Int b=vm::pop(Stack); Int a=vm::pop(Stack); #line 1204 "runtime.in" {Stack->push(a | b); return;} } #line 1208 "runtime.in" // Int XOR(Int a, Int b); void gen15(stack *Stack) { Int b=vm::pop(Stack); Int a=vm::pop(Stack); #line 1209 "runtime.in" {Stack->push(a ^ b); return;} } #line 1213 "runtime.in" // Int NOT(Int a); void gen16(stack *Stack) { Int a=vm::pop(Stack); #line 1214 "runtime.in" {Stack->push(~a); return;} } // Casts #line 1220 "runtime.in" void pairToGuide(stack *Stack) { pair z=vm::pop(Stack); #line 1221 "runtime.in" {Stack->push(new pairguide(z)); return;} } #line 1226 "runtime.in" void pathToGuide(stack *Stack) { path p=vm::pop(Stack); #line 1227 "runtime.in" {Stack->push(new pathguide(p)); return;} } #line 1231 "runtime.in" void guideToPath(stack *Stack) { guide * g=vm::pop(Stack); #line 1232 "runtime.in" {Stack->push(g->solve()); return;} } // Picture operations #line 1238 "runtime.in" void newPicture(stack *Stack) { #line 1239 "runtime.in" {Stack->push(new picture()); return;} } #line 1244 "runtime.in" // bool empty(picture *f); void gen21(stack *Stack) { picture * f=vm::pop(Stack); #line 1245 "runtime.in" {Stack->push(f->null()); return;} } #line 1249 "runtime.in" // void erase(picture *f); void gen22(stack *Stack) { picture * f=vm::pop(Stack); #line 1250 "runtime.in" f->nodes.clear(); } #line 1254 "runtime.in" // pair min(picture *f); void gen23(stack *Stack) { picture * f=vm::pop(Stack); #line 1255 "runtime.in" {Stack->push(f->bounds().Min()); return;} } #line 1259 "runtime.in" // pair max(picture *f); void gen24(stack *Stack) { picture * f=vm::pop(Stack); #line 1260 "runtime.in" {Stack->push(f->bounds().Max()); return;} } #line 1264 "runtime.in" // void label(picture *f, string *s, string *size, transform t, pair position, pair align, pen p); void gen25(stack *Stack) { pen p=vm::pop(Stack); pair align=vm::pop(Stack); pair position=vm::pop(Stack); transform t=vm::pop(Stack); string * size=vm::pop(Stack); string * s=vm::pop(Stack); picture * f=vm::pop(Stack); #line 1266 "runtime.in" f->append(new drawLabel(*s,*size,t,position,align,p)); } #line 1270 "runtime.in" // bool labels(picture *f); void gen26(stack *Stack) { picture * f=vm::pop(Stack); #line 1271 "runtime.in" {Stack->push(f->havelabels()); return;} } #line 1275 "runtime.in" // patharray* _texpath(string *s, pen p=CURRENTPEN); void gen27(stack *Stack) { pen p=vm::pop(Stack,CURRENTPEN); string * s=vm::pop(Stack); #line 1276 "runtime.in" array *P=new array(0); if(s->empty()) {Stack->push(P); return;} string prefix=outname(); spaceToUnderscore(prefix); string psname=auxname(prefix,"ps"); string texname=auxname(prefix,"tex"); string dviname=auxname(prefix,"dvi"); bbox b; bool pdf=settings::pdf(getSetting("tex")); texfile tex(texname,b,true); tex.miniprologue(); tex.setfont(p); if(!pdf) { tex.verbatimline("\\special{ps:"); tex.verbatimline(ASYo); tex.verbatimline("/ASY1 true def"); tex.verbatimline("/v {neg exch 4 copy 4 2 roll 2 copy 6 2 roll 2 copy (M) print ASYo ASYo (L) print ASYo add ASYo (L) print add ASYo add ASYo (L) print add ASYo ASYo (c) print} bind def"); tex.verbatimline("/show {ASY1 {(Z) "+currentpoint+ "/ASY1 false def} if currentpoint newpath moveto false charpath "+ pathforall+"} bind def}"); } tex.verbatimline(*s+"%"); tex.epilogue(true); tex.close(); // TODO: Put in common subproutine (cf. teprocess). string aux=auxname(prefix,"aux"); unlink(aux.c_str()); string program=texprogram(); ostringstream cmd; bool context=settings::context(getSetting("tex")); cmd << program << (context ? " --nonstopmode '" : " \\nonstopmode\\input '") << texname << "'"; bool quiet=verbose <= 2; int status=System(cmd,quiet ? 1 : 0,true,"texpath",texpathmessage()); if(!status && getSetting("twice")) status=System(cmd,quiet ? 1 : 0,true,"texpath",texpathmessage()); if(status) { if(quiet) { ostringstream cmd; cmd << program << (context ? " --scrollmode '" : " \\scrollmode\\input '") << texname << "'"; System(cmd,0); } } string pdfname; if(!status) { if(pdf) { pdfname=auxname(prefix,"pdf"); std::ofstream ps(psname.c_str()); if(!ps) cannotwrite(psname); ps << ASYo << newl << "/ASY1 true def" << newl << "/fill {ASY1 {(Z) " << currentpoint << "/ASY1 false def} if " << pathforall << " (M) " << currentpoint << "currentpoint newpath moveto } bind def" << newl << "/stroke {ASY1 {(Z) " << currentpoint << "/ASY1 false def} if strokepath " << pathforall << " (M) " << currentpoint << "currentpoint newpath moveto } bind def" << newl; ostringstream cmd; cmd << "'" << getSetting("gs") << "' -q -dNOCACHE -dNOPAUSE -dBATCH"; if(safe) cmd << " -dSAFER"; cmd << " -sDEVICE=epswrite -sOutputFile=- '" << pdfname << "'"; iopipestream gs(cmd.str().c_str(),"gs","Ghostscript"); gs.block(false); while(true) { string line; gs >> line; if(line.empty() && !gs.running()) break; ps << line; } ps.close(); } else { ostringstream cmd; cmd << "'" << getSetting("dvips") << "' -R -Pdownload35 -D600 " << getSetting("dvipsOptions"); if(verbose <= 2) cmd << " -q"; cmd << " -o '" << psname << "' '" << dviname << "'"; status=System(cmd,0,true,"dvips"); } } if(status != 0) error("texpath failed"); bool keep=getSetting("keep"); if(!keep) { // Delete temporary files. unlink(texname.c_str()); if(!getSetting("keepaux")) unlink(aux.c_str()); unlink(auxname(prefix,"log").c_str()); if(pdf) unlink(pdfname.c_str()); else unlink(dviname.c_str()); if(context) { unlink(auxname(prefix,"top").c_str()); unlink(auxname(prefix,"tua").c_str()); unlink(auxname(prefix,"tui").c_str()); } } {Stack->push(readpath(psname,keep,twelvepercent, pdf ? twelvepercent : -twelvepercent)); return;} } #line 1390 "runtime.in" // patharray* textpath(string *s, pen p=CURRENTPEN); void gen28(stack *Stack) { pen p=vm::pop(Stack,CURRENTPEN); string * s=vm::pop(Stack); #line 1391 "runtime.in" array *P=new array(0); if(s->empty()) {Stack->push(P); return;} string prefix=outname(); spaceToUnderscore(prefix); string outputname=auxname(prefix,getSetting("textoutputtype")); string textname=auxname(prefix,getSetting("textextension")); std::ofstream text(textname.c_str()); if(!text) cannotwrite(textname); text << getSetting("textprologue") << newl << p.Font() << newl << *s << newl << getSetting("textepilogue") << endl; text.close(); string psname=auxname(prefix,"ps"); std::ofstream ps(psname.c_str()); if(!ps) cannotwrite(psname); ps << ASYo << newl << "/ASY1 true def" << newl << "/fill {ASY1 {(Z) " << currentpoint << "/ASY1 false def} if " << pathforall << " (M) " << currentpoint << "currentpoint newpath moveto } bind def" << newl << "/stroke {ASY1 {(Z) " << currentpoint << "/ASY1 false def} if strokepath " << pathforall << " (M) " << currentpoint << "currentpoint newpath moveto } bind def" << endl; ostringstream pipe; pipe << getSetting("textcommand") << " '" << textname << "'"; iopipestream typesetter(pipe.str().c_str()); ostringstream pipe2; pipe2 << "'" << getSetting("gs") << "' -q -dNOCACHE -dNOPAUSE -dBATCH"; if(safe) pipe2 << " -dSAFER"; pipe2 << " -sDEVICE=epswrite -sOutputFile=- -"; iopipestream gs(pipe2.str().c_str(),"gs","Ghostscript"); gs.block(false); // TODO: Simplify by connecting the pipes directly. while(true) { string out; if(typesetter.isopen()) { typesetter >> out; if(!out.empty()) gs << out; else if(!typesetter.running()) { typesetter.pipeclose(); gs.eof(); } } string out2; gs >> out2; if(out2.empty() && !gs.running()) break; ps << out2; } ps.close(); if(verbose > 2) cout << endl; bool keep=getSetting("keep"); if(!keep) // Delete temporary files. unlink(textname.c_str()); {Stack->push(readpath(psname,keep,tenpercent,tenpercent)); return;} } #line 1462 "runtime.in" // patharray* _strokepath(path g, pen p=CURRENTPEN); void gen29(stack *Stack) { pen p=vm::pop(Stack,CURRENTPEN); path g=vm::pop(Stack); #line 1463 "runtime.in" array *P=new array(0); if(g.size() == 0) {Stack->push(P); return;} string prefix=outname(); spaceToUnderscore(prefix); string psname=auxname(prefix,"ps"); bbox b; psfile ps(psname,false); ps.prologue(b); ps.verbatimline(ASYo); ps.verbatimline("/stroke {(Z) "+currentpoint+pathforall+"} bind def"); ps.resetpen(); ps.setpen(p); ps.write(g); ps.strokepath(); ps.stroke(); ps.verbatimline("(M) "+currentpoint); ps.epilogue(); ps.close(); {Stack->push(readpath(psname,getSetting("keep"))); return;} } #line 1486 "runtime.in" // void _draw(picture *f, path g, pen p); void gen30(stack *Stack) { pen p=vm::pop(Stack); path g=vm::pop(Stack); picture * f=vm::pop(Stack); #line 1487 "runtime.in" f->append(new drawPath(g,p)); } #line 1491 "runtime.in" // void fill(picture *f, patharray *g, pen p=CURRENTPEN, bool copy=true); void gen31(stack *Stack) { bool copy=vm::pop(Stack,true); pen p=vm::pop(Stack,CURRENTPEN); patharray * g=vm::pop(Stack); picture * f=vm::pop(Stack); #line 1492 "runtime.in" array *(*copyarray)(array *a)=copy ? copyArray: nop; f->append(new drawFill(*copyarray(g),false,p)); } #line 1497 "runtime.in" // void latticeshade(picture *f, patharray *g, bool stroke=false, pen fillrule=CURRENTPEN, penarray2 *p, bool copy=true); void gen32(stack *Stack) { bool copy=vm::pop(Stack,true); penarray2 * p=vm::pop(Stack); pen fillrule=vm::pop(Stack,CURRENTPEN); bool stroke=vm::pop(Stack,false); patharray * g=vm::pop(Stack); picture * f=vm::pop(Stack); #line 1499 "runtime.in" array *(*copyarray)(array *a)=copy ? copyArray: nop; f->append(new drawLatticeShade(*copyarray(g),stroke,fillrule,*copyarray(p))); } #line 1504 "runtime.in" // void axialshade(picture *f, patharray *g, bool stroke=false, pen pena, pair a, pen penb, pair b, bool copy=true); void gen33(stack *Stack) { bool copy=vm::pop(Stack,true); pair b=vm::pop(Stack); pen penb=vm::pop(Stack); pair a=vm::pop(Stack); pen pena=vm::pop(Stack); bool stroke=vm::pop(Stack,false); patharray * g=vm::pop(Stack); picture * f=vm::pop(Stack); #line 1506 "runtime.in" array *(*copyarray)(array *a)=copy ? copyArray: nop; f->append(new drawAxialShade(*copyarray(g),stroke,pena,a,penb,b)); } #line 1511 "runtime.in" // void radialshade(picture *f, patharray *g, bool stroke=false, pen pena, pair a, real ra, pen penb, pair b, real rb, bool copy=true); void gen34(stack *Stack) { bool copy=vm::pop(Stack,true); real rb=vm::pop(Stack); pair b=vm::pop(Stack); pen penb=vm::pop(Stack); real ra=vm::pop(Stack); pair a=vm::pop(Stack); pen pena=vm::pop(Stack); bool stroke=vm::pop(Stack,false); patharray * g=vm::pop(Stack); picture * f=vm::pop(Stack); #line 1513 "runtime.in" array *(*copyarray)(array *a)=copy ? copyArray: nop; f->append(new drawRadialShade(*copyarray(g),stroke,pena,a,ra,penb,b,rb)); } #line 1518 "runtime.in" // void gouraudshade(picture *f, patharray *g, bool stroke=false, pen fillrule=CURRENTPEN, penarray *p, pairarray *z, Intarray *edges, bool copy=true); void gen35(stack *Stack) { bool copy=vm::pop(Stack,true); Intarray * edges=vm::pop(Stack); pairarray * z=vm::pop(Stack); penarray * p=vm::pop(Stack); pen fillrule=vm::pop(Stack,CURRENTPEN); bool stroke=vm::pop(Stack,false); patharray * g=vm::pop(Stack); picture * f=vm::pop(Stack); #line 1521 "runtime.in" array *(*copyarray)(array *a)=copy ? copyArray: nop; checkArrays(p,z); checkArrays(z,edges); f->append(new drawGouraudShade(*copyarray(g),stroke,fillrule,*copyarray(p), *copyarray(z),*copyarray(edges))); } #line 1529 "runtime.in" // void gouraudshade(picture *f, patharray *g, bool stroke=false, pen fillrule=CURRENTPEN, penarray *p, Intarray *edges, bool copy=true); void gen36(stack *Stack) { bool copy=vm::pop(Stack,true); Intarray * edges=vm::pop(Stack); penarray * p=vm::pop(Stack); pen fillrule=vm::pop(Stack,CURRENTPEN); bool stroke=vm::pop(Stack,false); patharray * g=vm::pop(Stack); picture * f=vm::pop(Stack); #line 1532 "runtime.in" array *(*copyarray)(array *a)=copy ? copyArray: nop; size_t n=checkArrays(p,edges); size_t m=checkArray(g); array *z=new array(n); Int k=0; Int in=(Int) n; for(size_t j=0; j < m; ++j) { path *P=read(g,j); assert(P); Int stop=Min(P->size(),in-k); mem::vector& nodes=P->Nodes(); for(Int i=0; i < stop; ++i) (*z)[k++]=nodes[i].point; } checkArrays(p,z); f->append(new drawGouraudShade(*copyarray(g),stroke,fillrule,*copyarray(p), *z,*copyarray(edges))); } #line 1553 "runtime.in" // void tensorshade(picture *f, patharray *g, bool stroke=false, pen fillrule=CURRENTPEN, penarray2 *p, patharray *b=NULL, pairarray2 *z=emptyarray, bool copy=true); void gen37(stack *Stack) { bool copy=vm::pop(Stack,true); pairarray2 * z=vm::pop(Stack,emptyarray); patharray * b=vm::pop(Stack,NULL); penarray2 * p=vm::pop(Stack); pen fillrule=vm::pop(Stack,CURRENTPEN); bool stroke=vm::pop(Stack,false); patharray * g=vm::pop(Stack); picture * f=vm::pop(Stack); #line 1556 "runtime.in" array *(*copyarray)(array *a)=copy ? copyArray: nop; array *(*copyarray2)(array *a)=copy ? copyArray2: nop; if(b == NULL) b=g; size_t n=checkArrays(p,b); size_t nz=checkArray(z); if(nz != 0) checkEqual(nz,n); f->append(new drawTensorShade(*copyarray(g),stroke,fillrule,*copyarray2(p), *copyarray(b),*copyarray2(z))); } #line 1568 "runtime.in" // void functionshade(picture *f, patharray *g, bool stroke=false, pen fillrule=CURRENTPEN, string shader=emptystring, bool copy=true); void gen38(stack *Stack) { bool copy=vm::pop(Stack,true); string shader=vm::pop(Stack,emptystring); pen fillrule=vm::pop(Stack,CURRENTPEN); bool stroke=vm::pop(Stack,false); patharray * g=vm::pop(Stack); picture * f=vm::pop(Stack); #line 1571 "runtime.in" array *(*copyarray)(array *a)=copy ? copyArray: nop; f->append(new drawFunctionShade(*copyarray(g),stroke,fillrule,shader)); } // Clip a picture to a superpath using the given fill rule. // Subsequent additions to the picture will not be affected by the clipping. #line 1578 "runtime.in" // void clip(picture *f, patharray *g, bool stroke=false, pen fillrule=CURRENTPEN, bool copy=true); void gen39(stack *Stack) { bool copy=vm::pop(Stack,true); pen fillrule=vm::pop(Stack,CURRENTPEN); bool stroke=vm::pop(Stack,false); patharray * g=vm::pop(Stack); picture * f=vm::pop(Stack); #line 1580 "runtime.in" array *(*copyarray)(array *a)=copy ? copyArray: nop; drawClipBegin *begin=new drawClipBegin(*copyarray(g),stroke,fillrule,true); f->enclose(begin,new drawClipEnd(true,begin)); } #line 1586 "runtime.in" // void beginclip(picture *f, patharray *g, bool stroke=false, pen fillrule=CURRENTPEN, bool copy=true); void gen40(stack *Stack) { bool copy=vm::pop(Stack,true); pen fillrule=vm::pop(Stack,CURRENTPEN); bool stroke=vm::pop(Stack,false); patharray * g=vm::pop(Stack); picture * f=vm::pop(Stack); #line 1588 "runtime.in" array *(*copyarray)(array *a)=copy ? copyArray: nop; f->append(new drawClipBegin(*copyarray(g),stroke,fillrule,false)); } #line 1593 "runtime.in" // void endclip(picture *f); void gen41(stack *Stack) { picture * f=vm::pop(Stack); #line 1594 "runtime.in" f->append(new drawClipEnd(false)); } #line 1598 "runtime.in" // void gsave(picture *f); void gen42(stack *Stack) { picture * f=vm::pop(Stack); #line 1599 "runtime.in" f->append(new drawGsave()); } #line 1603 "runtime.in" // void grestore(picture *f); void gen43(stack *Stack) { picture * f=vm::pop(Stack); #line 1604 "runtime.in" f->append(new drawGrestore()); } #line 1608 "runtime.in" // void begingroup(picture *f); void gen44(stack *Stack) { picture * f=vm::pop(Stack); #line 1609 "runtime.in" f->append(new drawBegin()); } #line 1613 "runtime.in" // void endgroup(picture *f); void gen45(stack *Stack) { picture * f=vm::pop(Stack); #line 1614 "runtime.in" f->append(new drawEnd()); } #line 1618 "runtime.in" // void add(picture *dest, picture *src); void gen46(stack *Stack) { picture * src=vm::pop(Stack); picture * dest=vm::pop(Stack); #line 1619 "runtime.in" dest->add(*src); } #line 1623 "runtime.in" // void prepend(picture *dest, picture *src); void gen47(stack *Stack) { picture * src=vm::pop(Stack); picture * dest=vm::pop(Stack); #line 1624 "runtime.in" dest->prepend(*src); } #line 1628 "runtime.in" // void postscript(picture *f, string s); void gen48(stack *Stack) { string s=vm::pop(Stack); picture * f=vm::pop(Stack); #line 1629 "runtime.in" f->append(new drawVerbatim(PostScript,s)); } #line 1633 "runtime.in" // void tex(picture *f, string s); void gen49(stack *Stack) { string s=vm::pop(Stack); picture * f=vm::pop(Stack); #line 1634 "runtime.in" f->append(new drawVerbatim(TeX,s)); } #line 1638 "runtime.in" // void postscript(picture *f, string s, pair min, pair max); void gen50(stack *Stack) { pair max=vm::pop(Stack); pair min=vm::pop(Stack); string s=vm::pop(Stack); picture * f=vm::pop(Stack); #line 1639 "runtime.in" f->append(new drawVerbatim(PostScript,s,min,max)); } #line 1643 "runtime.in" // void tex(picture *f, string s, pair min, pair max); void gen51(stack *Stack) { pair max=vm::pop(Stack); pair min=vm::pop(Stack); string s=vm::pop(Stack); picture * f=vm::pop(Stack); #line 1644 "runtime.in" f->append(new drawVerbatim(TeX,s,min,max)); } #line 1648 "runtime.in" // void texpreamble(string s); void gen52(stack *Stack) { string s=vm::pop(Stack); #line 1649 "runtime.in" string t=s+"\n"; processDataStruct &pd=processData(); pd.TeXpipepreamble.push_back(t); pd.TeXpreamble.push_back(t); } #line 1656 "runtime.in" // void deletepreamble(); void gen53(stack *) { #line 1657 "runtime.in" if(getSetting("inlinetex")) { unlink(auxname(outname(),"pre").c_str()); } } #line 1663 "runtime.in" // void _labelpath(picture *f, string s, string size, path g, string justify, pair offset, pen p); void gen54(stack *Stack) { pen p=vm::pop(Stack); pair offset=vm::pop(Stack); string justify=vm::pop(Stack); path g=vm::pop(Stack); string size=vm::pop(Stack); string s=vm::pop(Stack); picture * f=vm::pop(Stack); #line 1665 "runtime.in" f->append(new drawLabelPath(s,size,g,justify,offset,p)); } #line 1669 "runtime.in" // void texreset(); void gen55(stack *) { #line 1670 "runtime.in" processDataStruct &pd=processData(); pd.TeXpipepreamble.clear(); pd.TeXpreamble.clear(); pd.tex.pipeclose(); } #line 1677 "runtime.in" // void layer(picture *f); void gen56(stack *Stack) { picture * f=vm::pop(Stack); #line 1678 "runtime.in" f->append(new drawLayer()); } #line 1682 "runtime.in" // void newpage(picture *f); void gen57(stack *Stack) { picture * f=vm::pop(Stack); #line 1683 "runtime.in" f->append(new drawNewPage()); } #line 1687 "runtime.in" // void _image(picture *f, realarray2 *data, pair initial, pair final, penarray *palette=NULL, transform t=identity, bool copy=true, bool antialias=false); void gen58(stack *Stack) { bool antialias=vm::pop(Stack,false); bool copy=vm::pop(Stack,true); transform t=vm::pop(Stack,identity); penarray * palette=vm::pop(Stack,NULL); pair final=vm::pop(Stack); pair initial=vm::pop(Stack); realarray2 * data=vm::pop(Stack); picture * f=vm::pop(Stack); #line 1690 "runtime.in" array *(*copyarray)(array *a)=copy ? copyArray: nop; array *(*copyarray2)(array *a)=copy ? copyArray2: nop; f->append(new drawImage(*copyarray2(data),*copyarray(palette), t*matrix(initial,final),antialias)); } #line 1697 "runtime.in" // void _image(picture *f, penarray2 *data, pair initial, pair final, transform t=identity, bool copy=true, bool antialias=false); void gen59(stack *Stack) { bool antialias=vm::pop(Stack,false); bool copy=vm::pop(Stack,true); transform t=vm::pop(Stack,identity); pair final=vm::pop(Stack); pair initial=vm::pop(Stack); penarray2 * data=vm::pop(Stack); picture * f=vm::pop(Stack); #line 1699 "runtime.in" array *(*copyarray2)(array *a)=copy ? copyArray2: nop; f->append(new drawImage(*copyarray2(data),t*matrix(initial,final),antialias)); } #line 1704 "runtime.in" // string nativeformat(); void gen60(stack *Stack) { #line 1705 "runtime.in" {Stack->push(nativeformat()); return;} } #line 1709 "runtime.in" // bool latex(); void gen61(stack *Stack) { #line 1710 "runtime.in" {Stack->push(latex(getSetting("tex"))); return;} } #line 1714 "runtime.in" // bool pdf(); void gen62(stack *Stack) { #line 1715 "runtime.in" {Stack->push(pdf(getSetting("tex"))); return;} } #line 1719 "runtime.in" // void shipout(string prefix=emptystring, picture *f, picture *preamble=NULL, string format=emptystring, bool wait=false, bool view=true, callableTransform *xform); void gen63(stack *Stack) { callableTransform * xform=vm::pop(Stack); bool view=vm::pop(Stack,true); bool wait=vm::pop(Stack,false); string format=vm::pop(Stack,emptystring); picture * preamble=vm::pop(Stack,NULL); picture * f=vm::pop(Stack); string prefix=vm::pop(Stack,emptystring); #line 1722 "runtime.in" if(prefix.empty()) prefix=outname(); picture *result=new picture; unsigned level=0; picture::nodelist::iterator p; for(p = f->nodes.begin(); p != f->nodes.end(); ++p) { xform->call(Stack); transform t=pop(Stack); static transform Zero=transform(0.0,0.0,0.0,0.0,0.0,0.0); bool Delete=(t == Zero); picture *group=new picture; assert(*p); if((*p)->endgroup()) error(nobegin); if((*p)->begingroup()) { ++level; while(p != f->nodes.end() && level) { if(!Delete) { drawElement *e=t.isIdentity() ? *p : (*p)->transformed(t); group->append(e); } ++p; if(p == f->nodes.end()) break; assert(*p); if((*p)->begingroup()) ++level; if((*p)->endgroup()) { if(level) --level; else error(nobegin); } } } if(p == f->nodes.end()) break; assert(*p); if(!Delete) { drawElement *e=t.isIdentity() ? *p : (*p)->transformed(t); group->append(e); result->add(*group); } } result->shipout(preamble,prefix,format,0.0,wait,view); } #line 1765 "runtime.in" // void shipout3(string prefix, picture *f, string format=emptystring, real width, real height, real angle, triple m, triple M, realarray2 *t, realarray *background, triplearray *lights, realarray2 *diffuse, realarray2 *ambient, realarray2 *specular, bool viewportlighting, bool view=true); void gen64(stack *Stack) { bool view=vm::pop(Stack,true); bool viewportlighting=vm::pop(Stack); realarray2 * specular=vm::pop(Stack); realarray2 * ambient=vm::pop(Stack); realarray2 * diffuse=vm::pop(Stack); triplearray * lights=vm::pop(Stack); realarray * background=vm::pop(Stack); realarray2 * t=vm::pop(Stack); triple M=vm::pop(Stack); triple m=vm::pop(Stack); real angle=vm::pop(Stack); real height=vm::pop(Stack); real width=vm::pop(Stack); string format=vm::pop(Stack,emptystring); picture * f=vm::pop(Stack); string prefix=vm::pop(Stack); #line 1770 "runtime.in" size_t n=checkArrays(lights,diffuse); checkEqual(n,checkArray(ambient)); checkEqual(n,checkArray(specular)); f->shipout3(prefix,format,width,height,angle,m,M,copyArray2C(t,true,4), copyArrayC(background),n,copyTripleArrayC(lights), copyArray2C(diffuse,false,4),copyArray2C(ambient,false,4), copyArray2C(specular,false,4),viewportlighting,view); } #line 1781 "runtime.in" // void shipout3(string prefix, picture *f); void gen65(stack *Stack) { picture * f=vm::pop(Stack); string prefix=vm::pop(Stack); #line 1782 "runtime.in" f->shipout3(prefix); } #line 1786 "runtime.in" // void deconstruct(picture *f, picture *preamble=NULL, real magnification=1, callableTransform *xform); void gen66(stack *Stack) { callableTransform * xform=vm::pop(Stack); real magnification=vm::pop(Stack,1); picture * preamble=vm::pop(Stack,NULL); picture * f=vm::pop(Stack); #line 1788 "runtime.in" unsigned level=0; unsigned n=0; string prefix=outname(); string xformat=getSetting("xformat"); static long arg_max=sysconf(_SC_ARG_MAX); const unsigned maxargs=::min(arg_max/(prefix.size()+xformat.size()+25ul), 256ul); cout << xformat << newl; cout << maxargs << newl; string preformat=nativeformat(); const string Done="Done"; const string Error="Error"; ostringstream cmd; // Enforce ghostscript limitations. magnification=::max(magnification,0.0001); real res=::min(::max(magnification*72.0,2.0),8192.0); const char *converter=NULL, *hint=NULL; bool png=xformat == "png"; if(magnification > 0.0) { mem::list nameStack; string outname; unsigned arg=0; unsigned batch=0; for(picture::nodelist::iterator p=f->nodes.begin();;) { if(p == f->nodes.end()) break; if(arg == 0) { cmd.str(""); ostringstream buf; buf << batch << "_"; outname=buildname(prefix+buf.str()+"%d",xformat,""); if(png) { cmd << "'" << getSetting("gs") << "' -q -dNOPAUSE -dBATCH -sDEVICE=pngalpha -dEPSCrop"; if(safe) cmd << " -dSAFER"; cmd << " -r" << res << "x" << res << " -sOutputFile='" << outname << "'"; converter="gs"; hint="Ghostscript"; } else { cmd << "'" << getSetting("convert") << "' -density " << res << "x" << res << " -transparent white"; hint=converter="convert"; } } picture *group=new picture; xform->call(Stack); transform t=pop(Stack); assert(*p); if((*p)->endgroup()) { cout << Error << endl; error(nobegin); } if((*p)->begingroup()) { ++level; while(p != f->nodes.end() && level) { drawElement *e=t.isIdentity() ? *p : (*p)->transformed(t); group->append(e); ++p; if(p == f->nodes.end()) break; assert(*p); if((*p)->begingroup()) ++level; if((*p)->endgroup()) { if(level) --level; else { cout << Error << endl; error(nobegin); } } } } if(p != f->nodes.end()) { assert(*p); drawElement *e=t.isIdentity() ? *p : (*p)->transformed(t); group->append(e); bbox b; ostringstream buf; buf << prefix << "_" << n; group->shipout(preamble,buf.str(),preformat,magnification,false,false); string Preformat=png && group->Transparency() ? "pdf" : preformat; string name=buildname(buf.str(),Preformat); nameStack.push_back(name); cmd << " '"; if(!png) cmd << preformat+":"; cmd << name << "'"; b=group->bounds(); b *= magnification; cout << b << newl; ++n; ++p; ++arg; } if(p == f->nodes.end() || arg >= maxargs) { arg=0; ++batch; cout.flush(); if(!png) cmd << " -scene 1 '" << xformat << ":" << outname << "'"; int status=System(cmd,0,true,converter,hint); if(status) { cout << Error << endl; error("deconstruct failed"); } } } if(!getSetting("keep")) { for(mem::list::iterator p=nameStack.begin(); p != nameStack.end(); ++p) unlink(p->c_str()); } cout << Done << endl; } } #line 1919 "runtime.in" // void purge(Int divisor=0); void gen67(stack *Stack) { Int divisor=vm::pop(Stack,0); #line 1920 "runtime.in" purge(divisor); } // Pen operations #line 1926 "runtime.in" void newPen(stack *Stack) { #line 1927 "runtime.in" {Stack->push(pen()); return;} } #line 1932 "runtime.in" // bool ==(pen a, pen b); void gen69(stack *Stack) { pen b=vm::pop(Stack); pen a=vm::pop(Stack); #line 1933 "runtime.in" {Stack->push(a == b); return;} } #line 1937 "runtime.in" // bool !=(pen a, pen b); void gen70(stack *Stack) { pen b=vm::pop(Stack); pen a=vm::pop(Stack); #line 1938 "runtime.in" {Stack->push(a != b); return;} } #line 1942 "runtime.in" // pen +(pen a, pen b); void gen71(stack *Stack) { pen b=vm::pop(Stack); pen a=vm::pop(Stack); #line 1943 "runtime.in" {Stack->push(a+b); return;} } #line 1947 "runtime.in" // pen *(real a, pen b); void gen72(stack *Stack) { pen b=vm::pop(Stack); real a=vm::pop(Stack); #line 1948 "runtime.in" {Stack->push(a*b); return;} } #line 1952 "runtime.in" // pen *(pen a, real b); void gen73(stack *Stack) { real b=vm::pop(Stack); pen a=vm::pop(Stack); #line 1953 "runtime.in" {Stack->push(b*a); return;} } #line 1957 "runtime.in" // pair max(pen p); void gen74(stack *Stack) { pen p=vm::pop(Stack); #line 1958 "runtime.in" {Stack->push(p.bounds().Max()); return;} } #line 1962 "runtime.in" // pair min(pen p); void gen75(stack *Stack) { pen p=vm::pop(Stack); #line 1963 "runtime.in" {Stack->push(p.bounds().Min()); return;} } // Reset the meaning of pen default attributes. #line 1968 "runtime.in" // void resetdefaultpen(); void gen76(stack *) { #line 1969 "runtime.in" processData().defaultpen=camp::pen::initialpen(); } #line 1973 "runtime.in" // void defaultpen(pen p); void gen77(stack *Stack) { pen p=vm::pop(Stack); #line 1974 "runtime.in" processData().defaultpen=pen(resolvepen,p); } #line 1978 "runtime.in" // pen defaultpen(); void gen78(stack *Stack) { #line 1979 "runtime.in" {Stack->push(processData().defaultpen); return;} } #line 1983 "runtime.in" // bool invisible(pen p); void gen79(stack *Stack) { pen p=vm::pop(Stack); #line 1984 "runtime.in" {Stack->push(p.invisible()); return;} } #line 1988 "runtime.in" // pen invisible(); void gen80(stack *Stack) { #line 1989 "runtime.in" {Stack->push(pen(invisiblepen)); return;} } #line 1993 "runtime.in" // pen gray(pen p); void gen81(stack *Stack) { pen p=vm::pop(Stack); #line 1994 "runtime.in" p.togrey(); {Stack->push(p); return;} } #line 1999 "runtime.in" // pen rgb(pen p); void gen82(stack *Stack) { pen p=vm::pop(Stack); #line 2000 "runtime.in" p.torgb(); {Stack->push(p); return;} } #line 2005 "runtime.in" // pen cmyk(pen p); void gen83(stack *Stack) { pen p=vm::pop(Stack); #line 2006 "runtime.in" p.tocmyk(); {Stack->push(p); return;} } #line 2011 "runtime.in" // pen interp(pen a, pen b, real t); void gen84(stack *Stack) { real t=vm::pop(Stack); pen b=vm::pop(Stack); pen a=vm::pop(Stack); #line 2012 "runtime.in" {Stack->push(interpolate(a,b,t)); return;} } #line 2016 "runtime.in" // pen rgb(real r, real g, real b); void gen85(stack *Stack) { real b=vm::pop(Stack); real g=vm::pop(Stack); real r=vm::pop(Stack); #line 2017 "runtime.in" {Stack->push(pen(r,g,b)); return;} } #line 2021 "runtime.in" // pen cmyk(real c, real m, real y, real k); void gen86(stack *Stack) { real k=vm::pop(Stack); real y=vm::pop(Stack); real m=vm::pop(Stack); real c=vm::pop(Stack); #line 2022 "runtime.in" {Stack->push(pen(c,m,y,k)); return;} } #line 2026 "runtime.in" // pen gray(real gray); void gen87(stack *Stack) { real gray=vm::pop(Stack); #line 2027 "runtime.in" {Stack->push(pen(gray)); return;} } #line 2031 "runtime.in" // realarray* colors(pen p); void gen88(stack *Stack) { pen p=vm::pop(Stack); #line 2032 "runtime.in" size_t n=ColorComponents[p.colorspace()]; array *a=new array(n); switch(n) { case 0: break; case 1: (*a)[0]=p.gray(); break; case 3: (*a)[0]=p.red(); (*a)[1]=p.green(); (*a)[2]=p.blue(); break; case 4: (*a)[0]=p.cyan(); (*a)[1]=p.magenta(); (*a)[2]=p.yellow(); (*a)[3]=p.black(); break; default: break; } {Stack->push(a); return;} } #line 2059 "runtime.in" // string colorspace(pen p); void gen89(stack *Stack) { pen p=vm::pop(Stack); #line 2060 "runtime.in" string s=ColorDeviceSuffix[p.colorspace()]; std::transform(s.begin(),s.end(),s.begin(),tolower); {Stack->push(s); return;} } #line 2066 "runtime.in" // pen pattern(string *s); void gen90(stack *Stack) { string * s=vm::pop(Stack); #line 2067 "runtime.in" {Stack->push(pen(setpattern,*s)); return;} } #line 2071 "runtime.in" // string pattern(pen p); void gen91(stack *Stack) { pen p=vm::pop(Stack); #line 2072 "runtime.in" {Stack->push(p.fillpattern()); return;} } #line 2076 "runtime.in" // pen fillrule(Int n); void gen92(stack *Stack) { Int n=vm::pop(Stack); #line 2077 "runtime.in" {Stack->push(pen(n >= 0 && n < nFill ? (FillRule) n : DEFFILL)); return;} } #line 2081 "runtime.in" // Int fillrule(pen p); void gen93(stack *Stack) { pen p=vm::pop(Stack); #line 2082 "runtime.in" {Stack->push(p.Fillrule()); return;} } #line 2086 "runtime.in" // pen opacity(real opacity=1.0, string blend=defaulttransparency); void gen94(stack *Stack) { string blend=vm::pop(Stack,defaulttransparency); real opacity=vm::pop(Stack,1.0); #line 2087 "runtime.in" for(Int i=0; i < nBlendMode; ++i) if(blend == BlendMode[i]) {Stack->push(pen(Transparency(blend,opacity))); return;} ostringstream buf; buf << "Unknown blend mode: " << "'" << blend << "'"; error(buf); } #line 2096 "runtime.in" // real opacity(pen p); void gen95(stack *Stack) { pen p=vm::pop(Stack); #line 2097 "runtime.in" {Stack->push(p.opacity()); return;} } #line 2101 "runtime.in" // string blend(pen p); void gen96(stack *Stack) { pen p=vm::pop(Stack); #line 2102 "runtime.in" {Stack->push(p.blend()); return;} } #line 2106 "runtime.in" // pen linetype(string *s, real offset=0, bool scale=true, bool adjust=true); void gen97(stack *Stack) { bool adjust=vm::pop(Stack,true); bool scale=vm::pop(Stack,true); real offset=vm::pop(Stack,0); string * s=vm::pop(Stack); #line 2107 "runtime.in" {Stack->push(pen(LineType(*s,offset,scale,adjust))); return;} } #line 2111 "runtime.in" // string linetype(pen p=CURRENTPEN); void gen98(stack *Stack) { pen p=vm::pop(Stack,CURRENTPEN); #line 2112 "runtime.in" {Stack->push(p.stroke()); return;} } #line 2116 "runtime.in" // real offset(pen p); void gen99(stack *Stack) { pen p=vm::pop(Stack); #line 2117 "runtime.in" {Stack->push(p.linetype().offset); return;} } #line 2121 "runtime.in" // bool scale(pen p); void gen100(stack *Stack) { pen p=vm::pop(Stack); #line 2122 "runtime.in" {Stack->push(p.linetype().scale); return;} } #line 2126 "runtime.in" // bool adjust(pen p); void gen101(stack *Stack) { pen p=vm::pop(Stack); #line 2127 "runtime.in" {Stack->push(p.linetype().adjust); return;} } #line 2131 "runtime.in" // pen adjust(pen p, real arclength, bool cyclic); void gen102(stack *Stack) { bool cyclic=vm::pop(Stack); real arclength=vm::pop(Stack); pen p=vm::pop(Stack); #line 2132 "runtime.in" {Stack->push(adjustdash(p,arclength,cyclic)); return;} } #line 2136 "runtime.in" // pen linecap(Int n); void gen103(stack *Stack) { Int n=vm::pop(Stack); #line 2137 "runtime.in" {Stack->push(pen(setlinecap,n >= 0 && n < nCap ? n : DEFCAP)); return;} } #line 2141 "runtime.in" // Int linecap(pen p=CURRENTPEN); void gen104(stack *Stack) { pen p=vm::pop(Stack,CURRENTPEN); #line 2142 "runtime.in" {Stack->push(p.cap()); return;} } #line 2146 "runtime.in" // pen linejoin(Int n); void gen105(stack *Stack) { Int n=vm::pop(Stack); #line 2147 "runtime.in" {Stack->push(pen(setlinejoin,n >= 0 && n < nJoin ? n : DEFJOIN)); return;} } #line 2151 "runtime.in" // Int linejoin(pen p=CURRENTPEN); void gen106(stack *Stack) { pen p=vm::pop(Stack,CURRENTPEN); #line 2152 "runtime.in" {Stack->push(p.join()); return;} } #line 2156 "runtime.in" // pen miterlimit(real x); void gen107(stack *Stack) { real x=vm::pop(Stack); #line 2157 "runtime.in" {Stack->push(pen(setmiterlimit,x >= 1.0 ? x : DEFJOIN)); return;} } #line 2161 "runtime.in" // real miterlimit(pen p=CURRENTPEN); void gen108(stack *Stack) { pen p=vm::pop(Stack,CURRENTPEN); #line 2162 "runtime.in" {Stack->push(p.miter()); return;} } #line 2166 "runtime.in" // pen linewidth(real x); void gen109(stack *Stack) { real x=vm::pop(Stack); #line 2167 "runtime.in" {Stack->push(pen(setlinewidth,x >= 0.0 ? x : DEFWIDTH)); return;} } #line 2171 "runtime.in" // real linewidth(pen p=CURRENTPEN); void gen110(stack *Stack) { pen p=vm::pop(Stack,CURRENTPEN); #line 2172 "runtime.in" {Stack->push(p.width()); return;} } #line 2176 "runtime.in" // pen fontcommand(string *s); void gen111(stack *Stack) { string * s=vm::pop(Stack); #line 2177 "runtime.in" {Stack->push(pen(setfont,*s)); return;} } #line 2181 "runtime.in" // string font(pen p=CURRENTPEN); void gen112(stack *Stack) { pen p=vm::pop(Stack,CURRENTPEN); #line 2182 "runtime.in" {Stack->push(p.Font()); return;} } #line 2186 "runtime.in" // pen fontsize(real size, real lineskip); void gen113(stack *Stack) { real lineskip=vm::pop(Stack); real size=vm::pop(Stack); #line 2187 "runtime.in" {Stack->push(pen(setfontsize,size > 0.0 ? size : 0.0, lineskip > 0.0 ? lineskip : 0.0)); return;} } #line 2192 "runtime.in" // real fontsize(pen p=CURRENTPEN); void gen114(stack *Stack) { pen p=vm::pop(Stack,CURRENTPEN); #line 2193 "runtime.in" {Stack->push(p.size()); return;} } #line 2197 "runtime.in" // real lineskip(pen p=CURRENTPEN); void gen115(stack *Stack) { pen p=vm::pop(Stack,CURRENTPEN); #line 2198 "runtime.in" {Stack->push(p.Lineskip()); return;} } #line 2202 "runtime.in" // pen overwrite(Int n); void gen116(stack *Stack) { Int n=vm::pop(Stack); #line 2203 "runtime.in" {Stack->push(pen(setoverwrite,n >= 0 && n < nOverwrite ? (overwrite_t) n : DEFWRITE)); return;} } #line 2208 "runtime.in" // Int overwrite(pen p=CURRENTPEN); void gen117(stack *Stack) { pen p=vm::pop(Stack,CURRENTPEN); #line 2209 "runtime.in" {Stack->push(p.Overwrite()); return;} } #line 2213 "runtime.in" // pen basealign(Int n); void gen118(stack *Stack) { Int n=vm::pop(Stack); #line 2214 "runtime.in" {Stack->push(pen(n >= 0 && n < nBaseLine ? (BaseLine) n : DEFBASE)); return;} } #line 2218 "runtime.in" // Int basealign(pen p=CURRENTPEN); void gen119(stack *Stack) { pen p=vm::pop(Stack,CURRENTPEN); #line 2219 "runtime.in" {Stack->push(p.Baseline()); return;} } #line 2223 "runtime.in" // transform transform(pen p); void gen120(stack *Stack) { pen p=vm::pop(Stack); #line 2224 "runtime.in" {Stack->push(p.getTransform()); return;} } #line 2228 "runtime.in" // path nib(pen p); void gen121(stack *Stack) { pen p=vm::pop(Stack); #line 2229 "runtime.in" {Stack->push(p.Path()); return;} } #line 2233 "runtime.in" // pen makepen(path p); void gen122(stack *Stack) { path p=vm::pop(Stack); #line 2234 "runtime.in" {Stack->push(pen(p)); return;} } #line 2238 "runtime.in" // pen colorless(pen p); void gen123(stack *Stack) { pen p=vm::pop(Stack); #line 2239 "runtime.in" p.colorless(); {Stack->push(p); return;} } // Interactive mode #line 2245 "runtime.in" // bool interactive(); void gen124(stack *Stack) { #line 2246 "runtime.in" {Stack->push(interact::interactive); return;} } #line 2251 "runtime.in" // bool uptodate(); void gen125(stack *Stack) { #line 2252 "runtime.in" {Stack->push(interact::uptodate); return;} } // System commands #line 2258 "runtime.in" // Int system(string s); void gen126(stack *Stack) { string s=vm::pop(Stack); #line 2259 "runtime.in" if(safe) error("system() call disabled; override with option -nosafe"); if(s.empty()) {Stack->push(0); return;} else {Stack->push(System(s.c_str())); return;} } #line 2266 "runtime.in" // bool view(); void gen127(stack *Stack) { #line 2267 "runtime.in" {Stack->push(view()); return;} } #line 2271 "runtime.in" // string asydir(); void gen128(stack *Stack) { #line 2272 "runtime.in" {Stack->push(systemDir); return;} } #line 2276 "runtime.in" // string locale(string s=emptystring); void gen129(stack *Stack) { string s=vm::pop(Stack,emptystring); #line 2277 "runtime.in" char *L=setlocale(LC_ALL,s.empty() ? NULL : s.c_str()); {Stack->push(L != NULL ? string(L) : ""); return;} } #line 2282 "runtime.in" // void abort(string s=emptystring); void gen130(stack *Stack) { string s=vm::pop(Stack,emptystring); #line 2283 "runtime.in" if(s.empty()) throw handled_error(); error(s.c_str()); } #line 2288 "runtime.in" // void exit(); void gen131(stack *) { #line 2289 "runtime.in" throw quit(); } #line 2293 "runtime.in" // void assert(bool b, string s=emptystring); void gen132(stack *Stack) { string s=vm::pop(Stack,emptystring); bool b=vm::pop(Stack); #line 2294 "runtime.in" flush(cout); if(!b) { ostringstream buf; buf << "assert FAILED"; if(s != "") buf << ": " << s << endl; error(buf); } } #line 2304 "runtime.in" // void sleep(Int seconds); void gen133(stack *Stack) { Int seconds=vm::pop(Stack); #line 2305 "runtime.in" if(seconds <= 0) return; sleep(seconds); } #line 2310 "runtime.in" // void usleep(Int microseconds); void gen134(stack *Stack) { Int microseconds=vm::pop(Stack); #line 2311 "runtime.in" if(microseconds <= 0) return; usleep((unsigned long) microseconds); } #line 2316 "runtime.in" // void _eval(string *s, bool embedded, bool interactiveWrite=false); void gen135(stack *Stack) { bool interactiveWrite=vm::pop(Stack,false); bool embedded=vm::pop(Stack); string * s=vm::pop(Stack); #line 2317 "runtime.in" if (embedded) { trans::coenv *e=Stack->getEnvironment(); vm::interactiveStack *is=dynamic_cast(Stack); if (e && is) { runStringEmbedded(*s, *e, *is); } else { cerr << "no runtime environment for embedded eval" << endl; } } else { runString(*s,interactiveWrite); } } #line 2331 "runtime.in" // void _eval(runnable *s, bool embedded); void gen136(stack *Stack) { bool embedded=vm::pop(Stack); runnable * s=vm::pop(Stack); #line 2332 "runtime.in" absyntax::block *ast=new absyntax::block(s->getPos(), false); ast->add(s); if (embedded) { trans::coenv *e=Stack->getEnvironment(); vm::interactiveStack *is=dynamic_cast(Stack); if (e && is) { runCodeEmbedded(ast, *e, *is); } else { cerr << "no runtime environment for embedded eval" << endl; } } else { runCode(ast); } } #line 2349 "runtime.in" // string location(); void gen137(stack *Stack) { #line 2350 "runtime.in" ostringstream buf; buf << getPos(); {Stack->push(buf.str()); return;} } // Wrapper for the stack::load() method. #line 2356 "runtime.in" void loadModule(stack *Stack) { string * index=vm::pop(Stack); #line 2357 "runtime.in" Stack->load(*index); } #line 2361 "runtime.in" // string cd(string s=emptystring); void gen139(stack *Stack) { string s=vm::pop(Stack,emptystring); #line 2362 "runtime.in" if(!s.empty() && !globalwrite()) writeDisabled(); {Stack->push(setPath(s.c_str())); return;} } #line 2367 "runtime.in" // void list(string *s, bool imports=false); void gen140(stack *Stack) { bool imports=vm::pop(Stack,false); string * s=vm::pop(Stack); #line 2368 "runtime.in" if(*s == "-") return; trans::genv ge; symbol *name=symbol::trans(*s); record *r=ge.getModule(name,*s); r->e.list(imports ? 0 : r); } // Path operations #line 2378 "runtime.in" void nullPath(stack *Stack) { #line 2379 "runtime.in" {Stack->push(nullpath); return;} } #line 2384 "runtime.in" // bool ==(path a, path b); void gen142(stack *Stack) { path b=vm::pop(Stack); path a=vm::pop(Stack); #line 2385 "runtime.in" {Stack->push(a == b); return;} } #line 2389 "runtime.in" // bool !=(path a, path b); void gen143(stack *Stack) { path b=vm::pop(Stack); path a=vm::pop(Stack); #line 2390 "runtime.in" {Stack->push(!(a == b)); return;} } #line 2394 "runtime.in" // pair point(path p, Int t); void gen144(stack *Stack) { Int t=vm::pop(Stack); path p=vm::pop(Stack); #line 2395 "runtime.in" {Stack->push(p.point((Int) t)); return;} } #line 2399 "runtime.in" // pair point(path p, real t); void gen145(stack *Stack) { real t=vm::pop(Stack); path p=vm::pop(Stack); #line 2400 "runtime.in" {Stack->push(p.point(t)); return;} } #line 2404 "runtime.in" // pair precontrol(path p, Int t); void gen146(stack *Stack) { Int t=vm::pop(Stack); path p=vm::pop(Stack); #line 2405 "runtime.in" {Stack->push(p.precontrol((Int) t)); return;} } #line 2409 "runtime.in" // pair precontrol(path p, real t); void gen147(stack *Stack) { real t=vm::pop(Stack); path p=vm::pop(Stack); #line 2410 "runtime.in" {Stack->push(p.precontrol(t)); return;} } #line 2414 "runtime.in" // pair postcontrol(path p, Int t); void gen148(stack *Stack) { Int t=vm::pop(Stack); path p=vm::pop(Stack); #line 2415 "runtime.in" {Stack->push(p.postcontrol((Int) t)); return;} } #line 2419 "runtime.in" // pair postcontrol(path p, real t); void gen149(stack *Stack) { real t=vm::pop(Stack); path p=vm::pop(Stack); #line 2420 "runtime.in" {Stack->push(p.postcontrol(t)); return;} } #line 2424 "runtime.in" // pair dir(path p, Int t, Int sign=0, bool normalize=true); void gen150(stack *Stack) { bool normalize=vm::pop(Stack,true); Int sign=vm::pop(Stack,0); Int t=vm::pop(Stack); path p=vm::pop(Stack); #line 2425 "runtime.in" {Stack->push(p.dir(t,sign,normalize)); return;} } #line 2429 "runtime.in" // pair dir(path p, real t, bool normalize=true); void gen151(stack *Stack) { bool normalize=vm::pop(Stack,true); real t=vm::pop(Stack); path p=vm::pop(Stack); #line 2430 "runtime.in" {Stack->push(p.dir(t,normalize)); return;} } #line 2434 "runtime.in" // pair accel(path p, Int t, Int sign=0); void gen152(stack *Stack) { Int sign=vm::pop(Stack,0); Int t=vm::pop(Stack); path p=vm::pop(Stack); #line 2435 "runtime.in" {Stack->push(p.accel(t,sign)); return;} } #line 2439 "runtime.in" // pair accel(path p, real t); void gen153(stack *Stack) { real t=vm::pop(Stack); path p=vm::pop(Stack); #line 2440 "runtime.in" {Stack->push(p.accel(t)); return;} } #line 2444 "runtime.in" // real radius(path p, real t); void gen154(stack *Stack) { real t=vm::pop(Stack); path p=vm::pop(Stack); #line 2445 "runtime.in" pair v=p.dir(t,false); pair a=p.accel(t); real d=dot(a,v); real v2=v.abs2(); real a2=a.abs2(); real denom=v2*a2-d*d; real r=v2*sqrt(v2); {Stack->push(denom > 0 ? r/sqrt(denom) : 0.0); return;} } #line 2456 "runtime.in" // path reverse(path p); void gen155(stack *Stack) { path p=vm::pop(Stack); #line 2457 "runtime.in" {Stack->push(p.reverse()); return;} } #line 2461 "runtime.in" // path subpath(path p, Int a, Int b); void gen156(stack *Stack) { Int b=vm::pop(Stack); Int a=vm::pop(Stack); path p=vm::pop(Stack); #line 2462 "runtime.in" {Stack->push(p.subpath((Int) a, (Int) b)); return;} } #line 2466 "runtime.in" // path subpath(path p, real a, real b); void gen157(stack *Stack) { real b=vm::pop(Stack); real a=vm::pop(Stack); path p=vm::pop(Stack); #line 2467 "runtime.in" {Stack->push(p.subpath(a,b)); return;} } #line 2471 "runtime.in" // path nurb(pair z0, pair z1, pair z2, pair z3, real w0, real w1, real w2, real w3, Int m); void gen158(stack *Stack) { Int m=vm::pop(Stack); real w3=vm::pop(Stack); real w2=vm::pop(Stack); real w1=vm::pop(Stack); real w0=vm::pop(Stack); pair z3=vm::pop(Stack); pair z2=vm::pop(Stack); pair z1=vm::pop(Stack); pair z0=vm::pop(Stack); #line 2473 "runtime.in" {Stack->push(nurb(z0,z1,z2,z3,w0,w1,w2,w3,m)); return;} } #line 2477 "runtime.in" // Int length(path p); void gen159(stack *Stack) { path p=vm::pop(Stack); #line 2478 "runtime.in" {Stack->push(p.length()); return;} } #line 2482 "runtime.in" // bool cyclic(path p); void gen160(stack *Stack) { path p=vm::pop(Stack); #line 2483 "runtime.in" {Stack->push(p.cyclic()); return;} } #line 2487 "runtime.in" // bool straight(path p, Int t); void gen161(stack *Stack) { Int t=vm::pop(Stack); path p=vm::pop(Stack); #line 2488 "runtime.in" {Stack->push(p.straight(t)); return;} } #line 2492 "runtime.in" // path unstraighten(path p); void gen162(stack *Stack) { path p=vm::pop(Stack); #line 2493 "runtime.in" {Stack->push(p.unstraighten()); return;} } #line 2497 "runtime.in" // bool piecewisestraight(path p); void gen163(stack *Stack) { path p=vm::pop(Stack); #line 2498 "runtime.in" {Stack->push(p.piecewisestraight()); return;} } #line 2502 "runtime.in" // real arclength(path p); void gen164(stack *Stack) { path p=vm::pop(Stack); #line 2503 "runtime.in" {Stack->push(p.arclength()); return;} } #line 2507 "runtime.in" // real arctime(path p, real dval); void gen165(stack *Stack) { real dval=vm::pop(Stack); path p=vm::pop(Stack); #line 2508 "runtime.in" {Stack->push(p.arctime(dval)); return;} } #line 2512 "runtime.in" // real dirtime(path p, pair z); void gen166(stack *Stack) { pair z=vm::pop(Stack); path p=vm::pop(Stack); #line 2513 "runtime.in" {Stack->push(p.directiontime(z)); return;} } #line 2517 "runtime.in" // realarray* intersect(path p, path q, real fuzz=-1); void gen167(stack *Stack) { real fuzz=vm::pop(Stack,-1); path q=vm::pop(Stack); path p=vm::pop(Stack); #line 2518 "runtime.in" bool exact=fuzz <= 0.0; if(fuzz < 0) fuzz=BigFuzz*::max(::max(length(p.max()),length(p.min())), ::max(length(q.max()),length(q.min()))); std::vector S,T; real s,t; if(intersections(s,t,S,T,p,q,fuzz,true,exact)) { array *V=new array(2); (*V)[0]=s; (*V)[1]=t; {Stack->push(V); return;} } {Stack->push(new array(0)); return;} } #line 2534 "runtime.in" // realarray2* intersections(path p, path q, real fuzz=-1); void gen168(stack *Stack) { real fuzz=vm::pop(Stack,-1); path q=vm::pop(Stack); path p=vm::pop(Stack); #line 2535 "runtime.in" bool exact=fuzz <= 0.0; if(fuzz < 0.0) fuzz=BigFuzz*::max(::max(length(p.max()),length(p.min())), ::max(length(q.max()),length(q.min()))); real s,t; std::vector S,T; intersections(s,t,S,T,p,q,fuzz,false,true); size_t n=S.size(); if(n == 0 && !exact) { if(intersections(s,t,S,T,p,q,fuzz,true,false)) { array *V=new array(1); array *Vi=new array(2); (*V)[0]=Vi; (*Vi)[0]=s; (*Vi)[1]=t; {Stack->push(V); return;} } } array *V=new array(n); for(size_t i=0; i < n; ++i) { array *Vi=new array(2); (*V)[i]=Vi; (*Vi)[0]=S[i]; (*Vi)[1]=T[i]; } stable_sort(V->begin(),V->end(),run::compare2()); {Stack->push(V); return;} } #line 2565 "runtime.in" // realarray* intersections(path p, explicit pair a, explicit pair b, real fuzz=-1); void gen169(stack *Stack) { real fuzz=vm::pop(Stack,-1); pair b=vm::pop(Stack); pair a=vm::pop(Stack); path p=vm::pop(Stack); #line 2566 "runtime.in" if(fuzz < 0) fuzz=BigFuzz*::max(::max(length(p.max()),length(p.min())), ::max(length(a),length(b))); std::vector S; intersections(S,p,a,b,fuzz); sort(S.begin(),S.end()); size_t n=S.size(); array *V=new array(n); for(size_t i=0; i < n; ++i) (*V)[i]=S[i]; {Stack->push(V); return;} } // Return the intersection point of the extensions of the line segments // PQ and pq. #line 2582 "runtime.in" // pair extension(pair P, pair Q, pair p, pair q); void gen170(stack *Stack) { pair q=vm::pop(Stack); pair p=vm::pop(Stack); pair Q=vm::pop(Stack); pair P=vm::pop(Stack); #line 2583 "runtime.in" pair ac=P-Q; pair bd=q-p; real det=ac.getx()*bd.gety()-ac.gety()*bd.getx(); if(det == 0) {Stack->push(pair(infinity,infinity)); return;} {Stack->push(P+((p.getx()-P.getx())*bd.gety()-(p.gety()-P.gety())*bd.getx())*ac/det); return;} } #line 2591 "runtime.in" // Int size(path p); void gen171(stack *Stack) { path p=vm::pop(Stack); #line 2592 "runtime.in" {Stack->push(p.size()); return;} } #line 2596 "runtime.in" // path &(path p, path q); void gen172(stack *Stack) { path q=vm::pop(Stack); path p=vm::pop(Stack); #line 2597 "runtime.in" {Stack->push(camp::concat(p,q)); return;} } #line 2601 "runtime.in" // pair min(path p); void gen173(stack *Stack) { path p=vm::pop(Stack); #line 2602 "runtime.in" {Stack->push(p.min()); return;} } #line 2606 "runtime.in" // pair max(path p); void gen174(stack *Stack) { path p=vm::pop(Stack); #line 2607 "runtime.in" {Stack->push(p.max()); return;} } #line 2611 "runtime.in" // realarray* mintimes(path p); void gen175(stack *Stack) { path p=vm::pop(Stack); #line 2612 "runtime.in" array *V=new array(2); pair z=p.mintimes(); (*V)[0]=z.getx(); (*V)[1]=z.gety(); {Stack->push(V); return;} } #line 2620 "runtime.in" // realarray* maxtimes(path p); void gen176(stack *Stack) { path p=vm::pop(Stack); #line 2621 "runtime.in" array *V=new array(2); pair z=p.maxtimes(); (*V)[0]=z.getx(); (*V)[1]=z.gety(); {Stack->push(V); return;} } #line 2629 "runtime.in" // real relativedistance(real theta, real phi, real t, bool atleast); void gen177(stack *Stack) { bool atleast=vm::pop(Stack); real t=vm::pop(Stack); real phi=vm::pop(Stack); real theta=vm::pop(Stack); #line 2630 "runtime.in" {Stack->push(camp::velocity(theta,phi,tension(t,atleast))); return;} } #line 2634 "runtime.in" // Int windingnumber(patharray *p, pair z); void gen178(stack *Stack) { pair z=vm::pop(Stack); patharray * p=vm::pop(Stack); #line 2635 "runtime.in" {Stack->push(windingnumber(p,z)); return;} } #line 2639 "runtime.in" // bool inside(explicit patharray *g, pair z, pen fillrule=CURRENTPEN); void gen179(stack *Stack) { pen fillrule=vm::pop(Stack,CURRENTPEN); pair z=vm::pop(Stack); patharray * g=vm::pop(Stack); #line 2640 "runtime.in" {Stack->push(fillrule.inside(windingnumber(g,z))); return;} } #line 2644 "runtime.in" // bool inside(path g, pair z, pen fillrule=CURRENTPEN); void gen180(stack *Stack) { pen fillrule=vm::pop(Stack,CURRENTPEN); pair z=vm::pop(Stack); path g=vm::pop(Stack); #line 2645 "runtime.in" {Stack->push(fillrule.inside(g.windingnumber(z))); return;} } // Determine the side of a--b that c lies on // (negative=left, zero=on line, positive=right). #line 2651 "runtime.in" // real side(pair a, pair b, pair c); void gen181(stack *Stack) { pair c=vm::pop(Stack); pair b=vm::pop(Stack); pair a=vm::pop(Stack); #line 2652 "runtime.in" {Stack->push(orient2d(a,b,c)); return;} } // Determine the side of the counterclockwise circle through a,b,c that d // lies on (negative=inside, 0=on circle, positive=right). #line 2658 "runtime.in" // real incircle(pair a, pair b, pair c, pair d); void gen182(stack *Stack) { pair d=vm::pop(Stack); pair c=vm::pop(Stack); pair b=vm::pop(Stack); pair a=vm::pop(Stack); #line 2659 "runtime.in" {Stack->push(incircle(a.getx(),a.gety(),b.getx(),b.gety(),c.getx(),c.gety(), d.getx(),d.gety())); return;} } // Path3 operations #line 2666 "runtime.in" // path3 path3(triplearray *pre, triplearray *point, triplearray *post, boolarray *straight, bool cyclic); void gen183(stack *Stack) { bool cyclic=vm::pop(Stack); boolarray * straight=vm::pop(Stack); triplearray * post=vm::pop(Stack); triplearray * point=vm::pop(Stack); triplearray * pre=vm::pop(Stack); #line 2668 "runtime.in" size_t n=checkArrays(pre,point); checkEqual(n,checkArray(post)); checkEqual(n,checkArray(straight)); mem::vector nodes(n); for(size_t i=0; i < n; ++i) { nodes[i].pre=read(pre,i); nodes[i].point=read(point,i); nodes[i].post=read(post,i); nodes[i].straight=read(straight,i); } {Stack->push(path3(nodes,(Int) n,cyclic)); return;} } #line 2684 "runtime.in" void nullPath3(stack *Stack) { #line 2685 "runtime.in" {Stack->push(nullpath3); return;} } #line 2689 "runtime.in" // bool ==(path3 a, path3 b); void gen185(stack *Stack) { path3 b=vm::pop(Stack); path3 a=vm::pop(Stack); #line 2690 "runtime.in" {Stack->push(a == b); return;} } #line 2694 "runtime.in" // bool !=(path3 a, path3 b); void gen186(stack *Stack) { path3 b=vm::pop(Stack); path3 a=vm::pop(Stack); #line 2695 "runtime.in" {Stack->push(!(a == b)); return;} } #line 2699 "runtime.in" // triple point(path3 p, Int t); void gen187(stack *Stack) { Int t=vm::pop(Stack); path3 p=vm::pop(Stack); #line 2700 "runtime.in" {Stack->push(p.point((Int) t)); return;} } #line 2704 "runtime.in" // triple point(path3 p, real t); void gen188(stack *Stack) { real t=vm::pop(Stack); path3 p=vm::pop(Stack); #line 2705 "runtime.in" {Stack->push(p.point(t)); return;} } #line 2709 "runtime.in" // triple precontrol(path3 p, Int t); void gen189(stack *Stack) { Int t=vm::pop(Stack); path3 p=vm::pop(Stack); #line 2710 "runtime.in" {Stack->push(p.precontrol((Int) t)); return;} } #line 2714 "runtime.in" // triple precontrol(path3 p, real t); void gen190(stack *Stack) { real t=vm::pop(Stack); path3 p=vm::pop(Stack); #line 2715 "runtime.in" {Stack->push(p.precontrol(t)); return;} } #line 2719 "runtime.in" // triple postcontrol(path3 p, Int t); void gen191(stack *Stack) { Int t=vm::pop(Stack); path3 p=vm::pop(Stack); #line 2720 "runtime.in" {Stack->push(p.postcontrol((Int) t)); return;} } #line 2724 "runtime.in" // triple postcontrol(path3 p, real t); void gen192(stack *Stack) { real t=vm::pop(Stack); path3 p=vm::pop(Stack); #line 2725 "runtime.in" {Stack->push(p.postcontrol(t)); return;} } #line 2729 "runtime.in" // triple dir(path3 p, Int t, Int sign=0, bool normalize=true); void gen193(stack *Stack) { bool normalize=vm::pop(Stack,true); Int sign=vm::pop(Stack,0); Int t=vm::pop(Stack); path3 p=vm::pop(Stack); #line 2730 "runtime.in" {Stack->push(p.dir(t,sign,normalize)); return;} } #line 2734 "runtime.in" // triple dir(path3 p, real t, bool normalize=true); void gen194(stack *Stack) { bool normalize=vm::pop(Stack,true); real t=vm::pop(Stack); path3 p=vm::pop(Stack); #line 2735 "runtime.in" {Stack->push(p.dir(t,normalize)); return;} } #line 2739 "runtime.in" // triple accel(path3 p, Int t, Int sign=0); void gen195(stack *Stack) { Int sign=vm::pop(Stack,0); Int t=vm::pop(Stack); path3 p=vm::pop(Stack); #line 2740 "runtime.in" {Stack->push(p.accel(t,sign)); return;} } #line 2744 "runtime.in" // triple accel(path3 p, real t); void gen196(stack *Stack) { real t=vm::pop(Stack); path3 p=vm::pop(Stack); #line 2745 "runtime.in" {Stack->push(p.accel(t)); return;} } #line 2749 "runtime.in" // real radius(path3 p, real t); void gen197(stack *Stack) { real t=vm::pop(Stack); path3 p=vm::pop(Stack); #line 2750 "runtime.in" triple v=p.dir(t,false); triple a=p.accel(t); real d=dot(a,v); real v2=v.abs2(); real a2=a.abs2(); real denom=v2*a2-d*d; real r=v2*sqrt(v2); {Stack->push(denom > 0 ? r/sqrt(denom) : 0.0); return;} } #line 2761 "runtime.in" // real radius(triple z0, triple c0, triple c1, triple z1, real t); void gen198(stack *Stack) { real t=vm::pop(Stack); triple z1=vm::pop(Stack); triple c1=vm::pop(Stack); triple c0=vm::pop(Stack); triple z0=vm::pop(Stack); #line 2762 "runtime.in" triple v=(3.0*(z1-z0)+9.0*(c0-c1))*t*t+(6.0*(z0+c1)-12.0*c0)*t+3.0*(c0-z0); triple a=6.0*(z1-z0+3.0*(c0-c1))*t+6.0*(z0+c1)-12.0*c0; real d=dot(a,v); real v2=v.abs2(); real a2=a.abs2(); real denom=v2*a2-d*d; real r=v2*sqrt(v2); {Stack->push(denom > 0 ? r/sqrt(denom) : 0.0); return;} } #line 2773 "runtime.in" // path3 reverse(path3 p); void gen199(stack *Stack) { path3 p=vm::pop(Stack); #line 2774 "runtime.in" {Stack->push(p.reverse()); return;} } #line 2778 "runtime.in" // path3 subpath(path3 p, Int a, Int b); void gen200(stack *Stack) { Int b=vm::pop(Stack); Int a=vm::pop(Stack); path3 p=vm::pop(Stack); #line 2779 "runtime.in" {Stack->push(p.subpath((Int) a, (Int) b)); return;} } #line 2783 "runtime.in" // path3 subpath(path3 p, real a, real b); void gen201(stack *Stack) { real b=vm::pop(Stack); real a=vm::pop(Stack); path3 p=vm::pop(Stack); #line 2784 "runtime.in" {Stack->push(p.subpath(a,b)); return;} } #line 2788 "runtime.in" // Int length(path3 p); void gen202(stack *Stack) { path3 p=vm::pop(Stack); #line 2789 "runtime.in" {Stack->push(p.length()); return;} } #line 2793 "runtime.in" // bool cyclic(path3 p); void gen203(stack *Stack) { path3 p=vm::pop(Stack); #line 2794 "runtime.in" {Stack->push(p.cyclic()); return;} } #line 2798 "runtime.in" // bool straight(path3 p, Int t); void gen204(stack *Stack) { Int t=vm::pop(Stack); path3 p=vm::pop(Stack); #line 2799 "runtime.in" {Stack->push(p.straight(t)); return;} } // Return the component of vector v perpendicular to a unit vector u. #line 2804 "runtime.in" // triple perp(triple v, triple u); void gen205(stack *Stack) { triple u=vm::pop(Stack); triple v=vm::pop(Stack); #line 2805 "runtime.in" {Stack->push(v-dot(v,u)*u); return;} } // Return the maximum perpendicular deviation of segment i of path3 g // from a straight line. #line 2811 "runtime.in" // real straightness(path3 p, Int t); void gen206(stack *Stack) { Int t=vm::pop(Stack); path3 p=vm::pop(Stack); #line 2812 "runtime.in" if(p.straight(t)) {Stack->push(0); return;} triple z0=p.point(t); triple u=unit(p.point(t+1)-z0); {Stack->push(::max(length(perp(p.postcontrol(t)-z0,u)), length(perp(p.precontrol(t+1)-z0,u)))); return;} } // Return the maximum perpendicular deviation of z0..controls c0 and c1..z1 // from a straight line. #line 2822 "runtime.in" // real straightness(triple z0, triple c0, triple c1, triple z1); void gen207(stack *Stack) { triple z1=vm::pop(Stack); triple c1=vm::pop(Stack); triple c0=vm::pop(Stack); triple z0=vm::pop(Stack); #line 2823 "runtime.in" triple u=unit(z1-z0); {Stack->push(::max(length(perp(c0-z0,u)),length(perp(c1-z0,u)))); return;} } #line 2828 "runtime.in" // bool piecewisestraight(path3 p); void gen208(stack *Stack) { path3 p=vm::pop(Stack); #line 2829 "runtime.in" {Stack->push(p.piecewisestraight()); return;} } #line 2833 "runtime.in" // real arclength(path3 p); void gen209(stack *Stack) { path3 p=vm::pop(Stack); #line 2834 "runtime.in" {Stack->push(p.arclength()); return;} } #line 2838 "runtime.in" // real arctime(path3 p, real dval); void gen210(stack *Stack) { real dval=vm::pop(Stack); path3 p=vm::pop(Stack); #line 2839 "runtime.in" {Stack->push(p.arctime(dval)); return;} } #line 2843 "runtime.in" // realarray* intersect(path3 p, path3 q, real fuzz=-1); void gen211(stack *Stack) { real fuzz=vm::pop(Stack,-1); path3 q=vm::pop(Stack); path3 p=vm::pop(Stack); #line 2844 "runtime.in" bool exact=fuzz <= 0.0; if(fuzz < 0) fuzz=BigFuzz*::max(::max(length(p.max()),length(p.min())), ::max(length(q.max()),length(q.min()))); std::vector S,T; real s,t; if(intersections(s,t,S,T,p,q,fuzz,true,exact)) { array *V=new array(2); (*V)[0]=s; (*V)[1]=t; {Stack->push(V); return;} } else {Stack->push(new array(0)); return;} } #line 2861 "runtime.in" // realarray2* intersections(path3 p, path3 q, real fuzz=-1); void gen212(stack *Stack) { real fuzz=vm::pop(Stack,-1); path3 q=vm::pop(Stack); path3 p=vm::pop(Stack); #line 2862 "runtime.in" bool exact=fuzz <= 0.0; if(fuzz < 0) fuzz=BigFuzz*::max(::max(length(p.max()),length(p.min())), ::max(length(q.max()),length(q.min()))); bool single=!exact; real s,t; std::vector S,T; bool found=intersections(s,t,S,T,p,q,fuzz,single,exact); if(!found) {Stack->push(new array(0)); return;} array *V; if(single) { V=new array(1); array *Vi=new array(2); (*V)[0]=Vi; (*Vi)[0]=s; (*Vi)[1]=t; } else { size_t n=S.size(); V=new array(n); for(size_t i=0; i < n; ++i) { array *Vi=new array(2); (*V)[i]=Vi; (*Vi)[0]=S[i]; (*Vi)[1]=T[i]; } } stable_sort(V->begin(),V->end(),run::compare2()); {Stack->push(V); return;} } #line 2894 "runtime.in" // realarray2* intersections(path3 p, triplearray2 *P, real fuzz=-1); void gen213(stack *Stack) { real fuzz=vm::pop(Stack,-1); triplearray2 * P=vm::pop(Stack); path3 p=vm::pop(Stack); #line 2895 "runtime.in" triple *A=copyTripleArray2C(P,true,4); if(fuzz <= 0) fuzz=BigFuzz*::max(::max(length(p.max()),length(p.min())), norm(A,16)); std::vector T,U,V; intersections(T,U,V,p,A,fuzz); delete[] A; size_t n=T.size(); array *W=new array(n); for(size_t i=0; i < n; ++i) { array *Wi=new array(3); (*W)[i]=Wi; (*Wi)[0]=T[i]; (*Wi)[1]=U[i]; (*Wi)[2]=V[i]; } {Stack->push(W); return;} // Sorting will done in asy. } #line 2914 "runtime.in" // Int size(path3 p); void gen214(stack *Stack) { path3 p=vm::pop(Stack); #line 2915 "runtime.in" {Stack->push(p.size()); return;} } #line 2919 "runtime.in" // path3 &(path3 p, path3 q); void gen215(stack *Stack) { path3 q=vm::pop(Stack); path3 p=vm::pop(Stack); #line 2920 "runtime.in" {Stack->push(camp::concat(p,q)); return;} } #line 2924 "runtime.in" // triple min(path3 p); void gen216(stack *Stack) { path3 p=vm::pop(Stack); #line 2925 "runtime.in" {Stack->push(p.min()); return;} } #line 2929 "runtime.in" // triple max(path3 p); void gen217(stack *Stack) { path3 p=vm::pop(Stack); #line 2930 "runtime.in" {Stack->push(p.max()); return;} } #line 2934 "runtime.in" // realarray* mintimes(path3 p); void gen218(stack *Stack) { path3 p=vm::pop(Stack); #line 2935 "runtime.in" array *V=new array(3); triple v=p.mintimes(); (*V)[0]=v.getx(); (*V)[1]=v.gety(); (*V)[2]=v.getz(); {Stack->push(V); return;} } #line 2944 "runtime.in" // realarray* maxtimes(path3 p); void gen219(stack *Stack) { path3 p=vm::pop(Stack); #line 2945 "runtime.in" array *V=new array(3); triple v=p.maxtimes(); (*V)[0]=v.getx(); (*V)[1]=v.gety(); (*V)[2]=v.getz(); {Stack->push(V); return;} } #line 2954 "runtime.in" // path3 *(realarray2 *t, path3 g); void gen220(stack *Stack) { path3 g=vm::pop(Stack); realarray2 * t=vm::pop(Stack); #line 2955 "runtime.in" {Stack->push(transformed(*t,g)); return;} } // Guide operations #line 2961 "runtime.in" void nullGuide(stack *Stack) { #line 2962 "runtime.in" {Stack->push(new pathguide(path())); return;} } #line 2967 "runtime.in" void dotsGuide(stack *Stack) { guidearray * a=vm::pop(Stack); #line 2968 "runtime.in" guidevector v; size_t size=checkArray(a); for (size_t i=0; i < size; ++i) v.push_back(a->read(i)); {Stack->push(new multiguide(v)); return;} } #line 2977 "runtime.in" void dashesGuide(stack *Stack) { guidearray * a=vm::pop(Stack); #line 2978 "runtime.in" static camp::curlSpec curly; static specguide curlout(&curly, camp::OUT); static specguide curlin(&curly, camp::IN); size_t n=checkArray(a); // a--b is equivalent to a{curl 1}..{curl 1}b guidevector v; if (n > 0) v.push_back(a->read(0)); if (n==1) { v.push_back(&curlout); v.push_back(&curlin); } else for (size_t i=1; iread(i)); } {Stack->push(new multiguide(v)); return;} } #line 3004 "runtime.in" void newCycleToken(stack *Stack) { #line 3005 "runtime.in" {Stack->push(cycleToken()); return;} } #line 3009 "runtime.in" // guide* operator cast(cycleToken tok); void gen225(stack *Stack) { cycleToken tok=vm::pop(Stack); #line 3010 "runtime.in" // Avoid unused variable warning messages. unused(&tok); {Stack->push(new cycletokguide()); return;} } #line 3016 "runtime.in" // guide* operator spec(pair z, Int p); void gen226(stack *Stack) { Int p=vm::pop(Stack); pair z=vm::pop(Stack); #line 3017 "runtime.in" camp::side d=(camp::side) p; camp::dirSpec *sp=new camp::dirSpec(z); {Stack->push(new specguide(sp,d)); return;} } #line 3024 "runtime.in" // curlSpecifier operator curl(real gamma, Int p); void gen227(stack *Stack) { Int p=vm::pop(Stack); real gamma=vm::pop(Stack); #line 3025 "runtime.in" camp::side s=(camp::side) p; {Stack->push(curlSpecifier(gamma,s)); return;} } #line 3030 "runtime.in" void curlSpecifierValuePart(stack *Stack) { curlSpecifier spec=vm::pop(Stack); #line 3031 "runtime.in" {Stack->push(spec.getValue()); return;} } #line 3035 "runtime.in" void curlSpecifierSidePart(stack *Stack) { curlSpecifier spec=vm::pop(Stack); #line 3036 "runtime.in" {Stack->push(spec.getSide()); return;} } #line 3040 "runtime.in" // guide* operator cast(curlSpecifier spec); void gen230(stack *Stack) { curlSpecifier spec=vm::pop(Stack); #line 3041 "runtime.in" {Stack->push(new specguide(spec)); return;} } #line 3045 "runtime.in" // tensionSpecifier operator tension(real tout, real tin, bool atleast); void gen231(stack *Stack) { bool atleast=vm::pop(Stack); real tin=vm::pop(Stack); real tout=vm::pop(Stack); #line 3046 "runtime.in" {Stack->push(tensionSpecifier(tout, tin, atleast)); return;} } #line 3050 "runtime.in" void tensionSpecifierOutPart(stack *Stack) { tensionSpecifier t=vm::pop(Stack); #line 3051 "runtime.in" {Stack->push(t.getOut()); return;} } #line 3055 "runtime.in" void tensionSpecifierInPart(stack *Stack) { tensionSpecifier t=vm::pop(Stack); #line 3056 "runtime.in" {Stack->push(t.getIn()); return;} } #line 3060 "runtime.in" void tensionSpecifierAtleastPart(stack *Stack) { tensionSpecifier t=vm::pop(Stack); #line 3061 "runtime.in" {Stack->push(t.getAtleast()); return;} } #line 3065 "runtime.in" // guide* operator cast(tensionSpecifier t); void gen235(stack *Stack) { tensionSpecifier t=vm::pop(Stack); #line 3066 "runtime.in" {Stack->push(new tensionguide(t)); return;} } #line 3070 "runtime.in" // guide* operator controls(pair zout, pair zin); void gen236(stack *Stack) { pair zin=vm::pop(Stack); pair zout=vm::pop(Stack); #line 3071 "runtime.in" {Stack->push(new controlguide(zout, zin)); return;} } #line 3075 "runtime.in" // Int size(guide *g); void gen237(stack *Stack) { guide * g=vm::pop(Stack); #line 3076 "runtime.in" flatguide f; g->flatten(f,false); {Stack->push(f.size()); return;} } #line 3082 "runtime.in" // Int length(guide *g); void gen238(stack *Stack) { guide * g=vm::pop(Stack); #line 3083 "runtime.in" flatguide f; g->flatten(f,false); {Stack->push(g->cyclic() ? f.size() : f.size()-1); return;} } #line 3089 "runtime.in" // bool cyclic(guide *g); void gen239(stack *Stack) { guide * g=vm::pop(Stack); #line 3090 "runtime.in" flatguide f; g->flatten(f,false); {Stack->push(g->cyclic()); return;} } #line 3096 "runtime.in" // pair point(guide *g, Int t); void gen240(stack *Stack) { Int t=vm::pop(Stack); guide * g=vm::pop(Stack); #line 3097 "runtime.in" flatguide f; g->flatten(f,false); {Stack->push(f.Nodes(adjustedIndex(t,f.size(),g->cyclic())).z); return;} } #line 3103 "runtime.in" // pairarray* dirSpecifier(guide *g, Int t); void gen241(stack *Stack) { Int t=vm::pop(Stack); guide * g=vm::pop(Stack); #line 3104 "runtime.in" flatguide f; g->flatten(f,false); Int n=f.size(); if(!g->cyclic() && (t < 0 || t >= n-1)) {Stack->push(new array(0)); return;} array *c=new array(2); (*c)[0]=f.Nodes(t).out->dir(); (*c)[1]=f.Nodes(t+1).in->dir(); {Stack->push(c); return;} } #line 3115 "runtime.in" // pairarray* controlSpecifier(guide *g, Int t); void gen242(stack *Stack) { Int t=vm::pop(Stack); guide * g=vm::pop(Stack); #line 3116 "runtime.in" flatguide f; g->flatten(f,false); Int n=f.size(); if(!g->cyclic() && (t < 0 || t >= n-1)) {Stack->push(new array(0)); return;} knot curr=f.Nodes(t); knot next=f.Nodes(t+1); if(curr.out->controlled()) { assert(next.in->controlled()); array *c=new array(2); (*c)[0]=curr.out->control(); (*c)[1]=next.in->control(); {Stack->push(c); return;} } else {Stack->push(new array(0)); return;} } #line 3132 "runtime.in" // tensionSpecifier tensionSpecifier(guide *g, Int t); void gen243(stack *Stack) { Int t=vm::pop(Stack); guide * g=vm::pop(Stack); #line 3133 "runtime.in" flatguide f; g->flatten(f,false); Int n=f.size(); if(!g->cyclic() && (t < 0 || t >= n-1)) {Stack->push(tensionSpecifier(1.0,1.0,false)); return;} knot curr=f.Nodes(t); {Stack->push(tensionSpecifier(curr.tout.val,f.Nodes(t+1).tin.val,curr.tout.atleast)); return;} } #line 3142 "runtime.in" // realarray* curlSpecifier(guide *g, Int t); void gen244(stack *Stack) { Int t=vm::pop(Stack); guide * g=vm::pop(Stack); #line 3143 "runtime.in" flatguide f; g->flatten(f,false); Int n=f.size(); if(!g->cyclic() && (t < 0 || t >= n-1)) {Stack->push(new array(0)); return;} array *c=new array(2); real c0=f.Nodes(t).out->curl(); real c1=f.Nodes(t+1).in->curl(); (*c)[0]=c0 >= 0.0 ? c0 : 1.0; (*c)[1]=c1 >= 0.0 ? c1 : 1.0; {Stack->push(c); return;} } #line 3156 "runtime.in" // guide* reverse(guide *g); void gen245(stack *Stack) { guide * g=vm::pop(Stack); #line 3157 "runtime.in" flatguide f; g->flatten(f,false); if(f.precyclic()) {Stack->push(new pathguide(g->solve().reverse())); return;} size_t n=f.size(); bool cyclic=g->cyclic(); guidevector v; if(n >= 0) { size_t start=cyclic ? n : n-1; knot curr=f.Nodes(start); knot next; for(size_t i=start; i > 0; --i) { next=f.Nodes(i-1); v.push_back(new pairguide(curr.z)); if(next.out->controlled()) { assert(curr.in->controlled()); v.push_back(new controlguide(curr.in->control(),next.out->control())); } else { pair d=curr.in->dir(); if(d != zero) v.push_back(new specguide(new dirSpec(-d),camp::OUT)); else { real C=curr.in->curl(); if(C >= 0.0) v.push_back(new specguide(new curlSpec(C),camp::OUT)); } real tout=curr.tin.val; real tin=next.tout.val; bool atleast=next.tout.atleast; if(tout != 1.0 || tin != 1.0 || next.tout.atleast) v.push_back(new tensionguide(tensionSpecifier(tout,tin,atleast))); d=next.out->dir(); if(d != zero) v.push_back(new specguide(new dirSpec(-d),camp::IN)); else { real C=next.out->curl(); if(C >= 0.0) v.push_back(new specguide(new curlSpec(C),camp::IN)); } } curr=next; } if(cyclic) v.push_back(new cycletokguide()); else v.push_back(new pairguide(next.z)); } {Stack->push(new multiguide(v)); return;} } // Three-dimensional picture and surface operations #line 3212 "runtime.in" // void _draw(picture *f, path3 g, pen p); void gen246(stack *Stack) { pen p=vm::pop(Stack); path3 g=vm::pop(Stack); picture * f=vm::pop(Stack); #line 3213 "runtime.in" if(g.size() > 0) f->append(new drawPath3(g,p)); } #line 3219 "runtime.in" // void draw(picture *f, triplearray2 *g, bool straight, penarray *p, real opacity, real shininess, real granularity, triple normal, bool lighton, penarray *colors); void gen247(stack *Stack) { penarray * colors=vm::pop(Stack); bool lighton=vm::pop(Stack); triple normal=vm::pop(Stack); real granularity=vm::pop(Stack); real shininess=vm::pop(Stack); real opacity=vm::pop(Stack); penarray * p=vm::pop(Stack); bool straight=vm::pop(Stack); triplearray2 * g=vm::pop(Stack); picture * f=vm::pop(Stack); #line 3222 "runtime.in" f->append(new drawSurface(*g,straight,*p,opacity,shininess,granularity, normal,lighton,*colors)); } #line 3227 "runtime.in" // triple min3(picture *f); void gen248(stack *Stack) { picture * f=vm::pop(Stack); #line 3228 "runtime.in" {Stack->push(f->bounds3().Min()); return;} } #line 3232 "runtime.in" // triple max3(picture *f); void gen249(stack *Stack) { picture * f=vm::pop(Stack); #line 3233 "runtime.in" {Stack->push(f->bounds3().Max()); return;} } #line 3237 "runtime.in" // pair min(picture *f, realarray2 *t); void gen250(stack *Stack) { realarray2 * t=vm::pop(Stack); picture * f=vm::pop(Stack); #line 3238 "runtime.in" real *T=copyArray2C(t,4); pair m=f->bounds(::min,xproject,yproject,T); delete[] T; {Stack->push(m); return;} } #line 3245 "runtime.in" // pair max(picture *f, realarray2 *t); void gen251(stack *Stack) { realarray2 * t=vm::pop(Stack); picture * f=vm::pop(Stack); #line 3246 "runtime.in" real *T=copyArray2C(t,4); pair M=f->bounds(::max,xproject,yproject,T); delete[] T; {Stack->push(M); return;} } #line 3253 "runtime.in" // pair minratio(picture *f); void gen252(stack *Stack) { picture * f=vm::pop(Stack); #line 3254 "runtime.in" {Stack->push(f->bounds(::min,xratio,yratio)); return;} } #line 3258 "runtime.in" // pair maxratio(picture *f); void gen253(stack *Stack) { picture * f=vm::pop(Stack); #line 3259 "runtime.in" {Stack->push(f->bounds(::max,xratio,yratio)); return;} } #line 3263 "runtime.in" // triple minbound(triplearray2 *P, triple b); void gen254(stack *Stack) { triple b=vm::pop(Stack); triplearray2 * P=vm::pop(Stack); #line 3264 "runtime.in" real *A=copyTripleArray2Components(P,true,4); b=triple(bound(A,::min,b.getx(),sqrtFuzz*norm(A,16)), bound(A+16,::min,b.gety(),sqrtFuzz*norm(A+16,16)), bound(A+32,::min,b.getz(),sqrtFuzz*norm(A+32,16))); delete[] A; {Stack->push(b); return;} } #line 3273 "runtime.in" // triple maxbound(triplearray2 *P, triple b); void gen255(stack *Stack) { triple b=vm::pop(Stack); triplearray2 * P=vm::pop(Stack); #line 3274 "runtime.in" real *A=copyTripleArray2Components(P,true,4); b=triple(bound(A,::max,b.getx(),sqrtFuzz*norm(A,16)), bound(A+16,::max,b.gety(),sqrtFuzz*norm(A+16,16)), bound(A+32,::max,b.getz(),sqrtFuzz*norm(A+32,16))); delete[] A; {Stack->push(b); return;} } #line 3283 "runtime.in" // pair minbound(triplearray2 *P, realarray2 *t, pair b); void gen256(stack *Stack) { pair b=vm::pop(Stack); realarray2 * t=vm::pop(Stack); triplearray2 * P=vm::pop(Stack); #line 3284 "runtime.in" triple *A=copyTripleArray2C(P,true,4); real *T=copyArray2C(t,4); real fuzz=sqrtFuzz*norm(A,16); b=pair(bound(A,::min,xproject,T,b.getx(),fuzz), bound(A,::min,yproject,T,b.gety(),fuzz)); delete[] T; delete[] A; {Stack->push(b); return;} } #line 3295 "runtime.in" // pair maxbound(triplearray2 *P, realarray2 *t, pair b); void gen257(stack *Stack) { pair b=vm::pop(Stack); realarray2 * t=vm::pop(Stack); triplearray2 * P=vm::pop(Stack); #line 3296 "runtime.in" triple *A=copyTripleArray2C(P,true,4); real *T=copyArray2C(t,4); real fuzz=sqrtFuzz*norm(A,16); b=pair(bound(A,::max,xproject,T,b.getx(),fuzz), bound(A,::max,yproject,T,b.gety(),fuzz)); delete[] T; delete[] A; {Stack->push(b); return;} } #line 3307 "runtime.in" // pair max(path3 g, realarray2 *t); void gen258(stack *Stack) { realarray2 * t=vm::pop(Stack); path3 g=vm::pop(Stack); #line 3308 "runtime.in" real *T=copyArray2C(t,4); pair b=g.bounds(::max,xproject,yproject,T); delete[] T; {Stack->push(b); return;} } #line 3315 "runtime.in" // pair min(path3 g, realarray2 *t); void gen259(stack *Stack) { realarray2 * t=vm::pop(Stack); path3 g=vm::pop(Stack); #line 3316 "runtime.in" real *T=copyArray2C(t,4); pair b=g.bounds(::min,xproject,yproject,T); delete[] T; {Stack->push(b); return;} } #line 3323 "runtime.in" // real change2(triplearray2 *a); void gen260(stack *Stack) { triplearray2 * a=vm::pop(Stack); #line 3324 "runtime.in" size_t n=checkArray(a); if(n == 0) {Stack->push(0.0); return;} vm::array *a0=vm::read(a,0); size_t m=checkArray(a0); if(m == 0) {Stack->push(0.0); return;} triple a00=vm::read(a0,0); real M=0.0; for(size_t i=0; i < n; ++i) { vm::array *ai=vm::read(a,i); size_t m=checkArray(ai); for(size_t j=0; j < m; ++j) { real a=(vm::read(ai,j)-a00).abs2(); if(a > M) M=a; } } {Stack->push(M); return;} } #line 3345 "runtime.in" // bool is3D(picture *f); void gen261(stack *Stack) { picture * f=vm::pop(Stack); #line 3346 "runtime.in" {Stack->push(f->have3D()); return;} } #line 3350 "runtime.in" // pair bezier(pair a, pair b, pair c, pair d, real t); void gen262(stack *Stack) { real t=vm::pop(Stack); pair d=vm::pop(Stack); pair c=vm::pop(Stack); pair b=vm::pop(Stack); pair a=vm::pop(Stack); #line 3351 "runtime.in" real onemt=1-t; real onemt2=onemt*onemt; {Stack->push(onemt2*onemt*a+t*(3.0*(onemt2*b+t*onemt*c)+t*t*d)); return;} } #line 3357 "runtime.in" // pair bezierP(pair a, pair b, pair c, pair d, real t); void gen263(stack *Stack) { real t=vm::pop(Stack); pair d=vm::pop(Stack); pair c=vm::pop(Stack); pair b=vm::pop(Stack); pair a=vm::pop(Stack); #line 3358 "runtime.in" {Stack->push(3.0*(t*t*(d-a+3.0*(b-c))+t*(2.0*(a+c)-4.0*b)+b-a)); return;} } #line 3362 "runtime.in" // pair bezierPP(pair a, pair b, pair c, pair d, real t); void gen264(stack *Stack) { real t=vm::pop(Stack); pair d=vm::pop(Stack); pair c=vm::pop(Stack); pair b=vm::pop(Stack); pair a=vm::pop(Stack); #line 3363 "runtime.in" {Stack->push(6.0*(t*(d-a+3.0*(b-c))+a+c-2.0*b)); return;} } #line 3367 "runtime.in" // pair bezierPPP(pair a, pair b, pair c, pair d); void gen265(stack *Stack) { pair d=vm::pop(Stack); pair c=vm::pop(Stack); pair b=vm::pop(Stack); pair a=vm::pop(Stack); #line 3368 "runtime.in" {Stack->push(6.0*(d-a+3.0*(b-c))); return;} } #line 3372 "runtime.in" // triple bezier(triple a, triple b, triple c, triple d, real t); void gen266(stack *Stack) { real t=vm::pop(Stack); triple d=vm::pop(Stack); triple c=vm::pop(Stack); triple b=vm::pop(Stack); triple a=vm::pop(Stack); #line 3373 "runtime.in" real onemt=1-t; real onemt2=onemt*onemt; {Stack->push(onemt2*onemt*a+t*(3.0*(onemt2*b+t*onemt*c)+t*t*d)); return;} } #line 3379 "runtime.in" // triple bezierP(triple a, triple b, triple c, triple d, real t); void gen267(stack *Stack) { real t=vm::pop(Stack); triple d=vm::pop(Stack); triple c=vm::pop(Stack); triple b=vm::pop(Stack); triple a=vm::pop(Stack); #line 3380 "runtime.in" {Stack->push(3.0*(t*t*(d-a+3.0*(b-c))+t*(2.0*(a+c)-4.0*b)+b-a)); return;} } #line 3384 "runtime.in" // triple bezierPP(triple a, triple b, triple c, triple d, real t); void gen268(stack *Stack) { real t=vm::pop(Stack); triple d=vm::pop(Stack); triple c=vm::pop(Stack); triple b=vm::pop(Stack); triple a=vm::pop(Stack); #line 3385 "runtime.in" {Stack->push(6.0*(t*(d-a+3.0*(b-c))+a+c-2.0*b)); return;} } #line 3389 "runtime.in" // triple bezierPPP(triple a, triple b, triple c, triple d); void gen269(stack *Stack) { triple d=vm::pop(Stack); triple c=vm::pop(Stack); triple b=vm::pop(Stack); triple a=vm::pop(Stack); #line 3390 "runtime.in" {Stack->push(6.0*(d-a+3.0*(b-c))); return;} } // String operations #line 3396 "runtime.in" void emptyString(stack *Stack) { #line 3397 "runtime.in" {Stack->push(emptystring); return;} } #line 3402 "runtime.in" // Int length(string *s); void gen271(stack *Stack) { string * s=vm::pop(Stack); #line 3403 "runtime.in" {Stack->push((Int) s->length()); return;} } #line 3407 "runtime.in" // Int find(string *s, string t, Int pos=0); void gen272(stack *Stack) { Int pos=vm::pop(Stack,0); string t=vm::pop(Stack); string * s=vm::pop(Stack); #line 3408 "runtime.in" size_t n=s->find(t,pos); {Stack->push(n == string::npos ? (Int) -1 : (Int) n); return;} } #line 3413 "runtime.in" // Int rfind(string *s, string t, Int pos=-1); void gen273(stack *Stack) { Int pos=vm::pop(Stack,-1); string t=vm::pop(Stack); string * s=vm::pop(Stack); #line 3414 "runtime.in" size_t n=s->rfind(t,pos); {Stack->push(n == string::npos ? (Int) -1 : (Int) n); return;} } #line 3419 "runtime.in" // string reverse(string s); void gen274(stack *Stack) { string s=vm::pop(Stack); #line 3420 "runtime.in" reverse(s.begin(),s.end()); {Stack->push(s); return;} } #line 3425 "runtime.in" // string insert(string s, Int pos, string t); void gen275(stack *Stack) { string t=vm::pop(Stack); Int pos=vm::pop(Stack); string s=vm::pop(Stack); #line 3426 "runtime.in" if ((size_t) pos < s.length()) {Stack->push(s.insert(pos,t)); return;} {Stack->push(s); return;} } #line 3432 "runtime.in" // string substr(string* s, Int pos, Int n=-1); void gen276(stack *Stack) { Int n=vm::pop(Stack,-1); Int pos=vm::pop(Stack); string* s=vm::pop(Stack); #line 3433 "runtime.in" if ((size_t) pos < s->length()) {Stack->push(s->substr(pos,n)); return;} {Stack->push(emptystring); return;} } #line 3439 "runtime.in" // string erase(string s, Int pos, Int n); void gen277(stack *Stack) { Int n=vm::pop(Stack); Int pos=vm::pop(Stack); string s=vm::pop(Stack); #line 3440 "runtime.in" if ((size_t) pos < s.length()) {Stack->push(s.erase(pos,n)); return;} {Stack->push(s); return;} } #line 3446 "runtime.in" // string downcase(string s); void gen278(stack *Stack) { string s=vm::pop(Stack); #line 3447 "runtime.in" std::transform(s.begin(),s.end(),s.begin(),tolower); {Stack->push(s); return;} } #line 3452 "runtime.in" // string upcase(string s); void gen279(stack *Stack) { string s=vm::pop(Stack); #line 3453 "runtime.in" std::transform(s.begin(),s.end(),s.begin(),toupper); {Stack->push(s); return;} } // returns a string constructed by translating all occurrences of the string // from in an array of string pairs {from,to} to the string to in string s. #line 3460 "runtime.in" // string replace(string *S, stringarray2 *translate); void gen280(stack *Stack) { stringarray2 * translate=vm::pop(Stack); string * S=vm::pop(Stack); #line 3461 "runtime.in" size_t size=checkArray(translate); for(size_t i=0; i < size; i++) { array *a=read(translate,i); checkArray(a); } const char *p=S->c_str(); ostringstream buf; while(*p) { for(size_t i=0; i < size;) { array *a=read(translate,i); string* from=read(a,0); size_t len=from->length(); if(strncmp(p,from->c_str(),len) != 0) {i++; continue;} buf << read(a,1); p += len; if(*p == 0) {Stack->push(buf.str()); return;} i=0; } buf << *(p++); } {Stack->push(buf.str()); return;} } #line 3485 "runtime.in" // string format(string *format, Int x); void gen281(stack *Stack) { Int x=vm::pop(Stack); string * format=vm::pop(Stack); #line 3486 "runtime.in" const char *f=format->c_str(); checkformat(f,true); Int size=snprintf(NULL,0,f,x)+1; if(size < 1) size=255; // Workaround for non-C99 compliant systems. char *buf=new char[size]; snprintf(buf,size,f,x); string s=string(buf); delete[] buf; {Stack->push(s); return;} } #line 3500 "runtime.in" // string format(string *format, real x, string locale=emptystring); void gen282(stack *Stack) { string locale=vm::pop(Stack,emptystring); real x=vm::pop(Stack); string * format=vm::pop(Stack); #line 3501 "runtime.in" ostringstream out; checkformat(format->c_str(),false); const char *phantom="\\phantom{+}"; const char *p0=format->c_str(); const char *p=p0; const char *start=NULL; while (*p != 0) { if(*p == '%') { p++; if(*p != '%') {start=p-1; break;} } out << *(p++); } if(!start) {Stack->push(out.str()); return;} // Allow at most 1 argument while (*p != 0) { if(*p == '*' || *p == '$') {Stack->push(out.str()); return;} if(isupper(*p) || islower(*p)) {p++; break;} p++; } const char *tail=p; string f=format->substr(start-p0,tail-start); const char *oldlocale=NULL; if(!locale.empty()) { oldlocale=setlocale(LC_ALL,NULL); if(oldlocale) oldlocale=StrdupNoGC(oldlocale); setlocale(LC_ALL,locale.c_str()); } Int size=snprintf(NULL,0,f.c_str(),x)+1; if(size < 1) size=255; // Workaround for non-C99 compliant systems. char *buf=new char[size]; snprintf(buf,size,f.c_str(),x); if(oldlocale) { setlocale(LC_ALL,oldlocale); delete[] oldlocale; } bool trailingzero=f.find("#") < string::npos; bool plus=f.find("+") < string::npos; bool space=f.find(" ") < string::npos; char *q=buf; // beginning of formatted number if(*q == ' ') { out << phantom; q++; } const char decimal=*(localeconv()->decimal_point); // Remove any spurious sign if(*q == '-' || *q == '+') { p=q+1; bool zero=true; while(*p != 0) { if(!isdigit(*p) && *p != decimal) break; if(isdigit(*p) && *p != '0') {zero=false; break;} p++; } if(zero) { q++; if(plus || space) out << phantom; } } const char *r=p=q; bool dp=false; while(*r != 0 && (isdigit(*r) || *r == decimal || *r == '+' || *r == '-')) { if(*r == decimal) dp=true; r++; } if(dp) { // Remove trailing zeros and/or decimal point r--; unsigned n=0; while(r > q && *r == '0') {r--; n++;} if(*r == decimal) {r--; n++;} while(q <= r) out << *(q++); if(!trailingzero) q += n; } bool zero=(r == p && *r == '0') && !trailingzero; // Translate "E+/E-/e+/e-" exponential notation to TeX while(*q != 0) { if((*q == 'E' || *q == 'e') && (*(q+1) == '+' || *(q+1) == '-')) { if(!zero) out << "\\!\\times\\!10^{"; bool plus=(*(q+1) == '+'); q++; if(plus) q++; if(*q == '-') out << *(q++); while(*q == '0' && (zero || isdigit(*(q+1)))) q++; while(isdigit(*q)) out << *(q++); if(!zero) out << "}"; break; } out << *(q++); } while(*tail != 0) out << *(tail++); delete[] buf; {Stack->push(out.str()); return;} } #line 3618 "runtime.in" // Int hex(string s); void gen283(stack *Stack) { string s=vm::pop(Stack); #line 3619 "runtime.in" istringstream is(s); is.setf(std::ios::hex,std::ios::basefield); Int value; if(is && is >> value && ((is >> std::ws).eof())) {Stack->push(value); return;} ostringstream buf; buf << "invalid hexidecimal cast from string \"" << s << "\""; error(buf); } #line 3629 "runtime.in" // string string(Int x); void gen284(stack *Stack) { Int x=vm::pop(Stack); #line 3630 "runtime.in" ostringstream buf; buf << x; {Stack->push(buf.str()); return;} } #line 3636 "runtime.in" // string string(real x, Int digits=DBL_DIG); void gen285(stack *Stack) { Int digits=vm::pop(Stack,DBL_DIG); real x=vm::pop(Stack); #line 3637 "runtime.in" ostringstream buf; buf.precision(digits); buf << x; {Stack->push(buf.str()); return;} } #line 3644 "runtime.in" // string time(string format=defaulttimeformat); void gen286(stack *Stack) { string format=vm::pop(Stack,defaulttimeformat); #line 3645 "runtime.in" #ifdef HAVE_STRFTIME const time_t bintime=time(NULL); if(!strftime(Time,nTime,format.c_str(),localtime(&bintime))) {Stack->push(""); return;} {Stack->push(Time); return;} #else {Stack->push(format); return;} #endif } #line 3655 "runtime.in" // string time(Int seconds, string format=defaulttimeformat); void gen287(stack *Stack) { string format=vm::pop(Stack,defaulttimeformat); Int seconds=vm::pop(Stack); #line 3656 "runtime.in" #ifdef HAVE_STRFTIME const time_t bintime=seconds; if(!strftime(Time,nTime,format.c_str(),localtime(&bintime))) {Stack->push(""); return;} {Stack->push(Time); return;} #else // Avoid unused variable warning messages unused(&seconds); {Stack->push(format); return;} #endif } #line 3668 "runtime.in" // Int seconds(string t=emptystring, string format=emptystring); void gen288(stack *Stack) { string format=vm::pop(Stack,emptystring); string t=vm::pop(Stack,emptystring); #line 3669 "runtime.in" #if defined(HAVE_STRPTIME) const time_t bintime=time(NULL); tm tm=*localtime(&bintime); if(t != "" && !strptime(t.c_str(),format.c_str(),&tm)) {Stack->push(-1); return;} {Stack->push((Int) mktime(&tm)); return;} #else {Stack->push(-1); return;} #endif } #line 3680 "runtime.in" // realarray* _cputime(); void gen289(stack *Stack) { #line 3681 "runtime.in" static const real ticktime=1.0/sysconf(_SC_CLK_TCK); struct tms buf; ::times(&buf); array *t=new array(4); (*t)[0] = ((real) buf.tms_utime)*ticktime; (*t)[1] = ((real) buf.tms_stime)*ticktime; (*t)[2] = ((real) buf.tms_cutime)*ticktime; (*t)[3] = ((real) buf.tms_cstime)*ticktime; {Stack->push(t); return;} } // Math #line 3696 "runtime.in" // real ^(real x, Int y); void gen290(stack *Stack) { Int y=vm::pop(Stack); real x=vm::pop(Stack); #line 3697 "runtime.in" {Stack->push(pow(x,y)); return;} } #line 3702 "runtime.in" // pair ^(pair z, Int y); void gen291(stack *Stack) { Int y=vm::pop(Stack); pair z=vm::pop(Stack); #line 3703 "runtime.in" {Stack->push(pow(z,y)); return;} } #line 3707 "runtime.in" // Int quotient(Int x, Int y); void gen292(stack *Stack) { Int y=vm::pop(Stack); Int x=vm::pop(Stack); #line 3708 "runtime.in" if(y == 0) dividebyzero(); if(y == -1) {Stack->push(Negate(x)); return;} // Implementation-independent definition of integer division: round down {Stack->push((x-portableMod(x,y))/y); return;} } #line 3715 "runtime.in" // Int abs(Int x); void gen293(stack *Stack) { Int x=vm::pop(Stack); #line 3716 "runtime.in" {Stack->push(Abs(x)); return;} } #line 3720 "runtime.in" // Int sgn(real x); void gen294(stack *Stack) { real x=vm::pop(Stack); #line 3721 "runtime.in" {Stack->push(sgn(x)); return;} } #line 3725 "runtime.in" // Int rand(); void gen295(stack *Stack) { #line 3726 "runtime.in" {Stack->push(rand()); return;} } #line 3730 "runtime.in" // void srand(Int seed); void gen296(stack *Stack) { Int seed=vm::pop(Stack); #line 3731 "runtime.in" srand(intcast(seed)); } // a random number uniformly distributed in the interval [0,1] #line 3736 "runtime.in" // real unitrand(); void gen297(stack *Stack) { #line 3737 "runtime.in" {Stack->push(((real) rand())/RAND_MAX); return;} } #line 3741 "runtime.in" // Int ceil(real x); void gen298(stack *Stack) { real x=vm::pop(Stack); #line 3742 "runtime.in" {Stack->push(Intcast(ceil(x))); return;} } #line 3746 "runtime.in" // Int floor(real x); void gen299(stack *Stack) { real x=vm::pop(Stack); #line 3747 "runtime.in" {Stack->push(Intcast(floor(x))); return;} } #line 3751 "runtime.in" // Int round(real x); void gen300(stack *Stack) { real x=vm::pop(Stack); #line 3752 "runtime.in" if(validInt(x)) {Stack->push(Round(x)); return;} integeroverflow(0); } #line 3757 "runtime.in" // Int Ceil(real x); void gen301(stack *Stack) { real x=vm::pop(Stack); #line 3758 "runtime.in" {Stack->push(Ceil(x)); return;} } #line 3762 "runtime.in" // Int Floor(real x); void gen302(stack *Stack) { real x=vm::pop(Stack); #line 3763 "runtime.in" {Stack->push(Floor(x)); return;} } #line 3767 "runtime.in" // Int Round(real x); void gen303(stack *Stack) { real x=vm::pop(Stack); #line 3768 "runtime.in" {Stack->push(Round(Intcap(x))); return;} } #line 3772 "runtime.in" // real fmod(real x, real y); void gen304(stack *Stack) { real y=vm::pop(Stack); real x=vm::pop(Stack); #line 3773 "runtime.in" if (y == 0.0) dividebyzero(); {Stack->push(fmod(x,y)); return;} } #line 3778 "runtime.in" // real atan2(real y, real x); void gen305(stack *Stack) { real x=vm::pop(Stack); real y=vm::pop(Stack); #line 3779 "runtime.in" {Stack->push(atan2(y,x)); return;} } #line 3783 "runtime.in" // real hypot(real x, real y); void gen306(stack *Stack) { real y=vm::pop(Stack); real x=vm::pop(Stack); #line 3784 "runtime.in" {Stack->push(hypot(x,y)); return;} } #line 3788 "runtime.in" // real remainder(real x, real y); void gen307(stack *Stack) { real y=vm::pop(Stack); real x=vm::pop(Stack); #line 3789 "runtime.in" {Stack->push(remainder(x,y)); return;} } #line 3793 "runtime.in" // real J(Int n, real x); void gen308(stack *Stack) { real x=vm::pop(Stack); Int n=vm::pop(Stack); #line 3794 "runtime.in" {Stack->push(jn(n,x)); return;} } #line 3798 "runtime.in" // real Y(Int n, real x); void gen309(stack *Stack) { real x=vm::pop(Stack); Int n=vm::pop(Stack); #line 3799 "runtime.in" {Stack->push(yn(n,x)); return;} } #line 3803 "runtime.in" // real erf(real x); void gen310(stack *Stack) { real x=vm::pop(Stack); #line 3804 "runtime.in" {Stack->push(erf(x)); return;} } #line 3808 "runtime.in" // real erfc(real x); void gen311(stack *Stack) { real x=vm::pop(Stack); #line 3809 "runtime.in" {Stack->push(erfc(x)); return;} } #line 3813 "runtime.in" // Int factorial(Int n); void gen312(stack *Stack) { Int n=vm::pop(Stack); #line 3814 "runtime.in" if(n < 0) error(invalidargument); {Stack->push(factorial(n)); return;} } #line 3818 "runtime.in" // Int choose(Int n, Int k); void gen313(stack *Stack) { Int k=vm::pop(Stack); Int n=vm::pop(Stack); #line 3819 "runtime.in" if(n < 0 || k < 0 || k > n) error(invalidargument); Int f=1; Int r=n-k; for(Int i=n; i > r; --i) { if(f > Int_MAX/i) integeroverflow(0); f=(f*i)/(n-i+1); } {Stack->push(f); return;} } #line 3829 "runtime.in" // real gamma(real x); void gen314(stack *Stack) { real x=vm::pop(Stack); #line 3830 "runtime.in" #ifdef HAVE_TGAMMA {Stack->push(tgamma(x)); return;} #else real lg = lgamma(x); {Stack->push(signgam*exp(lg)); return;} #endif } // Complex Gamma function #line 3840 "runtime.in" // pair gamma(explicit pair z); void gen315(stack *Stack) { pair z=vm::pop(Stack); #line 3841 "runtime.in" {Stack->push(gamma(z)); return;} } #line 3845 "runtime.in" // realarray* quadraticroots(real a, real b, real c); void gen316(stack *Stack) { real c=vm::pop(Stack); real b=vm::pop(Stack); real a=vm::pop(Stack); #line 3846 "runtime.in" quadraticroots q(a,b,c); array *roots=new array(q.roots); if(q.roots >= 1) (*roots)[0]=q.t1; if(q.roots == 2) (*roots)[1]=q.t2; {Stack->push(roots); return;} } #line 3854 "runtime.in" // pairarray* quadraticroots(explicit pair a, explicit pair b, explicit pair c); void gen317(stack *Stack) { pair c=vm::pop(Stack); pair b=vm::pop(Stack); pair a=vm::pop(Stack); #line 3855 "runtime.in" Quadraticroots q(a,b,c); array *roots=new array(q.roots); if(q.roots >= 1) (*roots)[0]=q.z1; if(q.roots == 2) (*roots)[1]=q.z2; {Stack->push(roots); return;} } #line 3863 "runtime.in" // realarray* cubicroots(real a, real b, real c, real d); void gen318(stack *Stack) { real d=vm::pop(Stack); real c=vm::pop(Stack); real b=vm::pop(Stack); real a=vm::pop(Stack); #line 3864 "runtime.in" cubicroots q(a,b,c,d); array *roots=new array(q.roots); if(q.roots >= 1) (*roots)[0]=q.t1; if(q.roots >= 2) (*roots)[1]=q.t2; if(q.roots == 3) (*roots)[2]=q.t3; {Stack->push(roots); return;} } // Transforms #line 3875 "runtime.in" // bool ==(transform a, transform b); void gen319(stack *Stack) { transform b=vm::pop(Stack); transform a=vm::pop(Stack); #line 3876 "runtime.in" {Stack->push(a == b); return;} } #line 3881 "runtime.in" // bool !=(transform a, transform b); void gen320(stack *Stack) { transform b=vm::pop(Stack); transform a=vm::pop(Stack); #line 3882 "runtime.in" {Stack->push(a != b); return;} } #line 3886 "runtime.in" // transform +(transform a, transform b); void gen321(stack *Stack) { transform b=vm::pop(Stack); transform a=vm::pop(Stack); #line 3887 "runtime.in" {Stack->push(a+b); return;} } #line 3891 "runtime.in" // transform *(transform a, transform b); void gen322(stack *Stack) { transform b=vm::pop(Stack); transform a=vm::pop(Stack); #line 3892 "runtime.in" {Stack->push(a*b); return;} } #line 3896 "runtime.in" // pair *(transform t, pair z); void gen323(stack *Stack) { pair z=vm::pop(Stack); transform t=vm::pop(Stack); #line 3897 "runtime.in" {Stack->push(t*z); return;} } #line 3901 "runtime.in" // path *(transform t, path g); void gen324(stack *Stack) { path g=vm::pop(Stack); transform t=vm::pop(Stack); #line 3902 "runtime.in" {Stack->push(transformed(t,g)); return;} } #line 3906 "runtime.in" // pen *(transform t, pen p); void gen325(stack *Stack) { pen p=vm::pop(Stack); transform t=vm::pop(Stack); #line 3907 "runtime.in" {Stack->push(transformed(t,p)); return;} } #line 3911 "runtime.in" // picture* *(transform t, picture *f); void gen326(stack *Stack) { picture * f=vm::pop(Stack); transform t=vm::pop(Stack); #line 3912 "runtime.in" {Stack->push(transformed(t,f)); return;} } #line 3916 "runtime.in" // picture* *(realarray2 *t, picture *f); void gen327(stack *Stack) { picture * f=vm::pop(Stack); realarray2 * t=vm::pop(Stack); #line 3917 "runtime.in" {Stack->push(transformed(*t,f)); return;} } #line 3921 "runtime.in" // transform ^(transform t, Int n); void gen328(stack *Stack) { Int n=vm::pop(Stack); transform t=vm::pop(Stack); #line 3922 "runtime.in" transform T; if(n < 0) { n=-n; t=inverse(t); } for(Int i=0; i < n; i++) T=T*t; {Stack->push(T); return;} } #line 3932 "runtime.in" void transformXPart(stack *Stack) { transform t=vm::pop(Stack); #line 3933 "runtime.in" {Stack->push(t.getx()); return;} } #line 3937 "runtime.in" void transformYPart(stack *Stack) { transform t=vm::pop(Stack); #line 3938 "runtime.in" {Stack->push(t.gety()); return;} } #line 3942 "runtime.in" void transformXXPart(stack *Stack) { transform t=vm::pop(Stack); #line 3943 "runtime.in" {Stack->push(t.getxx()); return;} } #line 3947 "runtime.in" void transformXYPart(stack *Stack) { transform t=vm::pop(Stack); #line 3948 "runtime.in" {Stack->push(t.getxy()); return;} } #line 3952 "runtime.in" void transformYXPart(stack *Stack) { transform t=vm::pop(Stack); #line 3953 "runtime.in" {Stack->push(t.getyx()); return;} } #line 3957 "runtime.in" void transformYYPart(stack *Stack) { transform t=vm::pop(Stack); #line 3958 "runtime.in" {Stack->push(t.getyy()); return;} } #line 3962 "runtime.in" void real6ToTransform(stack *Stack) { real yy=vm::pop(Stack); real yx=vm::pop(Stack); real xy=vm::pop(Stack); real xx=vm::pop(Stack); real y=vm::pop(Stack); real x=vm::pop(Stack); #line 3964 "runtime.in" {Stack->push(transform(x,y,xx,xy,yx,yy)); return;} } #line 3968 "runtime.in" // transform shift(transform t); void gen336(stack *Stack) { transform t=vm::pop(Stack); #line 3969 "runtime.in" {Stack->push(transform(t.getx(),t.gety(),0,0,0,0)); return;} } #line 3973 "runtime.in" // transform shiftless(transform t); void gen337(stack *Stack) { transform t=vm::pop(Stack); #line 3974 "runtime.in" {Stack->push(transform(0,0,t.getxx(),t.getxy(),t.getyx(),t.getyy())); return;} } #line 3978 "runtime.in" // transform identity(); void transformIdentity(stack *Stack) { #line 3979 "runtime.in" {Stack->push(identity); return;} } #line 3983 "runtime.in" // transform inverse(transform t); void gen339(stack *Stack) { transform t=vm::pop(Stack); #line 3984 "runtime.in" {Stack->push(inverse(t)); return;} } #line 3988 "runtime.in" // transform shift(pair z); void gen340(stack *Stack) { pair z=vm::pop(Stack); #line 3989 "runtime.in" {Stack->push(shift(z)); return;} } #line 3993 "runtime.in" // transform shift(real x, real y); void gen341(stack *Stack) { real y=vm::pop(Stack); real x=vm::pop(Stack); #line 3994 "runtime.in" {Stack->push(shift(pair(x,y))); return;} } #line 3998 "runtime.in" // transform xscale(real x); void gen342(stack *Stack) { real x=vm::pop(Stack); #line 3999 "runtime.in" {Stack->push(xscale(x)); return;} } #line 4003 "runtime.in" // transform yscale(real y); void gen343(stack *Stack) { real y=vm::pop(Stack); #line 4004 "runtime.in" {Stack->push(yscale(y)); return;} } #line 4008 "runtime.in" // transform scale(real x); void gen344(stack *Stack) { real x=vm::pop(Stack); #line 4009 "runtime.in" {Stack->push(scale(x)); return;} } #line 4013 "runtime.in" // transform scale(real x, real y); void gen345(stack *Stack) { real y=vm::pop(Stack); real x=vm::pop(Stack); #line 4014 "runtime.in" {Stack->push(xscale(x)*yscale(y)); return;} } #line 4018 "runtime.in" // transform slant(real s); void gen346(stack *Stack) { real s=vm::pop(Stack); #line 4019 "runtime.in" {Stack->push(slant(s)); return;} } #line 4023 "runtime.in" // transform rotate(real angle, pair z=0); void gen347(stack *Stack) { pair z=vm::pop(Stack,0); real angle=vm::pop(Stack); #line 4024 "runtime.in" {Stack->push(rotatearound(z,radians(angle))); return;} } #line 4028 "runtime.in" // transform reflect(pair a, pair b); void gen348(stack *Stack) { pair b=vm::pop(Stack); pair a=vm::pop(Stack); #line 4029 "runtime.in" {Stack->push(reflectabout(a,b)); return;} } // Pair operations #line 4035 "runtime.in" void pairZero(stack *Stack) { #line 4036 "runtime.in" {Stack->push(zero); return;} } #line 4041 "runtime.in" void realRealToPair(stack *Stack) { real y=vm::pop(Stack); real x=vm::pop(Stack); #line 4042 "runtime.in" {Stack->push(pair(x,y)); return;} } #line 4046 "runtime.in" void pairNegate(stack *Stack) { pair z=vm::pop(Stack); #line 4047 "runtime.in" {Stack->push(-z); return;} } #line 4051 "runtime.in" // real xpart(pair z); void pairXPart(stack *Stack) { pair z=vm::pop(Stack); #line 4052 "runtime.in" {Stack->push(z.getx()); return;} } #line 4056 "runtime.in" // real ypart(pair z); void pairYPart(stack *Stack) { pair z=vm::pop(Stack); #line 4057 "runtime.in" {Stack->push(z.gety()); return;} } #line 4061 "runtime.in" // real length(pair z); void gen354(stack *Stack) { pair z=vm::pop(Stack); #line 4062 "runtime.in" {Stack->push(z.length()); return;} } #line 4066 "runtime.in" // real abs(pair z); void gen355(stack *Stack) { pair z=vm::pop(Stack); #line 4067 "runtime.in" {Stack->push(z.length()); return;} } #line 4071 "runtime.in" // pair sqrt(explicit pair z); void gen356(stack *Stack) { pair z=vm::pop(Stack); #line 4072 "runtime.in" {Stack->push(Sqrt(z)); return;} } // Return the angle of z in radians. #line 4077 "runtime.in" // real angle(pair z, bool warn=true); void gen357(stack *Stack) { bool warn=vm::pop(Stack,true); pair z=vm::pop(Stack); #line 4078 "runtime.in" if(!warn && z.getx() == 0.0 && z.gety() == 0.0) {Stack->push(0.0); return;} {Stack->push(z.angle()); return;} } // Return the angle of z in degrees in the interval [0,360). #line 4084 "runtime.in" // real degrees(pair z, bool warn=true); void gen358(stack *Stack) { bool warn=vm::pop(Stack,true); pair z=vm::pop(Stack); #line 4085 "runtime.in" if(!warn && z.getx() == 0.0 && z.gety() == 0.0) {Stack->push(0.0); return;} {Stack->push(principalBranch(degrees(z.angle()))); return;} } // Convert degrees to radians. #line 4091 "runtime.in" // real radians(real degrees); void gen359(stack *Stack) { real degrees=vm::pop(Stack); #line 4092 "runtime.in" {Stack->push(radians(degrees)); return;} } // Convert radians to degrees. #line 4097 "runtime.in" // real degrees(real radians); void gen360(stack *Stack) { real radians=vm::pop(Stack); #line 4098 "runtime.in" {Stack->push(degrees(radians)); return;} } // Convert radians to degrees in [0,360). #line 4103 "runtime.in" // real Degrees(real radians); void gen361(stack *Stack) { real radians=vm::pop(Stack); #line 4104 "runtime.in" {Stack->push(principalBranch(degrees(radians))); return;} } #line 4108 "runtime.in" // real Sin(real deg); void gen362(stack *Stack) { real deg=vm::pop(Stack); #line 4109 "runtime.in" {Stack->push(sin(radians(deg))); return;} } #line 4113 "runtime.in" // real Cos(real deg); void gen363(stack *Stack) { real deg=vm::pop(Stack); #line 4114 "runtime.in" {Stack->push(cos(radians(deg))); return;} } #line 4118 "runtime.in" // real Tan(real deg); void gen364(stack *Stack) { real deg=vm::pop(Stack); #line 4119 "runtime.in" {Stack->push(tan(radians(deg))); return;} } #line 4123 "runtime.in" // real aSin(real x); void gen365(stack *Stack) { real x=vm::pop(Stack); #line 4124 "runtime.in" {Stack->push(degrees(asin(x))); return;} } #line 4128 "runtime.in" // real aCos(real x); void gen366(stack *Stack) { real x=vm::pop(Stack); #line 4129 "runtime.in" {Stack->push(degrees(acos(x))); return;} } #line 4133 "runtime.in" // real aTan(real x); void gen367(stack *Stack) { real x=vm::pop(Stack); #line 4134 "runtime.in" {Stack->push(degrees(atan(x))); return;} } #line 4138 "runtime.in" // pair unit(pair z); void gen368(stack *Stack) { pair z=vm::pop(Stack); #line 4139 "runtime.in" {Stack->push(unit(z)); return;} } #line 4143 "runtime.in" // pair dir(real degrees); void gen369(stack *Stack) { real degrees=vm::pop(Stack); #line 4144 "runtime.in" {Stack->push(expi(radians(degrees))); return;} } #line 4148 "runtime.in" // pair dir(explicit pair z); void gen370(stack *Stack) { pair z=vm::pop(Stack); #line 4149 "runtime.in" {Stack->push(unit(z)); return;} } #line 4153 "runtime.in" // pair expi(real angle); void gen371(stack *Stack) { real angle=vm::pop(Stack); #line 4154 "runtime.in" {Stack->push(expi(angle)); return;} } #line 4158 "runtime.in" // pair exp(explicit pair z); void gen372(stack *Stack) { pair z=vm::pop(Stack); #line 4159 "runtime.in" {Stack->push(exp(z)); return;} } #line 4163 "runtime.in" // pair log(explicit pair z); void gen373(stack *Stack) { pair z=vm::pop(Stack); #line 4164 "runtime.in" {Stack->push(pair(log(z.length()),z.angle())); return;} } #line 4168 "runtime.in" // pair sin(explicit pair z); void gen374(stack *Stack) { pair z=vm::pop(Stack); #line 4169 "runtime.in" {Stack->push(sin(z)); return;} } #line 4173 "runtime.in" // pair cos(explicit pair z); void gen375(stack *Stack) { pair z=vm::pop(Stack); #line 4174 "runtime.in" {Stack->push(pair(cos(z.getx())*cosh(z.gety()),-sin(z.getx())*sinh(z.gety()))); return;} } #line 4178 "runtime.in" // pair conj(pair z); void gen376(stack *Stack) { pair z=vm::pop(Stack); #line 4179 "runtime.in" {Stack->push(conj(z)); return;} } #line 4183 "runtime.in" // pair realmult(pair z, pair w); void gen377(stack *Stack) { pair w=vm::pop(Stack); pair z=vm::pop(Stack); #line 4184 "runtime.in" {Stack->push(pair (z.getx()*w.getx(),z.gety()*w.gety())); return;} } #line 4188 "runtime.in" // triple realmult(triple u, triple v); void gen378(stack *Stack) { triple v=vm::pop(Stack); triple u=vm::pop(Stack); #line 4189 "runtime.in" {Stack->push(triple (u.getx()*v.getx(),u.gety()*v.gety(),u.getz()*v.getz())); return;} } // To avoid confusion, a dot product requires explicit pair arguments. #line 4194 "runtime.in" // real dot(explicit pair z, explicit pair w); void gen379(stack *Stack) { pair w=vm::pop(Stack); pair z=vm::pop(Stack); #line 4195 "runtime.in" {Stack->push(dot(z,w)); return;} } // Triple operations #line 4201 "runtime.in" void tripleZero(stack *Stack) { #line 4202 "runtime.in" static triple zero; {Stack->push(zero); return;} } #line 4208 "runtime.in" void realRealRealToTriple(stack *Stack) { real z=vm::pop(Stack); real y=vm::pop(Stack); real x=vm::pop(Stack); #line 4209 "runtime.in" {Stack->push(triple(x,y,z)); return;} } #line 4213 "runtime.in" // real xpart(triple v); void tripleXPart(stack *Stack) { triple v=vm::pop(Stack); #line 4214 "runtime.in" {Stack->push(v.getx()); return;} } #line 4218 "runtime.in" // real ypart(triple v); void tripleYPart(stack *Stack) { triple v=vm::pop(Stack); #line 4219 "runtime.in" {Stack->push(v.gety()); return;} } #line 4223 "runtime.in" // real zpart(triple v); void tripleZPart(stack *Stack) { triple v=vm::pop(Stack); #line 4224 "runtime.in" {Stack->push(v.getz()); return;} } #line 4228 "runtime.in" // triple *(real x, triple v); void gen385(stack *Stack) { triple v=vm::pop(Stack); real x=vm::pop(Stack); #line 4229 "runtime.in" {Stack->push(x*v); return;} } #line 4233 "runtime.in" // triple *(triple v, real x); void gen386(stack *Stack) { real x=vm::pop(Stack); triple v=vm::pop(Stack); #line 4234 "runtime.in" {Stack->push(v*x); return;} } #line 4238 "runtime.in" // triple /(triple v, real x); void gen387(stack *Stack) { real x=vm::pop(Stack); triple v=vm::pop(Stack); #line 4239 "runtime.in" {Stack->push(v/x); return;} } #line 4243 "runtime.in" // real length(triple v); void gen388(stack *Stack) { triple v=vm::pop(Stack); #line 4244 "runtime.in" {Stack->push(v.length()); return;} } #line 4248 "runtime.in" // real abs(triple v); void gen389(stack *Stack) { triple v=vm::pop(Stack); #line 4249 "runtime.in" {Stack->push(v.length()); return;} } #line 4253 "runtime.in" // real polar(triple v, bool warn=true); void gen390(stack *Stack) { bool warn=vm::pop(Stack,true); triple v=vm::pop(Stack); #line 4254 "runtime.in" if(!warn && v.getx() == 0.0 && v.gety() == 0.0 && v.getz() == 0.0) {Stack->push(0.0); return;} {Stack->push(v.polar()); return;} } #line 4259 "runtime.in" // real azimuth(triple v, bool warn=true); void gen391(stack *Stack) { bool warn=vm::pop(Stack,true); triple v=vm::pop(Stack); #line 4260 "runtime.in" if(!warn && v.getx() == 0.0 && v.gety() == 0.0) {Stack->push(0.0); return;} {Stack->push(v.azimuth()); return;} } #line 4265 "runtime.in" // real colatitude(triple v, bool warn=true); void gen392(stack *Stack) { bool warn=vm::pop(Stack,true); triple v=vm::pop(Stack); #line 4266 "runtime.in" if(!warn && v.getx() == 0.0 && v.gety() == 0.0 && v.getz() == 0.0) {Stack->push(0.0); return;} {Stack->push(degrees(v.polar())); return;} } #line 4271 "runtime.in" // real latitude(triple v, bool warn=true); void gen393(stack *Stack) { bool warn=vm::pop(Stack,true); triple v=vm::pop(Stack); #line 4272 "runtime.in" if(!warn && v.getx() == 0.0 && v.gety() == 0.0 && v.getz() == 0.0) {Stack->push(0.0); return;} {Stack->push(90.0-degrees(v.polar())); return;} } // Return the longitude of v in [0,360). #line 4278 "runtime.in" // real longitude(triple v, bool warn=true); void gen394(stack *Stack) { bool warn=vm::pop(Stack,true); triple v=vm::pop(Stack); #line 4279 "runtime.in" if(!warn && v.getx() == 0.0 && v.gety() == 0.0) {Stack->push(0.0); return;} {Stack->push(principalBranch(degrees(v.azimuth()))); return;} } #line 4284 "runtime.in" // triple unit(triple v); void gen395(stack *Stack) { triple v=vm::pop(Stack); #line 4285 "runtime.in" {Stack->push(unit(v)); return;} } #line 4289 "runtime.in" // real dot(triple u, triple v); void gen396(stack *Stack) { triple v=vm::pop(Stack); triple u=vm::pop(Stack); #line 4290 "runtime.in" {Stack->push(dot(u,v)); return;} } #line 4294 "runtime.in" // triple cross(triple u, triple v); void gen397(stack *Stack) { triple v=vm::pop(Stack); triple u=vm::pop(Stack); #line 4295 "runtime.in" {Stack->push(cross(u,v)); return;} } #line 4299 "runtime.in" // triple expi(real polar, real azimuth); void gen398(stack *Stack) { real azimuth=vm::pop(Stack); real polar=vm::pop(Stack); #line 4300 "runtime.in" {Stack->push(expi(polar,azimuth)); return;} } #line 4304 "runtime.in" // triple dir(real colatitude, real longitude); void gen399(stack *Stack) { real longitude=vm::pop(Stack); real colatitude=vm::pop(Stack); #line 4305 "runtime.in" {Stack->push(expi(radians(colatitude),radians(longitude))); return;} } // System routines #line 4311 "runtime.in" // void atupdate(callable *f); void gen400(stack *Stack) { callable * f=vm::pop(Stack); #line 4312 "runtime.in" processData().atUpdateFunction=f; } #line 4317 "runtime.in" // callable* atupdate(); void gen401(stack *Stack) { #line 4318 "runtime.in" {Stack->push(processData().atUpdateFunction); return;} } #line 4322 "runtime.in" // void atexit(callable *f); void gen402(stack *Stack) { callable * f=vm::pop(Stack); #line 4323 "runtime.in" processData().atExitFunction=f; } #line 4327 "runtime.in" // callable* atexit(); void gen403(stack *Stack) { #line 4328 "runtime.in" {Stack->push(processData().atExitFunction); return;} } #line 4332 "runtime.in" // void atbreakpoint(callableBp *f); void gen404(stack *Stack) { callableBp * f=vm::pop(Stack); #line 4333 "runtime.in" processData().atBreakpointFunction=f; } #line 4337 "runtime.in" // void breakpoint(runnable *s=NULL); void gen405(stack *Stack) { runnable * s=vm::pop(Stack,NULL); #line 4338 "runtime.in" breakpoint(Stack,s); } #line 4342 "runtime.in" // string locatefile(string file); void gen406(stack *Stack) { string file=vm::pop(Stack); #line 4343 "runtime.in" {Stack->push(locateFile(file)); return;} } #line 4347 "runtime.in" // void stop(string file, Int line, runnable *s=NULL); void gen407(stack *Stack) { runnable * s=vm::pop(Stack,NULL); Int line=vm::pop(Stack); string file=vm::pop(Stack); #line 4348 "runtime.in" file=locateFile(file); clear(file,line); cout << "setting breakpoint at " << file << ": " << line << endl; bplist.push_back(bpinfo(file,line,s)); } #line 4355 "runtime.in" // void breakpoints(); void gen408(stack *) { #line 4356 "runtime.in" for(mem::list::iterator p=bplist.begin(); p != bplist.end(); ++p) cout << p->f.name() << ": " << p->f.line() << endl; } #line 4361 "runtime.in" // void clear(string file, Int line); void gen409(stack *Stack) { Int line=vm::pop(Stack); string file=vm::pop(Stack); #line 4362 "runtime.in" file=locateFile(file); clear(file,line,true); } #line 4367 "runtime.in" // void clear(); void gen410(stack *) { #line 4368 "runtime.in" bplist.clear(); } // Strip directory from string #line 4373 "runtime.in" // string stripdirectory(string *s); void gen411(stack *Stack) { string * s=vm::pop(Stack); #line 4374 "runtime.in" {Stack->push(stripDir(*s)); return;} } // Strip directory from string #line 4379 "runtime.in" // string stripfile(string *s); void gen412(stack *Stack) { string * s=vm::pop(Stack); #line 4380 "runtime.in" {Stack->push(stripFile(*s)); return;} } // Strip file extension from string #line 4385 "runtime.in" // string stripextension(string *s); void gen413(stack *Stack) { string * s=vm::pop(Stack); #line 4386 "runtime.in" {Stack->push(stripExt(*s)); return;} } // Call ImageMagick convert. #line 4391 "runtime.in" // Int convert(string args=emptystring, string file=emptystring, string format=emptystring); void gen414(stack *Stack) { string format=vm::pop(Stack,emptystring); string file=vm::pop(Stack,emptystring); string args=vm::pop(Stack,emptystring); #line 4393 "runtime.in" ostringstream cmd; string name=convertname(file,format); cmd << "'" << getSetting("convert") << "' " << args << " '" << name << "'"; bool quiet=verbose <= 1; Int ret=System(cmd,quiet ? 1 : 0,true,"convert","your ImageMagick convert utility"); if(ret == 0 && verbose > 0) cout << "Wrote " << ((file.empty()) ? name : file) << endl; {Stack->push(ret); return;} } // Call ImageMagick animate. #line 4409 "runtime.in" // Int animate(string args=emptystring, string file=emptystring, string format=emptystring); void gen415(stack *Stack) { string format=vm::pop(Stack,emptystring); string file=vm::pop(Stack,emptystring); string args=vm::pop(Stack,emptystring); #line 4411 "runtime.in" #ifndef __CYGWIN__ string name=convertname(file,format,false); if(view()) { ostringstream cmd; cmd << "'" << getSetting("animate") << "' " << args << " '" << name << "'"; {Stack->push(System(cmd,0,false,"animate","your animated GIF viewer")); return;} } #endif {Stack->push(0); return;} } // Delete file named s. #line 4425 "runtime.in" // Int delete(string *s); void gen416(stack *Stack) { string * s=vm::pop(Stack); #line 4426 "runtime.in" checkLocal(*s); Int rc=unlink(s->c_str()); if(rc == 0 && verbose > 0) cout << "Deleted " << *s << endl; {Stack->push(rc); return;} } // Rename file "from" to file "to". #line 4435 "runtime.in" // Int rename(string *from, string *to); void gen417(stack *Stack) { string * to=vm::pop(Stack); string * from=vm::pop(Stack); #line 4436 "runtime.in" checkLocal(*from); checkLocal(*to); Int rc=rename(from->c_str(),to->c_str()); if(rc == 0 && verbose > 0) cout << "Renamed " << *from << " to " << *to << endl; {Stack->push(rc); return;} } // Array operations // Create an empty array. #line 4449 "runtime.in" void emptyArray(stack *Stack) { #line 4450 "runtime.in" {Stack->push(new array(0)); return;} } // Create a new array (technically a vector). // This array will be multidimensional. First the number of dimensions // is popped off the stack, followed by each dimension in reverse order. // The array itself is technically a one dimensional array of one // dimension arrays and so on. #line 4459 "runtime.in" void newDeepArray(stack *Stack) { Int depth=vm::pop(Stack); #line 4460 "runtime.in" assert(depth > 0); Int *dims = new Int[depth]; for (Int index = depth-1; index >= 0; index--) { Int i=pop(Stack); if(i < 0) error("cannot create a negative length array"); dims[index]=i; } array *a=deepArray(depth, dims); delete[] dims; {Stack->push(a); return;} } // Creates an array with elements already specified. First, the number // of elements is popped off the stack, followed by each element in // reverse order. #line 4479 "runtime.in" void newInitializedArray(stack *Stack) { Int n=vm::pop(Stack); #line 4480 "runtime.in" assert(n >= 0); array *a = new array(n); for (Int index = n-1; index >= 0; index--) (*a)[index] = pop(Stack); {Stack->push(a); return;} } // Similar to newInitializedArray, but after the n elements, append another // array to it. #line 4493 "runtime.in" void newAppendedArray(stack *Stack) { Int n=vm::pop(Stack); array* tail=vm::pop(Stack); #line 4494 "runtime.in" assert(n >= 0); array *a = new array(n); for (Int index = n-1; index >= 0; index--) (*a)[index] = pop(Stack); copy(tail->begin(), tail->end(), back_inserter(*a)); {Stack->push(a); return;} } // The function T[] array(int n, T value, int depth=0) produces a array of n // copies of x, where each copy is copied up to depth. #line 4509 "runtime.in" void newDuplicateArray(stack *Stack) { Int depth=vm::pop(Stack,Int_MAX); item value=vm::pop(Stack); Int n=vm::pop(Stack); #line 4510 "runtime.in" if(n < 0) error("cannot create a negative length array"); if(depth < 0) error("cannot copy to a negative depth"); {Stack->push(new array(n, value, depth)); return;} } // Read an element from an array. Checks for initialization & bounds. #line 4518 "runtime.in" void arrayRead(stack *Stack) { Int n=vm::pop(Stack); array * a=vm::pop(Stack); #line 4519 "runtime.in" item& i=arrayRead(a,n); if (i.empty()) { ostringstream buf; buf << "read uninitialized value from array at index " << n; error(buf); } {Stack->push(i); return;} } // Slice a substring from an array. #line 4530 "runtime.in" void arraySliceRead(stack *Stack) { Int right=vm::pop(Stack); Int left=vm::pop(Stack); array * a=vm::pop(Stack); #line 4531 "runtime.in" checkArray(a); {Stack->push(a->slice(left, right)); return;} } // Slice a substring from an array. This implements the cases a[i:] and a[:] // where the endpoint is not given, and assumed to be the length of the array. #line 4538 "runtime.in" void arraySliceReadToEnd(stack *Stack) { Int left=vm::pop(Stack); array * a=vm::pop(Stack); #line 4539 "runtime.in" size_t len=checkArray(a); {Stack->push(a->slice(left, (Int)len)); return;} } // Read an element from an array of arrays. Check bounds and initialize // as necessary. #line 4546 "runtime.in" void arrayArrayRead(stack *Stack) { Int n=vm::pop(Stack); array * a=vm::pop(Stack); #line 4547 "runtime.in" item& i=arrayRead(a,n); if (i.empty()) i=new array(0); {Stack->push(i); return;} } // Write an element to an array. Increase size if necessary. #line 4554 "runtime.in" void arrayWrite(stack *Stack) { Int n=vm::pop(Stack); array * a=vm::pop(Stack); item value=vm::pop(Stack); #line 4555 "runtime.in" size_t len=checkArray(a); bool cyclic=a->cyclic(); if(cyclic && len > 0) n=imod(n,len); else { if(cyclic) outOfBounds("writing cyclic",len,n); if(n < 0) outOfBounds("writing",len,n); if(len <= (size_t) n) a->resize(n+1); } (*a)[n] = value; {Stack->push(value); return;} } #line 4569 "runtime.in" void arraySliceWrite(stack *Stack) { Int right=vm::pop(Stack); Int left=vm::pop(Stack); array * dest=vm::pop(Stack); array * src=vm::pop(Stack); #line 4570 "runtime.in" checkArray(src); checkArray(dest); dest->setSlice(left, right, src); {Stack->push(src); return;} } #line 4577 "runtime.in" void arraySliceWriteToEnd(stack *Stack) { Int left=vm::pop(Stack); array * dest=vm::pop(Stack); array * src=vm::pop(Stack); #line 4578 "runtime.in" checkArray(src); size_t len=checkArray(dest); dest->setSlice(left, (Int) len, src); {Stack->push(src); return;} } // Returns the length of an array. #line 4586 "runtime.in" void arrayLength(stack *Stack) { array * a=vm::pop(Stack); #line 4587 "runtime.in" {Stack->push((Int) checkArray(a)); return;} } // Returns an array of integers representing the keys of the array. #line 4592 "runtime.in" void arrayKeys(stack *Stack) { array * a=vm::pop(Stack); #line 4593 "runtime.in" size_t size=checkArray(a); array *keys=new array(); for (size_t i=0; ipush((Int)i); } {Stack->push(keys); return;} } // Return the cyclic flag for an array. #line 4607 "runtime.in" void arrayCyclicFlag(stack *Stack) { array * a=vm::pop(Stack); #line 4608 "runtime.in" checkArray(a); {Stack->push(a->cyclic()); return;} } // Check to see if an array element is initialized. #line 4614 "runtime.in" void arrayInitializedHelper(stack *Stack) { array * a=vm::pop(Stack); Int n=vm::pop(Stack); #line 4615 "runtime.in" size_t len=checkArray(a); bool cyclic=a->cyclic(); if(cyclic && len > 0) n=imod(n,len); else if(n < 0 || n >= (Int) len) {Stack->push(false); return;} item&i=(*a)[(unsigned) n]; {Stack->push(!i.empty()); return;} } // Returns the initialize method for an array. #line 4625 "runtime.in" void arrayInitialized(stack *Stack) { array * a=vm::pop(Stack); #line 4626 "runtime.in" {Stack->push(new thunk(new bfunc(arrayInitializedHelper),a)); return;} } // The helper function for the cyclic method that sets the cyclic flag. #line 4631 "runtime.in" void arrayCyclicHelper(stack *Stack) { array * a=vm::pop(Stack); bool b=vm::pop(Stack); #line 4632 "runtime.in" checkArray(a); a->cyclic(b); } // Set the cyclic flag for an array. #line 4638 "runtime.in" void arrayCyclic(stack *Stack) { array * a=vm::pop(Stack); #line 4639 "runtime.in" {Stack->push(new thunk(new bfunc(arrayCyclicHelper),a)); return;} } // The helper function for the push method that does the actual operation. #line 4644 "runtime.in" void arrayPushHelper(stack *Stack) { array * a=vm::pop(Stack); item x=vm::pop(Stack); #line 4645 "runtime.in" checkArray(a); a->push(x); {Stack->push(x); return;} } // Returns the push method for an array. #line 4652 "runtime.in" void arrayPush(stack *Stack) { array * a=vm::pop(Stack); #line 4653 "runtime.in" {Stack->push(new thunk(new bfunc(arrayPushHelper),a)); return;} } // The helper function for the append method that appends b to a. #line 4658 "runtime.in" void arrayAppendHelper(stack *Stack) { array * a=vm::pop(Stack); array * b=vm::pop(Stack); #line 4659 "runtime.in" checkArray(a); size_t size=checkArray(b); for(size_t i=0; i < size; i++) a->push((*b)[i]); } // Returns the append method for an array. #line 4667 "runtime.in" void arrayAppend(stack *Stack) { array * a=vm::pop(Stack); #line 4668 "runtime.in" {Stack->push(new thunk(new bfunc(arrayAppendHelper),a)); return;} } // The helper function for the pop method. #line 4673 "runtime.in" void arrayPopHelper(stack *Stack) { array * a=vm::pop(Stack); #line 4674 "runtime.in" size_t asize=checkArray(a); if(asize == 0) error("cannot pop element from empty array"); {Stack->push(a->pop()); return;} } // Returns the pop method for an array. #line 4682 "runtime.in" void arrayPop(stack *Stack) { array * a=vm::pop(Stack); #line 4683 "runtime.in" {Stack->push(new thunk(new bfunc(arrayPopHelper),a)); return;} } // The helper function for the insert method. #line 4688 "runtime.in" void arrayInsertHelper(stack *Stack) { array * a=vm::pop(Stack); array * x=vm::pop(Stack); Int i=vm::pop(Stack); #line 4689 "runtime.in" size_t asize=checkArray(a); checkArray(x); if(a->cyclic() && asize > 0) i=imod(i,asize); if(i < 0 || i > (Int) asize) outOfBounds("inserting",asize,i); (*a).insert((*a).begin()+i,(*x).begin(),(*x).end()); } // Returns the insert method for an array. #line 4699 "runtime.in" void arrayInsert(stack *Stack) { array * a=vm::pop(Stack); #line 4700 "runtime.in" {Stack->push(new thunk(new bfunc(arrayInsertHelper),a)); return;} } // Returns the delete method for an array. #line 4705 "runtime.in" void arrayDelete(stack *Stack) { array * a=vm::pop(Stack); #line 4706 "runtime.in" {Stack->push(new thunk(new bfunc(arrayDeleteHelper),a)); return;} } #line 4710 "runtime.in" void arrayAlias(stack *Stack) { array * b=vm::pop(Stack); array * a=vm::pop(Stack); #line 4711 "runtime.in" {Stack->push(a==b); return;} } // Return array formed by indexing array a with elements of integer array b #line 4716 "runtime.in" void arrayIntArray(stack *Stack) { array * b=vm::pop(Stack); array * a=vm::pop(Stack); #line 4717 "runtime.in" size_t asize=checkArray(a); size_t bsize=checkArray(b); array *r=new array(bsize); bool cyclic=a->cyclic(); for(size_t i=0; i < bsize; i++) { Int index=read(b,i); if(cyclic && asize > 0) index=imod(index,asize); else if(index < 0 || index >= (Int) asize) outOfBounds("reading",asize,index); (*r)[i]=(*a)[index]; } {Stack->push(r); return;} } // returns the complement of the integer array a in {0,2,...,n-1}, // so that b[complement(a,b.length)] yields the complement of b[a]. #line 4735 "runtime.in" // Intarray* complement(Intarray *a, Int n); void gen448(stack *Stack) { Int n=vm::pop(Stack); Intarray * a=vm::pop(Stack); #line 4736 "runtime.in" size_t asize=checkArray(a); array *r=new array(0); bool *keep=new bool[n]; for(Int i=0; i < n; ++i) keep[i]=true; for(size_t i=0; i < asize; ++i) { Int j=read(a,i); if(j >= 0 && j < n) keep[j]=false; } for(Int i=0; i < n; i++) if(keep[i]) r->push(i); delete[] keep; {Stack->push(r); return;} } // Generate the sequence {f(i) : i=0,1,...n-1} given a function f and integer n #line 4753 "runtime.in" void arraySequence(stack *Stack) { Int n=vm::pop(Stack); callable * f=vm::pop(Stack); #line 4754 "runtime.in" if(n < 0) n=0; array *a=new array(n); for(Int i=0; i < n; ++i) { Stack->push(i); f->call(Stack); (*a)[i]=pop(Stack); } {Stack->push(a); return;} } // Return the array {0,1,...n-1} #line 4766 "runtime.in" // Intarray* sequence(Int n); void gen450(stack *Stack) { Int n=vm::pop(Stack); #line 4767 "runtime.in" if(n < 0) n=0; array *a=new array(n); for(Int i=0; i < n; ++i) { (*a)[i]=i; } {Stack->push(a); return;} } // Apply a function to each element of an array #line 4777 "runtime.in" void arrayFunction(stack *Stack) { array * a=vm::pop(Stack); callable * f=vm::pop(Stack); #line 4778 "runtime.in" size_t size=checkArray(a); array *b=new array(size); for(size_t i=0; i < size; ++i) { Stack->push((*a)[i]); f->call(Stack); (*b)[i]=pop(Stack); } {Stack->push(b); return;} } #line 4789 "runtime.in" void arraySort(stack *Stack) { callable * f=vm::pop(Stack); array * a=vm::pop(Stack); #line 4790 "runtime.in" array *c=copyArray(a); compareFunc=f; FuncStack=Stack; stable_sort(c->begin(),c->end(),compareFunction); {Stack->push(c); return;} } #line 4798 "runtime.in" // bool all(boolarray *a); void gen453(stack *Stack) { boolarray * a=vm::pop(Stack); #line 4799 "runtime.in" size_t size=checkArray(a); bool c=true; for(size_t i=0; i < size; i++) if(!get((*a)[i])) {c=false; break;} {Stack->push(c); return;} } #line 4807 "runtime.in" // boolarray* !(boolarray* a); void gen454(stack *Stack) { boolarray* a=vm::pop(Stack); #line 4808 "runtime.in" size_t size=checkArray(a); array *c=new array(size); for(size_t i=0; i < size; i++) (*c)[i]=!read(a,i); {Stack->push(c); return;} } #line 4816 "runtime.in" // Int sum(boolarray *a); void gen455(stack *Stack) { boolarray * a=vm::pop(Stack); #line 4817 "runtime.in" size_t size=checkArray(a); Int sum=0; for(size_t i=0; i < size; i++) sum += read(a,i) ? 1 : 0; {Stack->push(sum); return;} } #line 4825 "runtime.in" void arrayCopy(stack *Stack) { array * a=vm::pop(Stack); #line 4826 "runtime.in" {Stack->push(copyArray(a)); return;} } #line 4830 "runtime.in" void arrayConcat(stack *Stack) { array * a=vm::pop(Stack); #line 4831 "runtime.in" // a is an array of arrays to be concatenated together. // The signature is // T[] concat(... T[][] a); size_t numArgs=checkArray(a); size_t resultSize=0; for (size_t i=0; i < numArgs; ++i) { resultSize += checkArray(a->read(i)); } array *result=new array(resultSize); size_t ri=0; for (size_t i=0; i < numArgs; ++i) { array *arg=a->read(i); size_t size=checkArray(arg); for (size_t j=0; j < size; ++j) { (*result)[ri]=(*arg)[j]; ++ri; } } {Stack->push(result); return;} } #line 4858 "runtime.in" void array2Copy(stack *Stack) { array * a=vm::pop(Stack); #line 4859 "runtime.in" {Stack->push(copyArray2(a)); return;} } #line 4863 "runtime.in" void array3Copy(stack *Stack) { array * a=vm::pop(Stack); #line 4864 "runtime.in" {Stack->push(copyArray3(a)); return;} } #line 4868 "runtime.in" void array2Transpose(stack *Stack) { array * a=vm::pop(Stack); #line 4869 "runtime.in" size_t asize=checkArray(a); array *c=new array(0); for(size_t i=0; i < asize; i++) { size_t ip=i+1; array *ai=read(a,i); size_t aisize=checkArray(ai); size_t csize=checkArray(c); if(csize < aisize) { c->resize(aisize); for(size_t j=csize; j < aisize; j++) { (*c)[j]=new array(ip); } } for(size_t j=0; j < aisize; j++) { array *cj=read(c,j); if(checkArray(cj) < ip) cj->resize(ip); (*cj)[i]=(*ai)[j]; } } {Stack->push(c); return;} } // a is a rectangular 3D array; perm is an Int array indicating the type of // permutation (021 or 120, etc; original is 012). // Transpose by sending respective members to the permutated locations: // return the array obtained by putting a[i][j][k] into position perm{ijk}. #line 4896 "runtime.in" void array3Transpose(stack *Stack) { array * perm=vm::pop(Stack); array * a=vm::pop(Stack); #line 4897 "runtime.in" const size_t DIM=3; if(checkArray(perm) != DIM) { ostringstream buf; buf << "permutation array must have length " << DIM; error(buf); } size_t* size=new size_t[DIM]; for(size_t i=0; i < DIM; ++i) size[i]=DIM; for(size_t i=0; i < DIM; ++i) { Int p=read(perm,i); size_t P=(size_t) p; if(p < 0 || P >= DIM) { ostringstream buf; buf << "permutation index out of range: " << p; error(buf); } size[P]=P; } for(size_t i=0; i < DIM; ++i) if(size[i] == DIM) error("permutation indices must be distinct"); static const char *rectangular= "3D transpose implemented for rectangular matrices only"; size_t isize=size[0]=checkArray(a); array *a0=read(a,0); size[1]=checkArray(a0); array *a00=read(a0,0); size[2]=checkArray(a00); for(size_t i=0; i < isize; i++) { array *ai=read(a,i); size_t jsize=checkArray(ai); if(jsize != size[1]) error(rectangular); for(size_t j=0; j < jsize; j++) { array *aij=read(ai,j); if(checkArray(aij) != size[2]) error(rectangular); } } size_t perm0=(size_t) read(perm,0); size_t perm1=(size_t) read(perm,1); size_t perm2=(size_t) read(perm,2); size_t sizep0=size[perm0]; size_t sizep1=size[perm1]; size_t sizep2=size[perm2]; array *c=new array(sizep0); for(size_t i=0; i < sizep0; ++i) { array *ci=new array(sizep1); (*c)[i]=ci; for(size_t j=0; j < sizep1; ++j) { array *cij=new array(sizep2); (*ci)[j]=cij; } } size_t* i=new size_t[DIM]; for(i[0]=0; i[0] < size[0]; ++i[0]) { array *a0=read(a,i[0]); for(i[1]=0; i[1] < size[1]; ++i[1]) { array *a1=read(a0,i[1]); for(i[2]=0; i[2] < size[2]; ++i[2]) { array *c0=read(c,i[perm0]); array *c1=read(c0,i[perm1]); (*c1)[i[perm2]]=read(a1,i[2]); } } } delete [] i; delete [] size; {Stack->push(c); return;} } // In a boolean array, find the index of the nth true value or -1 if not found // If n is negative, search backwards. #line 4981 "runtime.in" // Int find(boolarray *a, Int n=1); void gen462(stack *Stack) { Int n=vm::pop(Stack,1); boolarray * a=vm::pop(Stack); #line 4982 "runtime.in" size_t size=checkArray(a); Int j=-1; if(n > 0) for(size_t i=0; i < size; i++) if(read(a,i)) { n--; if(n == 0) {j=(Int) i; break;} } if(n < 0) for(size_t i=size; i > 0;) if(read(a,--i)) { n++; if(n == 0) {j=(Int) i; break;} } {Stack->push(j); return;} } #line 4999 "runtime.in" // bool ==(realarray2 *a, realarray2 *b); void gen463(stack *Stack) { realarray2 * b=vm::pop(Stack); realarray2 * a=vm::pop(Stack); #line 5000 "runtime.in" size_t n=checkArray(a); if(n != checkArray(b)) {Stack->push(false); return;} size_t n0=n == 0 ? 0 : checkArray(read(a,0)); if(n0 != checkArray(read(b,0))) {Stack->push(false); return;} for(size_t i=0; i < n; ++i) { array *ai=read(a,i); array *bi=read(b,i); for(size_t j=0; j < n0; ++j) { if(read(ai,j) != read(bi,j)) {Stack->push(false); return;} } } {Stack->push(true); return;} } // construct vector obtained by replacing those elements of b for which the // corresponding elements of a are false by the corresponding element of c. #line 5020 "runtime.in" void arrayConditional(stack *Stack) { array * c=vm::pop(Stack); array * b=vm::pop(Stack); array * a=vm::pop(Stack); #line 5021 "runtime.in" size_t size=checkArray(a); array *r=new array(size); if(b && c) { checkArrays(a,b); checkArrays(b,c); for(size_t i=0; i < size; i++) (*r)[i]=read(a,i) ? (*b)[i] : (*c)[i]; } else { r->clear(); if(b) { checkArrays(a,b); for(size_t i=0; i < size; i++) if(read(a,i)) r->push((*b)[i]); } else if(c) { checkArrays(a,c); for(size_t i=0; i < size; i++) if(!read(a,i)) r->push((*c)[i]); } } {Stack->push(r); return;} } // Return an n x n identity matrix. #line 5045 "runtime.in" // realarray2* identity(Int n); void gen465(stack *Stack) { Int n=vm::pop(Stack); #line 5046 "runtime.in" {Stack->push(Identity(n)); return;} } // Return the diagonal matrix with diagonal entries given by a. #line 5051 "runtime.in" void diagonal(stack *Stack) { realarray * a=vm::pop(Stack); #line 5052 "runtime.in" size_t n=checkArray(a); array *c=new array(n); for(size_t i=0; i < n; ++i) { array *ci=new array(n); (*c)[i]=ci; for(size_t j=0; j < i; ++j) (*ci)[j]=0.0; (*ci)[i]=read(a,i); for(size_t j=i+1; j < n; ++j) (*ci)[j]=0.0; } {Stack->push(c); return;} } // Return the inverse of an n x n matrix a using Gauss-Jordan elimination. #line 5068 "runtime.in" // realarray2* inverse(realarray2 *a); void gen467(stack *Stack) { realarray2 * a=vm::pop(Stack); #line 5069 "runtime.in" a=copyArray2(a); size_t n=checkArray(a); checkSquare(a); inverseAllocate(n); for(size_t i=0; i < n; i++) pivot[i]=0; size_t col=0, row=0; // This is the main loop over the columns to be reduced. for(size_t i=0; i < n; i++) { real big=0.0; // This is the outer loop of the search for a pivot element. for(size_t j=0; j < n; j++) { array *aj=read(a,j); if(pivot[j] != 1) { for(size_t k=0; k < n; k++) { if(pivot[k] == 0) { real temp=fabs(read(aj,k)); if(temp >= big) { big=temp; row=j; col=k; } } else if(pivot[k] > 1) { inverseDeallocate(); error(singular); } } } } ++(pivot[col]); // Interchange rows, if needed, to put the pivot element on the diagonal. array *acol=read(a,col); if(row != col) { array *arow=read(a,row); for(size_t l=0; l < n; l++) { real temp=read(arow,l); (*arow)[l]=read(acol,l); (*acol)[l]=temp; } } Row[i]=row; Col[i]=col; // Divide the pivot row by the pivot element. real denom=read(acol,col); if(denom == 0.0) { inverseDeallocate(); error(singular); } real pivinv=1.0/denom; (*acol)[col]=1.0; for(size_t l=0; l < n; l++) (*acol)[l]=read(acol,l)*pivinv; // Reduce all rows except for the pivoted one. for(size_t k=0; k < n; k++) { if(k != col) { array *ak=read(a,k); real akcol=read(ak,col); (*ak)[col]=0.0; for(size_t l=0; l < n; l++) (*ak)[l]=read(ak,l)-read(acol,l)*akcol; } } } // Unscramble the inverse matrix in view of the column interchanges. for(size_t l=n; l > 0;) { l--; size_t r=Row[l]; size_t c=Col[l]; if(r != c) { for(size_t k=0; k < n; k++) { array *ak=read(a,k); real temp=read(ak,r); (*ak)[r]=read(ak,c); (*ak)[c]=temp; } } } inverseDeallocate(); {Stack->push(a); return;} } // Solve the linear equation ax=b by LU decomposition, returning the // solution x, where a is an n x n matrix and b is an array of length n. // If no solution exists, return an empty array. #line 5162 "runtime.in" // realarray* solve(realarray2 *a, realarray *b, bool warn=true); void gen468(stack *Stack) { bool warn=vm::pop(Stack,true); realarray * b=vm::pop(Stack); realarray2 * a=vm::pop(Stack); #line 5163 "runtime.in" size_t n=checkArray(a); if(n == 0) {Stack->push(new array(0)); return;} size_t m=checkArray(b); if(m != n) error(incommensurate); real *A=copyArray2C(a); size_t *index=new size_t[n]; if(LUdecompose(A,n,index,warn) == 0) {Stack->push(new array(0)); return;} array *x=new array(n); real *B=copyArrayC(b); for(size_t i=0; i < n; ++i) { size_t ip=index[i]; real sum=B[ip]; B[ip]=B[i]; real *Ai=A+i*n; for(size_t j=0; j < i; ++j) sum -= Ai[j]*B[j]; B[i]=sum; } for(size_t i=n; i > 0;) { --i; real sum=B[i]; real *Ai=A+i*n; for(size_t j=i+1; j < n; ++j) sum -= Ai[j]*B[j]; B[i]=sum/Ai[i]; } for(size_t i=0; i < n; ++i) (*x)[i]=B[i]; delete[] index; delete[] B; delete[] A; {Stack->push(x); return;} } // Solve the linear equation ax=b by LU decomposition, returning the // solution x, where a is an n x n matrix and b is an n x m matrix. // If no solution exists, return an empty array. #line 5213 "runtime.in" // realarray2* solve(realarray2 *a, realarray2 *b, bool warn=true); void gen469(stack *Stack) { bool warn=vm::pop(Stack,true); realarray2 * b=vm::pop(Stack); realarray2 * a=vm::pop(Stack); #line 5214 "runtime.in" size_t n=checkArray(a); if(n == 0) {Stack->push(new array(0)); return;} if(checkArray(b) != n) error(incommensurate); size_t m=checkArray(read(b,0)); real *A=copyArray2C(a); real *B=copyArray2C(b,false); size_t *index=new size_t[n]; if(LUdecompose(A,n,index,warn) == 0) {Stack->push(new array(0)); return;} array *x=new array(n); for(size_t i=0; i < n; ++i) { real *Ai=A+i*n; real *Bi=B+i*m; real *Bip=B+index[i]*m; for(size_t k=0; k < m; ++k) { real sum=Bip[k]; Bip[k]=Bi[k]; size_t jk=k; for(size_t j=0; j < i; ++j, jk += m) sum -= Ai[j]*B[jk]; Bi[k]=sum; } } for(size_t i=n; i > 0;) { --i; real *Ai=A+i*n; real *Bi=B+i*m; for(size_t k=0; k < m; ++k) { real sum=Bi[k]; size_t jk=(i+1)*m+k; for(size_t j=i+1; j < n; ++j, jk += m) sum -= Ai[j]*B[jk]; Bi[k]=sum/Ai[i]; } } for(size_t i=0; i < n; ++i) { real *Bi=B+i*m; array *xi=new array(m); (*x)[i]=xi; for(size_t j=0; j < m; ++j) (*xi)[j]=Bi[j]; } delete[] index; delete[] B; delete[] A; {Stack->push(x); return;} } // Compute the determinant of an n x n matrix. #line 5275 "runtime.in" // real determinant(realarray2 *a); void gen470(stack *Stack) { realarray2 * a=vm::pop(Stack); #line 5276 "runtime.in" real *A=copyArray2C(a); size_t n=checkArray(a); real det=LUdecompose(A,n,NULL,false); size_t n1=n+1; for(size_t i=0; i < n; ++i) det *= A[i*n1]; delete[] A; {Stack->push(det); return;} } #line 5290 "runtime.in" // realarray* *(realarray2 *a, realarray *b); void gen471(stack *Stack) { realarray * b=vm::pop(Stack); realarray2 * a=vm::pop(Stack); #line 5291 "runtime.in" size_t n=checkArray(a); size_t m=checkArray(b); array *c=new array(n); real *B=copyArrayC(b); for(size_t i=0; i < n; ++i) { array *ai=read(a,i); if(checkArray(ai) != m) error(incommensurate); real sum=0.0; for(size_t j=0; j < m; ++j) sum += read(ai,j)*B[j]; (*c)[i]=sum; } delete[] B; {Stack->push(c); return;} } #line 5308 "runtime.in" // realarray2* *(realarray2 *a, realarray2 *b); void gen472(stack *Stack) { realarray2 * b=vm::pop(Stack); realarray2 * a=vm::pop(Stack); #line 5309 "runtime.in" size_t n=checkArray(a); size_t nb=checkArray(b); size_t na0=n == 0 ? 0 : checkArray(read(a,0)); if(na0 != nb) error(incommensurate); size_t nb0=nb == 0 ? 0 : checkArray(read(b,0)); array *c=new array(n); real *A=copyArray2C(a,false); real *B=copyArray2C(b,false); for(size_t i=0; i < n; ++i) { real *Ai=A+i*nb; array *ci=new array(nb0); (*c)[i]=ci; for(size_t j=0; j < nb0; ++j) { real sum=0.0; size_t kj=j; for(size_t k=0; k < nb; ++k, kj += nb0) sum += Ai[k]*B[kj]; (*ci)[j]=sum; } } delete[] B; delete[] A; {Stack->push(c); return;} } #line 5343 "runtime.in" // triple *(realarray2 *t, triple v); void gen473(stack *Stack) { triple v=vm::pop(Stack); realarray2 * t=vm::pop(Stack); #line 5344 "runtime.in" {Stack->push(*t*v); return;} } #line 5348 "runtime.in" // pair project(triple v, realarray2 *t); void gen474(stack *Stack) { realarray2 * t=vm::pop(Stack); triple v=vm::pop(Stack); #line 5349 "runtime.in" size_t n=checkArray(t); if(n != 4) error(incommensurate); array *t0=read(t,0); array *t1=read(t,1); array *t3=read(t,3); if(checkArray(t0) != 4 || checkArray(t1) != 4 || checkArray(t3) != 4) error(incommensurate); real x=v.getx(); real y=v.gety(); real z=v.getz(); real f=read(t3,0)*x+read(t3,1)*y+read(t3,2)*z+ read(t3,3); if(f == 0.0) dividebyzero(); f=1.0/f; {Stack->push(pair((read(t0,0)*x+read(t0,1)*y+read(t0,2)*z+ read(t0,3))*f, (read(t1,0)*x+read(t1,1)*y+read(t1,2)*z+ read(t1,3))*f)); return;} } // Compute the dot product of vectors a and b. #line 5374 "runtime.in" // real dot(realarray *a, realarray *b); void gen475(stack *Stack) { realarray * b=vm::pop(Stack); realarray * a=vm::pop(Stack); #line 5375 "runtime.in" size_t n=checkArrays(a,b); real sum=0.0; for(size_t i=0; i < n; ++i) sum += read(a,i)*read(b,i); {Stack->push(sum); return;} } // Solve the problem L\inv f, where f is an n vector and L is the n x n matrix // // [ b[0] c[0] a[0] ] // [ a[1] b[1] c[1] ] // [ a[2] b[2] c[2] ] // [ ... ] // [ c[n-1] a[n-1] b[n-1] ] #line 5390 "runtime.in" // realarray* tridiagonal(realarray *a, realarray *b, realarray *c, realarray *f); void gen476(stack *Stack) { realarray * f=vm::pop(Stack); realarray * c=vm::pop(Stack); realarray * b=vm::pop(Stack); realarray * a=vm::pop(Stack); #line 5391 "runtime.in" size_t n=checkArrays(a,b); checkEqual(n,checkArray(c)); checkEqual(n,checkArray(f)); array *up=new array(n); array& u=*up; if(n == 0) {Stack->push(up); return;} // Special case: zero Dirichlet boundary conditions if(read(a,0) == 0.0 && read(c,n-1) == 0.0) { real temp=read(b,0); if(temp == 0.0) dividebyzero(); temp=1.0/temp; real *work=new real[n]; u[0]=read(f,0)*temp; work[0]=-read(c,0)*temp; for(size_t i=1; i < n; i++) { real temp=(read(b,i)+read(a,i)*work[i-1]); if(temp == 0.0) {delete[] work; dividebyzero();} temp=1.0/temp; u[i]=(read(f,i)-read(a,i)*read(u,i-1))*temp; work[i]=-read(c,i)*temp; } for(size_t i=n-1; i >= 1; i--) u[i-1]=read(u,i-1)+work[i-1]*read(u,i); delete[] work; {Stack->push(up); return;} } real binv=read(b,0); if(binv == 0.0) dividebyzero(); binv=1.0/binv; if(n == 1) {u[0]=read(f,0)*binv; {Stack->push(up); return;}} if(n == 2) { real factor=(read(b,0)*read(b,1)- read(a,0)*read(c,1)); if(factor== 0.0) dividebyzero(); factor=1.0/factor; real temp=(read(b,0)*read(f,1)- read(c,1)*read(f,0))*factor; u[0]=(read(b,1)*read(f,0)- read(a,0)*read(f,1))*factor; u[1]=temp; {Stack->push(up); return;} } real *gamma=new real[n-2]; real *delta=new real[n-2]; gamma[0]=read(c,0)*binv; delta[0]=read(a,0)*binv; u[0]=read(f,0)*binv; real beta=read(c,n-1); real fn=read(f,n-1)-beta*read(u,0); real alpha=read(b,n-1)-beta*delta[0]; for(size_t i=1; i <= n-3; i++) { real alphainv=read(b,i)-read(a,i)*gamma[i-1]; if(alphainv == 0.0) {delete[] gamma; delete[] delta; dividebyzero();} alphainv=1.0/alphainv; beta *= -gamma[i-1]; gamma[i]=read(c,i)*alphainv; u[i]=(read(f,i)-read(a,i)*read(u,i-1))*alphainv; fn -= beta*read(u,i); delta[i]=-read(a,i)*delta[i-1]*alphainv; alpha -= beta*delta[i]; } real alphainv=read(b,n-2)-read(a,n-2)*gamma[n-3]; if(alphainv == 0.0) {delete[] gamma; delete[] delta; dividebyzero();} alphainv=1.0/alphainv; u[n-2]=(read(f,n-2)-read(a,n-2)*read(u,n-3)) *alphainv; beta=read(a,n-1)-beta*gamma[n-3]; real dnm1=(read(c,n-2)-read(a,n-2)*delta[n-3])*alphainv; real temp=alpha-beta*dnm1; if(temp == 0.0) {delete[] gamma; delete[] delta; dividebyzero();} u[n-1]=temp=(fn-beta*read(u,n-2))/temp; u[n-2]=read(u,n-2)-dnm1*temp; for(size_t i=n-2; i >= 1; i--) u[i-1]=read(u,i-1)-gamma[i-1]*read(u,i)-delta[i-1]*temp; delete[] delta; delete[] gamma; {Stack->push(up); return;} } // Root solve by Newton-Raphson #line 5488 "runtime.in" // real newton(Int iterations=100, callableReal *f, callableReal *fprime, real x, bool verbose=false); void gen477(stack *Stack) { bool verbose=vm::pop(Stack,false); real x=vm::pop(Stack); callableReal * fprime=vm::pop(Stack); callableReal * f=vm::pop(Stack); Int iterations=vm::pop(Stack,100); #line 5490 "runtime.in" static const real fuzz=1000.0*DBL_EPSILON; Int i=0; size_t oldPrec=0; if(verbose) oldPrec=cout.precision(DBL_DIG); real diff=DBL_MAX; real lastdiff; do { real x0=x; Stack->push(x); fprime->call(Stack); real dfdx=pop(Stack); if(dfdx == 0.0) { x=DBL_MAX; break; } Stack->push(x); f->call(Stack); real fx=pop(Stack); x -= fx/dfdx; lastdiff=diff; if(verbose) cout << "Newton-Raphson: " << x << endl; diff=fabs(x-x0); if(++i == iterations) { x=DBL_MAX; break; } } while (diff != 0.0 && (diff < lastdiff || diff > fuzz*fabs(x))); if(verbose) cout.precision(oldPrec); {Stack->push(x); return;} } // Root solve by Newton-Raphson bisection // cf. routine rtsafe (Press et al., Numerical Recipes, 1991). #line 5536 "runtime.in" // real newton(Int iterations=100, callableReal *f, callableReal *fprime, real x1, real x2, bool verbose=false); void gen478(stack *Stack) { bool verbose=vm::pop(Stack,false); real x2=vm::pop(Stack); real x1=vm::pop(Stack); callableReal * fprime=vm::pop(Stack); callableReal * f=vm::pop(Stack); Int iterations=vm::pop(Stack,100); #line 5538 "runtime.in" static const real fuzz=1000.0*DBL_EPSILON; size_t oldPrec=0; if(verbose) oldPrec=cout.precision(DBL_DIG); Stack->push(x1); f->call(Stack); real f1=pop(Stack); if(f1 == 0.0) {Stack->push(x1); return;} Stack->push(x2); f->call(Stack); real f2=pop(Stack); if(f2 == 0.0) {Stack->push(x2); return;} if((f1 > 0.0 && f2 > 0.0) || (f1 < 0.0 && f2 < 0.0)) { ostringstream buf; buf << "root not bracketed, f(x1)=" << f1 << ", f(x2)=" << f2 << endl; error(buf); } real x=0.5*(x1+x2); real dxold=fabs(x2-x1); if(f1 > 0.0) { real temp=x1; x1=x2; x2=temp; } if(verbose) cout << "midpoint: " << x << endl; real dx=dxold; Stack->push(x); f->call(Stack); real y=pop(Stack); Stack->push(x); fprime->call(Stack); real dy=pop(Stack); Int j; for(j=0; j < iterations; j++) { if(((x-x2)*dy-y)*((x-x1)*dy-y) >= 0.0 || fabs(2.0*y) > fabs(dxold*dy)) { dxold=dx; dx=0.5*(x2-x1); x=x1+dx; if(verbose) cout << "bisection: " << x << endl; if(x1 == x) {Stack->push(x); return;} } else { dxold=dx; dx=y/dy; real temp=x; x -= dx; if(verbose) cout << "Newton-Raphson: " << x << endl; if(temp == x) {Stack->push(x); return;} } if(fabs(dx) < fuzz*fabs(x)) {Stack->push(x); return;} Stack->push(x); f->call(Stack); y=pop(Stack); Stack->push(x); fprime->call(Stack); dy=pop(Stack); if(y < 0.0) x1=x; else x2=x; } if(verbose) cout.precision(oldPrec); {Stack->push((j == iterations) ? DBL_MAX : x); return;} } #line 5616 "runtime.in" // real simpson(callableReal *f, real a, real b, real acc=DBL_EPSILON, real dxmax=0); void gen479(stack *Stack) { real dxmax=vm::pop(Stack,0); real acc=vm::pop(Stack,DBL_EPSILON); real b=vm::pop(Stack); real a=vm::pop(Stack); callableReal * f=vm::pop(Stack); #line 5618 "runtime.in" real integral; if(dxmax == 0) dxmax=b-a; Func=f; FuncStack=Stack; if(!simpson(integral,wrapFunction,a,b,acc,dxmax)) error("nesting capacity exceeded in simpson"); {Stack->push(integral); return;} } // Compute the fast Fourier transform of a pair array #line 5629 "runtime.in" void pairArrayFFT(stack *Stack) { Int sign=vm::pop(Stack,1); pairarray * a=vm::pop(Stack); #line 5630 "runtime.in" unsigned n=(unsigned) checkArray(a); #ifdef HAVE_LIBFFTW3 array *c=new array(n); if(n) { Complex *f=FFTWComplex(n); fft1d Forward(n,intcast(sign),f); for(size_t i=0; i < n; i++) { pair z=read(a,i); f[i]=Complex(z.getx(),z.gety()); } Forward.fft(f); for(size_t i=0; i < n; i++) { Complex z=f[i]; (*c)[i]=pair(z.real(),z.imag()); } FFTWdelete(f); } #else unused(&n); unused(&sign); array *c=new array(0); #endif // HAVE_LIBFFTW3 {Stack->push(c); return;} } #line 5658 "runtime.in" // Intarray2* triangulate(pairarray *z); void gen481(stack *Stack) { pairarray * z=vm::pop(Stack); #line 5659 "runtime.in" size_t nv=checkArray(z); // Call robust version of Gilles Dumoulin's port of Paul Bourke's // triangulation code. XYZ *pxyz=new XYZ[nv+3]; ITRIANGLE *V=new ITRIANGLE[4*nv]; for(size_t i=0; i < nv; ++i) { pair w=read(z,i); pxyz[i].p[0]=w.getx(); pxyz[i].p[1]=w.gety(); pxyz[i].i=(Int) i; } Int ntri; Triangulate((Int) nv,pxyz,V,ntri,true,false); size_t nt=(size_t) ntri; array *t=new array(nt); for(size_t i=0; i < nt; ++i) { array *ti=new array(3); (*t)[i]=ti; ITRIANGLE *Vi=V+i; (*ti)[0]=pxyz[Vi->p1].i; (*ti)[1]=pxyz[Vi->p2].i; (*ti)[2]=pxyz[Vi->p3].i; } delete[] V; delete[] pxyz; {Stack->push(t); return;} } // File operations #line 5695 "runtime.in" // bool ==(file *a, file *b); void gen482(stack *Stack) { file * b=vm::pop(Stack); file * a=vm::pop(Stack); #line 5696 "runtime.in" {Stack->push(a == b); return;} } #line 5701 "runtime.in" // bool !=(file *a, file *b); void gen483(stack *Stack) { file * b=vm::pop(Stack); file * a=vm::pop(Stack); #line 5702 "runtime.in" {Stack->push(a != b); return;} } #line 5706 "runtime.in" void nullFile(stack *Stack) { #line 5707 "runtime.in" {Stack->push(&camp::nullfile); return;} } #line 5711 "runtime.in" // file* input(string name, bool check=true, string comment=commentchar); void gen485(stack *Stack) { string comment=vm::pop(Stack,commentchar); bool check=vm::pop(Stack,true); string name=vm::pop(Stack); #line 5712 "runtime.in" char c=comment.empty() ? (char) 0 : comment[0]; file *f=new ifile(name,c,check); f->open(); {Stack->push(f); return;} } #line 5719 "runtime.in" // file* output(string name, bool update=false, string comment=commentchar); void gen486(stack *Stack) { string comment=vm::pop(Stack,commentchar); bool update=vm::pop(Stack,false); string name=vm::pop(Stack); #line 5720 "runtime.in" file *f; if(update) { char c=comment.empty() ? (char) 0 : comment[0]; f=new iofile(name,c); } else f=new ofile(name); f->open(); if(update) f->seek(0,false); {Stack->push(f); return;} } #line 5731 "runtime.in" // file* xinput(string name, bool check=true); void gen487(stack *Stack) { bool check=vm::pop(Stack,true); string name=vm::pop(Stack); #line 5732 "runtime.in" #ifdef HAVE_RPC_RPC_H file *f=new ixfile(name,check); f->open(); {Stack->push(f); return;} #else ostringstream buf; buf << name << ": XDR read support not enabled"; error(buf); unused(&check); // Suppress unused variable warning #endif } #line 5745 "runtime.in" // file* xoutput(string name, bool update=false); void gen488(stack *Stack) { bool update=vm::pop(Stack,false); string name=vm::pop(Stack); #line 5746 "runtime.in" #ifdef HAVE_RPC_RPC_H file *f; if(update) f=new ioxfile(name); else f=new oxfile(name); f->open(); if(update) f->seek(0,false); {Stack->push(f); return;} #else ostringstream buf; buf << name << ": XDR write support not enabled"; error(buf); unused(&update); // Suppress unused variable warning #endif } #line 5763 "runtime.in" // file* binput(string name, bool check=true); void gen489(stack *Stack) { bool check=vm::pop(Stack,true); string name=vm::pop(Stack); #line 5764 "runtime.in" file *f=new ibfile(name,check); f->open(); {Stack->push(f); return;} } #line 5770 "runtime.in" // file* boutput(string name, bool update=false); void gen490(stack *Stack) { bool update=vm::pop(Stack,false); string name=vm::pop(Stack); #line 5771 "runtime.in" file *f; if(update) f=new iobfile(name); else f=new obfile(name); f->open(); if(update) f->seek(0,false); {Stack->push(f); return;} } #line 5780 "runtime.in" // bool eof(file *File); void gen491(stack *Stack) { file * File=vm::pop(Stack); #line 5781 "runtime.in" {Stack->push(File->eof()); return;} } #line 5785 "runtime.in" // bool eol(file *File); void gen492(stack *Stack) { file * File=vm::pop(Stack); #line 5786 "runtime.in" {Stack->push(File->eol()); return;} } #line 5790 "runtime.in" // bool error(file *File); void gen493(stack *Stack) { file * File=vm::pop(Stack); #line 5791 "runtime.in" {Stack->push(File->error()); return;} } #line 5795 "runtime.in" // void clear(file *File); void gen494(stack *Stack) { file * File=vm::pop(Stack); #line 5796 "runtime.in" File->clear(); } #line 5800 "runtime.in" // void close(file *File); void gen495(stack *Stack) { file * File=vm::pop(Stack); #line 5801 "runtime.in" File->close(); } #line 5805 "runtime.in" // Int precision(file *File=NULL, Int digits=0); void gen496(stack *Stack) { Int digits=vm::pop(Stack,0); file * File=vm::pop(Stack,NULL); #line 5806 "runtime.in" if(File == 0) File=&camp::Stdout; {Stack->push(File->precision(digits)); return;} } #line 5811 "runtime.in" // void flush(file *File); void gen497(stack *Stack) { file * File=vm::pop(Stack); #line 5812 "runtime.in" File->flush(); } #line 5816 "runtime.in" // string getc(file *File); void gen498(stack *Stack) { file * File=vm::pop(Stack); #line 5817 "runtime.in" char c=0; if(File->isOpen()) File->read(c); static char str[1]; str[0]=c; {Stack->push(string(str)); return;} } #line 5825 "runtime.in" // Int tell(file *File); void gen499(stack *Stack) { file * File=vm::pop(Stack); #line 5826 "runtime.in" {Stack->push(File->tell()); return;} } #line 5830 "runtime.in" // void seek(file *File, Int pos); void gen500(stack *Stack) { Int pos=vm::pop(Stack); file * File=vm::pop(Stack); #line 5831 "runtime.in" File->seek(pos,pos >= 0); } #line 5835 "runtime.in" // void seekeof(file *File); void gen501(stack *Stack) { file * File=vm::pop(Stack); #line 5836 "runtime.in" File->seek(0,false); } // Set file dimensions #line 5841 "runtime.in" // file* dimension(file *File, Int nx); void gen502(stack *Stack) { Int nx=vm::pop(Stack); file * File=vm::pop(Stack); #line 5842 "runtime.in" File->dimension(nx); {Stack->push(File); return;} } #line 5847 "runtime.in" // file* dimension(file *File, Int nx, Int ny); void gen503(stack *Stack) { Int ny=vm::pop(Stack); Int nx=vm::pop(Stack); file * File=vm::pop(Stack); #line 5848 "runtime.in" File->dimension(nx,ny); {Stack->push(File); return;} } #line 5853 "runtime.in" // file* dimension(file *File, Int nx, Int ny, Int nz); void gen504(stack *Stack) { Int nz=vm::pop(Stack); Int ny=vm::pop(Stack); Int nx=vm::pop(Stack); file * File=vm::pop(Stack); #line 5854 "runtime.in" File->dimension(nx,ny,nz); {Stack->push(File); return;} } // Set file to read comma-separated values #line 5860 "runtime.in" // file* csv(file *File, bool b=true); void gen505(stack *Stack) { bool b=vm::pop(Stack,true); file * File=vm::pop(Stack); #line 5861 "runtime.in" File->CSVMode(b); {Stack->push(File); return;} } // Set file to read whitespace-separated values #line 5867 "runtime.in" // file* word(file *File, bool b=true); void gen506(stack *Stack) { bool b=vm::pop(Stack,true); file * File=vm::pop(Stack); #line 5868 "runtime.in" File->WordMode(b); {Stack->push(File); return;} } // Set file to read arrays in line-at-a-time mode #line 5874 "runtime.in" // file* line(file *File, bool b=true); void gen507(stack *Stack) { bool b=vm::pop(Stack,true); file * File=vm::pop(Stack); #line 5875 "runtime.in" File->LineMode(b); {Stack->push(File); return;} } // Set file to read/write single-precision XDR values. #line 5881 "runtime.in" // file* single(file *File, bool b=true); void gen508(stack *Stack) { bool b=vm::pop(Stack,true); file * File=vm::pop(Stack); #line 5882 "runtime.in" File->SingleReal(b); File->SingleInt(b); {Stack->push(File); return;} } // Set file to read/write single-precision real XDR values. #line 5889 "runtime.in" // file* single(file *File, real x, bool b=true); void gen509(stack *Stack) { bool b=vm::pop(Stack,true); real x=vm::pop(Stack); file * File=vm::pop(Stack); #line 5890 "runtime.in" File->SingleReal(b); unused(&x); {Stack->push(File); return;} } // Set file to read/write single-precision int XDR values. #line 5897 "runtime.in" // file* single(file *File, Int x, bool b=true); void gen510(stack *Stack) { bool b=vm::pop(Stack,true); Int x=vm::pop(Stack); file * File=vm::pop(Stack); #line 5898 "runtime.in" File->SingleInt(b); unused(&x); {Stack->push(File); return;} } // Set file to read an array1 (1 Int size followed by a 1d array) #line 5905 "runtime.in" // file* read1(file *File); void gen511(stack *Stack) { file * File=vm::pop(Stack); #line 5906 "runtime.in" File->dimension(-2); {Stack->push(File); return;} } // Set file to read an array2 (2 Int sizes followed by a 2d array) #line 5912 "runtime.in" // file* read2(file *File); void gen512(stack *Stack) { file * File=vm::pop(Stack); #line 5913 "runtime.in" File->dimension(-2,-2); {Stack->push(File); return;} } // Set file to read an array3 (3 Int sizes followed by a 3d array) #line 5919 "runtime.in" // file* read3(file *File); void gen513(stack *Stack) { file * File=vm::pop(Stack); #line 5920 "runtime.in" File->dimension(-2,-2,-2); {Stack->push(File); return;} } // Return the last n lines of the history named name. #line 5926 "runtime.in" // stringarray* history(string name, Int n=1); void gen514(stack *Stack) { Int n=vm::pop(Stack,1); string name=vm::pop(Stack); #line 5927 "runtime.in" #if defined(HAVE_LIBREADLINE) && defined(HAVE_LIBCURSES) bool newhistory=historyMap.find(name) == historyMap.end(); string filename; if(newhistory) { filename=historyfilename(name); std::ifstream exists(filename.c_str()); if(!exists) {Stack->push(new array(0)); return;} } store_history(&history_save); HISTORY_STATE& history=historyMap[name].state; history_set_history_state(&history); if(newhistory) read_history(filename.c_str()); array *a=get_history(n); store_history(&history); history_set_history_state(&history_save); {Stack->push(a); return;} #else unused(&n); {Stack->push(new array(0)); return;} #endif } // Return the last n lines of the interactive history. #line 5959 "runtime.in" // stringarray* history(Int n=0); void gen515(stack *Stack) { Int n=vm::pop(Stack,0); #line 5960 "runtime.in" #if defined(HAVE_LIBREADLINE) && defined(HAVE_LIBCURSES) {Stack->push(get_history(n)); return;} #else unused(&n); {Stack->push(new array(0)); return;} #endif } // Prompt for a string using prompt, the GNU readline library, and a // local history named name. #line 5971 "runtime.in" // string readline(string prompt=emptystring, string name=emptystring, bool tabcompletion=false); void gen516(stack *Stack) { bool tabcompletion=vm::pop(Stack,false); string name=vm::pop(Stack,emptystring); string prompt=vm::pop(Stack,emptystring); #line 5973 "runtime.in" if(!isatty(STDIN_FILENO)) {Stack->push(emptystring); return;} #if defined(HAVE_LIBREADLINE) && defined(HAVE_LIBCURSES) init_readline(tabcompletion); store_history(&history_save); bool newhistory=historyMap.find(name) == historyMap.end(); historyState& h=historyMap[name]; HISTORY_STATE& history=h.state; history_set_history_state(&history); if(newhistory) read_history(historyfilename(name).c_str()); static char *line=NULL; /* Return the memory to the free pool if the buffer has already been allocated. */ if(line) { free(line); line=NULL; } /* Get a line from the user. */ line=readline(prompt.c_str()); if(!line) cout << endl; history_set_history_state(&history_save); {Stack->push(line ? string(line) : emptystring); return;} #else cout << prompt; string s; getline(cin,s); unused(&tabcompletion); // Avoid unused variable warning message. {Stack->push(s); return;} #endif } // Save a string in a local history named name. // If store=true, store the local history in the file historyfilename(name). #line 6015 "runtime.in" // void saveline(string name, string value, bool store=true); void gen517(stack *Stack) { bool store=vm::pop(Stack,true); string value=vm::pop(Stack); string name=vm::pop(Stack); #line 6016 "runtime.in" #if defined(HAVE_LIBREADLINE) && defined(HAVE_LIBCURSES) store_history(&history_save); bool newhistory=historyMap.find(name) == historyMap.end(); historyState& h=historyMap[name]; h.store=store; HISTORY_STATE& history=h.state; history_set_history_state(&history); if(newhistory) read_history(historyfilename(name).c_str()); if(value != "") { add_history(value.c_str()); if(store) { std::ofstream hout(historyfilename(name).c_str(),std::ios::app); hout << value << endl; } } store_history(&history); history_set_history_state(&history_save); #else unused(&store); #endif } #line 6043 "runtime.in" // void generate_random_backtrace(); void gen518(stack *) { #line 6044 "runtime.in" #if defined(USEGC) && defined(GC_DEBUG) && defined(GC_BACKTRACE) GC_generate_random_backtrace(); #else error("generate_random_backtrace() requires ./configure --enable-gc-debug"); #endif } #line 6052 "runtime.in" // void print_random_addresses(Int n=1); void gen519(stack *Stack) { Int n=vm::pop(Stack,1); #line 6053 "runtime.in" #if defined(USEGC) && defined(GC_DEBUG) && defined(GC_BACKTRACE) GC_gcollect(); for (Int i=0; i < n; ++i) GC_debug_print_heap_obj_proc(GC_base(GC_generate_random_valid_address())); #else error("print_random_addresses() requires ./configure --enable-gc-debug"); unused(&n); // Avoid unused variable warning message. #endif } } // namespace run namespace trans { void gen_base_venv(venv &ve) { #line 1167 "runtime.in" addFunc(ve, run::gen8, primBoolean(), "!", formal(primBoolean(), "b", false, false)); #line 1195 "runtime.in" addFunc(ve, run::gen13, primInt(), "AND", formal(primInt(), "a", false, false), formal(primInt(), "b", false, false)); #line 1203 "runtime.in" addFunc(ve, run::gen14, primInt(), "OR", formal(primInt(), "a", false, false), formal(primInt(), "b", false, false)); #line 1208 "runtime.in" addFunc(ve, run::gen15, primInt(), "XOR", formal(primInt(), "a", false, false), formal(primInt(), "b", false, false)); #line 1213 "runtime.in" addFunc(ve, run::gen16, primInt(), "NOT", formal(primInt(), "a", false, false)); #line 1244 "runtime.in" addFunc(ve, run::gen21, primBoolean(), "empty", formal(primPicture(), "f", false, false)); #line 1249 "runtime.in" addFunc(ve, run::gen22, primVoid(), "erase", formal(primPicture(), "f", false, false)); #line 1254 "runtime.in" addFunc(ve, run::gen23, primPair(), "min", formal(primPicture(), "f", false, false)); #line 1259 "runtime.in" addFunc(ve, run::gen24, primPair(), "max", formal(primPicture(), "f", false, false)); #line 1264 "runtime.in" addFunc(ve, run::gen25, primVoid(), "label", formal(primPicture(), "f", false, false), formal(primString(), "s", false, false), formal(primString(), "size", false, false), formal(primTransform(), "t", false, false), formal(primPair(), "position", false, false), formal(primPair(), "align", false, false), formal(primPen(), "p", false, false)); #line 1270 "runtime.in" addFunc(ve, run::gen26, primBoolean(), "labels", formal(primPicture(), "f", false, false)); #line 1275 "runtime.in" addFunc(ve, run::gen27, pathArray() , "_texpath", formal(primString(), "s", false, false), formal(primPen(), "p", true, false)); #line 1390 "runtime.in" addFunc(ve, run::gen28, pathArray() , "textpath", formal(primString(), "s", false, false), formal(primPen(), "p", true, false)); #line 1462 "runtime.in" addFunc(ve, run::gen29, pathArray() , "_strokepath", formal(primPath(), "g", false, false), formal(primPen(), "p", true, false)); #line 1486 "runtime.in" addFunc(ve, run::gen30, primVoid(), "_draw", formal(primPicture(), "f", false, false), formal(primPath(), "g", false, false), formal(primPen(), "p", false, false)); #line 1491 "runtime.in" addFunc(ve, run::gen31, primVoid(), "fill", formal(primPicture(), "f", false, false), formal(pathArray() , "g", false, false), formal(primPen(), "p", true, false), formal(primBoolean(), "copy", true, false)); #line 1497 "runtime.in" addFunc(ve, run::gen32, primVoid(), "latticeshade", formal(primPicture(), "f", false, false), formal(pathArray() , "g", false, false), formal(primBoolean(), "stroke", true, false), formal(primPen(), "fillrule", true, false), formal(penArray2() , "p", false, false), formal(primBoolean(), "copy", true, false)); #line 1504 "runtime.in" addFunc(ve, run::gen33, primVoid(), "axialshade", formal(primPicture(), "f", false, false), formal(pathArray() , "g", false, false), formal(primBoolean(), "stroke", true, false), formal(primPen(), "pena", false, false), formal(primPair(), "a", false, false), formal(primPen(), "penb", false, false), formal(primPair(), "b", false, false), formal(primBoolean(), "copy", true, false)); #line 1511 "runtime.in" addFunc(ve, run::gen34, primVoid(), "radialshade", formal(primPicture(), "f", false, false), formal(pathArray() , "g", false, false), formal(primBoolean(), "stroke", true, false), formal(primPen(), "pena", false, false), formal(primPair(), "a", false, false), formal(primReal(), "ra", false, false), formal(primPen(), "penb", false, false), formal(primPair(), "b", false, false), formal(primReal(), "rb", false, false), formal(primBoolean(), "copy", true, false)); #line 1518 "runtime.in" addFunc(ve, run::gen35, primVoid(), "gouraudshade", formal(primPicture(), "f", false, false), formal(pathArray() , "g", false, false), formal(primBoolean(), "stroke", true, false), formal(primPen(), "fillrule", true, false), formal(penArray() , "p", false, false), formal(pairArray(), "z", false, false), formal(IntArray(), "edges", false, false), formal(primBoolean(), "copy", true, false)); #line 1529 "runtime.in" addFunc(ve, run::gen36, primVoid(), "gouraudshade", formal(primPicture(), "f", false, false), formal(pathArray() , "g", false, false), formal(primBoolean(), "stroke", true, false), formal(primPen(), "fillrule", true, false), formal(penArray() , "p", false, false), formal(IntArray(), "edges", false, false), formal(primBoolean(), "copy", true, false)); #line 1553 "runtime.in" addFunc(ve, run::gen37, primVoid(), "tensorshade", formal(primPicture(), "f", false, false), formal(pathArray() , "g", false, false), formal(primBoolean(), "stroke", true, false), formal(primPen(), "fillrule", true, false), formal(penArray2() , "p", false, false), formal(pathArray() , "b", true, false), formal(pairArray2(), "z", true, false), formal(primBoolean(), "copy", true, false)); #line 1568 "runtime.in" addFunc(ve, run::gen38, primVoid(), "functionshade", formal(primPicture(), "f", false, false), formal(pathArray() , "g", false, false), formal(primBoolean(), "stroke", true, false), formal(primPen(), "fillrule", true, false), formal(primString() , "shader", true, false), formal(primBoolean(), "copy", true, false)); #line 1576 "runtime.in" addFunc(ve, run::gen39, primVoid(), "clip", formal(primPicture(), "f", false, false), formal(pathArray() , "g", false, false), formal(primBoolean(), "stroke", true, false), formal(primPen(), "fillrule", true, false), formal(primBoolean(), "copy", true, false)); #line 1586 "runtime.in" addFunc(ve, run::gen40, primVoid(), "beginclip", formal(primPicture(), "f", false, false), formal(pathArray() , "g", false, false), formal(primBoolean(), "stroke", true, false), formal(primPen(), "fillrule", true, false), formal(primBoolean(), "copy", true, false)); #line 1593 "runtime.in" addFunc(ve, run::gen41, primVoid(), "endclip", formal(primPicture(), "f", false, false)); #line 1598 "runtime.in" addFunc(ve, run::gen42, primVoid(), "gsave", formal(primPicture(), "f", false, false)); #line 1603 "runtime.in" addFunc(ve, run::gen43, primVoid(), "grestore", formal(primPicture(), "f", false, false)); #line 1608 "runtime.in" addFunc(ve, run::gen44, primVoid(), "begingroup", formal(primPicture(), "f", false, false)); #line 1613 "runtime.in" addFunc(ve, run::gen45, primVoid(), "endgroup", formal(primPicture(), "f", false, false)); #line 1618 "runtime.in" addFunc(ve, run::gen46, primVoid(), "add", formal(primPicture(), "dest", false, false), formal(primPicture(), "src", false, false)); #line 1623 "runtime.in" addFunc(ve, run::gen47, primVoid(), "prepend", formal(primPicture(), "dest", false, false), formal(primPicture(), "src", false, false)); #line 1628 "runtime.in" addFunc(ve, run::gen48, primVoid(), "postscript", formal(primPicture(), "f", false, false), formal(primString() , "s", false, false)); #line 1633 "runtime.in" addFunc(ve, run::gen49, primVoid(), "tex", formal(primPicture(), "f", false, false), formal(primString() , "s", false, false)); #line 1638 "runtime.in" addFunc(ve, run::gen50, primVoid(), "postscript", formal(primPicture(), "f", false, false), formal(primString() , "s", false, false), formal(primPair(), "min", false, false), formal(primPair(), "max", false, false)); #line 1643 "runtime.in" addFunc(ve, run::gen51, primVoid(), "tex", formal(primPicture(), "f", false, false), formal(primString() , "s", false, false), formal(primPair(), "min", false, false), formal(primPair(), "max", false, false)); #line 1648 "runtime.in" addFunc(ve, run::gen52, primVoid(), "texpreamble", formal(primString() , "s", false, false)); #line 1656 "runtime.in" addFunc(ve, run::gen53, primVoid(), "deletepreamble"); #line 1663 "runtime.in" addFunc(ve, run::gen54, primVoid(), "_labelpath", formal(primPicture(), "f", false, false), formal(primString() , "s", false, false), formal(primString() , "size", false, false), formal(primPath(), "g", false, false), formal(primString() , "justify", false, false), formal(primPair(), "offset", false, false), formal(primPen(), "p", false, false)); #line 1669 "runtime.in" addFunc(ve, run::gen55, primVoid(), "texreset"); #line 1677 "runtime.in" addFunc(ve, run::gen56, primVoid(), "layer", formal(primPicture(), "f", false, false)); #line 1682 "runtime.in" addFunc(ve, run::gen57, primVoid(), "newpage", formal(primPicture(), "f", false, false)); #line 1687 "runtime.in" addFunc(ve, run::gen58, primVoid(), "_image", formal(primPicture(), "f", false, false), formal(realArray2(), "data", false, false), formal(primPair(), "initial", false, false), formal(primPair(), "final", false, false), formal(penArray() , "palette", true, false), formal(primTransform(), "t", true, false), formal(primBoolean(), "copy", true, false), formal(primBoolean(), "antialias", true, false)); #line 1697 "runtime.in" addFunc(ve, run::gen59, primVoid(), "_image", formal(primPicture(), "f", false, false), formal(penArray2() , "data", false, false), formal(primPair(), "initial", false, false), formal(primPair(), "final", false, false), formal(primTransform(), "t", true, false), formal(primBoolean(), "copy", true, false), formal(primBoolean(), "antialias", true, false)); #line 1704 "runtime.in" addFunc(ve, run::gen60, primString() , "nativeformat"); #line 1709 "runtime.in" addFunc(ve, run::gen61, primBoolean(), "latex"); #line 1714 "runtime.in" addFunc(ve, run::gen62, primBoolean(), "pdf"); #line 1719 "runtime.in" addFunc(ve, run::gen63, primVoid(), "shipout", formal(primString() , "prefix", true, false), formal(primPicture(), "f", false, false), formal(primPicture(), "preamble", true, false), formal(primString() , "format", true, false), formal(primBoolean(), "wait", true, false), formal(primBoolean(), "view", true, false), formal(transformFunction(), "xform", false, false)); #line 1765 "runtime.in" addFunc(ve, run::gen64, primVoid(), "shipout3", formal(primString() , "prefix", false, false), formal(primPicture(), "f", false, false), formal(primString() , "format", true, false), formal(primReal(), "width", false, false), formal(primReal(), "height", false, false), formal(primReal(), "angle", false, false), formal(primTriple(), "m", false, false), formal(primTriple(), "m", false, false), formal(realArray2(), "t", false, false), formal(realArray(), "background", false, false), formal(tripleArray(), "lights", false, false), formal(realArray2(), "diffuse", false, false), formal(realArray2(), "ambient", false, false), formal(realArray2(), "specular", false, false), formal(primBoolean(), "viewportlighting", false, false), formal(primBoolean(), "view", true, false)); #line 1781 "runtime.in" addFunc(ve, run::gen65, primVoid(), "shipout3", formal(primString() , "prefix", false, false), formal(primPicture(), "f", false, false)); #line 1786 "runtime.in" addFunc(ve, run::gen66, primVoid(), "deconstruct", formal(primPicture(), "f", false, false), formal(primPicture(), "preamble", true, false), formal(primReal(), "magnification", true, false), formal(transformFunction(), "xform", false, false)); #line 1919 "runtime.in" addFunc(ve, run::gen67, primVoid(), "purge", formal(primInt(), "divisor", true, false)); #line 1932 "runtime.in" addFunc(ve, run::gen69, primBoolean(), "==", formal(primPen(), "a", false, false), formal(primPen(), "b", false, false)); #line 1937 "runtime.in" addFunc(ve, run::gen70, primBoolean(), "!=", formal(primPen(), "a", false, false), formal(primPen(), "b", false, false)); #line 1942 "runtime.in" addFunc(ve, run::gen71, primPen(), "+", formal(primPen(), "a", false, false), formal(primPen(), "b", false, false)); #line 1947 "runtime.in" addFunc(ve, run::gen72, primPen(), "*", formal(primReal(), "a", false, false), formal(primPen(), "b", false, false)); #line 1952 "runtime.in" addFunc(ve, run::gen73, primPen(), "*", formal(primPen(), "a", false, false), formal(primReal(), "b", false, false)); #line 1957 "runtime.in" addFunc(ve, run::gen74, primPair(), "max", formal(primPen(), "p", false, false)); #line 1962 "runtime.in" addFunc(ve, run::gen75, primPair(), "min", formal(primPen(), "p", false, false)); #line 1967 "runtime.in" addFunc(ve, run::gen76, primVoid(), "resetdefaultpen"); #line 1973 "runtime.in" addFunc(ve, run::gen77, primVoid(), "defaultpen", formal(primPen(), "p", false, false)); #line 1978 "runtime.in" addFunc(ve, run::gen78, primPen(), "defaultpen"); #line 1983 "runtime.in" addFunc(ve, run::gen79, primBoolean(), "invisible", formal(primPen(), "p", false, false)); #line 1988 "runtime.in" addFunc(ve, run::gen80, primPen(), "invisible"); #line 1993 "runtime.in" addFunc(ve, run::gen81, primPen(), "gray", formal(primPen(), "p", false, false)); #line 1999 "runtime.in" addFunc(ve, run::gen82, primPen(), "rgb", formal(primPen(), "p", false, false)); #line 2005 "runtime.in" addFunc(ve, run::gen83, primPen(), "cmyk", formal(primPen(), "p", false, false)); #line 2011 "runtime.in" addFunc(ve, run::gen84, primPen(), "interp", formal(primPen(), "a", false, false), formal(primPen(), "b", false, false), formal(primReal(), "t", false, false)); #line 2016 "runtime.in" addFunc(ve, run::gen85, primPen(), "rgb", formal(primReal(), "r", false, false), formal(primReal(), "g", false, false), formal(primReal(), "b", false, false)); #line 2021 "runtime.in" addFunc(ve, run::gen86, primPen(), "cmyk", formal(primReal(), "c", false, false), formal(primReal(), "m", false, false), formal(primReal(), "y", false, false), formal(primReal(), "k", false, false)); #line 2026 "runtime.in" addFunc(ve, run::gen87, primPen(), "gray", formal(primReal(), "gray", false, false)); #line 2031 "runtime.in" addFunc(ve, run::gen88, realArray(), "colors", formal(primPen(), "p", false, false)); #line 2059 "runtime.in" addFunc(ve, run::gen89, primString() , "colorspace", formal(primPen(), "p", false, false)); #line 2066 "runtime.in" addFunc(ve, run::gen90, primPen(), "pattern", formal(primString(), "s", false, false)); #line 2071 "runtime.in" addFunc(ve, run::gen91, primString() , "pattern", formal(primPen(), "p", false, false)); #line 2076 "runtime.in" addFunc(ve, run::gen92, primPen(), "fillrule", formal(primInt(), "n", false, false)); #line 2081 "runtime.in" addFunc(ve, run::gen93, primInt(), "fillrule", formal(primPen(), "p", false, false)); #line 2086 "runtime.in" addFunc(ve, run::gen94, primPen(), "opacity", formal(primReal(), "opacity", true, false), formal(primString() , "blend", true, false)); #line 2096 "runtime.in" addFunc(ve, run::gen95, primReal(), "opacity", formal(primPen(), "p", false, false)); #line 2101 "runtime.in" addFunc(ve, run::gen96, primString() , "blend", formal(primPen(), "p", false, false)); #line 2106 "runtime.in" addFunc(ve, run::gen97, primPen(), "linetype", formal(primString(), "s", false, false), formal(primReal(), "offset", true, false), formal(primBoolean(), "scale", true, false), formal(primBoolean(), "adjust", true, false)); #line 2111 "runtime.in" addFunc(ve, run::gen98, primString() , "linetype", formal(primPen(), "p", true, false)); #line 2116 "runtime.in" addFunc(ve, run::gen99, primReal(), "offset", formal(primPen(), "p", false, false)); #line 2121 "runtime.in" addFunc(ve, run::gen100, primBoolean(), "scale", formal(primPen(), "p", false, false)); #line 2126 "runtime.in" addFunc(ve, run::gen101, primBoolean(), "adjust", formal(primPen(), "p", false, false)); #line 2131 "runtime.in" addFunc(ve, run::gen102, primPen(), "adjust", formal(primPen(), "p", false, false), formal(primReal(), "arclength", false, false), formal(primBoolean(), "cyclic", false, false)); #line 2136 "runtime.in" addFunc(ve, run::gen103, primPen(), "linecap", formal(primInt(), "n", false, false)); #line 2141 "runtime.in" addFunc(ve, run::gen104, primInt(), "linecap", formal(primPen(), "p", true, false)); #line 2146 "runtime.in" addFunc(ve, run::gen105, primPen(), "linejoin", formal(primInt(), "n", false, false)); #line 2151 "runtime.in" addFunc(ve, run::gen106, primInt(), "linejoin", formal(primPen(), "p", true, false)); #line 2156 "runtime.in" addFunc(ve, run::gen107, primPen(), "miterlimit", formal(primReal(), "x", false, false)); #line 2161 "runtime.in" addFunc(ve, run::gen108, primReal(), "miterlimit", formal(primPen(), "p", true, false)); #line 2166 "runtime.in" addFunc(ve, run::gen109, primPen(), "linewidth", formal(primReal(), "x", false, false)); #line 2171 "runtime.in" addFunc(ve, run::gen110, primReal(), "linewidth", formal(primPen(), "p", true, false)); #line 2176 "runtime.in" addFunc(ve, run::gen111, primPen(), "fontcommand", formal(primString(), "s", false, false)); #line 2181 "runtime.in" addFunc(ve, run::gen112, primString() , "font", formal(primPen(), "p", true, false)); #line 2186 "runtime.in" addFunc(ve, run::gen113, primPen(), "fontsize", formal(primReal(), "size", false, false), formal(primReal(), "lineskip", false, false)); #line 2192 "runtime.in" addFunc(ve, run::gen114, primReal(), "fontsize", formal(primPen(), "p", true, false)); #line 2197 "runtime.in" addFunc(ve, run::gen115, primReal(), "lineskip", formal(primPen(), "p", true, false)); #line 2202 "runtime.in" addFunc(ve, run::gen116, primPen(), "overwrite", formal(primInt(), "n", false, false)); #line 2208 "runtime.in" addFunc(ve, run::gen117, primInt(), "overwrite", formal(primPen(), "p", true, false)); #line 2213 "runtime.in" addFunc(ve, run::gen118, primPen(), "basealign", formal(primInt(), "n", false, false)); #line 2218 "runtime.in" addFunc(ve, run::gen119, primInt(), "basealign", formal(primPen(), "p", true, false)); #line 2223 "runtime.in" addFunc(ve, run::gen120, primTransform(), "transform", formal(primPen(), "p", false, false)); #line 2228 "runtime.in" addFunc(ve, run::gen121, primPath(), "nib", formal(primPen(), "p", false, false)); #line 2233 "runtime.in" addFunc(ve, run::gen122, primPen(), "makepen", formal(primPath(), "p", false, false)); #line 2238 "runtime.in" addFunc(ve, run::gen123, primPen(), "colorless", formal(primPen(), "p", false, false)); #line 2244 "runtime.in" addFunc(ve, run::gen124, primBoolean(), "interactive"); #line 2251 "runtime.in" addFunc(ve, run::gen125, primBoolean(), "uptodate"); #line 2256 "runtime.in" addFunc(ve, run::gen126, primInt(), "system", formal(primString() , "s", false, false)); #line 2266 "runtime.in" addFunc(ve, run::gen127, primBoolean(), "view"); #line 2271 "runtime.in" addFunc(ve, run::gen128, primString() , "asydir"); #line 2276 "runtime.in" addFunc(ve, run::gen129, primString() , "locale", formal(primString() , "s", true, false)); #line 2282 "runtime.in" addFunc(ve, run::gen130, primVoid(), "abort", formal(primString() , "s", true, false)); #line 2288 "runtime.in" addFunc(ve, run::gen131, primVoid(), "exit"); #line 2293 "runtime.in" addFunc(ve, run::gen132, primVoid(), "assert", formal(primBoolean(), "b", false, false), formal(primString() , "s", true, false)); #line 2304 "runtime.in" addFunc(ve, run::gen133, primVoid(), "sleep", formal(primInt(), "seconds", false, false)); #line 2310 "runtime.in" addFunc(ve, run::gen134, primVoid(), "usleep", formal(primInt(), "microseconds", false, false)); #line 2316 "runtime.in" addFunc(ve, run::gen135, primVoid(), "_eval", formal(primString(), "s", false, false), formal(primBoolean(), "embedded", false, false), formal(primBoolean(), "interactivewrite", true, false)); #line 2331 "runtime.in" addFunc(ve, run::gen136, primVoid(), "_eval", formal(primCode(), "s", false, false), formal(primBoolean(), "embedded", false, false)); #line 2349 "runtime.in" addFunc(ve, run::gen137, primString() , "location"); #line 2361 "runtime.in" addFunc(ve, run::gen139, primString() , "cd", formal(primString() , "s", true, false)); #line 2367 "runtime.in" addFunc(ve, run::gen140, primVoid(), "list", formal(primString(), "s", false, false), formal(primBoolean(), "imports", true, false)); #line 2384 "runtime.in" addFunc(ve, run::gen142, primBoolean(), "==", formal(primPath(), "a", false, false), formal(primPath(), "b", false, false)); #line 2389 "runtime.in" addFunc(ve, run::gen143, primBoolean(), "!=", formal(primPath(), "a", false, false), formal(primPath(), "b", false, false)); #line 2394 "runtime.in" addFunc(ve, run::gen144, primPair(), "point", formal(primPath(), "p", false, false), formal(primInt(), "t", false, false)); #line 2399 "runtime.in" addFunc(ve, run::gen145, primPair(), "point", formal(primPath(), "p", false, false), formal(primReal(), "t", false, false)); #line 2404 "runtime.in" addFunc(ve, run::gen146, primPair(), "precontrol", formal(primPath(), "p", false, false), formal(primInt(), "t", false, false)); #line 2409 "runtime.in" addFunc(ve, run::gen147, primPair(), "precontrol", formal(primPath(), "p", false, false), formal(primReal(), "t", false, false)); #line 2414 "runtime.in" addFunc(ve, run::gen148, primPair(), "postcontrol", formal(primPath(), "p", false, false), formal(primInt(), "t", false, false)); #line 2419 "runtime.in" addFunc(ve, run::gen149, primPair(), "postcontrol", formal(primPath(), "p", false, false), formal(primReal(), "t", false, false)); #line 2424 "runtime.in" addFunc(ve, run::gen150, primPair(), "dir", formal(primPath(), "p", false, false), formal(primInt(), "t", false, false), formal(primInt(), "sign", true, false), formal(primBoolean(), "normalize", true, false)); #line 2429 "runtime.in" addFunc(ve, run::gen151, primPair(), "dir", formal(primPath(), "p", false, false), formal(primReal(), "t", false, false), formal(primBoolean(), "normalize", true, false)); #line 2434 "runtime.in" addFunc(ve, run::gen152, primPair(), "accel", formal(primPath(), "p", false, false), formal(primInt(), "t", false, false), formal(primInt(), "sign", true, false)); #line 2439 "runtime.in" addFunc(ve, run::gen153, primPair(), "accel", formal(primPath(), "p", false, false), formal(primReal(), "t", false, false)); #line 2444 "runtime.in" addFunc(ve, run::gen154, primReal(), "radius", formal(primPath(), "p", false, false), formal(primReal(), "t", false, false)); #line 2456 "runtime.in" addFunc(ve, run::gen155, primPath(), "reverse", formal(primPath(), "p", false, false)); #line 2461 "runtime.in" addFunc(ve, run::gen156, primPath(), "subpath", formal(primPath(), "p", false, false), formal(primInt(), "a", false, false), formal(primInt(), "b", false, false)); #line 2466 "runtime.in" addFunc(ve, run::gen157, primPath(), "subpath", formal(primPath(), "p", false, false), formal(primReal(), "a", false, false), formal(primReal(), "b", false, false)); #line 2471 "runtime.in" addFunc(ve, run::gen158, primPath(), "nurb", formal(primPair(), "z0", false, false), formal(primPair(), "z1", false, false), formal(primPair(), "z2", false, false), formal(primPair(), "z3", false, false), formal(primReal(), "w0", false, false), formal(primReal(), "w1", false, false), formal(primReal(), "w2", false, false), formal(primReal(), "w3", false, false), formal(primInt(), "m", false, false)); #line 2477 "runtime.in" addFunc(ve, run::gen159, primInt(), "length", formal(primPath(), "p", false, false)); #line 2482 "runtime.in" addFunc(ve, run::gen160, primBoolean(), "cyclic", formal(primPath(), "p", false, false)); #line 2487 "runtime.in" addFunc(ve, run::gen161, primBoolean(), "straight", formal(primPath(), "p", false, false), formal(primInt(), "t", false, false)); #line 2492 "runtime.in" addFunc(ve, run::gen162, primPath(), "unstraighten", formal(primPath(), "p", false, false)); #line 2497 "runtime.in" addFunc(ve, run::gen163, primBoolean(), "piecewisestraight", formal(primPath(), "p", false, false)); #line 2502 "runtime.in" addFunc(ve, run::gen164, primReal(), "arclength", formal(primPath(), "p", false, false)); #line 2507 "runtime.in" addFunc(ve, run::gen165, primReal(), "arctime", formal(primPath(), "p", false, false), formal(primReal(), "dval", false, false)); #line 2512 "runtime.in" addFunc(ve, run::gen166, primReal(), "dirtime", formal(primPath(), "p", false, false), formal(primPair(), "z", false, false)); #line 2517 "runtime.in" addFunc(ve, run::gen167, realArray(), "intersect", formal(primPath(), "p", false, false), formal(primPath(), "q", false, false), formal(primReal(), "fuzz", true, false)); #line 2534 "runtime.in" addFunc(ve, run::gen168, realArray2(), "intersections", formal(primPath(), "p", false, false), formal(primPath(), "q", false, false), formal(primReal(), "fuzz", true, false)); #line 2565 "runtime.in" addFunc(ve, run::gen169, realArray(), "intersections", formal(primPath(), "p", false, false), formal(primPair(), "a", false, true), formal(primPair(), "b", false, true), formal(primReal(), "fuzz", true, false)); #line 2580 "runtime.in" addFunc(ve, run::gen170, primPair(), "extension", formal(primPair(), "p", false, false), formal(primPair(), "q", false, false), formal(primPair(), "p", false, false), formal(primPair(), "q", false, false)); #line 2591 "runtime.in" addFunc(ve, run::gen171, primInt(), "size", formal(primPath(), "p", false, false)); #line 2596 "runtime.in" addFunc(ve, run::gen172, primPath(), "&", formal(primPath(), "p", false, false), formal(primPath(), "q", false, false)); #line 2601 "runtime.in" addFunc(ve, run::gen173, primPair(), "min", formal(primPath(), "p", false, false)); #line 2606 "runtime.in" addFunc(ve, run::gen174, primPair(), "max", formal(primPath(), "p", false, false)); #line 2611 "runtime.in" addFunc(ve, run::gen175, realArray(), "mintimes", formal(primPath(), "p", false, false)); #line 2620 "runtime.in" addFunc(ve, run::gen176, realArray(), "maxtimes", formal(primPath(), "p", false, false)); #line 2629 "runtime.in" addFunc(ve, run::gen177, primReal(), "relativedistance", formal(primReal(), "theta", false, false), formal(primReal(), "phi", false, false), formal(primReal(), "t", false, false), formal(primBoolean(), "atleast", false, false)); #line 2634 "runtime.in" addFunc(ve, run::gen178, primInt(), "windingnumber", formal(pathArray() , "p", false, false), formal(primPair(), "z", false, false)); #line 2639 "runtime.in" addFunc(ve, run::gen179, primBoolean(), "inside", formal(pathArray() , "g", false, true), formal(primPair(), "z", false, false), formal(primPen(), "fillrule", true, false)); #line 2644 "runtime.in" addFunc(ve, run::gen180, primBoolean(), "inside", formal(primPath(), "g", false, false), formal(primPair(), "z", false, false), formal(primPen(), "fillrule", true, false)); #line 2649 "runtime.in" addFunc(ve, run::gen181, primReal(), "side", formal(primPair(), "a", false, false), formal(primPair(), "b", false, false), formal(primPair(), "c", false, false)); #line 2656 "runtime.in" addFunc(ve, run::gen182, primReal(), "incircle", formal(primPair(), "a", false, false), formal(primPair(), "b", false, false), formal(primPair(), "c", false, false), formal(primPair(), "d", false, false)); #line 2664 "runtime.in" addFunc(ve, run::gen183, primPath3(), "path3", formal(tripleArray(), "pre", false, false), formal(tripleArray(), "point", false, false), formal(tripleArray(), "post", false, false), formal(boolArray(), "straight", false, false), formal(primBoolean(), "cyclic", false, false)); #line 2689 "runtime.in" addFunc(ve, run::gen185, primBoolean(), "==", formal(primPath3(), "a", false, false), formal(primPath3(), "b", false, false)); #line 2694 "runtime.in" addFunc(ve, run::gen186, primBoolean(), "!=", formal(primPath3(), "a", false, false), formal(primPath3(), "b", false, false)); #line 2699 "runtime.in" addFunc(ve, run::gen187, primTriple(), "point", formal(primPath3(), "p", false, false), formal(primInt(), "t", false, false)); #line 2704 "runtime.in" addFunc(ve, run::gen188, primTriple(), "point", formal(primPath3(), "p", false, false), formal(primReal(), "t", false, false)); #line 2709 "runtime.in" addFunc(ve, run::gen189, primTriple(), "precontrol", formal(primPath3(), "p", false, false), formal(primInt(), "t", false, false)); #line 2714 "runtime.in" addFunc(ve, run::gen190, primTriple(), "precontrol", formal(primPath3(), "p", false, false), formal(primReal(), "t", false, false)); #line 2719 "runtime.in" addFunc(ve, run::gen191, primTriple(), "postcontrol", formal(primPath3(), "p", false, false), formal(primInt(), "t", false, false)); #line 2724 "runtime.in" addFunc(ve, run::gen192, primTriple(), "postcontrol", formal(primPath3(), "p", false, false), formal(primReal(), "t", false, false)); #line 2729 "runtime.in" addFunc(ve, run::gen193, primTriple(), "dir", formal(primPath3(), "p", false, false), formal(primInt(), "t", false, false), formal(primInt(), "sign", true, false), formal(primBoolean(), "normalize", true, false)); #line 2734 "runtime.in" addFunc(ve, run::gen194, primTriple(), "dir", formal(primPath3(), "p", false, false), formal(primReal(), "t", false, false), formal(primBoolean(), "normalize", true, false)); #line 2739 "runtime.in" addFunc(ve, run::gen195, primTriple(), "accel", formal(primPath3(), "p", false, false), formal(primInt(), "t", false, false), formal(primInt(), "sign", true, false)); #line 2744 "runtime.in" addFunc(ve, run::gen196, primTriple(), "accel", formal(primPath3(), "p", false, false), formal(primReal(), "t", false, false)); #line 2749 "runtime.in" addFunc(ve, run::gen197, primReal(), "radius", formal(primPath3(), "p", false, false), formal(primReal(), "t", false, false)); #line 2761 "runtime.in" addFunc(ve, run::gen198, primReal(), "radius", formal(primTriple(), "z0", false, false), formal(primTriple(), "c0", false, false), formal(primTriple(), "c1", false, false), formal(primTriple(), "z1", false, false), formal(primReal(), "t", false, false)); #line 2773 "runtime.in" addFunc(ve, run::gen199, primPath3(), "reverse", formal(primPath3(), "p", false, false)); #line 2778 "runtime.in" addFunc(ve, run::gen200, primPath3(), "subpath", formal(primPath3(), "p", false, false), formal(primInt(), "a", false, false), formal(primInt(), "b", false, false)); #line 2783 "runtime.in" addFunc(ve, run::gen201, primPath3(), "subpath", formal(primPath3(), "p", false, false), formal(primReal(), "a", false, false), formal(primReal(), "b", false, false)); #line 2788 "runtime.in" addFunc(ve, run::gen202, primInt(), "length", formal(primPath3(), "p", false, false)); #line 2793 "runtime.in" addFunc(ve, run::gen203, primBoolean(), "cyclic", formal(primPath3(), "p", false, false)); #line 2798 "runtime.in" addFunc(ve, run::gen204, primBoolean(), "straight", formal(primPath3(), "p", false, false), formal(primInt(), "t", false, false)); #line 2803 "runtime.in" addFunc(ve, run::gen205, primTriple(), "perp", formal(primTriple(), "v", false, false), formal(primTriple(), "u", false, false)); #line 2809 "runtime.in" addFunc(ve, run::gen206, primReal(), "straightness", formal(primPath3(), "p", false, false), formal(primInt(), "t", false, false)); #line 2820 "runtime.in" addFunc(ve, run::gen207, primReal(), "straightness", formal(primTriple(), "z0", false, false), formal(primTriple(), "c0", false, false), formal(primTriple(), "c1", false, false), formal(primTriple(), "z1", false, false)); #line 2828 "runtime.in" addFunc(ve, run::gen208, primBoolean(), "piecewisestraight", formal(primPath3(), "p", false, false)); #line 2833 "runtime.in" addFunc(ve, run::gen209, primReal(), "arclength", formal(primPath3(), "p", false, false)); #line 2838 "runtime.in" addFunc(ve, run::gen210, primReal(), "arctime", formal(primPath3(), "p", false, false), formal(primReal(), "dval", false, false)); #line 2843 "runtime.in" addFunc(ve, run::gen211, realArray(), "intersect", formal(primPath3(), "p", false, false), formal(primPath3(), "q", false, false), formal(primReal(), "fuzz", true, false)); #line 2861 "runtime.in" addFunc(ve, run::gen212, realArray2(), "intersections", formal(primPath3(), "p", false, false), formal(primPath3(), "q", false, false), formal(primReal(), "fuzz", true, false)); #line 2894 "runtime.in" addFunc(ve, run::gen213, realArray2(), "intersections", formal(primPath3(), "p", false, false), formal(tripleArray2(), "p", false, false), formal(primReal(), "fuzz", true, false)); #line 2914 "runtime.in" addFunc(ve, run::gen214, primInt(), "size", formal(primPath3(), "p", false, false)); #line 2919 "runtime.in" addFunc(ve, run::gen215, primPath3(), "&", formal(primPath3(), "p", false, false), formal(primPath3(), "q", false, false)); #line 2924 "runtime.in" addFunc(ve, run::gen216, primTriple(), "min", formal(primPath3(), "p", false, false)); #line 2929 "runtime.in" addFunc(ve, run::gen217, primTriple(), "max", formal(primPath3(), "p", false, false)); #line 2934 "runtime.in" addFunc(ve, run::gen218, realArray(), "mintimes", formal(primPath3(), "p", false, false)); #line 2944 "runtime.in" addFunc(ve, run::gen219, realArray(), "maxtimes", formal(primPath3(), "p", false, false)); #line 2954 "runtime.in" addFunc(ve, run::gen220, primPath3(), "*", formal(realArray2(), "t", false, false), formal(primPath3(), "g", false, false)); #line 3009 "runtime.in" addFunc(ve, run::gen225, primGuide(), "operator cast", formal(primCycleToken(), "tok", false, false)); #line 3016 "runtime.in" addFunc(ve, run::gen226, primGuide(), "operator spec", formal(primPair(), "z", false, false), formal(primInt(), "p", false, false)); #line 3024 "runtime.in" addFunc(ve, run::gen227, primCurlSpecifier(), "operator curl", formal(primReal(), "gamma", false, false), formal(primInt(), "p", false, false)); #line 3040 "runtime.in" addFunc(ve, run::gen230, primGuide(), "operator cast", formal(primCurlSpecifier(), "spec", false, false)); #line 3045 "runtime.in" addFunc(ve, run::gen231, primTensionSpecifier(), "operator tension", formal(primReal(), "tout", false, false), formal(primReal(), "tin", false, false), formal(primBoolean(), "atleast", false, false)); #line 3065 "runtime.in" addFunc(ve, run::gen235, primGuide(), "operator cast", formal(primTensionSpecifier(), "t", false, false)); #line 3070 "runtime.in" addFunc(ve, run::gen236, primGuide(), "operator controls", formal(primPair(), "zout", false, false), formal(primPair(), "zin", false, false)); #line 3075 "runtime.in" addFunc(ve, run::gen237, primInt(), "size", formal(primGuide(), "g", false, false)); #line 3082 "runtime.in" addFunc(ve, run::gen238, primInt(), "length", formal(primGuide(), "g", false, false)); #line 3089 "runtime.in" addFunc(ve, run::gen239, primBoolean(), "cyclic", formal(primGuide(), "g", false, false)); #line 3096 "runtime.in" addFunc(ve, run::gen240, primPair(), "point", formal(primGuide(), "g", false, false), formal(primInt(), "t", false, false)); #line 3103 "runtime.in" addFunc(ve, run::gen241, pairArray(), "dirSpecifier", formal(primGuide(), "g", false, false), formal(primInt(), "t", false, false)); #line 3115 "runtime.in" addFunc(ve, run::gen242, pairArray(), "controlSpecifier", formal(primGuide(), "g", false, false), formal(primInt(), "t", false, false)); #line 3132 "runtime.in" addFunc(ve, run::gen243, primTensionSpecifier(), "tensionSpecifier", formal(primGuide(), "g", false, false), formal(primInt(), "t", false, false)); #line 3142 "runtime.in" addFunc(ve, run::gen244, realArray(), "curlSpecifier", formal(primGuide(), "g", false, false), formal(primInt(), "t", false, false)); #line 3156 "runtime.in" addFunc(ve, run::gen245, primGuide(), "reverse", formal(primGuide(), "g", false, false)); #line 3210 "runtime.in" addFunc(ve, run::gen246, primVoid(), "_draw", formal(primPicture(), "f", false, false), formal(primPath3(), "g", false, false), formal(primPen(), "p", false, false)); #line 3219 "runtime.in" addFunc(ve, run::gen247, primVoid(), "draw", formal(primPicture(), "f", false, false), formal(tripleArray2(), "g", false, false), formal(primBoolean(), "straight", false, false), formal(penArray() , "p", false, false), formal(primReal(), "opacity", false, false), formal(primReal(), "shininess", false, false), formal(primReal(), "granularity", false, false), formal(primTriple(), "normal", false, false), formal(primBoolean(), "lighton", false, false), formal(penArray() , "colors", false, false)); #line 3227 "runtime.in" addFunc(ve, run::gen248, primTriple(), "min3", formal(primPicture(), "f", false, false)); #line 3232 "runtime.in" addFunc(ve, run::gen249, primTriple(), "max3", formal(primPicture(), "f", false, false)); #line 3237 "runtime.in" addFunc(ve, run::gen250, primPair(), "min", formal(primPicture(), "f", false, false), formal(realArray2(), "t", false, false)); #line 3245 "runtime.in" addFunc(ve, run::gen251, primPair(), "max", formal(primPicture(), "f", false, false), formal(realArray2(), "t", false, false)); #line 3253 "runtime.in" addFunc(ve, run::gen252, primPair(), "minratio", formal(primPicture(), "f", false, false)); #line 3258 "runtime.in" addFunc(ve, run::gen253, primPair(), "maxratio", formal(primPicture(), "f", false, false)); #line 3263 "runtime.in" addFunc(ve, run::gen254, primTriple(), "minbound", formal(tripleArray2(), "p", false, false), formal(primTriple(), "b", false, false)); #line 3273 "runtime.in" addFunc(ve, run::gen255, primTriple(), "maxbound", formal(tripleArray2(), "p", false, false), formal(primTriple(), "b", false, false)); #line 3283 "runtime.in" addFunc(ve, run::gen256, primPair(), "minbound", formal(tripleArray2(), "p", false, false), formal(realArray2(), "t", false, false), formal(primPair(), "b", false, false)); #line 3295 "runtime.in" addFunc(ve, run::gen257, primPair(), "maxbound", formal(tripleArray2(), "p", false, false), formal(realArray2(), "t", false, false), formal(primPair(), "b", false, false)); #line 3307 "runtime.in" addFunc(ve, run::gen258, primPair(), "max", formal(primPath3(), "g", false, false), formal(realArray2(), "t", false, false)); #line 3315 "runtime.in" addFunc(ve, run::gen259, primPair(), "min", formal(primPath3(), "g", false, false), formal(realArray2(), "t", false, false)); #line 3323 "runtime.in" addFunc(ve, run::gen260, primReal(), "change2", formal(tripleArray2(), "a", false, false)); #line 3345 "runtime.in" addFunc(ve, run::gen261, primBoolean(), "is3D", formal(primPicture(), "f", false, false)); #line 3350 "runtime.in" addFunc(ve, run::gen262, primPair(), "bezier", formal(primPair(), "a", false, false), formal(primPair(), "b", false, false), formal(primPair(), "c", false, false), formal(primPair(), "d", false, false), formal(primReal(), "t", false, false)); #line 3357 "runtime.in" addFunc(ve, run::gen263, primPair(), "bezierP", formal(primPair(), "a", false, false), formal(primPair(), "b", false, false), formal(primPair(), "c", false, false), formal(primPair(), "d", false, false), formal(primReal(), "t", false, false)); #line 3362 "runtime.in" addFunc(ve, run::gen264, primPair(), "bezierPP", formal(primPair(), "a", false, false), formal(primPair(), "b", false, false), formal(primPair(), "c", false, false), formal(primPair(), "d", false, false), formal(primReal(), "t", false, false)); #line 3367 "runtime.in" addFunc(ve, run::gen265, primPair(), "bezierPPP", formal(primPair(), "a", false, false), formal(primPair(), "b", false, false), formal(primPair(), "c", false, false), formal(primPair(), "d", false, false)); #line 3372 "runtime.in" addFunc(ve, run::gen266, primTriple(), "bezier", formal(primTriple(), "a", false, false), formal(primTriple(), "b", false, false), formal(primTriple(), "c", false, false), formal(primTriple(), "d", false, false), formal(primReal(), "t", false, false)); #line 3379 "runtime.in" addFunc(ve, run::gen267, primTriple(), "bezierP", formal(primTriple(), "a", false, false), formal(primTriple(), "b", false, false), formal(primTriple(), "c", false, false), formal(primTriple(), "d", false, false), formal(primReal(), "t", false, false)); #line 3384 "runtime.in" addFunc(ve, run::gen268, primTriple(), "bezierPP", formal(primTriple(), "a", false, false), formal(primTriple(), "b", false, false), formal(primTriple(), "c", false, false), formal(primTriple(), "d", false, false), formal(primReal(), "t", false, false)); #line 3389 "runtime.in" addFunc(ve, run::gen269, primTriple(), "bezierPPP", formal(primTriple(), "a", false, false), formal(primTriple(), "b", false, false), formal(primTriple(), "c", false, false), formal(primTriple(), "d", false, false)); #line 3402 "runtime.in" addFunc(ve, run::gen271, primInt(), "length", formal(primString(), "s", false, false)); #line 3407 "runtime.in" addFunc(ve, run::gen272, primInt(), "find", formal(primString(), "s", false, false), formal(primString() , "t", false, false), formal(primInt(), "pos", true, false)); #line 3413 "runtime.in" addFunc(ve, run::gen273, primInt(), "rfind", formal(primString(), "s", false, false), formal(primString() , "t", false, false), formal(primInt(), "pos", true, false)); #line 3419 "runtime.in" addFunc(ve, run::gen274, primString() , "reverse", formal(primString() , "s", false, false)); #line 3425 "runtime.in" addFunc(ve, run::gen275, primString() , "insert", formal(primString() , "s", false, false), formal(primInt(), "pos", false, false), formal(primString() , "t", false, false)); #line 3432 "runtime.in" addFunc(ve, run::gen276, primString() , "substr", formal(primString(), "s", false, false), formal(primInt(), "pos", false, false), formal(primInt(), "n", true, false)); #line 3439 "runtime.in" addFunc(ve, run::gen277, primString() , "erase", formal(primString() , "s", false, false), formal(primInt(), "pos", false, false), formal(primInt(), "n", false, false)); #line 3446 "runtime.in" addFunc(ve, run::gen278, primString() , "downcase", formal(primString() , "s", false, false)); #line 3452 "runtime.in" addFunc(ve, run::gen279, primString() , "upcase", formal(primString() , "s", false, false)); #line 3458 "runtime.in" addFunc(ve, run::gen280, primString() , "replace", formal(primString(), "s", false, false), formal(stringArray2(), "translate", false, false)); #line 3485 "runtime.in" addFunc(ve, run::gen281, primString() , "format", formal(primString(), "format", false, false), formal(primInt(), "x", false, false)); #line 3500 "runtime.in" addFunc(ve, run::gen282, primString() , "format", formal(primString(), "format", false, false), formal(primReal(), "x", false, false), formal(primString() , "locale", true, false)); #line 3618 "runtime.in" addFunc(ve, run::gen283, primInt(), "hex", formal(primString() , "s", false, false)); #line 3629 "runtime.in" addFunc(ve, run::gen284, primString() , "string", formal(primInt(), "x", false, false)); #line 3636 "runtime.in" addFunc(ve, run::gen285, primString() , "string", formal(primReal(), "x", false, false), formal(primInt(), "digits", true, false)); #line 3644 "runtime.in" addFunc(ve, run::gen286, primString() , "time", formal(primString() , "format", true, false)); #line 3655 "runtime.in" addFunc(ve, run::gen287, primString() , "time", formal(primInt(), "seconds", false, false), formal(primString() , "format", true, false)); #line 3668 "runtime.in" addFunc(ve, run::gen288, primInt(), "seconds", formal(primString() , "t", true, false), formal(primString() , "format", true, false)); #line 3680 "runtime.in" addFunc(ve, run::gen289, realArray(), "_cputime"); #line 3694 "runtime.in" addFunc(ve, run::gen290, primReal(), "^", formal(primReal(), "x", false, false), formal(primInt(), "y", false, false)); #line 3702 "runtime.in" addFunc(ve, run::gen291, primPair(), "^", formal(primPair(), "z", false, false), formal(primInt(), "y", false, false)); #line 3707 "runtime.in" addFunc(ve, run::gen292, primInt(), "quotient", formal(primInt(), "x", false, false), formal(primInt(), "y", false, false)); #line 3715 "runtime.in" addFunc(ve, run::gen293, primInt(), "abs", formal(primInt(), "x", false, false)); #line 3720 "runtime.in" addFunc(ve, run::gen294, primInt(), "sgn", formal(primReal(), "x", false, false)); #line 3725 "runtime.in" addFunc(ve, run::gen295, primInt(), "rand"); #line 3730 "runtime.in" addFunc(ve, run::gen296, primVoid(), "srand", formal(primInt(), "seed", false, false)); #line 3735 "runtime.in" addFunc(ve, run::gen297, primReal(), "unitrand"); #line 3741 "runtime.in" addFunc(ve, run::gen298, primInt(), "ceil", formal(primReal(), "x", false, false)); #line 3746 "runtime.in" addFunc(ve, run::gen299, primInt(), "floor", formal(primReal(), "x", false, false)); #line 3751 "runtime.in" addFunc(ve, run::gen300, primInt(), "round", formal(primReal(), "x", false, false)); #line 3757 "runtime.in" addFunc(ve, run::gen301, primInt(), "Ceil", formal(primReal(), "x", false, false)); #line 3762 "runtime.in" addFunc(ve, run::gen302, primInt(), "Floor", formal(primReal(), "x", false, false)); #line 3767 "runtime.in" addFunc(ve, run::gen303, primInt(), "Round", formal(primReal(), "x", false, false)); #line 3772 "runtime.in" addFunc(ve, run::gen304, primReal(), "fmod", formal(primReal(), "x", false, false), formal(primReal(), "y", false, false)); #line 3778 "runtime.in" addFunc(ve, run::gen305, primReal(), "atan2", formal(primReal(), "y", false, false), formal(primReal(), "x", false, false)); #line 3783 "runtime.in" addFunc(ve, run::gen306, primReal(), "hypot", formal(primReal(), "x", false, false), formal(primReal(), "y", false, false)); #line 3788 "runtime.in" addFunc(ve, run::gen307, primReal(), "remainder", formal(primReal(), "x", false, false), formal(primReal(), "y", false, false)); #line 3793 "runtime.in" addFunc(ve, run::gen308, primReal(), "J", formal(primInt(), "n", false, false), formal(primReal(), "x", false, false)); #line 3798 "runtime.in" addFunc(ve, run::gen309, primReal(), "Y", formal(primInt(), "n", false, false), formal(primReal(), "x", false, false)); #line 3803 "runtime.in" addFunc(ve, run::gen310, primReal(), "erf", formal(primReal(), "x", false, false)); #line 3808 "runtime.in" addFunc(ve, run::gen311, primReal(), "erfc", formal(primReal(), "x", false, false)); #line 3813 "runtime.in" addFunc(ve, run::gen312, primInt(), "factorial", formal(primInt(), "n", false, false)); #line 3818 "runtime.in" addFunc(ve, run::gen313, primInt(), "choose", formal(primInt(), "n", false, false), formal(primInt(), "k", false, false)); #line 3829 "runtime.in" addFunc(ve, run::gen314, primReal(), "gamma", formal(primReal(), "x", false, false)); #line 3839 "runtime.in" addFunc(ve, run::gen315, primPair(), "gamma", formal(primPair(), "z", false, true)); #line 3845 "runtime.in" addFunc(ve, run::gen316, realArray(), "quadraticroots", formal(primReal(), "a", false, false), formal(primReal(), "b", false, false), formal(primReal(), "c", false, false)); #line 3854 "runtime.in" addFunc(ve, run::gen317, pairArray(), "quadraticroots", formal(primPair(), "a", false, true), formal(primPair(), "b", false, true), formal(primPair(), "c", false, true)); #line 3863 "runtime.in" addFunc(ve, run::gen318, realArray(), "cubicroots", formal(primReal(), "a", false, false), formal(primReal(), "b", false, false), formal(primReal(), "c", false, false), formal(primReal(), "d", false, false)); #line 3873 "runtime.in" addFunc(ve, run::gen319, primBoolean(), "==", formal(primTransform(), "a", false, false), formal(primTransform(), "b", false, false)); #line 3881 "runtime.in" addFunc(ve, run::gen320, primBoolean(), "!=", formal(primTransform(), "a", false, false), formal(primTransform(), "b", false, false)); #line 3886 "runtime.in" addFunc(ve, run::gen321, primTransform(), "+", formal(primTransform(), "a", false, false), formal(primTransform(), "b", false, false)); #line 3891 "runtime.in" addFunc(ve, run::gen322, primTransform(), "*", formal(primTransform(), "a", false, false), formal(primTransform(), "b", false, false)); #line 3896 "runtime.in" addFunc(ve, run::gen323, primPair(), "*", formal(primTransform(), "t", false, false), formal(primPair(), "z", false, false)); #line 3901 "runtime.in" addFunc(ve, run::gen324, primPath(), "*", formal(primTransform(), "t", false, false), formal(primPath(), "g", false, false)); #line 3906 "runtime.in" addFunc(ve, run::gen325, primPen(), "*", formal(primTransform(), "t", false, false), formal(primPen(), "p", false, false)); #line 3911 "runtime.in" addFunc(ve, run::gen326, primPicture(), "*", formal(primTransform(), "t", false, false), formal(primPicture(), "f", false, false)); #line 3916 "runtime.in" addFunc(ve, run::gen327, primPicture(), "*", formal(realArray2(), "t", false, false), formal(primPicture(), "f", false, false)); #line 3921 "runtime.in" addFunc(ve, run::gen328, primTransform(), "^", formal(primTransform(), "t", false, false), formal(primInt(), "n", false, false)); #line 3968 "runtime.in" addFunc(ve, run::gen336, primTransform(), "shift", formal(primTransform(), "t", false, false)); #line 3973 "runtime.in" addFunc(ve, run::gen337, primTransform(), "shiftless", formal(primTransform(), "t", false, false)); #line 3978 "runtime.in" addFunc(ve, run::transformIdentity, primTransform(), "identity"); #line 3983 "runtime.in" addFunc(ve, run::gen339, primTransform(), "inverse", formal(primTransform(), "t", false, false)); #line 3988 "runtime.in" addFunc(ve, run::gen340, primTransform(), "shift", formal(primPair(), "z", false, false)); #line 3993 "runtime.in" addFunc(ve, run::gen341, primTransform(), "shift", formal(primReal(), "x", false, false), formal(primReal(), "y", false, false)); #line 3998 "runtime.in" addFunc(ve, run::gen342, primTransform(), "xscale", formal(primReal(), "x", false, false)); #line 4003 "runtime.in" addFunc(ve, run::gen343, primTransform(), "yscale", formal(primReal(), "y", false, false)); #line 4008 "runtime.in" addFunc(ve, run::gen344, primTransform(), "scale", formal(primReal(), "x", false, false)); #line 4013 "runtime.in" addFunc(ve, run::gen345, primTransform(), "scale", formal(primReal(), "x", false, false), formal(primReal(), "y", false, false)); #line 4018 "runtime.in" addFunc(ve, run::gen346, primTransform(), "slant", formal(primReal(), "s", false, false)); #line 4023 "runtime.in" addFunc(ve, run::gen347, primTransform(), "rotate", formal(primReal(), "angle", false, false), formal(primPair(), "z", true, false)); #line 4028 "runtime.in" addFunc(ve, run::gen348, primTransform(), "reflect", formal(primPair(), "a", false, false), formal(primPair(), "b", false, false)); #line 4051 "runtime.in" addFunc(ve, run::pairXPart, primReal(), "xpart", formal(primPair(), "z", false, false)); #line 4056 "runtime.in" addFunc(ve, run::pairYPart, primReal(), "ypart", formal(primPair(), "z", false, false)); #line 4061 "runtime.in" addFunc(ve, run::gen354, primReal(), "length", formal(primPair(), "z", false, false)); #line 4066 "runtime.in" addFunc(ve, run::gen355, primReal(), "abs", formal(primPair(), "z", false, false)); #line 4071 "runtime.in" addFunc(ve, run::gen356, primPair(), "sqrt", formal(primPair(), "z", false, true)); #line 4076 "runtime.in" addFunc(ve, run::gen357, primReal(), "angle", formal(primPair(), "z", false, false), formal(primBoolean(), "warn", true, false)); #line 4083 "runtime.in" addFunc(ve, run::gen358, primReal(), "degrees", formal(primPair(), "z", false, false), formal(primBoolean(), "warn", true, false)); #line 4090 "runtime.in" addFunc(ve, run::gen359, primReal(), "radians", formal(primReal(), "degrees", false, false)); #line 4096 "runtime.in" addFunc(ve, run::gen360, primReal(), "degrees", formal(primReal(), "radians", false, false)); #line 4102 "runtime.in" addFunc(ve, run::gen361, primReal(), "Degrees", formal(primReal(), "radians", false, false)); #line 4108 "runtime.in" addFunc(ve, run::gen362, primReal(), "Sin", formal(primReal(), "deg", false, false)); #line 4113 "runtime.in" addFunc(ve, run::gen363, primReal(), "Cos", formal(primReal(), "deg", false, false)); #line 4118 "runtime.in" addFunc(ve, run::gen364, primReal(), "Tan", formal(primReal(), "deg", false, false)); #line 4123 "runtime.in" addFunc(ve, run::gen365, primReal(), "aSin", formal(primReal(), "x", false, false)); #line 4128 "runtime.in" addFunc(ve, run::gen366, primReal(), "aCos", formal(primReal(), "x", false, false)); #line 4133 "runtime.in" addFunc(ve, run::gen367, primReal(), "aTan", formal(primReal(), "x", false, false)); #line 4138 "runtime.in" addFunc(ve, run::gen368, primPair(), "unit", formal(primPair(), "z", false, false)); #line 4143 "runtime.in" addFunc(ve, run::gen369, primPair(), "dir", formal(primReal(), "degrees", false, false)); #line 4148 "runtime.in" addFunc(ve, run::gen370, primPair(), "dir", formal(primPair(), "z", false, true)); #line 4153 "runtime.in" addFunc(ve, run::gen371, primPair(), "expi", formal(primReal(), "angle", false, false)); #line 4158 "runtime.in" addFunc(ve, run::gen372, primPair(), "exp", formal(primPair(), "z", false, true)); #line 4163 "runtime.in" addFunc(ve, run::gen373, primPair(), "log", formal(primPair(), "z", false, true)); #line 4168 "runtime.in" addFunc(ve, run::gen374, primPair(), "sin", formal(primPair(), "z", false, true)); #line 4173 "runtime.in" addFunc(ve, run::gen375, primPair(), "cos", formal(primPair(), "z", false, true)); #line 4178 "runtime.in" addFunc(ve, run::gen376, primPair(), "conj", formal(primPair(), "z", false, false)); #line 4183 "runtime.in" addFunc(ve, run::gen377, primPair(), "realmult", formal(primPair(), "z", false, false), formal(primPair(), "w", false, false)); #line 4188 "runtime.in" addFunc(ve, run::gen378, primTriple(), "realmult", formal(primTriple(), "u", false, false), formal(primTriple(), "v", false, false)); #line 4193 "runtime.in" addFunc(ve, run::gen379, primReal(), "dot", formal(primPair(), "z", false, true), formal(primPair(), "w", false, true)); #line 4213 "runtime.in" addFunc(ve, run::tripleXPart, primReal(), "xpart", formal(primTriple(), "v", false, false)); #line 4218 "runtime.in" addFunc(ve, run::tripleYPart, primReal(), "ypart", formal(primTriple(), "v", false, false)); #line 4223 "runtime.in" addFunc(ve, run::tripleZPart, primReal(), "zpart", formal(primTriple(), "v", false, false)); #line 4228 "runtime.in" addFunc(ve, run::gen385, primTriple(), "*", formal(primReal(), "x", false, false), formal(primTriple(), "v", false, false)); #line 4233 "runtime.in" addFunc(ve, run::gen386, primTriple(), "*", formal(primTriple(), "v", false, false), formal(primReal(), "x", false, false)); #line 4238 "runtime.in" addFunc(ve, run::gen387, primTriple(), "/", formal(primTriple(), "v", false, false), formal(primReal(), "x", false, false)); #line 4243 "runtime.in" addFunc(ve, run::gen388, primReal(), "length", formal(primTriple(), "v", false, false)); #line 4248 "runtime.in" addFunc(ve, run::gen389, primReal(), "abs", formal(primTriple(), "v", false, false)); #line 4253 "runtime.in" addFunc(ve, run::gen390, primReal(), "polar", formal(primTriple(), "v", false, false), formal(primBoolean(), "warn", true, false)); #line 4259 "runtime.in" addFunc(ve, run::gen391, primReal(), "azimuth", formal(primTriple(), "v", false, false), formal(primBoolean(), "warn", true, false)); #line 4265 "runtime.in" addFunc(ve, run::gen392, primReal(), "colatitude", formal(primTriple(), "v", false, false), formal(primBoolean(), "warn", true, false)); #line 4271 "runtime.in" addFunc(ve, run::gen393, primReal(), "latitude", formal(primTriple(), "v", false, false), formal(primBoolean(), "warn", true, false)); #line 4277 "runtime.in" addFunc(ve, run::gen394, primReal(), "longitude", formal(primTriple(), "v", false, false), formal(primBoolean(), "warn", true, false)); #line 4284 "runtime.in" addFunc(ve, run::gen395, primTriple(), "unit", formal(primTriple(), "v", false, false)); #line 4289 "runtime.in" addFunc(ve, run::gen396, primReal(), "dot", formal(primTriple(), "u", false, false), formal(primTriple(), "v", false, false)); #line 4294 "runtime.in" addFunc(ve, run::gen397, primTriple(), "cross", formal(primTriple(), "u", false, false), formal(primTriple(), "v", false, false)); #line 4299 "runtime.in" addFunc(ve, run::gen398, primTriple(), "expi", formal(primReal(), "polar", false, false), formal(primReal(), "azimuth", false, false)); #line 4304 "runtime.in" addFunc(ve, run::gen399, primTriple(), "dir", formal(primReal(), "colatitude", false, false), formal(primReal(), "longitude", false, false)); #line 4309 "runtime.in" addFunc(ve, run::gen400, primVoid(), "atupdate", formal(voidFunction(), "f", false, false)); #line 4317 "runtime.in" addFunc(ve, run::gen401, voidFunction(), "atupdate"); #line 4322 "runtime.in" addFunc(ve, run::gen402, primVoid(), "atexit", formal(voidFunction(), "f", false, false)); #line 4327 "runtime.in" addFunc(ve, run::gen403, voidFunction(), "atexit"); #line 4332 "runtime.in" addFunc(ve, run::gen404, primVoid(), "atbreakpoint", formal(breakpointFunction(), "f", false, false)); #line 4337 "runtime.in" addFunc(ve, run::gen405, primVoid(), "breakpoint", formal(primCode(), "s", true, false)); #line 4342 "runtime.in" addFunc(ve, run::gen406, primString() , "locatefile", formal(primString() , "file", false, false)); #line 4347 "runtime.in" addFunc(ve, run::gen407, primVoid(), "stop", formal(primString() , "file", false, false), formal(primInt(), "line", false, false), formal(primCode(), "s", true, false)); #line 4355 "runtime.in" addFunc(ve, run::gen408, primVoid(), "breakpoints"); #line 4361 "runtime.in" addFunc(ve, run::gen409, primVoid(), "clear", formal(primString() , "file", false, false), formal(primInt(), "line", false, false)); #line 4367 "runtime.in" addFunc(ve, run::gen410, primVoid(), "clear"); #line 4372 "runtime.in" addFunc(ve, run::gen411, primString() , "stripdirectory", formal(primString(), "s", false, false)); #line 4378 "runtime.in" addFunc(ve, run::gen412, primString() , "stripfile", formal(primString(), "s", false, false)); #line 4384 "runtime.in" addFunc(ve, run::gen413, primString() , "stripextension", formal(primString(), "s", false, false)); #line 4390 "runtime.in" addFunc(ve, run::gen414, primInt(), "convert", formal(primString() , "args", true, false), formal(primString() , "file", true, false), formal(primString() , "format", true, false)); #line 4408 "runtime.in" addFunc(ve, run::gen415, primInt(), "animate", formal(primString() , "args", true, false), formal(primString() , "file", true, false), formal(primString() , "format", true, false)); #line 4424 "runtime.in" addFunc(ve, run::gen416, primInt(), "delete", formal(primString(), "s", false, false)); #line 4434 "runtime.in" addFunc(ve, run::gen417, primInt(), "rename", formal(primString(), "from", false, false), formal(primString(), "to", false, false)); #line 4733 "runtime.in" addFunc(ve, run::gen448, IntArray(), "complement", formal(IntArray(), "a", false, false), formal(primInt(), "n", false, false)); #line 4765 "runtime.in" addFunc(ve, run::gen450, IntArray(), "sequence", formal(primInt(), "n", false, false)); #line 4798 "runtime.in" addFunc(ve, run::gen453, primBoolean(), "all", formal(boolArray(), "a", false, false)); #line 4807 "runtime.in" addFunc(ve, run::gen454, boolArray(), "!", formal(boolArray(), "a", false, false)); #line 4816 "runtime.in" addFunc(ve, run::gen455, primInt(), "sum", formal(boolArray(), "a", false, false)); #line 4979 "runtime.in" addFunc(ve, run::gen462, primInt(), "find", formal(boolArray(), "a", false, false), formal(primInt(), "n", true, false)); #line 4999 "runtime.in" addFunc(ve, run::gen463, primBoolean(), "==", formal(realArray2(), "a", false, false), formal(realArray2(), "b", false, false)); #line 5044 "runtime.in" addFunc(ve, run::gen465, realArray2(), "identity", formal(primInt(), "n", false, false)); #line 5067 "runtime.in" addFunc(ve, run::gen467, realArray2(), "inverse", formal(realArray2(), "a", false, false)); #line 5159 "runtime.in" addFunc(ve, run::gen468, realArray(), "solve", formal(realArray2(), "a", false, false), formal(realArray(), "b", false, false), formal(primBoolean(), "warn", true, false)); #line 5210 "runtime.in" addFunc(ve, run::gen469, realArray2(), "solve", formal(realArray2(), "a", false, false), formal(realArray2(), "b", false, false), formal(primBoolean(), "warn", true, false)); #line 5274 "runtime.in" addFunc(ve, run::gen470, primReal(), "determinant", formal(realArray2(), "a", false, false)); #line 5290 "runtime.in" addFunc(ve, run::gen471, realArray(), "*", formal(realArray2(), "a", false, false), formal(realArray(), "b", false, false)); #line 5308 "runtime.in" addFunc(ve, run::gen472, realArray2(), "*", formal(realArray2(), "a", false, false), formal(realArray2(), "b", false, false)); #line 5343 "runtime.in" addFunc(ve, run::gen473, primTriple(), "*", formal(realArray2(), "t", false, false), formal(primTriple(), "v", false, false)); #line 5348 "runtime.in" addFunc(ve, run::gen474, primPair(), "project", formal(primTriple(), "v", false, false), formal(realArray2(), "t", false, false)); #line 5373 "runtime.in" addFunc(ve, run::gen475, primReal(), "dot", formal(realArray(), "a", false, false), formal(realArray(), "b", false, false)); #line 5383 "runtime.in" addFunc(ve, run::gen476, realArray(), "tridiagonal", formal(realArray(), "a", false, false), formal(realArray(), "b", false, false), formal(realArray(), "c", false, false), formal(realArray(), "f", false, false)); #line 5487 "runtime.in" addFunc(ve, run::gen477, primReal(), "newton", formal(primInt(), "iterations", true, false), formal(realRealFunction(), "f", false, false), formal(realRealFunction(), "fprime", false, false), formal(primReal(), "x", false, false), formal(primBoolean(), "verbose", true, false)); #line 5534 "runtime.in" addFunc(ve, run::gen478, primReal(), "newton", formal(primInt(), "iterations", true, false), formal(realRealFunction(), "f", false, false), formal(realRealFunction(), "fprime", false, false), formal(primReal(), "x1", false, false), formal(primReal(), "x2", false, false), formal(primBoolean(), "verbose", true, false)); #line 5616 "runtime.in" addFunc(ve, run::gen479, primReal(), "simpson", formal(realRealFunction(), "f", false, false), formal(primReal(), "a", false, false), formal(primReal(), "b", false, false), formal(primReal(), "acc", true, false), formal(primReal(), "dxmax", true, false)); #line 5658 "runtime.in" addFunc(ve, run::gen481, IntArray2(), "triangulate", formal(pairArray(), "z", false, false)); #line 5693 "runtime.in" addFunc(ve, run::gen482, primBoolean(), "==", formal(primFile(), "a", false, false), formal(primFile(), "b", false, false)); #line 5701 "runtime.in" addFunc(ve, run::gen483, primBoolean(), "!=", formal(primFile(), "a", false, false), formal(primFile(), "b", false, false)); #line 5711 "runtime.in" addFunc(ve, run::gen485, primFile(), "input", formal(primString() , "name", false, false), formal(primBoolean(), "check", true, false), formal(primString() , "comment", true, false)); #line 5719 "runtime.in" addFunc(ve, run::gen486, primFile(), "output", formal(primString() , "name", false, false), formal(primBoolean(), "update", true, false), formal(primString() , "comment", true, false)); #line 5731 "runtime.in" addFunc(ve, run::gen487, primFile(), "xinput", formal(primString() , "name", false, false), formal(primBoolean(), "check", true, false)); #line 5745 "runtime.in" addFunc(ve, run::gen488, primFile(), "xoutput", formal(primString() , "name", false, false), formal(primBoolean(), "update", true, false)); #line 5763 "runtime.in" addFunc(ve, run::gen489, primFile(), "binput", formal(primString() , "name", false, false), formal(primBoolean(), "check", true, false)); #line 5770 "runtime.in" addFunc(ve, run::gen490, primFile(), "boutput", formal(primString() , "name", false, false), formal(primBoolean(), "update", true, false)); #line 5780 "runtime.in" addFunc(ve, run::gen491, primBoolean(), "eof", formal(primFile(), "file", false, false)); #line 5785 "runtime.in" addFunc(ve, run::gen492, primBoolean(), "eol", formal(primFile(), "file", false, false)); #line 5790 "runtime.in" addFunc(ve, run::gen493, primBoolean(), "error", formal(primFile(), "file", false, false)); #line 5795 "runtime.in" addFunc(ve, run::gen494, primVoid(), "clear", formal(primFile(), "file", false, false)); #line 5800 "runtime.in" addFunc(ve, run::gen495, primVoid(), "close", formal(primFile(), "file", false, false)); #line 5805 "runtime.in" addFunc(ve, run::gen496, primInt(), "precision", formal(primFile(), "file", true, false), formal(primInt(), "digits", true, false)); #line 5811 "runtime.in" addFunc(ve, run::gen497, primVoid(), "flush", formal(primFile(), "file", false, false)); #line 5816 "runtime.in" addFunc(ve, run::gen498, primString() , "getc", formal(primFile(), "file", false, false)); #line 5825 "runtime.in" addFunc(ve, run::gen499, primInt(), "tell", formal(primFile(), "file", false, false)); #line 5830 "runtime.in" addFunc(ve, run::gen500, primVoid(), "seek", formal(primFile(), "file", false, false), formal(primInt(), "pos", false, false)); #line 5835 "runtime.in" addFunc(ve, run::gen501, primVoid(), "seekeof", formal(primFile(), "file", false, false)); #line 5840 "runtime.in" addFunc(ve, run::gen502, primFile(), "dimension", formal(primFile(), "file", false, false), formal(primInt(), "nx", false, false)); #line 5847 "runtime.in" addFunc(ve, run::gen503, primFile(), "dimension", formal(primFile(), "file", false, false), formal(primInt(), "nx", false, false), formal(primInt(), "ny", false, false)); #line 5853 "runtime.in" addFunc(ve, run::gen504, primFile(), "dimension", formal(primFile(), "file", false, false), formal(primInt(), "nx", false, false), formal(primInt(), "ny", false, false), formal(primInt(), "nz", false, false)); #line 5859 "runtime.in" addFunc(ve, run::gen505, primFile(), "csv", formal(primFile(), "file", false, false), formal(primBoolean(), "b", true, false)); #line 5866 "runtime.in" addFunc(ve, run::gen506, primFile(), "word", formal(primFile(), "file", false, false), formal(primBoolean(), "b", true, false)); #line 5873 "runtime.in" addFunc(ve, run::gen507, primFile(), "line", formal(primFile(), "file", false, false), formal(primBoolean(), "b", true, false)); #line 5880 "runtime.in" addFunc(ve, run::gen508, primFile(), "single", formal(primFile(), "file", false, false), formal(primBoolean(), "b", true, false)); #line 5888 "runtime.in" addFunc(ve, run::gen509, primFile(), "single", formal(primFile(), "file", false, false), formal(primReal(), "x", false, false), formal(primBoolean(), "b", true, false)); #line 5896 "runtime.in" addFunc(ve, run::gen510, primFile(), "single", formal(primFile(), "file", false, false), formal(primInt(), "x", false, false), formal(primBoolean(), "b", true, false)); #line 5904 "runtime.in" addFunc(ve, run::gen511, primFile(), "read1", formal(primFile(), "file", false, false)); #line 5911 "runtime.in" addFunc(ve, run::gen512, primFile(), "read2", formal(primFile(), "file", false, false)); #line 5918 "runtime.in" addFunc(ve, run::gen513, primFile(), "read3", formal(primFile(), "file", false, false)); #line 5925 "runtime.in" addFunc(ve, run::gen514, stringArray(), "history", formal(primString() , "name", false, false), formal(primInt(), "n", true, false)); #line 5958 "runtime.in" addFunc(ve, run::gen515, stringArray(), "history", formal(primInt(), "n", true, false)); #line 5969 "runtime.in" addFunc(ve, run::gen516, primString() , "readline", formal(primString() , "prompt", true, false), formal(primString() , "name", true, false), formal(primBoolean(), "tabcompletion", true, false)); #line 6013 "runtime.in" addFunc(ve, run::gen517, primVoid(), "saveline", formal(primString() , "name", false, false), formal(primString() , "value", false, false), formal(primBoolean(), "store", true, false)); #line 6043 "runtime.in" addFunc(ve, run::gen518, primVoid(), "generate_random_backtrace"); #line 6052 "runtime.in" addFunc(ve, run::gen519, primVoid(), "print_random_addresses", formal(primInt(), "n", true, false)); } } // namespace trans