1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218
|
/*
* Copyright (c) 2009 Samit Basu
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*/
#ifndef __Operators_hpp__
#define __Operators_hpp__
#include "Array.hpp"
#include "SparseMatrix.hpp"
#include "Algorithms.hpp"
template <class Op>
static inline bool IsZeroPreservingUnary()
{
double pr, pi;
Op::func(0.0,0.0,pr,pi);
return ((Op::func(0.0) == 0) && (pr == 0) && (pi == 0));
}
template <class Op>
static inline bool IsZeroPreservingCmp()
{
return ((Op::func(0.0,0.0) == false) && (Op::func(0,0,0,0) == false));
}
template <class Op>
static inline bool IsZeroPreserving()
{
double pr, pi;
Op::func(0.0,0.0,0.0,0.0,pr,pi);
return ((Op::func(0.0,0.0) == 0) && (pr == 0) && (pi == 0));
}
// Real, Real --> Real
template <typename S, typename T, class Op>
static inline SparseMatrix<S> DotOp(const SparseMatrix<T>& A,
const T & B) {
ConstSparseIterator<T> aspin(&A);
SparseMatrix<S> retval(A.dimensions());
// While more columns...
while (aspin.isValid()) {
retval.set(aspin.pos(),Op::func(aspin.value(),B));
aspin.next();
}
return retval;
}
// Real, Real --> Real
template <typename S, typename T, class Op>
static inline SparseMatrix<S> DotOp(const T& A,
const SparseMatrix<T>& B) {
ConstSparseIterator<T> bspin(&B);
SparseMatrix<S> retval(B.dimensions());
// While more columns...
while (bspin.isValid()) {
retval.set(bspin.pos(),Op::func(A,bspin.value()));
bspin.next();
}
return retval;
}
// Real, Real --> Real
template <typename S, typename T, class Op>
static inline SparseMatrix<S> DotOp(const SparseMatrix<T>& A,
const SparseMatrix<T>& B) {
ConstSparseIterator<T> aspin(&A);
ConstSparseIterator<T> bspin(&B);
SparseMatrix<S> retval(A.dimensions());
// While more columns...
while (aspin.isValid() || bspin.isValid()) {
if (aspin.pos() == bspin.pos()) {
retval.set(aspin.pos(),Op::func(aspin.value(),bspin.value()));
aspin.next();
bspin.next();
} else if (A.dimensions().map(aspin.pos()) <
B.dimensions().map(bspin.pos())) {
retval.set(aspin.pos(),Op::func(aspin.value(),T(0)));
aspin.next();
} else {
retval.set(bspin.pos(),Op::func(T(0),bspin.value()));
bspin.next();
}
}
return retval;
}
// Complex, Complex --> Complex
template <typename S, typename T, class Op>
static inline void DotOp(const SparseMatrix<T>& A_real,
const SparseMatrix<T>& A_imag,
const SparseMatrix<T>& B_real,
const SparseMatrix<T>& B_imag,
SparseMatrix<S>& C_real,
SparseMatrix<S>& C_imag) {
C_real = SparseMatrix<S>(A_real.dimensions());
C_imag = SparseMatrix<S>(A_imag.dimensions());
ConstComplexSparseIterator<T> a_spin(&A_real, &A_imag);
ConstComplexSparseIterator<T> b_spin(&B_real, &B_imag);
NTuple dim(A_real.dimensions());
while (a_spin.isValid() || b_spin.isValid()) {
S value_c_real, value_c_imag;
if (a_spin.pos() == b_spin.pos()) {
Op::func(a_spin.realValue(),a_spin.imagValue(),
b_spin.realValue(),b_spin.imagValue(),
value_c_real,value_c_imag);
C_real.set(a_spin.pos(),value_c_real);
C_imag.set(a_spin.pos(),value_c_imag);
a_spin.next(); b_spin.next();
} else if (dim.map(a_spin.pos()) < dim.map(b_spin.pos())) {
Op::func(a_spin.realValue(),a_spin.imagValue(),T(0),T(0),
value_c_real,value_c_imag);
C_real.set(a_spin.pos(),value_c_real);
C_imag.set(a_spin.pos(),value_c_imag);
a_spin.next();
} else {
Op::func(T(0),T(0),b_spin.realValue(),b_spin.imagValue(),
value_c_real,value_c_imag);
C_real.set(b_spin.pos(),value_c_real);
C_imag.set(b_spin.pos(),value_c_imag);
b_spin.next();
}
}
}
// Complex, Complex --> Complex
template <typename S, typename T, class Op>
static inline void DotOp(const SparseMatrix<T>& A_real,
const SparseMatrix<T>& A_imag,
const T& B_real,
const T& B_imag,
SparseMatrix<S>& C_real,
SparseMatrix<S>& C_imag) {
C_real = SparseMatrix<S>(A_real.dimensions());
C_imag = SparseMatrix<S>(A_imag.dimensions());
ConstComplexSparseIterator<T> a_spin(&A_real, &A_imag);
NTuple dim(A_real.dimensions());
while (a_spin.isValid()) {
S value_c_real, value_c_imag;
Op::func(a_spin.realValue(),a_spin.imagValue(),
B_real,B_imag,value_c_real,value_c_imag);
C_real.set(a_spin.pos(),value_c_real);
C_imag.set(a_spin.pos(),value_c_imag);
a_spin.next();
}
}
// Complex, Complex --> Complex
template <typename S, typename T, class Op>
static inline void DotOp(const T& A_real,
const T& A_imag,
const SparseMatrix<T>& B_real,
const SparseMatrix<T>& B_imag,
SparseMatrix<S>& C_real,
SparseMatrix<S>& C_imag) {
C_real = SparseMatrix<S>(B_real.dimensions());
C_imag = SparseMatrix<S>(B_imag.dimensions());
ConstComplexSparseIterator<T> b_spin(&B_real, &B_imag);
NTuple dim(B_real.dimensions());
while (b_spin.isValid()) {
S value_c_real, value_c_imag;
Op::func(A_real,A_imag,
b_spin.realValue(),b_spin.imagValue(),
value_c_real,value_c_imag);
C_real.set(b_spin.pos(),value_c_real);
C_imag.set(b_spin.pos(),value_c_imag);
b_spin.next();
}
}
// Complex, Complex --> Real
template <typename S, typename T, class Op>
static inline SparseMatrix<S> DotOp(const SparseMatrix<T>& A_real,
const SparseMatrix<T>& A_imag,
const SparseMatrix<T>& B_real,
const SparseMatrix<T>& B_imag) {
SparseMatrix<S> C(A_real.dimensions());
ConstComplexSparseIterator<T> a_spin(&A_real, &A_imag);
ConstComplexSparseIterator<T> b_spin(&B_real, &B_imag);
NTuple dim(A_real.dimensions());
while (a_spin.isValid() || b_spin.isValid()) {
if (a_spin.pos() == b_spin.pos()) {
C.set(a_spin.pos(),
Op::func(a_spin.realValue(),a_spin.imagValue(),
b_spin.realValue(),b_spin.imagValue()));
a_spin.next(); b_spin.next();
} else if (dim.map(a_spin.pos()) < dim.map(b_spin.pos())) {
C.set(a_spin.pos(),Op::func(a_spin.realValue(),a_spin.imagValue(),T(0),T(0)));
a_spin.next();
} else {
C.set(b_spin.pos(),Op::func(T(0),T(0),b_spin.realValue(),b_spin.imagValue()));
b_spin.next();
}
}
return C;
}
// Perform the operation via a typed intermediary
template <typename T, class Op>
Array DotOp(const Array &Ain, const Array &Bin, DataClass Tclass) {
Array Acast(Ain.toClass(Tclass));
Array Bcast(Bin.toClass(Tclass));
Array F(Tclass,NTuple(0,0));
if (Acast.isSparse() && Bcast.isSparse()) {
if (Acast.dimensions() != Bcast.dimensions())
throw Exception("size mismatch in arguments to binary operator");
if (Bcast.allReal() && Acast.allReal()) {
F = DotOp<T,T,Op>(Acast.constRealSparse<T>(),
Bcast.constRealSparse<T>());
} else {
Acast.forceComplex(); Bcast.forceComplex();
SparseMatrix<T> Freal(Acast.dimensions());
SparseMatrix<T> Fimag(Acast.dimensions());;
DotOp<T,T,Op>(Acast.constRealSparse<T>(),
Acast.constImagSparse<T>(),
Bcast.constRealSparse<T>(),
Bcast.constImagSparse<T>(),
Freal, Fimag);
F = Array(Freal,Fimag);
}
return F;
}
if (Acast.isSparse() && Bcast.isScalar()) {
if (Acast.allReal() && Bcast.allReal())
return DotOp<T,T,Op>(Acast.constRealSparse<T>(),Bcast.constRealScalar<T>());
else {
Acast.forceComplex(); Bcast.forceComplex();
SparseMatrix<T> Freal(Acast.dimensions());
SparseMatrix<T> Fimag(Acast.dimensions());
DotOp<T,T,Op>(Acast.constRealSparse<T>(),
Acast.constImagSparse<T>(),
Bcast.constRealScalar<T>(),
Bcast.constImagScalar<T>(), Freal, Fimag);
return Array(Freal,Fimag);
}
}
if (Acast.isScalar() && Bcast.isSparse()) {
if (Acast.allReal() && Bcast.allReal())
return DotOp<T,T,Op>(Acast.constRealScalar<T>(),Bcast.constRealSparse<T>());
else {
Acast.forceComplex(); Bcast.forceComplex();
SparseMatrix<T> Freal(Bcast.dimensions());
SparseMatrix<T> Fimag(Bcast.dimensions());
DotOp<T,T,Op>(Acast.constRealScalar<T>(),
Acast.constImagScalar<T>(),
Bcast.constRealSparse<T>(),
Bcast.constImagSparse<T>(), Freal, Fimag);
return Array(Freal,Fimag);
}
}
if (!Acast.isScalar()) Acast = Acast.asDenseArray();
if (!Bcast.isScalar()) Bcast = Bcast.asDenseArray();
if (Acast.isScalar() && Bcast.isScalar()) {
if (Acast.allReal() && Bcast.allReal()) {
F = Array::create(Op::func(Acast.constRealScalar<T>(),
Bcast.constRealScalar<T>()));
} else {
Acast.forceComplex(); Bcast.forceComplex();
F = Array::create(T(0),T(0));
Op::func(Acast.constRealScalar<T>(),
Acast.constImagScalar<T>(),
Bcast.constRealScalar<T>(),
Bcast.constImagScalar<T>(),
F.realScalar<T>(),F.imagScalar<T>());
}
} else if (Acast.isScalar()) {
if (Acast.allReal() && Bcast.allReal()) {
F = Array::create(Tclass,Bcast.dimensions());
T* ret = F.real<T>().data();
const T& Ap = Acast.constRealScalar<T>();
const T* Bp = Bcast.constReal<T>().constData();
uint64 q = uint64(Bcast.length());
for (uint64 i=0;i<q;i++) ret[i] = Op::func(Ap,Bp[i]);
} else {
Acast.forceComplex(); Bcast.forceComplex();
F = Array::create(Tclass,Bcast.dimensions());
T* Cr = F.real<T>().data();
T* Ci = F.imag<T>().data();
const T& Ar = Acast.constRealScalar<T>();
const T& Ai = Acast.constImagScalar<T>();
const T* Br = Bcast.constReal<T>().constData();
const T* Bi = Bcast.constImag<T>().constData();
uint64 q = uint64(Bcast.length());
for (uint64 i=0;i<q;i++) Op::func(Ar,Ai,Br[i],Bi[i],Cr[i],Ci[i]);
}
} else if (Bcast.isScalar()) {
if (Bcast.allReal() && Acast.allReal()) {
F = Array::create(Tclass,Acast.dimensions());
T* ret = F.real<T>().data();
const T* Ap = Acast.constReal<T>().constData();
const T& Bp = Bcast.constRealScalar<T>();
uint64 q = uint64(Acast.length());
for (uint64 i=0;i<q;i++) ret[i] = Op::func(Ap[i],Bp);
} else {
Acast.forceComplex(); Bcast.forceComplex();
F = Array::create(Tclass,Acast.dimensions());
T* Cr = F.real<T>().data();
T* Ci = F.imag<T>().data();
const T* Ar = Acast.constReal<T>().constData();
const T* Ai = Acast.constImag<T>().constData();
const T& Br = Bcast.constRealScalar<T>();
const T& Bi = Bcast.constImagScalar<T>();
uint64 q = uint64(Acast.length());
for (uint64 i=0;i<q;i++) Op::func(Ar[i],Ai[i],Br,Bi,Cr[i],Ci[i]);
}
} else {
if (Acast.dimensions() != Bcast.dimensions())
throw Exception("size mismatch in arguments to binary operator");
if (Bcast.allReal() && Acast.allReal()) {
F = Array::create(Tclass,Acast.dimensions());
T* ret = F.real<T>().data();
const T* Ap = Acast.constReal<T>().constData();
const T* Bp = Bcast.constReal<T>().constData();
uint64 q = uint64(Acast.length());
for (uint64 i=0;i<q;i++) ret[i] = Op::func(Ap[i],Bp[i]);
} else {
Acast.forceComplex(); Bcast.forceComplex();
F = Array::create(Tclass,Acast.dimensions());
T* Cr = F.real<T>().data();
T* Ci = F.imag<T>().data();
const T* Ar = Acast.constReal<T>().constData();
const T* Ai = Acast.constImag<T>().constData();
const T* Br = Bcast.constReal<T>().constData();
const T* Bi = Bcast.constImag<T>().constData();
uint64 q = uint64(Acast.length());
for (uint64 i=0;i<q;i++) Op::func(Ar[i],Ai[i],Br[i],Bi[i],Cr[i],Ci[i]);
}
}
return F;
}
// Assumes that the operation cannot create complex values from real ones
//
// So the table looks like this (order is unimportant)
// a b c v
// s s s s
// s d s s
// s c s s
// s l s s
// s i e
// d d d d
// d c d d
// d l d d
// d i i d
// i1 i2 e
// c i e
// c l d d
// c c d d
// l l d d
//
// The resulting rule:
// default: c is double, v is double
// if (a or b is single), c is single, v is single
// if (a or b is an integer)
// if (same type, or one is a double),
// c is integer
// else illegal.
//
// if (a or b single) --> v single, c single
// else {
// v double
// if (a and b not integer) --> c double, else c integer
// }
//
// Arithmetic Operations on Floating-Point Numbers
// This section describes which classes you can use in arithmetic operations with floating-point numbers.
// Double-Precision. You can perform basic arithmetic operations with double and any of the following other classes. When one or more operands is an integer (scalar or array), the double operand must be a scalar. The result is of type double, except where noted otherwise:
// single — The result is of type single
// double
// int* or uint* — The result has the same data type as the integer operand
// char
// logical
// This example performs arithmetic on data of types char and double. The result is of type double:
// c = 'uppercase' - 32;
// class(c)
// ans =
// double
// char(c)
// ans =
// UPPERCASE
// Single-Precision. You can perform basic arithmetic operations with single and any of the following other classes. The result is always single:
// single
// double
// char
// logical
// Arithmetic Operations on Integer Classes
// MATLAB can perform integer arithmetic on the following types of data:
// Integers or integer arrays of the same integer data type. This yields a result that has the same data type as the operands:
// x = uint32([132 347 528]) .* uint32(75);
// Integers or integer arrays and scalar double-precision floating-point numbers. This yields a result that has the same data type as the integer operands:
// x = uint32([132 347 528]) .* 75.49;
// For all binary operations in which one operand is an array of integer data type and the other is a scalar double, MATLAB computes the operation using elementwise double-precision arithmetic, and then converts the result back to the original integer data type.
static inline bool IsIntegerDataClass(const Array &Ain) {
return ((Ain.dataClass() >= Int8) && (Ain.dataClass() <= UInt64));
}
template <class Op>
Array DotOp(const Array &Ain, const Array &Bin) {
if ((Ain.isSparse() || Bin.isSparse()) && !IsZeroPreserving<Op>())
return ToSparse(DotOp<Op>(Ain.asDenseArray(),Bin.asDenseArray()));
DataClass via_type;
DataClass out_type;
ComputeTypes(Ain,Bin,via_type,out_type);
if ((out_type == Float) && (IsIntegerDataClass(Ain) ||
IsIntegerDataClass(Bin)))
throw Exception("Cannot combine single precision and integer class data");
if (IsIntegerDataClass(Ain) && IsIntegerDataClass(Bin) &&
Ain.dataClass() != Bin.dataClass())
throw Exception("Cannot combine data of different integer data classes");
if (IsIntegerDataClass(Ain)) out_type = Ain.dataClass();
if (IsIntegerDataClass(Bin)) out_type = Bin.dataClass();
Array F;
if (via_type == Float)
F = DotOp<float,Op>(Ain,Bin,Float);
else
F = DotOp<double,Op>(Ain,Bin,Double);
return F.toClass(out_type);
}
template <class Op>
Array BoolOp(const Array &Ain, const Array &Bin) {
return DotOp<bool,Op>(Ain,Bin,Bool).toClass(Bool);
}
// Comparison op -- uses real part only (used by ordinal operators)
template <typename T, class Op>
static inline Array CmpOp(const Array &Ain, const Array &Bin, DataClass Tclass) {
Array Acast(Ain.toClass(Tclass));
Array Bcast(Bin.toClass(Tclass));
Array F(Bool,NTuple(0,0));
if (Acast.isSparse() && Bcast.isSparse()) {
if (Acast.dimensions() != Bcast.dimensions())
throw Exception("size mismatch in arguments to binary operator");
F = DotOp<bool,T,Op>(Acast.constRealSparse<T>(),
Bcast.constRealSparse<T>());
return F;
}
if (!Acast.isScalar()) Acast = Acast.asDenseArray();
if (!Bcast.isScalar()) Bcast = Bcast.asDenseArray();
if (Acast.isScalar() && Bcast.isScalar()) {
F = Array::create(Op::func(Acast.constRealScalar<T>(),
Bcast.constRealScalar<T>()));
} else if (Acast.isScalar()) {
F = Array::create(Bool,Bcast.dimensions());
bool* ret = F.real<bool>().data();
const T& Ap = Acast.constRealScalar<T>();
const T* Bp = Bcast.constReal<T>().constData();
uint64 q = uint64(Bcast.length());
for (uint64 i=0;i<q;i++) ret[i] = Op::func(Ap,Bp[i]);
} else if (Bcast.isScalar()) {
F = Array::create(Bool,Acast.dimensions());
bool* ret = F.real<bool>().data();
const T* Ap = Acast.constReal<T>().constData();
const T& Bp = Bcast.constRealScalar<T>();
uint64 q = uint64(Acast.length());
for (uint64 i=0;i<q;i++) ret[i] = Op::func(Ap[i],Bp);
} else {
if (Acast.dimensions() != Bcast.dimensions())
throw Exception("size mismatch in arguments to binary operator");
F = Array::create(Bool,Acast.dimensions());
bool* ret = F.real<bool>().data();
const T* Ap = Acast.constReal<T>().constData();
const T* Bp = Bcast.constReal<T>().constData();
uint64 q = uint64(Acast.length());
for (uint64 i=0;i<q;i++) ret[i] = Op::func(Ap[i],Bp[i]);
}
return F;
}
template <class Op>
static inline Array CmpOp(const Array &Ain, const Array &Bin) {
DataClass via_type;
DataClass out_type;
ComputeTypes(Ain,Bin,via_type,out_type);
Array F;
// Check for non zero-preserving cmp functions
if ((Ain.isSparse() || Bin.isSparse()) && !IsZeroPreservingCmp<Op>())
return ToSparse(CmpOp<Op>(Ain.asDenseArray(),Bin.asDenseArray()));
if (via_type == Float)
F = CmpOp<float,Op>(Ain,Bin,Float);
else
F = CmpOp<double,Op>(Ain,Bin,Double);
return F.toClass(Bool);
}
// Comparison operator -- uses real and imaginary parts
template <typename T, class Op>
static inline Array EqOp(const Array &Ain, const Array &Bin, DataClass Tclass) {
Array Acast(Ain.toClass(Tclass));
Array Bcast(Bin.toClass(Tclass));
Array F(Bool,NTuple(0,0));
if (Acast.isSparse() && Bcast.isSparse()) {
if (Acast.dimensions() != Bcast.dimensions())
throw Exception("size mismatch in arguments to binary operator");
if (Bcast.allReal() && Acast.allReal()) {
F = DotOp<bool,T,Op>(Acast.constRealSparse<T>(),
Bcast.constRealSparse<T>());
} else {
Acast.forceComplex(); Bcast.forceComplex();
F = DotOp<bool,T,Op>(Acast.constRealSparse<T>(),
Acast.constImagSparse<T>(),
Bcast.constRealSparse<T>(),
Bcast.constImagSparse<T>());
}
return F;
}
if (!Acast.isScalar()) Acast = Acast.asDenseArray();
if (!Bcast.isScalar()) Bcast = Bcast.asDenseArray();
if (Acast.isScalar() && Bcast.isScalar()) {
if (Acast.allReal() && Bcast.allReal()) {
F = Array::create(Op::func(Acast.constRealScalar<T>(),
Bcast.constRealScalar<T>()));
} else {
Acast.forceComplex(); Bcast.forceComplex();
F = Array::create(Op::func(Acast.constRealScalar<T>(),
Acast.constImagScalar<T>(),
Bcast.constRealScalar<T>(),
Bcast.constImagScalar<T>()));
}
} else if (Acast.isScalar()) {
if (Acast.allReal() && Bcast.allReal()) {
F = Array::create(Bool,Bcast.dimensions());
bool* ret = F.real<bool>().data();
const T& Ap = Acast.constRealScalar<T>();
const T* Bp = Bcast.constReal<T>().constData();
uint64 q = uint64(Bcast.length());
for (uint64 i=0;i<q;i++) ret[i] = Op::func(Ap,Bp[i]);
} else {
Acast.forceComplex(); Bcast.forceComplex();
F = Array::create(Bool,Bcast.dimensions());
bool* ret = F.real<bool>().data();
const T& Ar = Acast.constRealScalar<T>();
const T& Ai = Acast.constImagScalar<T>();
const T* Br = Bcast.constReal<T>().constData();
const T* Bi = Bcast.constImag<T>().constData();
uint64 q = uint64(Bcast.length());
for (uint64 i=0;i<q;i++) ret[i] = Op::func(Ar,Ai,Br[i],Bi[i]);
}
} else if (Bcast.isScalar()) {
if (Bcast.allReal() && Acast.allReal()) {
F = Array::create(Bool,Acast.dimensions());
bool* ret = F.real<bool>().data();
const T* Ap = Acast.constReal<T>().constData();
const T& Bp = Bcast.constRealScalar<T>();
uint64 q = uint64(Acast.length());
for (uint64 i=0;i<q;i++) ret[i] = Op::func(Ap[i],Bp);
} else {
Acast.forceComplex(); Bcast.forceComplex();
F = Array::create(Bool,Acast.dimensions());
bool* ret = F.real<bool>().data();
const T* Ar = Acast.constReal<T>().constData();
const T* Ai = Acast.constImag<T>().constData();
const T& Br = Bcast.constRealScalar<T>();
const T& Bi = Bcast.constImagScalar<T>();
uint64 q = uint64(Acast.length());
for (uint64 i=0;i<q;i++) ret[i] = Op::func(Ar[i],Ai[i],Br,Bi);
}
} else {
if (Acast.dimensions() != Bcast.dimensions())
throw Exception("size mismatch in arguments to binary operator");
if (Bcast.allReal() && Acast.allReal()) {
F = Array::create(Bool,Acast.dimensions());
bool* ret = F.real<bool>().data();
const T* Ap = Acast.constReal<T>().constData();
const T* Bp = Bcast.constReal<T>().constData();
uint64 q = uint64(Acast.length());
for (uint64 i=0;i<q;i++) ret[i] = Op::func(Ap[i],Bp[i]);
} else {
Acast.forceComplex(); Bcast.forceComplex();
F = Array::create(Bool,Acast.dimensions());
bool* ret = F.real<bool>().data();
const T* Ar = Acast.constReal<T>().constData();
const T* Ai = Acast.constImag<T>().constData();
const T* Br = Bcast.constReal<T>().constData();
const T* Bi = Bcast.constImag<T>().constData();
uint64 q = uint64(Acast.length());
for (uint64 i=0;i<q;i++) ret[i] = Op::func(Ar[i],Ai[i],Br[i],Bi[i]);
}
}
return F;
}
template <class Op>
static inline Array EqOp(const Array &Ain, const Array &Bin) {
if ((Ain.isSparse() || Bin.isSparse()) && !IsZeroPreservingCmp<Op>())
return (ToSparse(EqOp<Op>(Ain.asDenseArray(),Bin.asDenseArray())));
DataClass via_type;
DataClass out_type;
ComputeTypes(Ain,Bin,via_type,out_type);
Array F;
if (via_type == Float)
F = EqOp<float,Op>(Ain,Bin,Float);
else
F = EqOp<double,Op>(Ain,Bin,Double);
return F.toClass(Bool);
}
// Real --> Real
template <typename S, typename T, class Op>
static inline SparseMatrix<S> UnaryOp(const SparseMatrix<T>& A) {
ConstSparseIterator<T> aspin(&A);
SparseMatrix<S> retval(A.dimensions());
while (aspin.isValid()) {
retval.set(aspin.pos(),Op::func(aspin.value()));
aspin.next();
}
return retval;
}
// Complex --> Complex
template <typename S, typename T, class Op>
static inline void UnaryOp(const SparseMatrix<T>& A_real,
const SparseMatrix<T>& A_imag,
SparseMatrix<S>& C_real,
SparseMatrix<S>& C_imag) {
C_real = SparseMatrix<S>(A_real.dimensions());
C_imag = SparseMatrix<S>(A_imag.dimensions());
ConstComplexSparseIterator<T> a_spin(&A_real, &A_imag);
NTuple dim(A_real.dimensions());
while (a_spin.isValid()) {
S value_c_real, value_c_imag;
Op::func(a_spin.realValue(),a_spin.imagValue(),
value_c_real,value_c_imag);
C_real.set(a_spin.pos(),value_c_real);
C_imag.set(a_spin.pos(),value_c_imag);
a_spin.next();
}
}
// Perform the operation via a typed intermediary
template <typename T, class Op>
static inline Array UnaryOp(const Array &Ain, DataClass Tclass) {
Array Acast(Ain.toClass(Tclass));
Array F(Tclass,NTuple(0,0));
if (Acast.isSparse()) {
if (Acast.allReal()) {
F = UnaryOp<T,T,Op>(Acast.constRealSparse<T>());
} else {
SparseMatrix<T> Freal(Acast.dimensions());
SparseMatrix<T> Fimag(Acast.dimensions());
UnaryOp<T,T,Op>(Acast.constRealSparse<T>(),
Acast.constImagSparse<T>(),
Freal,Fimag);
F = Array(Freal,Fimag);
}
return F;
}
if (!Acast.isScalar()) Acast = Acast.asDenseArray();
if (Acast.isScalar()) {
if (Acast.allReal()) {
F = Array::create(Op::func(Acast.constRealScalar<T>()));
} else {
F = Array::create(T(0),T(0));
Op::func(Acast.constRealScalar<T>(),
Acast.constImagScalar<T>(),
F.realScalar<T>(),F.imagScalar<T>());
}
} else {
if (Acast.allReal()) {
F = Array(Tclass,Acast.dimensions());
T* ret = F.real<T>().data();
const T* Ap = Acast.constReal<T>().constData();
uint64 q = uint64(Acast.length());
for (uint64 i=0;i<q;i++) ret[i] = Op::func(Ap[i]);
} else {
F = Array(Tclass,Acast.dimensions());
T* Cr = F.real<T>().data();
T* Ci = F.imag<T>().data();
const T* Ar = Acast.constReal<T>().constData();
const T* Ai = Acast.constImag<T>().constData();
uint64 q = uint64(Acast.length());
for (uint64 i=0;i<q;i++) Op::func(Ar[i],Ai[i],Cr[i],Ci[i]);
}
}
return F;
}
template <class Op>
static inline Array UnaryOp(const Array &Ain) {
// Check for non zero-preserving unary functions
if (Ain.isSparse() && !IsZeroPreservingUnary<Op>())
return ToSparse(UnaryOp<Op>(Ain.asDenseArray()));
if (Ain.dataClass() == Float)
return UnaryOp<float,Op>(Ain,Float);
else
return UnaryOp<double,Op>(Ain,Double);
}
template <typename T, class Op>
static inline Array VectorOp(const BasicArray<T> &real,
const BasicArray<T> &imag,
index_t out, int dim) {
NTuple outdims(real.dimensions()); outdims[dim] = out;
BasicArray<T> F_real(outdims);
BasicArray<T> F_imag(outdims);
ConstBasicIterator<T> source_real(&real,dim);
ConstBasicIterator<T> source_imag(&imag,dim);
BasicIterator<T> dest_real(&F_real,dim);
BasicIterator<T> dest_imag(&F_imag,dim);
BasicArray<T> in_buffer_real(NTuple(real.dimensions()[dim],1));
BasicArray<T> in_buffer_imag(NTuple(imag.dimensions()[dim],1));
BasicArray<T> out_buffer_real(NTuple(out,1));
BasicArray<T> out_buffer_imag(NTuple(out,1));
while (source_real.isValid() && dest_real.isValid()) {
for (index_t i=1;i<=source_real.size();i++) {
in_buffer_real[i] = source_real.get();
in_buffer_imag[i] = source_imag.get();
source_real.next(); source_imag.next();
}
Op::func(in_buffer_real,in_buffer_imag,
out_buffer_real,out_buffer_imag);
for (index_t i=1;i<=out;i++) {
dest_real.set(out_buffer_real[i]);
dest_imag.set(out_buffer_imag[i]);
dest_real.next(); dest_imag.next();
}
source_real.nextSlice(); source_imag.nextSlice();
dest_real.nextSlice(); dest_imag.nextSlice();
}
return Array(F_real,F_imag);
}
template <typename T, class Op>
static inline Array VectorOp(const SparseMatrix<T>& real, index_t out, int dim) {
if (dim == 0) {
ConstSparseIterator<T> spin_real(&real);
NTuple outdims(real.dimensions()); outdims[dim] = out;
SparseMatrix<T> retval(outdims);
while (spin_real.isValid()) {
SparseSlice<T> this_col;
index_t col_number = spin_real.col();
Op::func(spin_real,this_col);
retval.data()[col_number] = this_col;
}
return Array(retval);
} else
return Transpose(VectorOp<T,Op>(Transpose(real),out,0));
}
template <typename T, class Op>
static inline Array VectorOp(const SparseMatrix<T> &real,
const SparseMatrix<T> &imag,
index_t out, int dim) {
if (dim == 0) {
ConstComplexSparseIterator<T> spin_complex(&real,&imag);
NTuple outdims(real.dimensions()); outdims[dim] = out;
SparseMatrix<T> retval_real(outdims);
SparseMatrix<T> retval_imag(outdims);
while (spin_complex.isValid()) {
SparseSlice<T> this_real_col;
SparseSlice<T> this_imag_col;
index_t col_number = spin_complex.col();
Op::func(spin_complex,this_real_col,this_imag_col);
retval_real.data()[col_number] = this_real_col;
retval_imag.data()[col_number] = this_imag_col;
}
return Array(retval_real,retval_imag);
} else
return Transpose(VectorOp<T,Op>(Transpose(real),
Transpose(imag),out,0));
}
template <typename T, class Op>
static inline Array VectorOp(const BasicArray<T> &real, index_t out, int dim) {
NTuple outdims(real.dimensions()); outdims[dim] = out;
BasicArray<T> F(outdims);
ConstBasicIterator<T> source(&real,dim);
BasicIterator<T> dest(&F,dim);
BasicArray<T> in_buffer(NTuple(real.dimensions()[dim],1));
BasicArray<T> out_buffer(NTuple(out,1));
while (source.isValid() && dest.isValid()) {
for (index_t i=1;i<=source.size();i++) {
in_buffer[i] = source.get();
source.next();
}
Op::func(in_buffer,out_buffer);
for (index_t i=1;i<=out;i++) {
dest.set(out_buffer[i]);
dest.next();
}
source.nextSlice(); dest.nextSlice();
}
return Array(F);
}
template <typename T, class Op>
static inline Array VectorOp(const Array &Ain, index_t out, int dim, DataClass Tclass) {
Array Acast(Ain.toClass(Tclass));
if (Acast.isSparse()) {
if (Acast.allReal())
return VectorOp<T,Op>(Acast.constRealSparse<T>(),out,dim);
else
return VectorOp<T,Op>(Acast.constRealSparse<T>(),
Acast.constImagSparse<T>(),out,dim);
} else {
if (Acast.isScalar()) Acast = Acast.asDenseArray();
if (Acast.allReal()) {
return VectorOp<T,Op>(Acast.constReal<T>(),out,dim);
} else {
return VectorOp<T,Op>(Acast.constReal<T>(),Acast.constImag<T>(),out,dim);
}
}
}
template <class Op>
static inline Array VectorOp(const Array &Ain, int out, int dim) {
out = qMax(0,out);
if (Ain.dataClass() == Float)
return VectorOp<float,Op>(Ain,out,dim,Float);
else
return VectorOp<double,Op>(Ain,out,dim,Double);
}
template <typename T, class Op>
static inline Array VectorOpDynamic(const BasicArray<T> &real,
const BasicArray<T> &imag,
index_t out, int dim, Op &op) {
NTuple outdims(real.dimensions()); outdims[dim] = out;
BasicArray<T> F_real(outdims);
BasicArray<T> F_imag(outdims);
ConstBasicIterator<T> source_real(&real,dim);
ConstBasicIterator<T> source_imag(&imag,dim);
BasicIterator<T> dest_real(&F_real,dim);
BasicIterator<T> dest_imag(&F_imag,dim);
BasicArray<T> in_buffer_real(NTuple(real.dimensions()[dim],1));
BasicArray<T> in_buffer_imag(NTuple(imag.dimensions()[dim],1));
BasicArray<T> out_buffer_real(NTuple(out,1));
BasicArray<T> out_buffer_imag(NTuple(out,1));
while (source_real.isValid() && dest_real.isValid()) {
for (index_t i=1;i<=source_real.size();i++) {
in_buffer_real[i] = source_real.get();
in_buffer_imag[i] = source_imag.get();
source_real.next(); source_imag.next();
}
op.func(in_buffer_real,in_buffer_imag,
out_buffer_real,out_buffer_imag);
for (index_t i=1;i<=out;i++) {
dest_real.set(out_buffer_real[i]);
dest_imag.set(out_buffer_imag[i]);
dest_real.next(); dest_imag.next();
}
source_real.nextSlice(); source_imag.nextSlice();
dest_real.nextSlice(); dest_imag.nextSlice();
}
return Array(F_real,F_imag);
}
template <typename T, class Op>
static inline Array VectorOpDynamic(const SparseMatrix<T>& real, index_t out,
int dim, Op &op) {
if (dim == 0) {
ConstSparseIterator<T> spin_real(&real);
NTuple outdims(real.dimensions()); outdims[dim] = out;
SparseMatrix<T> retval(outdims);
while (spin_real.isValid()) {
SparseSlice<T> this_col;
index_t col_number = spin_real.col();
op.func(spin_real,this_col);
retval.data()[col_number] = this_col;
}
return Array(retval);
} else
return Transpose(VectorOpDynamic<T,Op>(Transpose(real),out,0,op));
}
template <typename T, class Op>
static inline Array VectorOpDynamic(const SparseMatrix<T> &real,
const SparseMatrix<T> &imag,
index_t out, int dim,
Op &op) {
if (dim == 0) {
ConstComplexSparseIterator<T> spin_complex(&real,&imag);
NTuple outdims(real.dimensions()); outdims[dim] = out;
SparseMatrix<T> retval_real(outdims);
SparseMatrix<T> retval_imag(outdims);
while (spin_complex.isValid()) {
SparseSlice<T> this_real_col;
SparseSlice<T> this_imag_col;
index_t col_number = spin_complex.col();
op.func(spin_complex,this_real_col,this_imag_col);
retval_real.data()[col_number] = this_real_col;
retval_imag.data()[col_number] = this_imag_col;
}
return Array(retval_real,retval_imag);
} else
return Transpose(VectorOpDynamic<T,Op>(Transpose(real),
Transpose(imag),out,0,op));
}
template <typename T, class Op>
static inline Array VectorOpDynamic(const BasicArray<T> &real,
index_t out, int dim,
Op &op) {
NTuple outdims(real.dimensions()); outdims[dim] = out;
BasicArray<T> F(outdims);
ConstBasicIterator<T> source(&real,dim);
BasicIterator<T> dest(&F,dim);
BasicArray<T> in_buffer(NTuple(real.dimensions()[dim],1));
BasicArray<T> out_buffer(NTuple(out,1));
while (source.isValid() && dest.isValid()) {
for (index_t i=1;i<=source.size();i++) {
in_buffer[i] = source.get();
source.next();
}
op.func(in_buffer,out_buffer);
for (index_t i=1;i<=out;i++) {
dest.set(out_buffer[i]);
dest.next();
}
source.nextSlice(); dest.nextSlice();
}
return Array(F);
}
template <typename T, class Op>
static inline Array VectorOpDynamic(const Array &Ain, index_t out, int dim,
DataClass Tclass, Op &op) {
Array Acast(Ain.toClass(Tclass));
if (Acast.isSparse()) {
if (Acast.allReal())
return VectorOpDynamic<T,Op>(Acast.constRealSparse<T>(),out,dim,op);
else
return VectorOpDynamic<T,Op>(Acast.constRealSparse<T>(),
Acast.constImagSparse<T>(),out,dim,op);
} else {
if (Acast.isScalar()) Acast = Acast.asDenseArray();
if (Acast.allReal()) {
return VectorOpDynamic<T,Op>(Acast.constReal<T>(),out,dim,op);
} else {
return VectorOpDynamic<T,Op>(Acast.constReal<T>(),Acast.constImag<T>(),out,dim,op);
}
}
}
template <class Op>
static inline Array VectorOpDynamic(const Array &Ain, int out, int dim,
Op &op) {
out = qMax(0,out);
if (Ain.dataClass() == Float)
return VectorOpDynamic<float,Op>(Ain,out,dim,Float,op);
else
return VectorOpDynamic<double,Op>(Ain,out,dim,Double,op);
}
template <typename T, class Op>
static inline Array BiVectorOp(const BasicArray<T> &real,
const BasicArray<T> &imag,
index_t out, int dim,
Array &D) {
NTuple outdims(real.dimensions()); outdims[dim] = out;
BasicArray<T> F_real(outdims);
BasicArray<T> F_imag(outdims);
BasicArray<index_t> Ddata(outdims);
ConstBasicIterator<T> source_real(&real,dim);
ConstBasicIterator<T> source_imag(&imag,dim);
BasicIterator<T> dest_real(&F_real,dim);
BasicIterator<T> dest_imag(&F_imag,dim);
BasicArray<T> in_buffer_real(NTuple(real.dimensions()[dim],1));
BasicArray<T> in_buffer_imag(NTuple(imag.dimensions()[dim],1));
BasicArray<T> out_buffer_real(NTuple(out,1));
BasicArray<T> out_buffer_imag(NTuple(out,1));
BasicArray<index_t> out_buffer_index(NTuple(out,1));
BasicIterator<index_t> D_iter(&Ddata,dim);
while (source_real.isValid() && dest_real.isValid()) {
for (index_t i=1;i<=source_real.size();i++) {
in_buffer_real[i] = source_real.get();
in_buffer_imag[i] = source_imag.get();
source_real.next(); source_imag.next();
}
Op::func(in_buffer_real,in_buffer_imag,
out_buffer_real,out_buffer_imag,
out_buffer_index);
for (index_t i=1;i<=out;i++) {
dest_real.set(out_buffer_real[i]);
dest_imag.set(out_buffer_imag[i]);
D_iter.set(out_buffer_index[i]);
dest_real.next(); dest_imag.next();
D_iter.next();
}
source_real.nextSlice(); source_imag.nextSlice();
dest_real.nextSlice(); dest_imag.nextSlice();
D_iter.nextSlice();
}
D = Array(Ddata);
return Array(F_real,F_imag);
}
template <typename T, class Op>
static inline Array BiVectorOp(const SparseMatrix<T>& real, index_t out, int dim,
Array &D) {
if (dim == 0) {
ConstSparseIterator<T> spin_real(&real);
NTuple outdims(real.dimensions()); outdims[dim] = out;
SparseMatrix<T> retval(outdims);
SparseMatrix<index_t> Dval(outdims);
while (spin_real.isValid()) {
SparseSlice<T> this_col;
SparseSlice<index_t> this_index;
index_t col_number = spin_real.col();
Op::func(spin_real,this_col,this_index);
retval.data()[col_number] = this_col;
Dval.data()[col_number] = this_index;
}
D = Array(Dval);
return Array(retval);
} else {
Array F = Transpose(BiVectorOp<T,Op>(Transpose(real),out,0,D));
D = Transpose(D);
return F;
}
}
template <typename T, class Op>
static inline Array BiVectorOp(const SparseMatrix<T> &real,
const SparseMatrix<T> &imag, index_t out, int dim,
Array &D) {
if (dim == 0) {
ConstComplexSparseIterator<T> spin_complex(&real,&imag);
NTuple outdims(real.dimensions()); outdims[dim] = out;
SparseMatrix<T> retval_real(outdims);
SparseMatrix<T> retval_imag(outdims);
SparseMatrix<index_t> Dval(outdims);
while (spin_complex.isValid()) {
SparseSlice<T> this_real_col;
SparseSlice<T> this_imag_col;
SparseSlice<index_t> this_index;
index_t col_number = spin_complex.col();
Op::func(spin_complex,this_real_col,this_imag_col,this_index);
retval_real.data()[col_number] = this_real_col;
retval_imag.data()[col_number] = this_imag_col;
Dval.data()[col_number] = this_index;
}
D = Array(Dval);
return Array(retval_real,retval_imag);
} else {
Array F = Transpose(BiVectorOp<T,Op>(Transpose(real),
Transpose(imag),out,0,D));
D = Transpose(D);
return F;
}
}
template <typename T, class Op>
static inline Array BiVectorOp(const BasicArray<T> &real, index_t out, int dim,
Array &D) {
NTuple outdims(real.dimensions()); outdims[dim] = out;
BasicArray<T> F(outdims);
BasicArray<index_t> Ddata(outdims);
ConstBasicIterator<T> source(&real,dim);
BasicIterator<T> dest(&F,dim);
BasicIterator<index_t> destD(&Ddata,dim);
BasicArray<T> in_buffer(NTuple(real.dimensions()[dim],1));
BasicArray<T> out_buffer1(NTuple(out,1));
BasicArray<index_t> out_buffer2(NTuple(out,1));
while (source.isValid() && dest.isValid() && destD.isValid()) {
for (index_t i=1;i<=source.size();i++) {
in_buffer[i] = source.get();
source.next();
}
Op::func(in_buffer,out_buffer1,out_buffer2);
for (index_t i=1;i<=out;i++) {
dest.set(out_buffer1[i]);
destD.set(out_buffer2[i]);
dest.next();
destD.next();
}
source.nextSlice(); dest.nextSlice(); destD.nextSlice();
}
D = Array(Ddata);
return Array(F);
}
template <typename T, class Op>
static inline ArrayVector BiVectorOp(const Array &Ain, index_t out,
int dim, DataClass Tclass) {
Array Acast(Ain.toClass(Tclass));
Array F, D;
if (Acast.isSparse()) {
if (Acast.allReal())
F = BiVectorOp<T,Op>(Acast.constRealSparse<T>(),out,dim,D);
else
F = BiVectorOp<T,Op>(Acast.constRealSparse<T>(),
Acast.constImagSparse<T>(),out,dim,D);
}
if (Acast.isScalar()) Acast = Acast.asDenseArray();
if (Acast.allReal()) {
F = BiVectorOp<T,Op>(Acast.constReal<T>(),out,dim,D);
} else {
F = BiVectorOp<T,Op>(Acast.constReal<T>(),Acast.constImag<T>(),out,dim,D);
}
F.toClass(Ain.dataClass());
ArrayVector ret;
ret.push_back(F);
ret.push_back(D);
return ret;
}
template <class Op>
static inline ArrayVector BiVectorOp(const Array &Ain, int out, int dim) {
out = qMax(0,out);
if (Ain.dataClass() == Float) {
ArrayVector Ret(BiVectorOp<float,Op>(Ain,out,dim,Float));
Ret[0] = Ret[0].toClass(Ain.dataClass());
return Ret;
} else {
ArrayVector Ret(BiVectorOp<double,Op>(Ain,out,dim,Double));
if (Ain.dataClass() != StringArray)
Ret[0] = Ret[0].toClass(Ain.dataClass());
return Ret;
}
}
template <typename T, class XIter, class YIter, class Op>
static inline Array StringOp(XIter xi, YIter yi, const NTuple &dims, const ArrayVector &eargs) {
BasicArray<T> retvec(dims);
for (index_t i=1;i<=dims.count();i++) {
ArrayVector t;
t.push_back(xi.get());
t.push_back(yi.get());
for (int j=0;j<eargs.size();j++)
t.push_back(eargs[j]);
retvec.set(i,Op::func(t));
xi.next();
yi.next();
}
return retvec;
}
template <typename T, class Op>
static inline Array StringOp(const ArrayVector& arg) {
if ((arg[0].dataClass() != CellArray) && (arg[1].dataClass() != CellArray))
return Array(Op::func(arg));
Array ax(arg[0]);
Array ay(arg[1]);
if (ax.dataClass() != CellArray) ax = CellArrayFromArray(ax);
if (ay.dataClass() != CellArray) ay = CellArrayFromArray(ay);
const BasicArray<Array> &x(ax.constReal<Array>());
const BasicArray<Array> &y(ay.constReal<Array>());
ArrayVector eargs(arg);
eargs.pop_front();
eargs.pop_front();
if (x.isScalar() && !y.isScalar()) {
ConstSpinIterator<Array> ix(&x);
ConstBasicIterator<Array> iy(&y,0);
return StringOp<T,ConstSpinIterator<Array>,ConstBasicIterator<Array>,Op>(ix,iy,y.dimensions(),eargs);
} else if (!x.isScalar() && y.isScalar()) {
ConstBasicIterator<Array> ix(&x,0);
ConstSpinIterator<Array> iy(&y);
return StringOp<T,ConstBasicIterator<Array>,ConstSpinIterator<Array>,Op>(ix,iy,x.dimensions(),eargs);
} else {
if (x.dimensions() != y.dimensions())
throw Exception("cell array arguments to string functions must be the same size");
ConstBasicIterator<Array> ix(&x,0);
ConstBasicIterator<Array> iy(&y,0);
return StringOp<T,ConstBasicIterator<Array>,ConstBasicIterator<Array>,Op>(ix,iy,x.dimensions(),eargs);
}
}
template <class Op>
static inline Array StringOp(const Array &arg) {
if (arg.isString() && !arg.isVector()) {
StringVector p(StringVectorFromArray(arg));
StringVector q;
for (int i=0;i<p.size();i++) {
QString x(p[i]);
Array y(Op::func(Array(x)));
q.push_back(y.asString());
}
return StringArrayFromStringVector(q,QChar(' '));
}
if (arg.dataClass() != CellArray)
return Array(Op::func(arg));
if (arg.isScalar())
return Array(Op::func(ArrayFromCellArray(arg)));
Array ax(arg);
const BasicArray<Array> &x(ax.constReal<Array>());
BasicArray<Array> y(ax.dimensions());
for (index_t i=1;i<=ax.length();i++)
y[i] = Op::func(x[i]);
return Array(y);
}
// These macros are defined here -- they are used to map
// operators to jit scalar functions under special circumstances.
#ifdef _WIN32
#define EXPORT __declspec(dllexport)
#else
#define EXPORT
#endif
#define JitScalarFunc2(name,func) \
extern "C" { EXPORT double _jit_ ## name(double a, double b) { return func(a,b); } }
#define JitScalarFunc1(name,func) \
extern "C" { EXPORT double _jit_ ## name(double a) { return func(a); } }
#define JitScalarFunc0(name,func) \
extern "C" { EXPORT double _jit_ ## name() { return func; } }
#endif
|