diff options
Diffstat (limited to 'graphics/asymptote/runarray.cc')
-rw-r--r-- | graphics/asymptote/runarray.cc | 638 |
1 files changed, 382 insertions, 256 deletions
diff --git a/graphics/asymptote/runarray.cc b/graphics/asymptote/runarray.cc index d750211978..5478028e4e 100644 --- a/graphics/asymptote/runarray.cc +++ b/graphics/asymptote/runarray.cc @@ -61,7 +61,7 @@ function *realRealFunction(); #define CURRENTPEN processData().currentpen -#line 21 "runarray.in" +#line 22 "runarray.in" #include "array.h" #include "arrayop.h" #include "triple.h" @@ -71,6 +71,10 @@ function *realRealFunction(); #ifdef HAVE_LIBFFTW3 #include "fftw++.h" +static const char *rectangular="matrix must be rectangular"; +#else +static const char *installFFTW= + "Please install fftw3, run ./configure, and recompile"; #endif using namespace camp; @@ -87,6 +91,7 @@ typedef array realarray; typedef array realarray2; typedef array pairarray; typedef array pairarray2; +typedef array pairarray3; typedef array triplearray2; using types::booleanArray; @@ -96,6 +101,7 @@ using types::realArray; using types::realArray2; using types::pairArray; using types::pairArray2; +using types::pairArray3; using types::tripleArray2; typedef callable callableReal; @@ -155,6 +161,7 @@ array *Identity(Int n) static const char *incommensurate="Incommensurate matrices"; static const char *singular="Singular matrix"; static const char *invalidarraylength="Invalid array length: "; + static size_t *pivot,*Row,*Col; bound_double *bounddouble(int N) @@ -633,10 +640,10 @@ void integeroverflow(size_t i) #endif namespace run { // Create an empty array. -#line 586 "runarray.in" +#line 594 "runarray.in" void emptyArray(stack *Stack) { -#line 587 "runarray.in" +#line 595 "runarray.in" {Stack->push<array*>(new array(0)); return;} } @@ -645,11 +652,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 596 "runarray.in" +#line 604 "runarray.in" void newDeepArray(stack *Stack) { Int depth=vm::pop<Int>(Stack); -#line 597 "runarray.in" +#line 605 "runarray.in" assert(depth > 0); Int *dims = new Int[depth]; @@ -668,11 +675,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 616 "runarray.in" +#line 624 "runarray.in" void newInitializedArray(stack *Stack) { Int n=vm::pop<Int>(Stack); -#line 617 "runarray.in" +#line 625 "runarray.in" assert(n >= 0); array *a = new array(n); @@ -685,12 +692,12 @@ void newInitializedArray(stack *Stack) // Similar to newInitializedArray, but after the n elements, append another // array to it. -#line 630 "runarray.in" +#line 638 "runarray.in" void newAppendedArray(stack *Stack) { Int n=vm::pop<Int>(Stack); array* tail=vm::pop<array*>(Stack); -#line 631 "runarray.in" +#line 639 "runarray.in" assert(n >= 0); array *a = new array(n); @@ -707,14 +714,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 648 "runarray.in" +#line 656 "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 649 "runarray.in" +#line 657 "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; @@ -725,25 +732,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 660 "runarray.in" +#line 668 "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 661 "runarray.in" +#line 669 "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 668 "runarray.in" +#line 676 "runarray.in" void arrayRead(stack *Stack) { Int n=vm::pop<Int>(Stack); array * a=vm::pop<array *>(Stack); -#line 669 "runarray.in" +#line 677 "runarray.in" item& i=arrayRead(a,n); if (i.empty()) { ostringstream buf; @@ -754,37 +761,37 @@ void arrayRead(stack *Stack) } // Slice a substring from an array. -#line 680 "runarray.in" +#line 688 "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 681 "runarray.in" +#line 689 "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 688 "runarray.in" +#line 696 "runarray.in" void arraySliceReadToEnd(stack *Stack) { Int left=vm::pop<Int>(Stack); array * a=vm::pop<array *>(Stack); -#line 689 "runarray.in" +#line 697 "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 696 "runarray.in" +#line 704 "runarray.in" void arrayArrayRead(stack *Stack) { Int n=vm::pop<Int>(Stack); array * a=vm::pop<array *>(Stack); -#line 697 "runarray.in" +#line 705 "runarray.in" item& i=arrayRead(a,n); if (i.empty()) i=new array(0); {Stack->push(i); return;} @@ -792,13 +799,13 @@ void arrayArrayRead(stack *Stack) // Write an element to an array. Increase size if necessary. // TODO: Add arrayWriteAndPop -#line 705 "runarray.in" +#line 713 "runarray.in" void arrayWrite(stack *Stack) { item value=vm::pop(Stack); Int n=vm::pop<Int>(Stack); array * a=vm::pop<array *>(Stack); -#line 706 "runarray.in" +#line 714 "runarray.in" size_t len=checkArray(a); bool cyclic=a->cyclic(); if(cyclic && len > 0) n=imod(n,len); @@ -812,27 +819,27 @@ void arrayWrite(stack *Stack) {Stack->push(value); return;} } -#line 720 "runarray.in" +#line 728 "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 721 "runarray.in" +#line 729 "runarray.in" checkArray(src); checkArray(dest); dest->setSlice(left, right, src); {Stack->push<array*>(src); return;} } -#line 728 "runarray.in" +#line 736 "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 729 "runarray.in" +#line 737 "runarray.in" checkArray(src); size_t len=checkArray(dest); dest->setSlice(left, (Int) len, src); @@ -840,20 +847,20 @@ void arraySliceWriteToEnd(stack *Stack) } // Returns the length of an array. -#line 737 "runarray.in" +#line 745 "runarray.in" void arrayLength(stack *Stack) { array * a=vm::pop<array *>(Stack); -#line 738 "runarray.in" +#line 746 "runarray.in" {Stack->push<Int>((Int) checkArray(a)); return;} } // Returns an array of integers representing the keys of the array. -#line 743 "runarray.in" +#line 751 "runarray.in" void arrayKeys(stack *Stack) { array * a=vm::pop<array *>(Stack); -#line 744 "runarray.in" +#line 752 "runarray.in" size_t size=checkArray(a); array *keys=new array(); @@ -867,33 +874,33 @@ void arrayKeys(stack *Stack) } // Return the cyclic flag for an array. -#line 758 "runarray.in" +#line 766 "runarray.in" void arrayCyclicFlag(stack *Stack) { array * a=vm::pop<array *>(Stack); -#line 759 "runarray.in" +#line 767 "runarray.in" checkArray(a); {Stack->push<bool>(a->cyclic()); return;} } -#line 764 "runarray.in" +#line 772 "runarray.in" void arraySetCyclicFlag(stack *Stack) { array * a=vm::pop<array *>(Stack); bool b=vm::pop<bool>(Stack); -#line 765 "runarray.in" +#line 773 "runarray.in" checkArray(a); a->cyclic(b); {Stack->push<bool>(b); return;} } // Check to see if an array element is initialized. -#line 772 "runarray.in" +#line 780 "runarray.in" void arrayInitializedHelper(stack *Stack) { array * a=vm::pop<array *>(Stack); Int n=vm::pop<Int>(Stack); -#line 773 "runarray.in" +#line 781 "runarray.in" size_t len=checkArray(a); bool cyclic=a->cyclic(); if(cyclic && len > 0) n=imod(n,len); @@ -903,62 +910,62 @@ void arrayInitializedHelper(stack *Stack) } // Returns the initialize method for an array. -#line 783 "runarray.in" +#line 791 "runarray.in" void arrayInitialized(stack *Stack) { array * a=vm::pop<array *>(Stack); -#line 784 "runarray.in" +#line 792 "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 789 "runarray.in" +#line 797 "runarray.in" void arrayCyclicHelper(stack *Stack) { array * a=vm::pop<array *>(Stack); bool b=vm::pop<bool>(Stack); -#line 790 "runarray.in" +#line 798 "runarray.in" checkArray(a); a->cyclic(b); } // Set the cyclic flag for an array. -#line 796 "runarray.in" +#line 804 "runarray.in" void arrayCyclic(stack *Stack) { array * a=vm::pop<array *>(Stack); -#line 797 "runarray.in" +#line 805 "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 802 "runarray.in" +#line 810 "runarray.in" void arrayPushHelper(stack *Stack) { array * a=vm::pop<array *>(Stack); item x=vm::pop(Stack); -#line 803 "runarray.in" +#line 811 "runarray.in" checkArray(a); a->push(x); {Stack->push(x); return;} } // Returns the push method for an array. -#line 810 "runarray.in" +#line 818 "runarray.in" void arrayPush(stack *Stack) { array * a=vm::pop<array *>(Stack); -#line 811 "runarray.in" +#line 819 "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 816 "runarray.in" +#line 824 "runarray.in" void arrayAppendHelper(stack *Stack) { array * a=vm::pop<array *>(Stack); array * b=vm::pop<array *>(Stack); -#line 817 "runarray.in" +#line 825 "runarray.in" checkArray(a); size_t size=checkArray(b); for(size_t i=0; i < size; i++) @@ -966,20 +973,20 @@ void arrayAppendHelper(stack *Stack) } // Returns the append method for an array. -#line 825 "runarray.in" +#line 833 "runarray.in" void arrayAppend(stack *Stack) { array * a=vm::pop<array *>(Stack); -#line 826 "runarray.in" +#line 834 "runarray.in" {Stack->push<callable*>(new thunk(new bfunc(arrayAppendHelper),a)); return;} } // The helper function for the pop method. -#line 831 "runarray.in" +#line 839 "runarray.in" void arrayPopHelper(stack *Stack) { array * a=vm::pop<array *>(Stack); -#line 832 "runarray.in" +#line 840 "runarray.in" size_t asize=checkArray(a); if(asize == 0) error("cannot pop element from empty array"); @@ -987,22 +994,22 @@ void arrayPopHelper(stack *Stack) } // Returns the pop method for an array. -#line 840 "runarray.in" +#line 848 "runarray.in" void arrayPop(stack *Stack) { array * a=vm::pop<array *>(Stack); -#line 841 "runarray.in" +#line 849 "runarray.in" {Stack->push<callable*>(new thunk(new bfunc(arrayPopHelper),a)); return;} } // The helper function for the insert method. -#line 846 "runarray.in" +#line 854 "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 847 "runarray.in" +#line 855 "runarray.in" size_t asize=checkArray(a); checkArray(x); if(a->cyclic() && asize > 0) i=imod(i,asize); @@ -1012,39 +1019,39 @@ void arrayInsertHelper(stack *Stack) } // Returns the insert method for an array. -#line 857 "runarray.in" +#line 865 "runarray.in" void arrayInsert(stack *Stack) { array * a=vm::pop<array *>(Stack); -#line 858 "runarray.in" +#line 866 "runarray.in" {Stack->push<callable*>(new thunk(new bfunc(arrayInsertHelper),a)); return;} } // Returns the delete method for an array. -#line 863 "runarray.in" +#line 871 "runarray.in" void arrayDelete(stack *Stack) { array * a=vm::pop<array *>(Stack); -#line 864 "runarray.in" +#line 872 "runarray.in" {Stack->push<callable*>(new thunk(new bfunc(arrayDeleteHelper),a)); return;} } -#line 868 "runarray.in" +#line 876 "runarray.in" void arrayAlias(stack *Stack) { array * b=vm::pop<array *>(Stack); array * a=vm::pop<array *>(Stack); -#line 869 "runarray.in" +#line 877 "runarray.in" {Stack->push<bool>(a==b); return;} } // Return array formed by indexing array a with elements of integer array b -#line 874 "runarray.in" +#line 882 "runarray.in" void arrayIntArray(stack *Stack) { array * b=vm::pop<array *>(Stack); array * a=vm::pop<array *>(Stack); -#line 875 "runarray.in" +#line 883 "runarray.in" size_t asize=checkArray(a); size_t bsize=checkArray(b); array *r=new array(bsize); @@ -1062,13 +1069,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 893 "runarray.in" +#line 901 "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 894 "runarray.in" +#line 902 "runarray.in" size_t asize=checkArray(a); array *r=new array(0); bool *keep=new bool[n]; @@ -1085,12 +1092,12 @@ void gen_runarray32(stack *Stack) } // Generate the sequence {f(i) : i=0,1,...n-1} given a function f and integer n -#line 911 "runarray.in" +#line 919 "runarray.in" void arraySequence(stack *Stack) { Int n=vm::pop<Int>(Stack); callable * f=vm::pop<callable *>(Stack); -#line 912 "runarray.in" +#line 920 "runarray.in" if(n < 0) n=0; array *a=new array(n); for(Int i=0; i < n; ++i) { @@ -1102,12 +1109,12 @@ void arraySequence(stack *Stack) } // Return the array {0,1,...n-1} -#line 924 "runarray.in" +#line 932 "runarray.in" // Intarray* sequence(Int n); void gen_runarray34(stack *Stack) { Int n=vm::pop<Int>(Stack); -#line 925 "runarray.in" +#line 933 "runarray.in" if(n < 0) n=0; array *a=new array(n); for(Int i=0; i < n; ++i) { @@ -1117,12 +1124,12 @@ void gen_runarray34(stack *Stack) } // Apply a function to each element of an array -#line 935 "runarray.in" +#line 943 "runarray.in" void arrayFunction(stack *Stack) { array * a=vm::pop<array *>(Stack); callable * f=vm::pop<callable *>(Stack); -#line 936 "runarray.in" +#line 944 "runarray.in" size_t size=checkArray(a); array *b=new array(size); for(size_t i=0; i < size; ++i) { @@ -1133,13 +1140,13 @@ void arrayFunction(stack *Stack) {Stack->push<array*>(b); return;} } -#line 947 "runarray.in" +#line 955 "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 948 "runarray.in" +#line 956 "runarray.in" array *c=copyArray(a); compareFunc=less; FuncStack=Stack; @@ -1148,13 +1155,13 @@ void arraySort(stack *Stack) {Stack->push<array*>(c); return;} } -#line 957 "runarray.in" +#line 965 "runarray.in" void arraySearch(stack *Stack) { callable * less=vm::pop<callable *>(Stack); item key=vm::pop(Stack); array * a=vm::pop<array *>(Stack); -#line 958 "runarray.in" +#line 966 "runarray.in" size_t size=a->size(); compareFunc=less; FuncStack=Stack; @@ -1172,12 +1179,12 @@ void arraySearch(stack *Stack) {Stack->push<Int>(0); return;} } -#line 976 "runarray.in" +#line 984 "runarray.in" // bool all(boolarray *a); void gen_runarray38(stack *Stack) { boolarray * a=vm::pop<boolarray *>(Stack); -#line 977 "runarray.in" +#line 985 "runarray.in" size_t size=checkArray(a); bool c=true; for(size_t i=0; i < size; i++) @@ -1185,12 +1192,12 @@ void gen_runarray38(stack *Stack) {Stack->push<bool>(c); return;} } -#line 985 "runarray.in" +#line 993 "runarray.in" // boolarray* !(boolarray* a); void gen_runarray39(stack *Stack) { boolarray* a=vm::pop<boolarray*>(Stack); -#line 986 "runarray.in" +#line 994 "runarray.in" size_t size=checkArray(a); array *c=new array(size); for(size_t i=0; i < size; i++) @@ -1198,12 +1205,12 @@ void gen_runarray39(stack *Stack) {Stack->push<boolarray*>(c); return;} } -#line 994 "runarray.in" +#line 1002 "runarray.in" // Int sum(boolarray *a); void gen_runarray40(stack *Stack) { boolarray * a=vm::pop<boolarray *>(Stack); -#line 995 "runarray.in" +#line 1003 "runarray.in" size_t size=checkArray(a); Int sum=0; for(size_t i=0; i < size; i++) @@ -1211,11 +1218,11 @@ void gen_runarray40(stack *Stack) {Stack->push<Int>(sum); return;} } -#line 1003 "runarray.in" +#line 1011 "runarray.in" void arrayConcat(stack *Stack) { array * a=vm::pop<array *>(Stack); -#line 1004 "runarray.in" +#line 1012 "runarray.in" // a is an array of arrays to be concatenated together. // The signature is // T[] concat(... T[][] a); @@ -1242,11 +1249,11 @@ void arrayConcat(stack *Stack) {Stack->push<array*>(result); return;} } -#line 1031 "runarray.in" +#line 1039 "runarray.in" void array2Transpose(stack *Stack) { array * a=vm::pop<array *>(Stack); -#line 1032 "runarray.in" +#line 1040 "runarray.in" size_t asize=checkArray(a); array *c=new array(0); for(size_t i=0; i < asize; i++) { @@ -1273,12 +1280,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 1059 "runarray.in" +#line 1067 "runarray.in" void array3Transpose(stack *Stack) { array * perm=vm::pop<array *>(Stack); array * a=vm::pop<array *>(Stack); -#line 1060 "runarray.in" +#line 1068 "runarray.in" const size_t DIM=3; if(checkArray(perm) != DIM) { @@ -1362,13 +1369,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 1144 "runarray.in" +#line 1152 "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 1145 "runarray.in" +#line 1153 "runarray.in" size_t size=checkArray(a); Int j=-1; if(n > 0) @@ -1385,12 +1392,12 @@ void gen_runarray44(stack *Stack) } // Find all indices of true values in a boolean array. -#line 1162 "runarray.in" +#line 1170 "runarray.in" // Intarray* findall(boolarray *a); void gen_runarray45(stack *Stack) { boolarray * a=vm::pop<boolarray *>(Stack); -#line 1163 "runarray.in" +#line 1171 "runarray.in" size_t size=checkArray(a); array *b=new array(0); for(size_t i=0; i < size; i++) { @@ -1403,13 +1410,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 1176 "runarray.in" +#line 1184 "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 1177 "runarray.in" +#line 1185 "runarray.in" size_t size=checkArray(a); array *r=new array(size); if(b && c) { @@ -1433,22 +1440,22 @@ void arrayConditional(stack *Stack) } // Return an n x n identity matrix. -#line 1201 "runarray.in" +#line 1209 "runarray.in" // realarray2* identity(Int n); void gen_runarray47(stack *Stack) { Int n=vm::pop<Int>(Stack); -#line 1202 "runarray.in" +#line 1210 "runarray.in" {Stack->push<realarray2*>(Identity(n)); return;} } // Return the inverse of an n x n matrix a using Gauss-Jordan elimination. -#line 1207 "runarray.in" +#line 1215 "runarray.in" // realarray2* inverse(realarray2 *a); void gen_runarray48(stack *Stack) { realarray2 * a=vm::pop<realarray2 *>(Stack); -#line 1208 "runarray.in" +#line 1216 "runarray.in" size_t n=checkArray(a); double *A; copyArray2C(A,a,true,0,NoGC); @@ -1461,14 +1468,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 1221 "runarray.in" +#line 1229 "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 1222 "runarray.in" +#line 1230 "runarray.in" size_t n=checkArray(a); if(n == 0) {Stack->push<realarray*>(new array(0)); return;} @@ -1520,14 +1527,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 1274 "runarray.in" +#line 1282 "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 1275 "runarray.in" +#line 1283 "runarray.in" size_t n=checkArray(a); if(n == 0) {Stack->push<realarray2*>(new array(0)); return;} @@ -1589,12 +1596,12 @@ void gen_runarray50(stack *Stack) } // Compute the determinant of an n x n matrix. -#line 1337 "runarray.in" +#line 1345 "runarray.in" // real determinant(realarray2 *a); void gen_runarray51(stack *Stack) { realarray2 * a=vm::pop<realarray2 *>(Stack); -#line 1338 "runarray.in" +#line 1346 "runarray.in" real *A; copyArray2C(A,a); size_t n=checkArray(a); @@ -1609,13 +1616,13 @@ void gen_runarray51(stack *Stack) {Stack->push<real>(det); return;} } -#line 1353 "runarray.in" +#line 1361 "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 1354 "runarray.in" +#line 1362 "runarray.in" size_t n=checkArray(a); size_t m=checkArray(b); array *c=new array(n); @@ -1633,13 +1640,13 @@ void gen_runarray52(stack *Stack) {Stack->push<realarray*>(c); return;} } -#line 1372 "runarray.in" +#line 1380 "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 1373 "runarray.in" +#line 1381 "runarray.in" size_t n=checkArray(a); if(n != checkArray(b)) error(incommensurate); real *A; @@ -1667,62 +1674,62 @@ void gen_runarray53(stack *Stack) {Stack->push<realarray*>(c); return;} } -#line 1401 "runarray.in" +#line 1409 "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 1402 "runarray.in" +#line 1410 "runarray.in" {Stack->push<Intarray2*>(mult<Int>(a,b)); return;} } -#line 1406 "runarray.in" +#line 1414 "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 1407 "runarray.in" +#line 1415 "runarray.in" {Stack->push<realarray2*>(mult<real>(a,b)); return;} } -#line 1411 "runarray.in" +#line 1419 "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 1412 "runarray.in" +#line 1420 "runarray.in" {Stack->push<pairarray2*>(mult<pair>(a,b)); return;} } -#line 1416 "runarray.in" +#line 1424 "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 1417 "runarray.in" +#line 1425 "runarray.in" {Stack->push<triple>(*t*v); return;} } -#line 1421 "runarray.in" +#line 1429 "runarray.in" // realarray2* AtA(realarray2 *a); void gen_runarray58(stack *Stack) { realarray2 * a=vm::pop<realarray2 *>(Stack); -#line 1422 "runarray.in" +#line 1430 "runarray.in" {Stack->push<realarray2*>(AtA<real>(a)); return;} } -#line 1426 "runarray.in" +#line 1434 "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 1427 "runarray.in" +#line 1435 "runarray.in" size_t n=checkArray(t); if(n != 4) error(incommensurate); array *t0=read<array*>(t,0); @@ -1747,13 +1754,13 @@ void gen_runarray59(stack *Stack) } // Compute the dot product of vectors a and b. -#line 1452 "runarray.in" +#line 1460 "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 1453 "runarray.in" +#line 1461 "runarray.in" size_t n=checkArrays(a,b); real sum=0.0; for(size_t i=0; i < n; ++i) @@ -1762,13 +1769,13 @@ void gen_runarray60(stack *Stack) } // Compute the complex dot product of vectors a and b. -#line 1462 "runarray.in" +#line 1470 "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 1463 "runarray.in" +#line 1471 "runarray.in" size_t n=checkArrays(a,b); pair sum=zero; for(size_t i=0; i < n; ++i) @@ -1783,7 +1790,7 @@ void gen_runarray61(stack *Stack) // [ a[2] b[2] c[2] ] // [ ... ] // [ c[n-1] a[n-1] b[n-1] ] -#line 1478 "runarray.in" +#line 1486 "runarray.in" // realarray* tridiagonal(realarray *a, realarray *b, realarray *c, realarray *f); void gen_runarray62(stack *Stack) { @@ -1791,7 +1798,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 1479 "runarray.in" +#line 1487 "runarray.in" size_t n=checkArrays(a,b); checkEqual(n,checkArray(c)); checkEqual(n,checkArray(f)); @@ -1888,7 +1895,7 @@ void gen_runarray62(stack *Stack) } // Root solve by Newton-Raphson -#line 1576 "runarray.in" +#line 1584 "runarray.in" // real newton(Int iterations=100, callableReal *f, callableReal *fprime, real x, bool verbose=false); void gen_runarray63(stack *Stack) { @@ -1897,7 +1904,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 1578 "runarray.in" +#line 1586 "runarray.in" static const real fuzz=1000.0*DBL_EPSILON; Int i=0; size_t oldPrec=0; @@ -1943,7 +1950,7 @@ void gen_runarray63(stack *Stack) // Root solve by Newton-Raphson bisection // cf. routine rtsafe (Press et al., Numerical Recipes, 1991). -#line 1624 "runarray.in" +#line 1632 "runarray.in" // real newton(Int iterations=100, callableReal *f, callableReal *fprime, real x1, real x2, bool verbose=false); void gen_runarray64(stack *Stack) { @@ -1953,7 +1960,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 1626 "runarray.in" +#line 1634 "runarray.in" static const real fuzz=1000.0*DBL_EPSILON; size_t oldPrec=0; if(verbose) @@ -2039,7 +2046,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 1712 "runarray.in" +#line 1720 "runarray.in" // real _findroot(callableReal *f, real a, real b, real tolerance, real fa, real fb); void gen_runarray65(stack *Stack) { @@ -2049,7 +2056,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 1714 "runarray.in" +#line 1722 "runarray.in" if(fa == 0.0) {Stack->push<real>(a); return;} if(fb == 0.0) {Stack->push<real>(b); return;} @@ -2141,7 +2148,7 @@ void gen_runarray65(stack *Stack) {Stack->push<real>(a-(b-a)/(fb-fa)*fa); return;} } -#line 1806 "runarray.in" +#line 1814 "runarray.in" // real simpson(callableReal *f, real a, real b, real acc=DBL_EPSILON, real dxmax=0); void gen_runarray66(stack *Stack) { @@ -2150,7 +2157,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 1808 "runarray.in" +#line 1816 "runarray.in" real integral; if(dxmax <= 0) dxmax=fabs(b-a); callable *oldFunc=Func; @@ -2163,13 +2170,13 @@ void gen_runarray66(stack *Stack) } // Compute the fast Fourier transform of a pair array -#line 1821 "runarray.in" +#line 1829 "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 1822 "runarray.in" +#line 1830 "runarray.in" #ifdef HAVE_LIBFFTW3 unsigned n=(unsigned) checkArray(a); array *c=new array(n); @@ -2193,17 +2200,132 @@ void gen_runarray67(stack *Stack) unused(a); unused(&sign); array *c=new array(0); - error("Please install fftw3, run ./configure, and recompile"); + error(installFFTW); #endif // HAVE_LIBFFTW3 {Stack->push<pairarray*>(c); return;} } -#line 1851 "runarray.in" -// Intarray2* triangulate(pairarray *z); +// Compute the fast Fourier transform of a 2D pair array +#line 1860 "runarray.in" +// pairarray2* fft(pairarray2 *a, Int sign=1); void gen_runarray68(stack *Stack) { + Int sign=vm::pop<Int>(Stack,1); + pairarray2 * a=vm::pop<pairarray2 *>(Stack); +#line 1861 "runarray.in" +#ifdef HAVE_LIBFFTW3 + size_t n=checkArray(a); + size_t m=n == 0 ? 0 : checkArray(read<array*>(a,0)); + + array *c=new array(n); + Complex *f=utils::ComplexAlign(n*m); + fftwpp::fft2d Forward(n,m,intcast(sign),f); + + if(n) { + for(size_t i=0; i < n; ++i) { + array *ai=read<array *>(a,i); + size_t aisize=checkArray(ai); + if(aisize != m) error(rectangular); + Complex *fi=f+m*i; + for(size_t j=0; j < m; ++j) { + pair z=read<pair>(ai,j); + fi[j]=Complex(z.getx(),z.gety()); + } + } + + Forward.fft(f); + + for(size_t i=0; i < n; ++i) { + array *ci=new array(m); + (*c)[i]=ci; + Complex *fi=f+m*i; + for(size_t j=0; j < m; ++j) { + Complex z=fi[j]; + (*ci)[j]=pair(z.real(),z.imag()); + } + } + + utils::deleteAlign(f); + } +#else + unused(a); + unused(&sign); + array *c=new array(0); + error(installFFTW); +#endif // HAVE_LIBFFTW3 + {Stack->push<pairarray2*>(c); return;} +} + +// Compute the fast Fourier transform of a 3D pair array +#line 1906 "runarray.in" +// pairarray3* fft(pairarray3 *a, Int sign=1); +void gen_runarray69(stack *Stack) +{ + Int sign=vm::pop<Int>(Stack,1); + pairarray3 * a=vm::pop<pairarray3 *>(Stack); +#line 1907 "runarray.in" +#ifdef HAVE_LIBFFTW3 + size_t n=checkArray(a); + array *a0=read<array*>(a,0); + size_t m=n == 0 ? 0 : checkArray(a0); + size_t l=m == 0 ? 0 : checkArray(read<array*>(a0,0)); + + array *c=new array(n); + Complex *f=utils::ComplexAlign(n*m*l); + fftwpp::fft3d Forward(n,m,l,intcast(sign),f); + + if(n) { + for(size_t i=0; i < n; ++i) { + array *ai=read<array *>(a,i); + size_t aisize=checkArray(ai); + if(aisize != m) error(rectangular); + Complex *fi=f+m*l*i; + for(size_t j=0; j < m; ++j) { + array *aij=read<array *>(ai,j); + size_t aijsize=checkArray(aij); + if(aijsize != l) error(rectangular); + Complex *fij=fi+l*j; + for(size_t k=0; k < l; ++k) { + pair z=read<pair>(aij,k); + fij[k]=Complex(z.getx(),z.gety()); + } + } + } + + Forward.fft(f); + + for(size_t i=0; i < n; ++i) { + array *ci=new array(m); + (*c)[i]=ci; + Complex *fi=f+m*l*i; + for(size_t j=0; j < m; ++j) { + array *cij=new array(l); + (*ci)[j]=cij; + Complex *fij=fi+l*j; + for(size_t k=0; k < l; ++k) { + Complex z=fij[k]; + (*cij)[k]=pair(z.real(),z.imag()); + } + } + } + + utils::deleteAlign(f); + } +#else + unused(a); + unused(&sign); + array *c=new array(0); + error(installFFTW); +#endif // HAVE_LIBFFTW3 + {Stack->push<pairarray3*>(c); return;} +} + +#line 1964 "runarray.in" +// Intarray2* triangulate(pairarray *z); +void gen_runarray70(stack *Stack) +{ pairarray * z=vm::pop<pairarray *>(Stack); -#line 1852 "runarray.in" +#line 1965 "runarray.in" size_t nv=checkArray(z); // Call robust version of Gilles Dumoulin's port of Paul Bourke's // triangulation code. @@ -2237,12 +2359,12 @@ void gen_runarray68(stack *Stack) {Stack->push<Intarray2*>(t); return;} } -#line 1886 "runarray.in" +#line 1999 "runarray.in" // real norm(realarray *a); -void gen_runarray69(stack *Stack) +void gen_runarray71(stack *Stack) { realarray * a=vm::pop<realarray *>(Stack); -#line 1887 "runarray.in" +#line 2000 "runarray.in" size_t n=checkArray(a); real M=0.0; for(size_t i=0; i < n; ++i) { @@ -2252,12 +2374,12 @@ void gen_runarray69(stack *Stack) {Stack->push<real>(M); return;} } -#line 1897 "runarray.in" +#line 2010 "runarray.in" // real norm(realarray2 *a); -void gen_runarray70(stack *Stack) +void gen_runarray72(stack *Stack) { realarray2 * a=vm::pop<realarray2 *>(Stack); -#line 1898 "runarray.in" +#line 2011 "runarray.in" size_t n=checkArray(a); real M=0.0; for(size_t i=0; i < n; ++i) { @@ -2271,12 +2393,12 @@ void gen_runarray70(stack *Stack) {Stack->push<real>(M); return;} } -#line 1912 "runarray.in" +#line 2025 "runarray.in" // real norm(triplearray2 *a); -void gen_runarray71(stack *Stack) +void gen_runarray73(stack *Stack) { triplearray2 * a=vm::pop<triplearray2 *>(Stack); -#line 1913 "runarray.in" +#line 2026 "runarray.in" size_t n=checkArray(a); real M=0.0; for(size_t i=0; i < n; ++i) { @@ -2290,12 +2412,12 @@ void gen_runarray71(stack *Stack) {Stack->push<real>(sqrt(M)); return;} } -#line 1927 "runarray.in" +#line 2040 "runarray.in" // real change2(triplearray2 *a); -void gen_runarray72(stack *Stack) +void gen_runarray74(stack *Stack) { triplearray2 * a=vm::pop<triplearray2 *>(Stack); -#line 1928 "runarray.in" +#line 2041 "runarray.in" size_t n=checkArray(a); if(n == 0) {Stack->push<real>(0.0); return;} @@ -2316,13 +2438,13 @@ void gen_runarray72(stack *Stack) {Stack->push<real>(M); return;} } -#line 1949 "runarray.in" +#line 2062 "runarray.in" // triple minbezier(triplearray2 *P, triple b); -void gen_runarray73(stack *Stack) +void gen_runarray75(stack *Stack) { triple b=vm::pop<triple>(Stack); triplearray2 * P=vm::pop<triplearray2 *>(Stack); -#line 1950 "runarray.in" +#line 2063 "runarray.in" size_t N; real *A=copyTripleArray2Components(P,N); bound_double *B=bounddouble(N); @@ -2333,13 +2455,13 @@ void gen_runarray73(stack *Stack) {Stack->push<triple>(b); return;} } -#line 1961 "runarray.in" +#line 2074 "runarray.in" // triple maxbezier(triplearray2 *P, triple b); -void gen_runarray74(stack *Stack) +void gen_runarray76(stack *Stack) { triple b=vm::pop<triple>(Stack); triplearray2 * P=vm::pop<triplearray2 *>(Stack); -#line 1962 "runarray.in" +#line 2075 "runarray.in" size_t N; real *A=copyTripleArray2Components(P,N); bound_double *B=bounddouble(N); @@ -2350,13 +2472,13 @@ void gen_runarray74(stack *Stack) {Stack->push<triple>(b); return;} } -#line 1973 "runarray.in" +#line 2086 "runarray.in" // pair minratio(triplearray2 *P, pair b); -void gen_runarray75(stack *Stack) +void gen_runarray77(stack *Stack) { pair b=vm::pop<pair>(Stack); triplearray2 * P=vm::pop<triplearray2 *>(Stack); -#line 1974 "runarray.in" +#line 2087 "runarray.in" size_t N; triple *A=copyTripleArray2C(P,N); real fuzz=Fuzz*norm(A,N); @@ -2367,13 +2489,13 @@ void gen_runarray75(stack *Stack) {Stack->push<pair>(b); return;} } -#line 1985 "runarray.in" +#line 2098 "runarray.in" // pair maxratio(triplearray2 *P, pair b); -void gen_runarray76(stack *Stack) +void gen_runarray78(stack *Stack) { pair b=vm::pop<pair>(Stack); triplearray2 * P=vm::pop<triplearray2 *>(Stack); -#line 1986 "runarray.in" +#line 2099 "runarray.in" size_t N; triple *A=copyTripleArray2C(P,N); bound_triple *B=boundtriple(N); @@ -2384,11 +2506,11 @@ void gen_runarray76(stack *Stack) {Stack->push<pair>(b); return;} } -#line 1997 "runarray.in" +#line 2110 "runarray.in" // realarray* _projection(); -void gen_runarray77(stack *Stack) +void gen_runarray79(stack *Stack) { -#line 1998 "runarray.in" +#line 2111 "runarray.in" #ifdef HAVE_GL array *a=new array(14); gl::projection P=gl::camera(); @@ -2425,162 +2547,166 @@ namespace trans { void gen_runarray_venv(venv &ve) { -#line 585 "runarray.in" +#line 593 "runarray.in" REGISTER_BLTIN(run::emptyArray,"emptyArray"); -#line 591 "runarray.in" +#line 599 "runarray.in" REGISTER_BLTIN(run::newDeepArray,"newDeepArray"); -#line 613 "runarray.in" +#line 621 "runarray.in" REGISTER_BLTIN(run::newInitializedArray,"newInitializedArray"); -#line 628 "runarray.in" +#line 636 "runarray.in" REGISTER_BLTIN(run::newAppendedArray,"newAppendedArray"); -#line 644 "runarray.in" +#line 652 "runarray.in" REGISTER_BLTIN(run::copyArrayValue,"copyArrayValue"); -#line 656 "runarray.in" +#line 664 "runarray.in" REGISTER_BLTIN(run::copyArray,"copyArray"); -#line 667 "runarray.in" +#line 675 "runarray.in" REGISTER_BLTIN(run::arrayRead,"arrayRead"); -#line 679 "runarray.in" +#line 687 "runarray.in" REGISTER_BLTIN(run::arraySliceRead,"arraySliceRead"); -#line 686 "runarray.in" - REGISTER_BLTIN(run::arraySliceReadToEnd,"arraySliceReadToEnd"); #line 694 "runarray.in" + REGISTER_BLTIN(run::arraySliceReadToEnd,"arraySliceReadToEnd"); +#line 702 "runarray.in" REGISTER_BLTIN(run::arrayArrayRead,"arrayArrayRead"); -#line 703 "runarray.in" +#line 711 "runarray.in" REGISTER_BLTIN(run::arrayWrite,"arrayWrite"); -#line 720 "runarray.in" - REGISTER_BLTIN(run::arraySliceWrite,"arraySliceWrite"); #line 728 "runarray.in" - REGISTER_BLTIN(run::arraySliceWriteToEnd,"arraySliceWriteToEnd"); + REGISTER_BLTIN(run::arraySliceWrite,"arraySliceWrite"); #line 736 "runarray.in" + REGISTER_BLTIN(run::arraySliceWriteToEnd,"arraySliceWriteToEnd"); +#line 744 "runarray.in" REGISTER_BLTIN(run::arrayLength,"arrayLength"); -#line 742 "runarray.in" +#line 750 "runarray.in" REGISTER_BLTIN(run::arrayKeys,"arrayKeys"); -#line 757 "runarray.in" +#line 765 "runarray.in" REGISTER_BLTIN(run::arrayCyclicFlag,"arrayCyclicFlag"); -#line 764 "runarray.in" +#line 772 "runarray.in" REGISTER_BLTIN(run::arraySetCyclicFlag,"arraySetCyclicFlag"); -#line 771 "runarray.in" +#line 779 "runarray.in" REGISTER_BLTIN(run::arrayInitializedHelper,"arrayInitializedHelper"); -#line 782 "runarray.in" +#line 790 "runarray.in" REGISTER_BLTIN(run::arrayInitialized,"arrayInitialized"); -#line 788 "runarray.in" +#line 796 "runarray.in" REGISTER_BLTIN(run::arrayCyclicHelper,"arrayCyclicHelper"); -#line 795 "runarray.in" +#line 803 "runarray.in" REGISTER_BLTIN(run::arrayCyclic,"arrayCyclic"); -#line 801 "runarray.in" - REGISTER_BLTIN(run::arrayPushHelper,"arrayPushHelper"); #line 809 "runarray.in" + REGISTER_BLTIN(run::arrayPushHelper,"arrayPushHelper"); +#line 817 "runarray.in" REGISTER_BLTIN(run::arrayPush,"arrayPush"); -#line 815 "runarray.in" +#line 823 "runarray.in" REGISTER_BLTIN(run::arrayAppendHelper,"arrayAppendHelper"); -#line 824 "runarray.in" +#line 832 "runarray.in" REGISTER_BLTIN(run::arrayAppend,"arrayAppend"); -#line 830 "runarray.in" +#line 838 "runarray.in" REGISTER_BLTIN(run::arrayPopHelper,"arrayPopHelper"); -#line 839 "runarray.in" +#line 847 "runarray.in" REGISTER_BLTIN(run::arrayPop,"arrayPop"); -#line 845 "runarray.in" +#line 853 "runarray.in" REGISTER_BLTIN(run::arrayInsertHelper,"arrayInsertHelper"); -#line 856 "runarray.in" +#line 864 "runarray.in" REGISTER_BLTIN(run::arrayInsert,"arrayInsert"); -#line 862 "runarray.in" +#line 870 "runarray.in" REGISTER_BLTIN(run::arrayDelete,"arrayDelete"); -#line 868 "runarray.in" +#line 876 "runarray.in" REGISTER_BLTIN(run::arrayAlias,"arrayAlias"); -#line 873 "runarray.in" +#line 881 "runarray.in" REGISTER_BLTIN(run::arrayIntArray,"arrayIntArray"); -#line 891 "runarray.in" +#line 899 "runarray.in" addFunc(ve, run::gen_runarray32, IntArray(), SYM(complement), formal(IntArray(), SYM(a), false, false), formal(primInt(), SYM(n), false, false)); -#line 910 "runarray.in" +#line 918 "runarray.in" REGISTER_BLTIN(run::arraySequence,"arraySequence"); -#line 923 "runarray.in" +#line 931 "runarray.in" addFunc(ve, run::gen_runarray34, IntArray(), SYM(sequence), formal(primInt(), SYM(n), false, false)); -#line 934 "runarray.in" +#line 942 "runarray.in" REGISTER_BLTIN(run::arrayFunction,"arrayFunction"); -#line 947 "runarray.in" +#line 955 "runarray.in" REGISTER_BLTIN(run::arraySort,"arraySort"); -#line 957 "runarray.in" +#line 965 "runarray.in" REGISTER_BLTIN(run::arraySearch,"arraySearch"); -#line 976 "runarray.in" +#line 984 "runarray.in" addFunc(ve, run::gen_runarray38, primBoolean(), SYM(all), formal(booleanArray(), SYM(a), false, false)); -#line 985 "runarray.in" +#line 993 "runarray.in" addFunc(ve, run::gen_runarray39, booleanArray(), SYM_LOGNOT, formal(booleanArray(), SYM(a), false, false)); -#line 994 "runarray.in" +#line 1002 "runarray.in" addFunc(ve, run::gen_runarray40, primInt(), SYM(sum), formal(booleanArray(), SYM(a), false, false)); -#line 1003 "runarray.in" +#line 1011 "runarray.in" REGISTER_BLTIN(run::arrayConcat,"arrayConcat"); -#line 1031 "runarray.in" +#line 1039 "runarray.in" REGISTER_BLTIN(run::array2Transpose,"array2Transpose"); -#line 1055 "runarray.in" +#line 1063 "runarray.in" REGISTER_BLTIN(run::array3Transpose,"array3Transpose"); -#line 1142 "runarray.in" +#line 1150 "runarray.in" addFunc(ve, run::gen_runarray44, primInt(), SYM(find), formal(booleanArray(), SYM(a), false, false), formal(primInt(), SYM(n), true, false)); -#line 1161 "runarray.in" +#line 1169 "runarray.in" addFunc(ve, run::gen_runarray45, IntArray(), SYM(findall), formal(booleanArray(), SYM(a), false, false)); -#line 1174 "runarray.in" +#line 1182 "runarray.in" REGISTER_BLTIN(run::arrayConditional,"arrayConditional"); -#line 1200 "runarray.in" +#line 1208 "runarray.in" addFunc(ve, run::gen_runarray47, realArray2(), SYM(identity), formal(primInt(), SYM(n), false, false)); -#line 1206 "runarray.in" +#line 1214 "runarray.in" addFunc(ve, run::gen_runarray48, realArray2(), SYM(inverse), formal(realArray2(), SYM(a), false, false)); -#line 1218 "runarray.in" +#line 1226 "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 1271 "runarray.in" +#line 1279 "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 1336 "runarray.in" +#line 1344 "runarray.in" addFunc(ve, run::gen_runarray51, primReal(), SYM(determinant), formal(realArray2(), SYM(a), false, false)); -#line 1353 "runarray.in" +#line 1361 "runarray.in" addFunc(ve, run::gen_runarray52, realArray(), SYM_TIMES, formal(realArray2(), SYM(a), false, false), formal(realArray(), SYM(b), false, false)); -#line 1372 "runarray.in" +#line 1380 "runarray.in" addFunc(ve, run::gen_runarray53, realArray(), SYM_TIMES, formal(realArray(), SYM(a), false, false), formal(realArray2(), SYM(b), false, false)); -#line 1401 "runarray.in" +#line 1409 "runarray.in" addFunc(ve, run::gen_runarray54, IntArray2(), SYM_TIMES, formal(IntArray2(), SYM(a), false, false), formal(IntArray2(), SYM(b), false, false)); -#line 1406 "runarray.in" +#line 1414 "runarray.in" addFunc(ve, run::gen_runarray55, realArray2(), SYM_TIMES, formal(realArray2(), SYM(a), false, false), formal(realArray2(), SYM(b), false, false)); -#line 1411 "runarray.in" +#line 1419 "runarray.in" addFunc(ve, run::gen_runarray56, pairArray2(), SYM_TIMES, formal(pairArray2(), SYM(a), false, false), formal(pairArray2(), SYM(b), false, false)); -#line 1416 "runarray.in" +#line 1424 "runarray.in" addFunc(ve, run::gen_runarray57, primTriple(), SYM_TIMES, formal(realArray2(), SYM(t), false, false), formal(primTriple(), SYM(v), false, false)); -#line 1421 "runarray.in" +#line 1429 "runarray.in" addFunc(ve, run::gen_runarray58, realArray2(), SYM(AtA), formal(realArray2(), SYM(a), false, false)); -#line 1426 "runarray.in" +#line 1434 "runarray.in" addFunc(ve, run::gen_runarray59, primPair(), SYM(project), formal(primTriple(), SYM(v), false, false), formal(realArray2(), SYM(t), false, false)); -#line 1451 "runarray.in" +#line 1459 "runarray.in" addFunc(ve, run::gen_runarray60, primReal(), SYM(dot), formal(realArray(), SYM(a), false, false), formal(realArray(), SYM(b), false, false)); -#line 1461 "runarray.in" +#line 1469 "runarray.in" addFunc(ve, run::gen_runarray61, primPair(), SYM(dot), formal(pairArray(), SYM(a), false, false), formal(pairArray(), SYM(b), false, false)); -#line 1471 "runarray.in" +#line 1479 "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 1575 "runarray.in" +#line 1583 "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 1622 "runarray.in" +#line 1630 "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 1704 "runarray.in" +#line 1712 "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 1806 "runarray.in" +#line 1814 "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 1820 "runarray.in" +#line 1828 "runarray.in" addFunc(ve, run::gen_runarray67, pairArray(), SYM(fft), formal(pairArray(), SYM(a), false, false), formal(primInt(), SYM(sign), true, false)); -#line 1851 "runarray.in" - addFunc(ve, run::gen_runarray68, IntArray2(), SYM(triangulate), formal(pairArray(), SYM(z), false, false)); -#line 1886 "runarray.in" - addFunc(ve, run::gen_runarray69, primReal(), SYM(norm), formal(realArray(), SYM(a), false, false)); -#line 1897 "runarray.in" - addFunc(ve, run::gen_runarray70, primReal(), SYM(norm), formal(realArray2(), SYM(a), false, false)); -#line 1912 "runarray.in" - addFunc(ve, run::gen_runarray71, primReal(), SYM(norm), formal(tripleArray2(), SYM(a), false, false)); -#line 1927 "runarray.in" - addFunc(ve, run::gen_runarray72, primReal(), SYM(change2), formal(tripleArray2(), SYM(a), false, false)); -#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 1961 "runarray.in" - addFunc(ve, run::gen_runarray74, primTriple(), SYM(maxbezier), formal(tripleArray2(), SYM(p), false, false), formal(primTriple(), SYM(b), false, false)); -#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 1985 "runarray.in" - addFunc(ve, run::gen_runarray76, primPair(), SYM(maxratio), formal(tripleArray2(), SYM(p), false, false), formal(primPair(), SYM(b), false, false)); -#line 1997 "runarray.in" - addFunc(ve, run::gen_runarray77, realArray(), SYM(_projection)); +#line 1859 "runarray.in" + addFunc(ve, run::gen_runarray68, pairArray2(), SYM(fft), formal(pairArray2(), SYM(a), false, false), formal(primInt(), SYM(sign), true, false)); +#line 1905 "runarray.in" + addFunc(ve, run::gen_runarray69, pairArray3(), SYM(fft), formal(pairArray3(), SYM(a), false, false), formal(primInt(), SYM(sign), true, false)); +#line 1964 "runarray.in" + addFunc(ve, run::gen_runarray70, IntArray2(), SYM(triangulate), formal(pairArray(), SYM(z), false, false)); +#line 1999 "runarray.in" + addFunc(ve, run::gen_runarray71, primReal(), SYM(norm), formal(realArray(), SYM(a), false, false)); +#line 2010 "runarray.in" + addFunc(ve, run::gen_runarray72, primReal(), SYM(norm), formal(realArray2(), SYM(a), false, false)); +#line 2025 "runarray.in" + addFunc(ve, run::gen_runarray73, primReal(), SYM(norm), formal(tripleArray2(), SYM(a), false, false)); +#line 2040 "runarray.in" + addFunc(ve, run::gen_runarray74, primReal(), SYM(change2), formal(tripleArray2(), SYM(a), false, false)); +#line 2062 "runarray.in" + addFunc(ve, run::gen_runarray75, primTriple(), SYM(minbezier), formal(tripleArray2(), SYM(p), false, false), formal(primTriple(), SYM(b), false, false)); +#line 2074 "runarray.in" + addFunc(ve, run::gen_runarray76, primTriple(), SYM(maxbezier), formal(tripleArray2(), SYM(p), false, false), formal(primTriple(), SYM(b), false, false)); +#line 2086 "runarray.in" + addFunc(ve, run::gen_runarray77, primPair(), SYM(minratio), formal(tripleArray2(), SYM(p), false, false), formal(primPair(), SYM(b), false, false)); +#line 2098 "runarray.in" + addFunc(ve, run::gen_runarray78, primPair(), SYM(maxratio), formal(tripleArray2(), SYM(p), false, false), formal(primPair(), SYM(b), false, false)); +#line 2110 "runarray.in" + addFunc(ve, run::gen_runarray79, realArray(), SYM(_projection)); } } // namespace trans |