diff options
Diffstat (limited to 'Build/source/utils/asymptote/runarray.cc')
-rw-r--r-- | Build/source/utils/asymptote/runarray.cc | 516 |
1 files changed, 276 insertions, 240 deletions
diff --git a/Build/source/utils/asymptote/runarray.cc b/Build/source/utils/asymptote/runarray.cc index a0ad0675edc..d7502119783 100644 --- a/Build/source/utils/asymptote/runarray.cc +++ b/Build/source/utils/asymptote/runarray.cc @@ -391,8 +391,44 @@ void transpose(double *a, size_t n) } // Invert an n x n array in place. -void inverse(double *a, size_t n) +void inverse(double *M, size_t n) { + if(n == 2) { + real a=M[0]; + real b=M[1]; + real c=M[2]; + real d=M[3]; + real det=a*d-b*c; + if(det == 0.0) + error(singular); + det=1.0/det; + M[0]=d*det; + M[1]=-b*det; + M[2]=-c*det; + M[3]=a*det; + return; + } + + if(n == 3) { + real a=M[0], b=M[1], c=M[2]; + real d=M[3], e=M[4], f=M[5]; + real g=M[6], h=M[7], i=M[8]; + + real A=e*i-f*h; + real B=f*g-d*i; + real C=d*h-e*g; + + real det=a*A+b*B+c*C; + if(det == 0.0) + error(singular); + det=1.0/det; + + M[0]=A*det; M[1]=(c*h-b*i)*det; M[2]=(b*f-c*e)*det; + M[3]=B*det; M[4]=(a*i-c*g)*det; M[5]=(c*d-a*f)*det; + M[6]=C*det; M[7]=(b*g-a*h)*det; M[8]=(a*e-b*d)*det; + return; + } + inverseAllocate(n); for(size_t i=0; i < n; i++) @@ -404,7 +440,7 @@ void inverse(double *a, size_t n) real big=0.0; // This is the outer loop of the search for a pivot element. for(size_t j=0; j < n; j++) { - double *aj=a+n*j; + double *aj=M+n*j; if(pivot[j] != 1) { for(size_t k=0; k < n; k++) { if(pivot[k] == 0) { @@ -424,9 +460,9 @@ void inverse(double *a, size_t n) ++(pivot[col]); // Interchange rows, if needed, to put the pivot element on the diagonal. - double *acol=a+n*col; + double *acol=M+n*col; if(row != col) { - double *arow=a+n*row; + double *arow=M+n*row; for(size_t k=0; k < n; k++) { real temp=arow[k]; arow[k]=acol[k]; @@ -451,7 +487,7 @@ void inverse(double *a, size_t n) // Reduce all rows except for the pivoted one. for(size_t k=0; k < n; k++) { if(k != col) { - double *ak=a+n*k; + double *ak=M+n*k; real akcol=ak[col]; ak[col]=0.0; for(size_t j=0; j < n; j++) @@ -467,7 +503,7 @@ void inverse(double *a, size_t n) size_t c=Col[k]; if(r != c) { for(size_t j=0; j < n; j++) { - double *aj=a+n*j; + double *aj=M+n*j; real temp=aj[r]; aj[r]=aj[c]; aj[c]=temp; @@ -597,10 +633,10 @@ void integeroverflow(size_t i) #endif namespace run { // Create an empty array. -#line 550 "runarray.in" +#line 586 "runarray.in" void emptyArray(stack *Stack) { -#line 551 "runarray.in" +#line 587 "runarray.in" {Stack->push<array*>(new array(0)); return;} } @@ -609,11 +645,11 @@ void emptyArray(stack *Stack) // 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 560 "runarray.in" +#line 596 "runarray.in" void newDeepArray(stack *Stack) { Int depth=vm::pop<Int>(Stack); -#line 561 "runarray.in" +#line 597 "runarray.in" assert(depth > 0); Int *dims = new Int[depth]; @@ -632,11 +668,11 @@ void newDeepArray(stack *Stack) // 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 580 "runarray.in" +#line 616 "runarray.in" void newInitializedArray(stack *Stack) { Int n=vm::pop<Int>(Stack); -#line 581 "runarray.in" +#line 617 "runarray.in" assert(n >= 0); array *a = new array(n); @@ -649,12 +685,12 @@ void newInitializedArray(stack *Stack) // Similar to newInitializedArray, but after the n elements, append another // array to it. -#line 594 "runarray.in" +#line 630 "runarray.in" void newAppendedArray(stack *Stack) { Int n=vm::pop<Int>(Stack); array* tail=vm::pop<array*>(Stack); -#line 595 "runarray.in" +#line 631 "runarray.in" assert(n >= 0); array *a = new array(n); @@ -671,14 +707,14 @@ void newAppendedArray(stack *Stack) // typeDepth is the true depth of the array determined at compile-time when the // operations for the array type are added. This typeDepth argument is // automatically pushed on the stack and is not visible to the user. -#line 612 "runarray.in" +#line 648 "runarray.in" void copyArrayValue(stack *Stack) { Int typeDepth=vm::pop<Int>(Stack); Int depth=vm::pop<Int>(Stack,Int_MAX); item value=vm::pop(Stack); Int n=vm::pop<Int>(Stack); -#line 613 "runarray.in" +#line 649 "runarray.in" if(n < 0) error("cannot create a negative length array"); if(depth < 0) error("cannot copy to a negative depth"); if(depth > typeDepth) depth=typeDepth; @@ -689,25 +725,25 @@ void copyArrayValue(stack *Stack) // typeDepth is the true depth of the array determined at compile-time when the // operations for the array type are added. This typeDepth argument is // automatically pushed on the stack and is not visible to the user. -#line 624 "runarray.in" +#line 660 "runarray.in" void copyArray(stack *Stack) { Int typeDepth=vm::pop<Int>(Stack); Int depth=vm::pop<Int>(Stack,Int_MAX); array * a=vm::pop<array *>(Stack); -#line 625 "runarray.in" +#line 661 "runarray.in" if(depth < 0) error("cannot copy to a negative depth"); if(depth > typeDepth) depth=typeDepth; {Stack->push<array*>(a->copyToDepth(depth)); return;} } // Read an element from an array. Checks for initialization & bounds. -#line 632 "runarray.in" +#line 668 "runarray.in" void arrayRead(stack *Stack) { Int n=vm::pop<Int>(Stack); array * a=vm::pop<array *>(Stack); -#line 633 "runarray.in" +#line 669 "runarray.in" item& i=arrayRead(a,n); if (i.empty()) { ostringstream buf; @@ -718,37 +754,37 @@ void arrayRead(stack *Stack) } // Slice a substring from an array. -#line 644 "runarray.in" +#line 680 "runarray.in" void arraySliceRead(stack *Stack) { Int right=vm::pop<Int>(Stack); Int left=vm::pop<Int>(Stack); array * a=vm::pop<array *>(Stack); -#line 645 "runarray.in" +#line 681 "runarray.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 652 "runarray.in" +#line 688 "runarray.in" void arraySliceReadToEnd(stack *Stack) { Int left=vm::pop<Int>(Stack); array * a=vm::pop<array *>(Stack); -#line 653 "runarray.in" +#line 689 "runarray.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 660 "runarray.in" +#line 696 "runarray.in" void arrayArrayRead(stack *Stack) { Int n=vm::pop<Int>(Stack); array * a=vm::pop<array *>(Stack); -#line 661 "runarray.in" +#line 697 "runarray.in" item& i=arrayRead(a,n); if (i.empty()) i=new array(0); {Stack->push(i); return;} @@ -756,13 +792,13 @@ void arrayArrayRead(stack *Stack) // Write an element to an array. Increase size if necessary. // TODO: Add arrayWriteAndPop -#line 669 "runarray.in" +#line 705 "runarray.in" void arrayWrite(stack *Stack) { item value=vm::pop(Stack); Int n=vm::pop<Int>(Stack); array * a=vm::pop<array *>(Stack); -#line 670 "runarray.in" +#line 706 "runarray.in" size_t len=checkArray(a); bool cyclic=a->cyclic(); if(cyclic && len > 0) n=imod(n,len); @@ -776,27 +812,27 @@ void arrayWrite(stack *Stack) {Stack->push(value); return;} } -#line 684 "runarray.in" +#line 720 "runarray.in" void arraySliceWrite(stack *Stack) { array * src=vm::pop<array *>(Stack); Int right=vm::pop<Int>(Stack); Int left=vm::pop<Int>(Stack); array * dest=vm::pop<array *>(Stack); -#line 685 "runarray.in" +#line 721 "runarray.in" checkArray(src); checkArray(dest); dest->setSlice(left, right, src); {Stack->push<array*>(src); return;} } -#line 692 "runarray.in" +#line 728 "runarray.in" void arraySliceWriteToEnd(stack *Stack) { array * src=vm::pop<array *>(Stack); Int left=vm::pop<Int>(Stack); array * dest=vm::pop<array *>(Stack); -#line 693 "runarray.in" +#line 729 "runarray.in" checkArray(src); size_t len=checkArray(dest); dest->setSlice(left, (Int) len, src); @@ -804,20 +840,20 @@ void arraySliceWriteToEnd(stack *Stack) } // Returns the length of an array. -#line 701 "runarray.in" +#line 737 "runarray.in" void arrayLength(stack *Stack) { array * a=vm::pop<array *>(Stack); -#line 702 "runarray.in" +#line 738 "runarray.in" {Stack->push<Int>((Int) checkArray(a)); return;} } // Returns an array of integers representing the keys of the array. -#line 707 "runarray.in" +#line 743 "runarray.in" void arrayKeys(stack *Stack) { array * a=vm::pop<array *>(Stack); -#line 708 "runarray.in" +#line 744 "runarray.in" size_t size=checkArray(a); array *keys=new array(); @@ -831,33 +867,33 @@ void arrayKeys(stack *Stack) } // Return the cyclic flag for an array. -#line 722 "runarray.in" +#line 758 "runarray.in" void arrayCyclicFlag(stack *Stack) { array * a=vm::pop<array *>(Stack); -#line 723 "runarray.in" +#line 759 "runarray.in" checkArray(a); {Stack->push<bool>(a->cyclic()); return;} } -#line 728 "runarray.in" +#line 764 "runarray.in" void arraySetCyclicFlag(stack *Stack) { array * a=vm::pop<array *>(Stack); bool b=vm::pop<bool>(Stack); -#line 729 "runarray.in" +#line 765 "runarray.in" checkArray(a); a->cyclic(b); {Stack->push<bool>(b); return;} } // Check to see if an array element is initialized. -#line 736 "runarray.in" +#line 772 "runarray.in" void arrayInitializedHelper(stack *Stack) { array * a=vm::pop<array *>(Stack); Int n=vm::pop<Int>(Stack); -#line 737 "runarray.in" +#line 773 "runarray.in" size_t len=checkArray(a); bool cyclic=a->cyclic(); if(cyclic && len > 0) n=imod(n,len); @@ -867,62 +903,62 @@ void arrayInitializedHelper(stack *Stack) } // Returns the initialize method for an array. -#line 747 "runarray.in" +#line 783 "runarray.in" void arrayInitialized(stack *Stack) { array * a=vm::pop<array *>(Stack); -#line 748 "runarray.in" +#line 784 "runarray.in" {Stack->push<callable*>(new thunk(new bfunc(arrayInitializedHelper),a)); return;} } // The helper function for the cyclic method that sets the cyclic flag. -#line 753 "runarray.in" +#line 789 "runarray.in" void arrayCyclicHelper(stack *Stack) { array * a=vm::pop<array *>(Stack); bool b=vm::pop<bool>(Stack); -#line 754 "runarray.in" +#line 790 "runarray.in" checkArray(a); a->cyclic(b); } // Set the cyclic flag for an array. -#line 760 "runarray.in" +#line 796 "runarray.in" void arrayCyclic(stack *Stack) { array * a=vm::pop<array *>(Stack); -#line 761 "runarray.in" +#line 797 "runarray.in" {Stack->push<callable*>(new thunk(new bfunc(arrayCyclicHelper),a)); return;} } // The helper function for the push method that does the actual operation. -#line 766 "runarray.in" +#line 802 "runarray.in" void arrayPushHelper(stack *Stack) { array * a=vm::pop<array *>(Stack); item x=vm::pop(Stack); -#line 767 "runarray.in" +#line 803 "runarray.in" checkArray(a); a->push(x); {Stack->push(x); return;} } // Returns the push method for an array. -#line 774 "runarray.in" +#line 810 "runarray.in" void arrayPush(stack *Stack) { array * a=vm::pop<array *>(Stack); -#line 775 "runarray.in" +#line 811 "runarray.in" {Stack->push<callable*>(new thunk(new bfunc(arrayPushHelper),a)); return;} } // The helper function for the append method that appends b to a. -#line 780 "runarray.in" +#line 816 "runarray.in" void arrayAppendHelper(stack *Stack) { array * a=vm::pop<array *>(Stack); array * b=vm::pop<array *>(Stack); -#line 781 "runarray.in" +#line 817 "runarray.in" checkArray(a); size_t size=checkArray(b); for(size_t i=0; i < size; i++) @@ -930,20 +966,20 @@ void arrayAppendHelper(stack *Stack) } // Returns the append method for an array. -#line 789 "runarray.in" +#line 825 "runarray.in" void arrayAppend(stack *Stack) { array * a=vm::pop<array *>(Stack); -#line 790 "runarray.in" +#line 826 "runarray.in" {Stack->push<callable*>(new thunk(new bfunc(arrayAppendHelper),a)); return;} } // The helper function for the pop method. -#line 795 "runarray.in" +#line 831 "runarray.in" void arrayPopHelper(stack *Stack) { array * a=vm::pop<array *>(Stack); -#line 796 "runarray.in" +#line 832 "runarray.in" size_t asize=checkArray(a); if(asize == 0) error("cannot pop element from empty array"); @@ -951,22 +987,22 @@ void arrayPopHelper(stack *Stack) } // Returns the pop method for an array. -#line 804 "runarray.in" +#line 840 "runarray.in" void arrayPop(stack *Stack) { array * a=vm::pop<array *>(Stack); -#line 805 "runarray.in" +#line 841 "runarray.in" {Stack->push<callable*>(new thunk(new bfunc(arrayPopHelper),a)); return;} } // The helper function for the insert method. -#line 810 "runarray.in" +#line 846 "runarray.in" void arrayInsertHelper(stack *Stack) { array * a=vm::pop<array *>(Stack); array * x=vm::pop<array *>(Stack); Int i=vm::pop<Int>(Stack); -#line 811 "runarray.in" +#line 847 "runarray.in" size_t asize=checkArray(a); checkArray(x); if(a->cyclic() && asize > 0) i=imod(i,asize); @@ -976,39 +1012,39 @@ void arrayInsertHelper(stack *Stack) } // Returns the insert method for an array. -#line 821 "runarray.in" +#line 857 "runarray.in" void arrayInsert(stack *Stack) { array * a=vm::pop<array *>(Stack); -#line 822 "runarray.in" +#line 858 "runarray.in" {Stack->push<callable*>(new thunk(new bfunc(arrayInsertHelper),a)); return;} } // Returns the delete method for an array. -#line 827 "runarray.in" +#line 863 "runarray.in" void arrayDelete(stack *Stack) { array * a=vm::pop<array *>(Stack); -#line 828 "runarray.in" +#line 864 "runarray.in" {Stack->push<callable*>(new thunk(new bfunc(arrayDeleteHelper),a)); return;} } -#line 832 "runarray.in" +#line 868 "runarray.in" void arrayAlias(stack *Stack) { array * b=vm::pop<array *>(Stack); array * a=vm::pop<array *>(Stack); -#line 833 "runarray.in" +#line 869 "runarray.in" {Stack->push<bool>(a==b); return;} } // Return array formed by indexing array a with elements of integer array b -#line 838 "runarray.in" +#line 874 "runarray.in" void arrayIntArray(stack *Stack) { array * b=vm::pop<array *>(Stack); array * a=vm::pop<array *>(Stack); -#line 839 "runarray.in" +#line 875 "runarray.in" size_t asize=checkArray(a); size_t bsize=checkArray(b); array *r=new array(bsize); @@ -1026,13 +1062,13 @@ void arrayIntArray(stack *Stack) // 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 857 "runarray.in" +#line 893 "runarray.in" // Intarray* complement(Intarray *a, Int n); void gen_runarray32(stack *Stack) { Int n=vm::pop<Int>(Stack); Intarray * a=vm::pop<Intarray *>(Stack); -#line 858 "runarray.in" +#line 894 "runarray.in" size_t asize=checkArray(a); array *r=new array(0); bool *keep=new bool[n]; @@ -1049,12 +1085,12 @@ void gen_runarray32(stack *Stack) } // Generate the sequence {f(i) : i=0,1,...n-1} given a function f and integer n -#line 875 "runarray.in" +#line 911 "runarray.in" void arraySequence(stack *Stack) { Int n=vm::pop<Int>(Stack); callable * f=vm::pop<callable *>(Stack); -#line 876 "runarray.in" +#line 912 "runarray.in" if(n < 0) n=0; array *a=new array(n); for(Int i=0; i < n; ++i) { @@ -1066,12 +1102,12 @@ void arraySequence(stack *Stack) } // Return the array {0,1,...n-1} -#line 888 "runarray.in" +#line 924 "runarray.in" // Intarray* sequence(Int n); void gen_runarray34(stack *Stack) { Int n=vm::pop<Int>(Stack); -#line 889 "runarray.in" +#line 925 "runarray.in" if(n < 0) n=0; array *a=new array(n); for(Int i=0; i < n; ++i) { @@ -1081,12 +1117,12 @@ void gen_runarray34(stack *Stack) } // Apply a function to each element of an array -#line 899 "runarray.in" +#line 935 "runarray.in" void arrayFunction(stack *Stack) { array * a=vm::pop<array *>(Stack); callable * f=vm::pop<callable *>(Stack); -#line 900 "runarray.in" +#line 936 "runarray.in" size_t size=checkArray(a); array *b=new array(size); for(size_t i=0; i < size; ++i) { @@ -1097,13 +1133,13 @@ void arrayFunction(stack *Stack) {Stack->push<array*>(b); return;} } -#line 911 "runarray.in" +#line 947 "runarray.in" void arraySort(stack *Stack) { bool stable=vm::pop<bool>(Stack,true); callable * less=vm::pop<callable *>(Stack); array * a=vm::pop<array *>(Stack); -#line 912 "runarray.in" +#line 948 "runarray.in" array *c=copyArray(a); compareFunc=less; FuncStack=Stack; @@ -1112,13 +1148,13 @@ void arraySort(stack *Stack) {Stack->push<array*>(c); return;} } -#line 921 "runarray.in" +#line 957 "runarray.in" void arraySearch(stack *Stack) { callable * less=vm::pop<callable *>(Stack); item key=vm::pop(Stack); array * a=vm::pop<array *>(Stack); -#line 922 "runarray.in" +#line 958 "runarray.in" size_t size=a->size(); compareFunc=less; FuncStack=Stack; @@ -1136,12 +1172,12 @@ void arraySearch(stack *Stack) {Stack->push<Int>(0); return;} } -#line 940 "runarray.in" +#line 976 "runarray.in" // bool all(boolarray *a); void gen_runarray38(stack *Stack) { boolarray * a=vm::pop<boolarray *>(Stack); -#line 941 "runarray.in" +#line 977 "runarray.in" size_t size=checkArray(a); bool c=true; for(size_t i=0; i < size; i++) @@ -1149,12 +1185,12 @@ void gen_runarray38(stack *Stack) {Stack->push<bool>(c); return;} } -#line 949 "runarray.in" +#line 985 "runarray.in" // boolarray* !(boolarray* a); void gen_runarray39(stack *Stack) { boolarray* a=vm::pop<boolarray*>(Stack); -#line 950 "runarray.in" +#line 986 "runarray.in" size_t size=checkArray(a); array *c=new array(size); for(size_t i=0; i < size; i++) @@ -1162,12 +1198,12 @@ void gen_runarray39(stack *Stack) {Stack->push<boolarray*>(c); return;} } -#line 958 "runarray.in" +#line 994 "runarray.in" // Int sum(boolarray *a); void gen_runarray40(stack *Stack) { boolarray * a=vm::pop<boolarray *>(Stack); -#line 959 "runarray.in" +#line 995 "runarray.in" size_t size=checkArray(a); Int sum=0; for(size_t i=0; i < size; i++) @@ -1175,11 +1211,11 @@ void gen_runarray40(stack *Stack) {Stack->push<Int>(sum); return;} } -#line 967 "runarray.in" +#line 1003 "runarray.in" void arrayConcat(stack *Stack) { array * a=vm::pop<array *>(Stack); -#line 968 "runarray.in" +#line 1004 "runarray.in" // a is an array of arrays to be concatenated together. // The signature is // T[] concat(... T[][] a); @@ -1206,11 +1242,11 @@ void arrayConcat(stack *Stack) {Stack->push<array*>(result); return;} } -#line 995 "runarray.in" +#line 1031 "runarray.in" void array2Transpose(stack *Stack) { array * a=vm::pop<array *>(Stack); -#line 996 "runarray.in" +#line 1032 "runarray.in" size_t asize=checkArray(a); array *c=new array(0); for(size_t i=0; i < asize; i++) { @@ -1237,12 +1273,12 @@ void array2Transpose(stack *Stack) // 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 1023 "runarray.in" +#line 1059 "runarray.in" void array3Transpose(stack *Stack) { array * perm=vm::pop<array *>(Stack); array * a=vm::pop<array *>(Stack); -#line 1024 "runarray.in" +#line 1060 "runarray.in" const size_t DIM=3; if(checkArray(perm) != DIM) { @@ -1326,13 +1362,13 @@ void array3Transpose(stack *Stack) // Find the index of the nth true value in a boolean array or -1 if not found. // If n is negative, search backwards. -#line 1108 "runarray.in" +#line 1144 "runarray.in" // Int find(boolarray *a, Int n=1); void gen_runarray44(stack *Stack) { Int n=vm::pop<Int>(Stack,1); boolarray * a=vm::pop<boolarray *>(Stack); -#line 1109 "runarray.in" +#line 1145 "runarray.in" size_t size=checkArray(a); Int j=-1; if(n > 0) @@ -1349,12 +1385,12 @@ void gen_runarray44(stack *Stack) } // Find all indices of true values in a boolean array. -#line 1126 "runarray.in" +#line 1162 "runarray.in" // Intarray* findall(boolarray *a); void gen_runarray45(stack *Stack) { boolarray * a=vm::pop<boolarray *>(Stack); -#line 1127 "runarray.in" +#line 1163 "runarray.in" size_t size=checkArray(a); array *b=new array(0); for(size_t i=0; i < size; i++) { @@ -1367,13 +1403,13 @@ void gen_runarray45(stack *Stack) // 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 1140 "runarray.in" +#line 1176 "runarray.in" void arrayConditional(stack *Stack) { array * c=vm::pop<array *>(Stack); array * b=vm::pop<array *>(Stack); array * a=vm::pop<array *>(Stack); -#line 1141 "runarray.in" +#line 1177 "runarray.in" size_t size=checkArray(a); array *r=new array(size); if(b && c) { @@ -1397,22 +1433,22 @@ void arrayConditional(stack *Stack) } // Return an n x n identity matrix. -#line 1165 "runarray.in" +#line 1201 "runarray.in" // realarray2* identity(Int n); void gen_runarray47(stack *Stack) { Int n=vm::pop<Int>(Stack); -#line 1166 "runarray.in" +#line 1202 "runarray.in" {Stack->push<realarray2*>(Identity(n)); return;} } // Return the inverse of an n x n matrix a using Gauss-Jordan elimination. -#line 1171 "runarray.in" +#line 1207 "runarray.in" // realarray2* inverse(realarray2 *a); void gen_runarray48(stack *Stack) { realarray2 * a=vm::pop<realarray2 *>(Stack); -#line 1172 "runarray.in" +#line 1208 "runarray.in" size_t n=checkArray(a); double *A; copyArray2C(A,a,true,0,NoGC); @@ -1425,14 +1461,14 @@ void gen_runarray48(stack *Stack) // 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 1185 "runarray.in" +#line 1221 "runarray.in" // realarray* solve(realarray2 *a, realarray *b, bool warn=true); void gen_runarray49(stack *Stack) { bool warn=vm::pop<bool>(Stack,true); realarray * b=vm::pop<realarray *>(Stack); realarray2 * a=vm::pop<realarray2 *>(Stack); -#line 1186 "runarray.in" +#line 1222 "runarray.in" size_t n=checkArray(a); if(n == 0) {Stack->push<realarray*>(new array(0)); return;} @@ -1484,14 +1520,14 @@ void gen_runarray49(stack *Stack) // 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 1238 "runarray.in" +#line 1274 "runarray.in" // realarray2* solve(realarray2 *a, realarray2 *b, bool warn=true); void gen_runarray50(stack *Stack) { bool warn=vm::pop<bool>(Stack,true); realarray2 * b=vm::pop<realarray2 *>(Stack); realarray2 * a=vm::pop<realarray2 *>(Stack); -#line 1239 "runarray.in" +#line 1275 "runarray.in" size_t n=checkArray(a); if(n == 0) {Stack->push<realarray2*>(new array(0)); return;} @@ -1553,12 +1589,12 @@ void gen_runarray50(stack *Stack) } // Compute the determinant of an n x n matrix. -#line 1301 "runarray.in" +#line 1337 "runarray.in" // real determinant(realarray2 *a); void gen_runarray51(stack *Stack) { realarray2 * a=vm::pop<realarray2 *>(Stack); -#line 1302 "runarray.in" +#line 1338 "runarray.in" real *A; copyArray2C(A,a); size_t n=checkArray(a); @@ -1573,13 +1609,13 @@ void gen_runarray51(stack *Stack) {Stack->push<real>(det); return;} } -#line 1317 "runarray.in" +#line 1353 "runarray.in" // realarray* *(realarray2 *a, realarray *b); void gen_runarray52(stack *Stack) { realarray * b=vm::pop<realarray *>(Stack); realarray2 * a=vm::pop<realarray2 *>(Stack); -#line 1318 "runarray.in" +#line 1354 "runarray.in" size_t n=checkArray(a); size_t m=checkArray(b); array *c=new array(n); @@ -1597,13 +1633,13 @@ void gen_runarray52(stack *Stack) {Stack->push<realarray*>(c); return;} } -#line 1336 "runarray.in" +#line 1372 "runarray.in" // realarray* *(realarray *a, realarray2 *b); void gen_runarray53(stack *Stack) { realarray2 * b=vm::pop<realarray2 *>(Stack); realarray * a=vm::pop<realarray *>(Stack); -#line 1337 "runarray.in" +#line 1373 "runarray.in" size_t n=checkArray(a); if(n != checkArray(b)) error(incommensurate); real *A; @@ -1631,62 +1667,62 @@ void gen_runarray53(stack *Stack) {Stack->push<realarray*>(c); return;} } -#line 1365 "runarray.in" +#line 1401 "runarray.in" // Intarray2* *(Intarray2 *a, Intarray2 *b); void gen_runarray54(stack *Stack) { Intarray2 * b=vm::pop<Intarray2 *>(Stack); Intarray2 * a=vm::pop<Intarray2 *>(Stack); -#line 1366 "runarray.in" +#line 1402 "runarray.in" {Stack->push<Intarray2*>(mult<Int>(a,b)); return;} } -#line 1370 "runarray.in" +#line 1406 "runarray.in" // realarray2* *(realarray2 *a, realarray2 *b); void gen_runarray55(stack *Stack) { realarray2 * b=vm::pop<realarray2 *>(Stack); realarray2 * a=vm::pop<realarray2 *>(Stack); -#line 1371 "runarray.in" +#line 1407 "runarray.in" {Stack->push<realarray2*>(mult<real>(a,b)); return;} } -#line 1375 "runarray.in" +#line 1411 "runarray.in" // pairarray2* *(pairarray2 *a, pairarray2 *b); void gen_runarray56(stack *Stack) { pairarray2 * b=vm::pop<pairarray2 *>(Stack); pairarray2 * a=vm::pop<pairarray2 *>(Stack); -#line 1376 "runarray.in" +#line 1412 "runarray.in" {Stack->push<pairarray2*>(mult<pair>(a,b)); return;} } -#line 1380 "runarray.in" +#line 1416 "runarray.in" // triple *(realarray2 *t, triple v); void gen_runarray57(stack *Stack) { triple v=vm::pop<triple>(Stack); realarray2 * t=vm::pop<realarray2 *>(Stack); -#line 1381 "runarray.in" +#line 1417 "runarray.in" {Stack->push<triple>(*t*v); return;} } -#line 1385 "runarray.in" +#line 1421 "runarray.in" // realarray2* AtA(realarray2 *a); void gen_runarray58(stack *Stack) { realarray2 * a=vm::pop<realarray2 *>(Stack); -#line 1386 "runarray.in" +#line 1422 "runarray.in" {Stack->push<realarray2*>(AtA<real>(a)); return;} } -#line 1390 "runarray.in" +#line 1426 "runarray.in" // pair project(triple v, realarray2 *t); void gen_runarray59(stack *Stack) { realarray2 * t=vm::pop<realarray2 *>(Stack); triple v=vm::pop<triple>(Stack); -#line 1391 "runarray.in" +#line 1427 "runarray.in" size_t n=checkArray(t); if(n != 4) error(incommensurate); array *t0=read<array*>(t,0); @@ -1711,13 +1747,13 @@ void gen_runarray59(stack *Stack) } // Compute the dot product of vectors a and b. -#line 1416 "runarray.in" +#line 1452 "runarray.in" // real dot(realarray *a, realarray *b); void gen_runarray60(stack *Stack) { realarray * b=vm::pop<realarray *>(Stack); realarray * a=vm::pop<realarray *>(Stack); -#line 1417 "runarray.in" +#line 1453 "runarray.in" size_t n=checkArrays(a,b); real sum=0.0; for(size_t i=0; i < n; ++i) @@ -1726,13 +1762,13 @@ void gen_runarray60(stack *Stack) } // Compute the complex dot product of vectors a and b. -#line 1426 "runarray.in" +#line 1462 "runarray.in" // pair dot(pairarray *a, pairarray *b); void gen_runarray61(stack *Stack) { pairarray * b=vm::pop<pairarray *>(Stack); pairarray * a=vm::pop<pairarray *>(Stack); -#line 1427 "runarray.in" +#line 1463 "runarray.in" size_t n=checkArrays(a,b); pair sum=zero; for(size_t i=0; i < n; ++i) @@ -1747,7 +1783,7 @@ void gen_runarray61(stack *Stack) // [ a[2] b[2] c[2] ] // [ ... ] // [ c[n-1] a[n-1] b[n-1] ] -#line 1442 "runarray.in" +#line 1478 "runarray.in" // realarray* tridiagonal(realarray *a, realarray *b, realarray *c, realarray *f); void gen_runarray62(stack *Stack) { @@ -1755,7 +1791,7 @@ void gen_runarray62(stack *Stack) realarray * c=vm::pop<realarray *>(Stack); realarray * b=vm::pop<realarray *>(Stack); realarray * a=vm::pop<realarray *>(Stack); -#line 1443 "runarray.in" +#line 1479 "runarray.in" size_t n=checkArrays(a,b); checkEqual(n,checkArray(c)); checkEqual(n,checkArray(f)); @@ -1852,7 +1888,7 @@ void gen_runarray62(stack *Stack) } // Root solve by Newton-Raphson -#line 1540 "runarray.in" +#line 1576 "runarray.in" // real newton(Int iterations=100, callableReal *f, callableReal *fprime, real x, bool verbose=false); void gen_runarray63(stack *Stack) { @@ -1861,7 +1897,7 @@ void gen_runarray63(stack *Stack) callableReal * fprime=vm::pop<callableReal *>(Stack); callableReal * f=vm::pop<callableReal *>(Stack); Int iterations=vm::pop<Int>(Stack,100); -#line 1542 "runarray.in" +#line 1578 "runarray.in" static const real fuzz=1000.0*DBL_EPSILON; Int i=0; size_t oldPrec=0; @@ -1907,7 +1943,7 @@ void gen_runarray63(stack *Stack) // Root solve by Newton-Raphson bisection // cf. routine rtsafe (Press et al., Numerical Recipes, 1991). -#line 1588 "runarray.in" +#line 1624 "runarray.in" // real newton(Int iterations=100, callableReal *f, callableReal *fprime, real x1, real x2, bool verbose=false); void gen_runarray64(stack *Stack) { @@ -1917,7 +1953,7 @@ void gen_runarray64(stack *Stack) callableReal * fprime=vm::pop<callableReal *>(Stack); callableReal * f=vm::pop<callableReal *>(Stack); Int iterations=vm::pop<Int>(Stack,100); -#line 1590 "runarray.in" +#line 1626 "runarray.in" static const real fuzz=1000.0*DBL_EPSILON; size_t oldPrec=0; if(verbose) @@ -2003,7 +2039,7 @@ void gen_runarray64(stack *Stack) // In this implementation, the binary search is interleaved // with a modified version of quadratic interpolation. // This is a C++ port of the Asymptote routine written by Charles Staats III. -#line 1676 "runarray.in" +#line 1712 "runarray.in" // real _findroot(callableReal *f, real a, real b, real tolerance, real fa, real fb); void gen_runarray65(stack *Stack) { @@ -2013,7 +2049,7 @@ void gen_runarray65(stack *Stack) real b=vm::pop<real>(Stack); real a=vm::pop<real>(Stack); callableReal * f=vm::pop<callableReal *>(Stack); -#line 1678 "runarray.in" +#line 1714 "runarray.in" if(fa == 0.0) {Stack->push<real>(a); return;} if(fb == 0.0) {Stack->push<real>(b); return;} @@ -2105,7 +2141,7 @@ void gen_runarray65(stack *Stack) {Stack->push<real>(a-(b-a)/(fb-fa)*fa); return;} } -#line 1770 "runarray.in" +#line 1806 "runarray.in" // real simpson(callableReal *f, real a, real b, real acc=DBL_EPSILON, real dxmax=0); void gen_runarray66(stack *Stack) { @@ -2114,7 +2150,7 @@ void gen_runarray66(stack *Stack) real b=vm::pop<real>(Stack); real a=vm::pop<real>(Stack); callableReal * f=vm::pop<callableReal *>(Stack); -#line 1772 "runarray.in" +#line 1808 "runarray.in" real integral; if(dxmax <= 0) dxmax=fabs(b-a); callable *oldFunc=Func; @@ -2127,13 +2163,13 @@ void gen_runarray66(stack *Stack) } // Compute the fast Fourier transform of a pair array -#line 1785 "runarray.in" +#line 1821 "runarray.in" // pairarray* fft(pairarray *a, Int sign=1); void gen_runarray67(stack *Stack) { Int sign=vm::pop<Int>(Stack,1); pairarray * a=vm::pop<pairarray *>(Stack); -#line 1786 "runarray.in" +#line 1822 "runarray.in" #ifdef HAVE_LIBFFTW3 unsigned n=(unsigned) checkArray(a); array *c=new array(n); @@ -2162,12 +2198,12 @@ void gen_runarray67(stack *Stack) {Stack->push<pairarray*>(c); return;} } -#line 1815 "runarray.in" +#line 1851 "runarray.in" // Intarray2* triangulate(pairarray *z); void gen_runarray68(stack *Stack) { pairarray * z=vm::pop<pairarray *>(Stack); -#line 1816 "runarray.in" +#line 1852 "runarray.in" size_t nv=checkArray(z); // Call robust version of Gilles Dumoulin's port of Paul Bourke's // triangulation code. @@ -2201,12 +2237,12 @@ void gen_runarray68(stack *Stack) {Stack->push<Intarray2*>(t); return;} } -#line 1850 "runarray.in" +#line 1886 "runarray.in" // real norm(realarray *a); void gen_runarray69(stack *Stack) { realarray * a=vm::pop<realarray *>(Stack); -#line 1851 "runarray.in" +#line 1887 "runarray.in" size_t n=checkArray(a); real M=0.0; for(size_t i=0; i < n; ++i) { @@ -2216,12 +2252,12 @@ void gen_runarray69(stack *Stack) {Stack->push<real>(M); return;} } -#line 1861 "runarray.in" +#line 1897 "runarray.in" // real norm(realarray2 *a); void gen_runarray70(stack *Stack) { realarray2 * a=vm::pop<realarray2 *>(Stack); -#line 1862 "runarray.in" +#line 1898 "runarray.in" size_t n=checkArray(a); real M=0.0; for(size_t i=0; i < n; ++i) { @@ -2235,12 +2271,12 @@ void gen_runarray70(stack *Stack) {Stack->push<real>(M); return;} } -#line 1876 "runarray.in" +#line 1912 "runarray.in" // real norm(triplearray2 *a); void gen_runarray71(stack *Stack) { triplearray2 * a=vm::pop<triplearray2 *>(Stack); -#line 1877 "runarray.in" +#line 1913 "runarray.in" size_t n=checkArray(a); real M=0.0; for(size_t i=0; i < n; ++i) { @@ -2254,12 +2290,12 @@ void gen_runarray71(stack *Stack) {Stack->push<real>(sqrt(M)); return;} } -#line 1891 "runarray.in" +#line 1927 "runarray.in" // real change2(triplearray2 *a); void gen_runarray72(stack *Stack) { triplearray2 * a=vm::pop<triplearray2 *>(Stack); -#line 1892 "runarray.in" +#line 1928 "runarray.in" size_t n=checkArray(a); if(n == 0) {Stack->push<real>(0.0); return;} @@ -2280,13 +2316,13 @@ void gen_runarray72(stack *Stack) {Stack->push<real>(M); return;} } -#line 1913 "runarray.in" +#line 1949 "runarray.in" // triple minbezier(triplearray2 *P, triple b); void gen_runarray73(stack *Stack) { triple b=vm::pop<triple>(Stack); triplearray2 * P=vm::pop<triplearray2 *>(Stack); -#line 1914 "runarray.in" +#line 1950 "runarray.in" size_t N; real *A=copyTripleArray2Components(P,N); bound_double *B=bounddouble(N); @@ -2297,13 +2333,13 @@ void gen_runarray73(stack *Stack) {Stack->push<triple>(b); return;} } -#line 1925 "runarray.in" +#line 1961 "runarray.in" // triple maxbezier(triplearray2 *P, triple b); void gen_runarray74(stack *Stack) { triple b=vm::pop<triple>(Stack); triplearray2 * P=vm::pop<triplearray2 *>(Stack); -#line 1926 "runarray.in" +#line 1962 "runarray.in" size_t N; real *A=copyTripleArray2Components(P,N); bound_double *B=bounddouble(N); @@ -2314,13 +2350,13 @@ void gen_runarray74(stack *Stack) {Stack->push<triple>(b); return;} } -#line 1937 "runarray.in" +#line 1973 "runarray.in" // pair minratio(triplearray2 *P, pair b); void gen_runarray75(stack *Stack) { pair b=vm::pop<pair>(Stack); triplearray2 * P=vm::pop<triplearray2 *>(Stack); -#line 1938 "runarray.in" +#line 1974 "runarray.in" size_t N; triple *A=copyTripleArray2C(P,N); real fuzz=Fuzz*norm(A,N); @@ -2331,13 +2367,13 @@ void gen_runarray75(stack *Stack) {Stack->push<pair>(b); return;} } -#line 1949 "runarray.in" +#line 1985 "runarray.in" // pair maxratio(triplearray2 *P, pair b); void gen_runarray76(stack *Stack) { pair b=vm::pop<pair>(Stack); triplearray2 * P=vm::pop<triplearray2 *>(Stack); -#line 1950 "runarray.in" +#line 1986 "runarray.in" size_t N; triple *A=copyTripleArray2C(P,N); bound_triple *B=boundtriple(N); @@ -2348,11 +2384,11 @@ void gen_runarray76(stack *Stack) {Stack->push<pair>(b); return;} } -#line 1961 "runarray.in" +#line 1997 "runarray.in" // realarray* _projection(); void gen_runarray77(stack *Stack) { -#line 1962 "runarray.in" +#line 1998 "runarray.in" #ifdef HAVE_GL array *a=new array(14); gl::projection P=gl::camera(); @@ -2389,161 +2425,161 @@ namespace trans { void gen_runarray_venv(venv &ve) { -#line 549 "runarray.in" +#line 585 "runarray.in" REGISTER_BLTIN(run::emptyArray,"emptyArray"); -#line 555 "runarray.in" +#line 591 "runarray.in" REGISTER_BLTIN(run::newDeepArray,"newDeepArray"); -#line 577 "runarray.in" +#line 613 "runarray.in" REGISTER_BLTIN(run::newInitializedArray,"newInitializedArray"); -#line 592 "runarray.in" +#line 628 "runarray.in" REGISTER_BLTIN(run::newAppendedArray,"newAppendedArray"); -#line 608 "runarray.in" +#line 644 "runarray.in" REGISTER_BLTIN(run::copyArrayValue,"copyArrayValue"); -#line 620 "runarray.in" +#line 656 "runarray.in" REGISTER_BLTIN(run::copyArray,"copyArray"); -#line 631 "runarray.in" +#line 667 "runarray.in" REGISTER_BLTIN(run::arrayRead,"arrayRead"); -#line 643 "runarray.in" +#line 679 "runarray.in" REGISTER_BLTIN(run::arraySliceRead,"arraySliceRead"); -#line 650 "runarray.in" +#line 686 "runarray.in" REGISTER_BLTIN(run::arraySliceReadToEnd,"arraySliceReadToEnd"); -#line 658 "runarray.in" +#line 694 "runarray.in" REGISTER_BLTIN(run::arrayArrayRead,"arrayArrayRead"); -#line 667 "runarray.in" +#line 703 "runarray.in" REGISTER_BLTIN(run::arrayWrite,"arrayWrite"); -#line 684 "runarray.in" +#line 720 "runarray.in" REGISTER_BLTIN(run::arraySliceWrite,"arraySliceWrite"); -#line 692 "runarray.in" +#line 728 "runarray.in" REGISTER_BLTIN(run::arraySliceWriteToEnd,"arraySliceWriteToEnd"); -#line 700 "runarray.in" +#line 736 "runarray.in" REGISTER_BLTIN(run::arrayLength,"arrayLength"); -#line 706 "runarray.in" +#line 742 "runarray.in" REGISTER_BLTIN(run::arrayKeys,"arrayKeys"); -#line 721 "runarray.in" +#line 757 "runarray.in" REGISTER_BLTIN(run::arrayCyclicFlag,"arrayCyclicFlag"); -#line 728 "runarray.in" +#line 764 "runarray.in" REGISTER_BLTIN(run::arraySetCyclicFlag,"arraySetCyclicFlag"); -#line 735 "runarray.in" +#line 771 "runarray.in" REGISTER_BLTIN(run::arrayInitializedHelper,"arrayInitializedHelper"); -#line 746 "runarray.in" +#line 782 "runarray.in" REGISTER_BLTIN(run::arrayInitialized,"arrayInitialized"); -#line 752 "runarray.in" +#line 788 "runarray.in" REGISTER_BLTIN(run::arrayCyclicHelper,"arrayCyclicHelper"); -#line 759 "runarray.in" +#line 795 "runarray.in" REGISTER_BLTIN(run::arrayCyclic,"arrayCyclic"); -#line 765 "runarray.in" +#line 801 "runarray.in" REGISTER_BLTIN(run::arrayPushHelper,"arrayPushHelper"); -#line 773 "runarray.in" +#line 809 "runarray.in" REGISTER_BLTIN(run::arrayPush,"arrayPush"); -#line 779 "runarray.in" +#line 815 "runarray.in" REGISTER_BLTIN(run::arrayAppendHelper,"arrayAppendHelper"); -#line 788 "runarray.in" +#line 824 "runarray.in" REGISTER_BLTIN(run::arrayAppend,"arrayAppend"); -#line 794 "runarray.in" +#line 830 "runarray.in" REGISTER_BLTIN(run::arrayPopHelper,"arrayPopHelper"); -#line 803 "runarray.in" +#line 839 "runarray.in" REGISTER_BLTIN(run::arrayPop,"arrayPop"); -#line 809 "runarray.in" +#line 845 "runarray.in" REGISTER_BLTIN(run::arrayInsertHelper,"arrayInsertHelper"); -#line 820 "runarray.in" +#line 856 "runarray.in" REGISTER_BLTIN(run::arrayInsert,"arrayInsert"); -#line 826 "runarray.in" +#line 862 "runarray.in" REGISTER_BLTIN(run::arrayDelete,"arrayDelete"); -#line 832 "runarray.in" +#line 868 "runarray.in" REGISTER_BLTIN(run::arrayAlias,"arrayAlias"); -#line 837 "runarray.in" +#line 873 "runarray.in" REGISTER_BLTIN(run::arrayIntArray,"arrayIntArray"); -#line 855 "runarray.in" +#line 891 "runarray.in" addFunc(ve, run::gen_runarray32, IntArray(), SYM(complement), formal(IntArray(), SYM(a), false, false), formal(primInt(), SYM(n), false, false)); -#line 874 "runarray.in" +#line 910 "runarray.in" REGISTER_BLTIN(run::arraySequence,"arraySequence"); -#line 887 "runarray.in" +#line 923 "runarray.in" addFunc(ve, run::gen_runarray34, IntArray(), SYM(sequence), formal(primInt(), SYM(n), false, false)); -#line 898 "runarray.in" +#line 934 "runarray.in" REGISTER_BLTIN(run::arrayFunction,"arrayFunction"); -#line 911 "runarray.in" +#line 947 "runarray.in" REGISTER_BLTIN(run::arraySort,"arraySort"); -#line 921 "runarray.in" +#line 957 "runarray.in" REGISTER_BLTIN(run::arraySearch,"arraySearch"); -#line 940 "runarray.in" +#line 976 "runarray.in" addFunc(ve, run::gen_runarray38, primBoolean(), SYM(all), formal(booleanArray(), SYM(a), false, false)); -#line 949 "runarray.in" +#line 985 "runarray.in" addFunc(ve, run::gen_runarray39, booleanArray(), SYM_LOGNOT, formal(booleanArray(), SYM(a), false, false)); -#line 958 "runarray.in" +#line 994 "runarray.in" addFunc(ve, run::gen_runarray40, primInt(), SYM(sum), formal(booleanArray(), SYM(a), false, false)); -#line 967 "runarray.in" +#line 1003 "runarray.in" REGISTER_BLTIN(run::arrayConcat,"arrayConcat"); -#line 995 "runarray.in" +#line 1031 "runarray.in" REGISTER_BLTIN(run::array2Transpose,"array2Transpose"); -#line 1019 "runarray.in" +#line 1055 "runarray.in" REGISTER_BLTIN(run::array3Transpose,"array3Transpose"); -#line 1106 "runarray.in" +#line 1142 "runarray.in" addFunc(ve, run::gen_runarray44, primInt(), SYM(find), formal(booleanArray(), SYM(a), false, false), formal(primInt(), SYM(n), true, false)); -#line 1125 "runarray.in" +#line 1161 "runarray.in" addFunc(ve, run::gen_runarray45, IntArray(), SYM(findall), formal(booleanArray(), SYM(a), false, false)); -#line 1138 "runarray.in" +#line 1174 "runarray.in" REGISTER_BLTIN(run::arrayConditional,"arrayConditional"); -#line 1164 "runarray.in" +#line 1200 "runarray.in" addFunc(ve, run::gen_runarray47, realArray2(), SYM(identity), formal(primInt(), SYM(n), false, false)); -#line 1170 "runarray.in" +#line 1206 "runarray.in" addFunc(ve, run::gen_runarray48, realArray2(), SYM(inverse), formal(realArray2(), SYM(a), false, false)); -#line 1182 "runarray.in" +#line 1218 "runarray.in" addFunc(ve, run::gen_runarray49, realArray(), SYM(solve), formal(realArray2(), SYM(a), false, false), formal(realArray(), SYM(b), false, false), formal(primBoolean(), SYM(warn), true, false)); -#line 1235 "runarray.in" +#line 1271 "runarray.in" addFunc(ve, run::gen_runarray50, realArray2(), SYM(solve), formal(realArray2(), SYM(a), false, false), formal(realArray2(), SYM(b), false, false), formal(primBoolean(), SYM(warn), true, false)); -#line 1300 "runarray.in" +#line 1336 "runarray.in" addFunc(ve, run::gen_runarray51, primReal(), SYM(determinant), formal(realArray2(), SYM(a), false, false)); -#line 1317 "runarray.in" +#line 1353 "runarray.in" addFunc(ve, run::gen_runarray52, realArray(), SYM_TIMES, formal(realArray2(), SYM(a), false, false), formal(realArray(), SYM(b), false, false)); -#line 1336 "runarray.in" +#line 1372 "runarray.in" addFunc(ve, run::gen_runarray53, realArray(), SYM_TIMES, formal(realArray(), SYM(a), false, false), formal(realArray2(), SYM(b), false, false)); -#line 1365 "runarray.in" +#line 1401 "runarray.in" addFunc(ve, run::gen_runarray54, IntArray2(), SYM_TIMES, formal(IntArray2(), SYM(a), false, false), formal(IntArray2(), SYM(b), false, false)); -#line 1370 "runarray.in" +#line 1406 "runarray.in" addFunc(ve, run::gen_runarray55, realArray2(), SYM_TIMES, formal(realArray2(), SYM(a), false, false), formal(realArray2(), SYM(b), false, false)); -#line 1375 "runarray.in" +#line 1411 "runarray.in" addFunc(ve, run::gen_runarray56, pairArray2(), SYM_TIMES, formal(pairArray2(), SYM(a), false, false), formal(pairArray2(), SYM(b), false, false)); -#line 1380 "runarray.in" +#line 1416 "runarray.in" addFunc(ve, run::gen_runarray57, primTriple(), SYM_TIMES, formal(realArray2(), SYM(t), false, false), formal(primTriple(), SYM(v), false, false)); -#line 1385 "runarray.in" +#line 1421 "runarray.in" addFunc(ve, run::gen_runarray58, realArray2(), SYM(AtA), formal(realArray2(), SYM(a), false, false)); -#line 1390 "runarray.in" +#line 1426 "runarray.in" addFunc(ve, run::gen_runarray59, primPair(), SYM(project), formal(primTriple(), SYM(v), false, false), formal(realArray2(), SYM(t), false, false)); -#line 1415 "runarray.in" +#line 1451 "runarray.in" addFunc(ve, run::gen_runarray60, primReal(), SYM(dot), formal(realArray(), SYM(a), false, false), formal(realArray(), SYM(b), false, false)); -#line 1425 "runarray.in" +#line 1461 "runarray.in" addFunc(ve, run::gen_runarray61, primPair(), SYM(dot), formal(pairArray(), SYM(a), false, false), formal(pairArray(), SYM(b), false, false)); -#line 1435 "runarray.in" +#line 1471 "runarray.in" addFunc(ve, run::gen_runarray62, realArray(), SYM(tridiagonal), formal(realArray(), SYM(a), false, false), formal(realArray(), SYM(b), false, false), formal(realArray(), SYM(c), false, false), formal(realArray(), SYM(f), false, false)); -#line 1539 "runarray.in" +#line 1575 "runarray.in" addFunc(ve, run::gen_runarray63, primReal(), SYM(newton), formal(primInt(), SYM(iterations), true, false), formal(realRealFunction(), SYM(f), false, false), formal(realRealFunction(), SYM(fprime), false, false), formal(primReal(), SYM(x), false, false), formal(primBoolean(), SYM(verbose), true, false)); -#line 1586 "runarray.in" +#line 1622 "runarray.in" addFunc(ve, run::gen_runarray64, primReal(), SYM(newton), formal(primInt(), SYM(iterations), true, false), formal(realRealFunction(), SYM(f), false, false), formal(realRealFunction(), SYM(fprime), false, false), formal(primReal(), SYM(x1), false, false), formal(primReal(), SYM(x2), false, false), formal(primBoolean(), SYM(verbose), true, false)); -#line 1668 "runarray.in" +#line 1704 "runarray.in" addFunc(ve, run::gen_runarray65, primReal(), SYM(_findroot), formal(realRealFunction(), SYM(f), false, false), formal(primReal(), SYM(a), false, false), formal(primReal(), SYM(b), false, false), formal(primReal(), SYM(tolerance), false, false), formal(primReal(), SYM(fa), false, false), formal(primReal(), SYM(fb), false, false)); -#line 1770 "runarray.in" +#line 1806 "runarray.in" addFunc(ve, run::gen_runarray66, primReal(), SYM(simpson), formal(realRealFunction(), SYM(f), false, false), formal(primReal(), SYM(a), false, false), formal(primReal(), SYM(b), false, false), formal(primReal(), SYM(acc), true, false), formal(primReal(), SYM(dxmax), true, false)); -#line 1784 "runarray.in" +#line 1820 "runarray.in" addFunc(ve, run::gen_runarray67, pairArray(), SYM(fft), formal(pairArray(), SYM(a), false, false), formal(primInt(), SYM(sign), true, false)); -#line 1815 "runarray.in" +#line 1851 "runarray.in" addFunc(ve, run::gen_runarray68, IntArray2(), SYM(triangulate), formal(pairArray(), SYM(z), false, false)); -#line 1850 "runarray.in" +#line 1886 "runarray.in" addFunc(ve, run::gen_runarray69, primReal(), SYM(norm), formal(realArray(), SYM(a), false, false)); -#line 1861 "runarray.in" +#line 1897 "runarray.in" addFunc(ve, run::gen_runarray70, primReal(), SYM(norm), formal(realArray2(), SYM(a), false, false)); -#line 1876 "runarray.in" +#line 1912 "runarray.in" addFunc(ve, run::gen_runarray71, primReal(), SYM(norm), formal(tripleArray2(), SYM(a), false, false)); -#line 1891 "runarray.in" +#line 1927 "runarray.in" addFunc(ve, run::gen_runarray72, primReal(), SYM(change2), formal(tripleArray2(), SYM(a), false, false)); -#line 1913 "runarray.in" +#line 1949 "runarray.in" addFunc(ve, run::gen_runarray73, primTriple(), SYM(minbezier), formal(tripleArray2(), SYM(p), false, false), formal(primTriple(), SYM(b), false, false)); -#line 1925 "runarray.in" +#line 1961 "runarray.in" addFunc(ve, run::gen_runarray74, primTriple(), SYM(maxbezier), formal(tripleArray2(), SYM(p), false, false), formal(primTriple(), SYM(b), false, false)); -#line 1937 "runarray.in" +#line 1973 "runarray.in" addFunc(ve, run::gen_runarray75, primPair(), SYM(minratio), formal(tripleArray2(), SYM(p), false, false), formal(primPair(), SYM(b), false, false)); -#line 1949 "runarray.in" +#line 1985 "runarray.in" addFunc(ve, run::gen_runarray76, primPair(), SYM(maxratio), formal(tripleArray2(), SYM(p), false, false), formal(primPair(), SYM(b), false, false)); -#line 1961 "runarray.in" +#line 1997 "runarray.in" addFunc(ve, run::gen_runarray77, realArray(), SYM(_projection)); } |