159 const T&
elem()
const {
return F;}
181 return is >> d.
elem();
189 return s << d.
elem();
196 return os << d.
elem();
205 return s >> d.
elem();
213 return s << d.
elem();
216#ifdef QDP_USE_LIBXML2
220XMLWriter&
operator<<(XMLWriter& xml,
const IScalar<T>& d)
222 return xml << d.elem();
230 read(xml, path, d.elem());
259 for(
int i=0; i < N; ++i)
267 for(
int i=0; i < N; ++i)
275 for(
int i=0; i < N; ++i)
283 for(
int i=0; i < N; ++i)
294 for(
int i=0; i < N; ++i)
308 for(
int i=0; i < N; ++i)
319 for(
int i=0; i < N; ++i)
330 for(
int i=0; i < N; ++i)
341 for(
int i=0; i < N; ++i)
352 for(
int i=0; i < N; ++i)
363 for(
int i=0; i < N; ++i)
374 for(
int i=0; i < N; ++i)
385 for(
int i=0; i < N; ++i)
396 for(
int i=0; i < N; ++i)
407 for(
int i=0; i < N; ++i)
418 for(
int i=0; i < N; ++i)
431 for(
int i=0; i < N; ++i)
442 for(
int i=0; i < N; ++i)
453 for(
int i=0; i < N; ++i)
464 for(
int i=0; i < N; ++i)
475 for(
int i=0; i < N; ++i)
486 for(
int i=0; i < N; ++i)
497 for(
int i=0; i < N; ++i)
508 for(
int i=0; i < N; ++i)
519 for(
int i=0; i < N; ++i)
530 for(
int i=0; i < N; ++i)
541 for(
int i=0; i < N; ++i)
555#if defined(QDP_USE_ARRAY_INITIALIZER)
562 for(
int i=0; i < N; ++i)
578 const T&
elem(
int i)
const {
return F[i];}
589template<
class T,
int N>
593 for(
int i=0; i < N; ++i)
600template<
class T,
int N>
604 for(
int i=0; i < N; ++i)
605 s << d.
elem(i) <<
"\n";
611template<
class T,
int N>
615 for(
int i=0; i < N; ++i)
621template<
class T,
int N>
625 for(
int i=0; i < N; ++i)
626 s << d.
elem(i) <<
"\n";
646template<
class T,
int N>
660template<
class T,
int N>
674template<
class T,
int N>
687template<
class T,
int N>
699template<
class T,
int N>
711template<
class T,
int N>
723template<
class T,
int N>
735template<
class T1,
class Op>
741template<
class T1,
int N,
class Op>
747template<
class T1,
class T2,
class Op>
755template<
class T1,
class T2,
class T3,
class Op>
761template<
class T1,
class T2,
int N,
class Op>
767template<
class T1,
class T2,
int N,
class Op>
773template<
class T1,
class T2,
int N,
class Op>
783template<
class T1,
class T2,
class T3,
int N,
class Op>
790template<
class T1,
class T2,
class T3,
int N,
class Op>
796template<
class T1,
class T2,
class T3,
int N,
class Op>
802template<
class T1,
class T2,
class T3,
int N,
class Op>
809template<
class T1,
class T2,
class T3,
int N,
class Op>
815template<
class T1,
class T2,
class T3,
int N,
class Op>
821template<
class T1,
class T2,
class T3,
int N,
class Op>
838template<
int N,
int m,
class T2,
class OpGammaConstMultiply>
843template<
class T2,
int N,
int m,
class OpMultiplyGammaConst>
848template<
class T2,
int N,
class OpGammaTypeMultiply>
853template<
class T2,
int N,
class OpMultiplyGammaType>
860template<
int N,
int m,
class T2,
class OpGammaConstDPMultiply>
865template<
class T2,
int N,
int m,
class OpMultiplyGammaConstDP>
870template<
class T2,
int N,
class OpGammaTypeDPMultiply>
875template<
class T2,
int N,
class OpMultiplyGammaTypeDP>
885template<
class T1,
class T2>
892template<
class T1,
class T2>
897template<
class T1,
class T2>
902template<
class T1,
class T2>
907template<
class T1,
class T2>
912template<
class T1,
class T2>
917template<
class T1,
class T2>
922template<
class T1,
class T2>
927template<
class T1,
class T2>
932template<
class T1,
class T2>
937template<
class T1,
class T2>
942template<
class T1,
class T2,
class T3>
949template<
class T,
int N>
956template<
int M,
int m,
class T2,
int N,
class OpGammaConstMultiply>
961template<
class T2,
int N,
int M,
int m,
class OpMultiplyGammaConst>
966template<
int M,
class T2,
int N,
class OpGammaTypeMultiply>
971template<
class T2,
int N,
int M,
class OpMultiplyGammaType>
979template<
class T,
int N>
986template<
class T1,
class T2,
int N>
993template<
class T1,
class T2,
int N>
998template<
class T1,
class T2,
int N>
1003template<
class T1,
class T2,
int N>
1008template<
class T1,
class T2,
int N>
1013template<
class T1,
class T2,
int N>
1018template<
class T1,
class T2,
int N>
1023template<
class T1,
class T2,
int N>
1028template<
class T1,
class T2,
int N>
1033template<
class T1,
class T2,
int N>
1038template<
class T1,
class T2,
int N>
1043template<
class T1,
class T2,
class T3,
int N>
1051template<
class T,
int N>
1057template<
class T1,
class T2,
int N>
1062template<
class T1,
class T2,
int N>
1067template<
class T1,
class T2,
int N>
1072template<
class T1,
class T2,
int N>
1077template<
class T1,
class T2,
int N>
1082template<
class T1,
class T2,
int N>
1087template<
class T1,
class T2,
int N>
1092template<
class T1,
class T2,
int N>
1097template<
class T1,
class T2,
int N>
1102template<
class T1,
class T2,
int N>
1152template<
class T1,
class T2>
1161template<
class T1,
class T2>
1170template<
class T1,
class T2>
1178template<
class T1,
class T2>
1187template<
class T1,
class T2>
1196template<
class T1,
class T2>
1206template<
class T1,
class T2>
1215template<
class T1,
class T2>
1220template<
class T1,
class T2>
1229template<
class T1,
class T2>
1235template<
class T1,
class T2>
1244template<
class T1,
class T2>
1253template<
class T1,
class T2>
1262template<
class T1,
class T2>
1271template<
class T1,
class T2>
1283template<
class T1,
class T2>
1288template<
class T1,
class T2>
1297template<
class T1,
class T2>
1302template<
class T1,
class T2>
1311template<
class T1,
class T2>
1316template<
class T1,
class T2>
1325template<
class T1,
class T2>
1330template<
class T1,
class T2>
1339template<
class T1,
class T2>
1344template<
class T1,
class T2>
1353template<
class T1,
class T2>
1358template<
class T1,
class T2>
1367template<
class T1,
class T2>
1372template<
class T1,
class T2>
1381template<
class T1,
class T2>
1386template<
class T1,
class T2>
1561template<
class T1,
class T2>
1570template<
class T1,
class T2>
1588template<
class T1,
class T2>
1646inline WordType<IScalar<T> >
1654template<
class T,
class T1>
1662template<
class T,
class T1>
1671template<
class T,
class T1>
1680template<
class T,
class T1>
1692template<
class T,
class T1>
1695 const IScalar<T1>& s0,
int i0,
1696 const IScalar<T1>& s1,
int i1,
1697 const IScalar<T1>& s2,
int i2,
1698 const IScalar<T1>& s3,
int i3)
1784template<
class T1,
class T2>
1789template<
class T1,
class T2>
1794template<
class T1,
class T2>
1803template<
class T1,
class T2>
1808template<
class T1,
class T2>
1822template<
class T1,
class T2,
class T3>
1827template<
class T1,
class T2,
class T3>
1850template<
class T,
class T1,
class T2>
1879template<
class T1,
int N>
1885 for(
int i=0; i < N; ++i)
1886 d.elem(i) = ! l.
elem(i);
1892template<
class T1,
int N>
1898 for(
int i=0; i < N; ++i)
1899 d.elem(i) = +l.
elem(i);
1905template<
class T1,
int N>
1911 for(
int i=0; i < N; ++i)
1912 d.elem(i) = -l.
elem(i);
1918template<
class T1,
class T2,
int N>
1924 for(
int i=0; i < N; ++i)
1930template<
class T1,
class T2,
int N>
1936 for(
int i=0; i < N; ++i)
1942template<
class T1,
class T2,
int N>
1948 for(
int i=0; i < N; ++i)
1955template<
class T1,
class T2,
int N>
1961 for(
int i=0; i < N; ++i)
1967template<
class T1,
class T2,
int N>
1973 for(
int i=0; i < N; ++i)
1979template<
class T1,
class T2,
int N>
1985 for(
int i=0; i < N; ++i)
1992template<
class T1,
class T2,
int N>
1998 for(
int i=0; i < N; ++i)
2004template<
class T1,
class T2,
int N>
2010 for(
int i=0; i < N; ++i)
2016template<
class T1,
class T2,
int N>
2022 for(
int i=0; i < N; ++i)
2029template<
class T1,
class T2,
int N>
2036 for(
int i=0; i < N; ++i)
2042template<
class T1,
class T2,
int N>
2049 for(
int i=0; i < N; ++i)
2055template<
class T1,
class T2,
int N>
2062 for(
int i=0; i < N; ++i)
2069template<
class T1,
class T2,
int N>
2076 for(
int i=0; i < N; ++i)
2082template<
class T1,
class T2,
int N>
2089 for(
int i=0; i < N; ++i)
2095template<
class T1,
class T2,
int N>
2102 for(
int i=0; i < N; ++i)
2109template<
class T1,
class T2,
int N>
2116 for(
int i=0; i < N; ++i)
2122template<
class T1,
class T2,
int N>
2129 for(
int i=0; i < N; ++i)
2135template<
class T1,
class T2,
int N>
2142 for(
int i=0; i < N; ++i)
2149template<
class T1,
class T2,
int N>
2155 for(
int i=0; i < N; ++i)
2161template<
class T1,
class T2,
int N>
2167 for(
int i=0; i < N; ++i)
2173template<
class T1,
class T2,
int N>
2179 for(
int i=0; i < N; ++i)
2186template<
class T1,
class T2,
int N>
2191template<
class T1,
class T2,
int N>
2197 for(
int i=0; i < N; ++i)
2198 d.elem(i) = l.
elem(i) << r.
elem(i);
2203template<
class T1,
class T2,
int N>
2208template<
class T1,
class T2,
int N>
2214 for(
int i=0; i < N; ++i)
2220template<
class T1,
class T2,
int N>
2225template<
class T1,
class T2,
int N>
2231 for(
int i=0; i < N; ++i)
2238template<
class T1,
class T2,
int N>
2243template<
class T1,
class T2,
int N>
2249 for(
int i=0; i < N; ++i)
2250 d.elem(i) = l.
elem(i) >> r.
elem(i);
2255template<
class T1,
class T2,
int N>
2260template<
class T1,
class T2,
int N>
2266 for(
int i=0; i < N; ++i)
2272template<
class T1,
class T2,
int N>
2277template<
class T1,
class T2,
int N>
2283 for(
int i=0; i < N; ++i)
2290template<
class T1,
class T2,
int N>
2295template<
class T1,
class T2,
int N>
2301 for(
int i=0; i < N; ++i)
2307template<
class T1,
class T2,
int N>
2312template<
class T1,
class T2,
int N>
2318 for(
int i=0; i < N; ++i)
2324template<
class T1,
class T2,
int N>
2329template<
class T1,
class T2,
int N>
2335 for(
int i=0; i < N; ++i)
2342template<
class T1,
class T2,
int N>
2347template<
class T1,
class T2,
int N>
2353 for(
int i=0; i < N; ++i)
2359template<
class T1,
class T2,
int N>
2364template<
class T1,
class T2,
int N>
2370 for(
int i=0; i < N; ++i)
2376template<
class T1,
class T2,
int N>
2381template<
class T1,
class T2,
int N>
2387 for(
int i=0; i < N; ++i)
2394template<
class T1,
class T2,
int N>
2399template<
class T1,
class T2,
int N>
2405 for(
int i=0; i < N; ++i)
2411template<
class T1,
class T2,
int N>
2416template<
class T1,
class T2,
int N>
2422 for(
int i=0; i < N; ++i)
2428template<
class T1,
class T2,
int N>
2433template<
class T1,
class T2,
int N>
2439 for(
int i=0; i < N; ++i)
2446template<
class T1,
class T2,
int N>
2451template<
class T1,
class T2,
int N>
2457 for(
int i=0; i < N; ++i)
2463template<
class T1,
class T2,
int N>
2468template<
class T1,
class T2,
int N>
2474 for(
int i=0; i < N; ++i)
2480template<
class T1,
class T2,
int N>
2485template<
class T1,
class T2,
int N>
2491 for(
int i=0; i < N; ++i)
2500template<
class T1,
class T2,
int N>
2505template<
class T1,
class T2,
int N>
2511 for(
int i=0; i < N; ++i)
2517template<
class T1,
class T2,
int N>
2522template<
class T1,
class T2,
int N>
2528 for(
int i=0; i < N; ++i)
2534template<
class T1,
class T2,
int N>
2539template<
class T1,
class T2,
int N>
2545 for(
int i=0; i < N; ++i)
2552template<
class T1,
class T2,
int N>
2557template<
class T1,
class T2,
int N>
2563 for(
int i=0; i < N; ++i)
2564 d.elem(i) = l.
elem(i) <= r.
elem(i);
2569template<
class T1,
class T2,
int N>
2574template<
class T1,
class T2,
int N>
2580 for(
int i=0; i < N; ++i)
2586template<
class T1,
class T2,
int N>
2591template<
class T1,
class T2,
int N>
2597 for(
int i=0; i < N; ++i)
2604template<
class T1,
class T2,
int N>
2609template<
class T1,
class T2,
int N>
2615 for(
int i=0; i < N; ++i)
2621template<
class T1,
class T2,
int N>
2626template<
class T1,
class T2,
int N>
2632 for(
int i=0; i < N; ++i)
2638template<
class T1,
class T2,
int N>
2643template<
class T1,
class T2,
int N>
2649 for(
int i=0; i < N; ++i)
2657template<
class T1,
class T2,
int N>
2662template<
class T1,
class T2,
int N>
2668 for(
int i=0; i < N; ++i)
2669 d.elem(i) = l.
elem(i) >= r.
elem(i);
2674template<
class T1,
class T2,
int N>
2679template<
class T1,
class T2,
int N>
2685 for(
int i=0; i < N; ++i)
2691template<
class T1,
class T2,
int N>
2696template<
class T1,
class T2,
int N>
2702 for(
int i=0; i < N; ++i)
2709template<
class T1,
class T2,
int N>
2714template<
class T1,
class T2,
int N>
2720 for(
int i=0; i < N; ++i)
2721 d.elem(i) = l.
elem(i) == r.
elem(i);
2726template<
class T1,
class T2,
int N>
2731template<
class T1,
class T2,
int N>
2737 for(
int i=0; i < N; ++i)
2743template<
class T1,
class T2,
int N>
2748template<
class T1,
class T2,
int N>
2754 for(
int i=0; i < N; ++i)
2761template<
class T1,
class T2,
int N>
2766template<
class T1,
class T2,
int N>
2772 for(
int i=0; i < N; ++i)
2773 d.elem(i) = l.
elem(i) != r.
elem(i);
2778template<
class T1,
class T2,
int N>
2783template<
class T1,
class T2,
int N>
2789 for(
int i=0; i < N; ++i)
2795template<
class T1,
class T2,
int N>
2800template<
class T1,
class T2,
int N>
2806 for(
int i=0; i < N; ++i)
2813template<
class T1,
class T2,
int N>
2818template<
class T1,
class T2,
int N>
2824 for(
int i=0; i < N; ++i)
2825 d.elem(i) = l.
elem(i) && r.
elem(i);
2830template<
class T1,
class T2,
int N>
2835template<
class T1,
class T2,
int N>
2841 for(
int i=0; i < N; ++i)
2847template<
class T1,
class T2,
int N>
2852template<
class T1,
class T2,
int N>
2858 for(
int i=0; i < N; ++i)
2865template<
class T1,
class T2,
int N>
2870template<
class T1,
class T2,
int N>
2876 for(
int i=0; i < N; ++i)
2877 d.elem(i) = l.
elem(i) || r.
elem(i);
2882template<
class T1,
class T2,
int N>
2887template<
class T1,
class T2,
int N>
2893 for(
int i=0; i < N; ++i)
2899template<
class T1,
class T2,
int N>
2904template<
class T1,
class T2,
int N>
2910 for(
int i=0; i < N; ++i)
2920template<
class T1,
int N>
2926 for(
int i=0; i < N; ++i)
2933template<
class T1,
int N>
2939 for(
int i=0; i < N; ++i)
2946template<
class T1,
int N>
2952 for(
int i=0; i < N; ++i)
2959template<
class T1,
int N>
2965 for(
int i=0; i < N; ++i)
2972template<
class T1,
int N>
2978 for(
int i=0; i < N; ++i)
2985template<
class T1,
int N>
2991 for(
int i=0; i < N; ++i)
2998template<
class T1,
int N>
3004 for(
int i=0; i < N; ++i)
3011template<
class T1,
int N>
3017 for(
int i=0; i < N; ++i)
3024template<
class T1,
int N>
3030 for(
int i=0; i < N; ++i)
3036template<
class T1,
int N>
3042 for(
int i=0; i < N; ++i)
3048template<
class T1,
int N>
3054 for(
int i=0; i < N; ++i)
3060template<
class T1,
int N>
3066 for(
int i=0; i < N; ++i)
3072template<
class T1,
int N>
3078 for(
int i=0; i < N; ++i)
3084template<
class T1,
int N>
3090 for(
int i=0; i < N; ++i)
3096template<
class T1,
int N>
3102 for(
int i=0; i < N; ++i)
3108template<
class T1,
int N>
3114 for(
int i=0; i < N; ++i)
3120template<
class T1,
int N>
3126 for(
int i=0; i < N; ++i)
3132template<
class T1,
int N>
3138 for(
int i=0; i < N; ++i)
3145template<
class T1,
class T2,
int N>
3151 for(
int i=0; i < N; ++i)
3157template<
class T1,
class T2,
int N>
3163 for(
int i=0; i < N; ++i)
3169template<
class T1,
class T2,
int N>
3175 for(
int i=0; i < N; ++i)
3182template<
class T1,
class T2,
int N>
3188 for(
int i=0; i < N; ++i)
3194template<
class T1,
class T2,
int N>
3200 for(
int i=0; i < N; ++i)
3206template<
class T1,
class T2,
int N>
3212 for(
int i=0; i < N; ++i)
3219template<
class T1,
int N>
3225 for(
int i=0; i < N; ++i)
3232template<
class T1,
class T2,
int N>
3238 for(
int i=0; i < N; ++i)
3244template<
class T1,
class T2,
int N>
3250 for(
int i=0; i < N; ++i)
3256template<
class T1,
class T2,
int N>
3262 for(
int i=0; i < N; ++i)
3271template<
class T,
int N>
3276template<
class T,
int N>
3280 return s1.
elem(innersite);
3285template<
class T,
int N>
3289 for(
int i=0; i < N; ++i)
3295template<
class T,
class T1,
int N>
3305template<
class T,
class T1>
3318template<
class T,
class T1>
3334template<
class T,
class T1,
int N>
3338 for(
int i=0; i < N; ++i)
3344template<
class T,
int N,
class T1,
class T2>
3354template<
class T,
int N>
3359template<
class T,
int N>
3365 d.elem() = s1.
elem(0);
3366 for(
int i=1; i < N; ++i)
3367 d.elem() += s1.
elem(i);
3376template<
class T,
int N>
3381template<
class T,
int N>
3387 d.elem() = s1.
elem(0);
3388 for(
int i=1; i < N; ++i)
3391 d.elem() = s1.
elem(i);
3400template<
class T,
int N>
3405template<
class T,
int N>
3411 d.elem() = s1.
elem(0);
3412 for(
int i=1; i < N; ++i)
3415 d.elem() = s1.
elem(i);
3424template<
class T,
int N>
3429template<
class T,
int N>
3434template<
class T,
int N>
3440 for(
int i=0; i < N; ++i)
3448template<
class T1,
class T2,
int N>
3453template<
class T1,
class T2,
int N>
3458template<
class T1,
class T2,
int N>
3464 for(
int i=0; i < N; ++i)
3471template<
class T1,
class T2,
int N>
3476template<
class T1,
class T2,
int N>
3481template<
class T1,
class T2,
int N>
3487 for(
int i=0; i < N; ++i)
3494template<
class T1,
class T2,
int N>
3499template<
class T1,
class T2,
int N>
3504template<
class T1,
class T2,
int N>
3510 for(
int i=0; i < N; ++i)
3522template<
class T1,
class T2,
class T3,
int N>
3527template<
class T1,
class T2,
class T3,
int N>
3533 for(
int i=0; i < N; ++i)
3544template<
class T1,
class T2,
class T3,
int N>
3549template<
class T1,
class T2,
class T3,
int N>
3555 for(
int i=0; i < N; ++i)
3566template<
class T1,
class T2,
class T3,
int N>
3571template<
class T1,
class T2,
class T3,
int N>
3577 for(
int i=0; i < N; ++i)
3588template<
class T1,
class T2,
class T3,
int N>
3593template<
class T1,
class T2,
class T3,
int N>
3599 for(
int i=0; i < N; ++i)
3610template<
class T1,
class T2,
class T3,
int N>
3615template<
class T1,
class T2,
class T3,
int N>
3621 for(
int i=0; i < N; ++i)
3632template<
class T1,
class T2,
class T3,
int N>
3637template<
class T1,
class T2,
class T3,
int N>
3643 for(
int i=0; i < N; ++i)
3654template<
class T1,
class T2,
class T3,
int N>
3659template<
class T1,
class T2,
class T3,
int N>
3665 for(
int i=0; i < N; ++i)
ILattice & operator-=(const ILattice< T1, N > &rhs)
ILattice -= ILattice.
ILattice & operator*=(const IScalar< T1 > &rhs)
ILattice *= IScalar.
ILattice & operator*=(const ILattice< T1, N > &rhs)
ILattice *= ILattice.
ILattice(const ILattice &a)
Deep copy constructor.
ILattice & operator/=(const ILattice< T1, N > &rhs)
ILattice /= ILattice.
ILattice & operator=(const IScalar< T1 > &rhs)
ILattice = IScalar.
ILattice & operator<<=(const IScalar< T1 > &rhs)
ILattice <<= IScalar.
ILattice & operator-=(const IScalar< T1 > &rhs)
ILattice -= IScalar.
ILattice & operator&=(const ILattice< T1, N > &rhs)
ILattice &= ILattice.
ILattice & operator=(const ILattice< T1, N > &rhs)
ILattice = ILattice.
ILattice & operator>>=(const ILattice< T1, N > &rhs)
ILattice >>= ILattice.
ILattice & operator%=(const IScalar< T1 > &rhs)
ILattice %= IScalar.
ILattice & operator|=(const IScalar< T1 > &rhs)
ILattice |= IScalar.
ILattice(const typename WordType< T >::Type_t &rhs)
construct dest = const
ILattice(const IScalar< T1 > &rhs)
construct dest = rhs
ILattice & operator^=(const IScalar< T1 > &rhs)
ILattice ^= IScalar.
ILattice & operator&=(const IScalar< T1 > &rhs)
ILattice &= IScalar.
const T & elem(int i) const
ILattice & operator/=(const IScalar< T1 > &rhs)
ILattice /= IScalar.
ILattice & operator+=(const IScalar< T1 > &rhs)
ILattice += IScalar.
ILattice(const ILattice< T1, N > &rhs)
construct dest = rhs
ILattice & operator%=(const ILattice< T1, N > &rhs)
ILattice %= ILattice.
ILattice & operator+=(const ILattice< T1, N > &rhs)
ILattice += ILattice.
ILattice & operator<<=(const ILattice< T1, N > &rhs)
ILattice <<= ILattice.
ILattice & operator|=(const ILattice< T1, N > &rhs)
ILattice |= ILattice.
ILattice & operator^=(const ILattice< T1, N > &rhs)
ILattice ^= ILattice.
ILattice & operator>>=(const IScalar< T1 > &rhs)
ILattice >>= IScalar.
ILattice(const T1 &rhs)
construct dest = rhs
IScalar(const IScalar< T1 > &rhs)
construct dest = rhs
IScalar & operator%=(const IScalar< T1 > &rhs)
IScalar %= IScalar.
IScalar & operator<<=(const IScalar< T1 > &rhs)
IScalar <<= IScalar.
IScalar & operator*=(const IScalar< T1 > &rhs)
IScalar *= IScalar.
IScalar(const T1 &rhs)
construct dest = rhs
IScalar & operator=(const IScalar< T1 > &rhs)
IScalar = IScalar.
IScalar & operator/=(const IScalar< T1 > &rhs)
IScalar /= IScalar.
IScalar(const IScalar &a)
Deep copies here.
IScalar & operator>>=(const IScalar< T1 > &rhs)
IScalar >>= IScalar.
IScalar & operator&=(const IScalar< T1 > &rhs)
IScalar &= IScalar.
IScalar(const typename WordType< T >::Type_t &rhs)
construct dest = const
IScalar & operator^=(const IScalar< T1 > &rhs)
IScalar ^= IScalar.
IScalar & operator+=(const IScalar< T1 > &rhs)
IScalar += IScalar.
IScalar & operator-=(const IScalar< T1 > &rhs)
IScalar -= IScalar.
IScalar & operator|=(const IScalar< T1 > &rhs)
IScalar |= IScalar.
StandardOutputStream class.
UnaryReturn< C, FnGlobalMin >::Type_t globalMin(const QDPType< T, C > &s1)
OScalar = globalMin(source).
UnaryReturn< C, FnGlobalMax >::Type_t globalMax(const QDPType< T, C > &s1)
OScalar = globalMax(source).
UnaryReturn< C, FnSum >::Type_t sum(const QDPType< T, C > &s1)
OScalar = sum(source).
void gather_sites(ILattice< T, 2 > &d, const ILattice< T1, 2 > &s0, int i0, const ILattice< T1, 2 > &s1, int i1)
gather several inner sites together
TextWriter & operator<<(TextWriter &txt, const std::string &output)
TextReader & operator>>(TextReader &txt, std::string &input)
void read(BinaryReader &bin, std::string &input, size_t maxBytes)
void fill_gaussian(IScalar< T > &d, IScalar< T > &r1, IScalar< T > &r2)
dest = gaussian
void copy_site(IScalar< T > &d, int isite, const IScalar< T1 > &s1)
dest [some type] = source [some type]
int toInt(const IScalar< T > &s)
QDP Int to int primitive in conversion routine.
WordType< IScalar< T > > toWordType(const IScalar< T > &s)
QDP Wordtype to primitive wordtype.
void zero_rep(IScalar< T > &dest)
dest = 0
void copymask(IScalar< T > &d, const IScalar< T1 > &mask, const IScalar< T > &s1)
dest = (mask) ? s1 : dest
double toDouble(const IScalar< T > &s)
QDP Double to double primitive in conversion routine.
BinaryReturn< IScalar< T1 >, IScalar< T2 >, OpAdjMultiplyAdj >::Type_t adjMultiplyAdj(const IScalar< T1 > &l, const IScalar< T2 > &r)
bool toBool(const IScalar< T > &s)
QDP Boolean to bool primitive in conversion routine.
BinaryReturn< IScalar< T1 >, IScalar< T2 >, OpMultiplyAdj >::Type_t multiplyAdj(const IScalar< T1 > &l, const IScalar< T2 > &r)
void cast_rep(T &d, const IScalar< T1 > &s1)
dest [float type] = source [int type]
BinaryReturn< IScalar< T1 >, IScalar< T2 >, OpAdjMultiply >::Type_t adjMultiply(const IScalar< T1 > &l, const IScalar< T2 > &r)
UnaryReturn< IScalar< T1 >, FnRealTrace >::Type_t trace_real(const IScalar< T1 > &s1)
UnaryReturn< IScalar< T1 >, FnImagTrace >::Type_t trace_imag(const IScalar< T1 > &s1)
void recast_rep(IScalar< T > &d, const IScalar< T1 > &s1)
dest [float type] = source [int type]
UnaryReturn< IScalar< T >, FnGetSite >::Type_t getSite(const IScalar< T > &s1, int innersite)
float toFloat(const IScalar< T > &s)
QDP Real to float primitive in conversion routine.
Yet another random number generator.
MakeReturn< UnaryNode< FnAdjoint, typenameCreateLeaf< QDPExpr< T1, C1 > >::Leaf_t >, typenameUnaryReturn< C1, FnAdjoint >::Type_t >::Expression_t adj(const QDPExpr< T1, C1 > &l)
MakeReturn< BinaryNode< FnPow, typenameCreateLeaf< QDPType< T1, C1 > >::Leaf_t, typenameCreateLeaf< QDPExpr< T2, C2 > >::Leaf_t >, typenameBinaryReturn< C1, C2, FnPow >::Type_t >::Expression_t pow(const QDPType< T1, C1 > &l, const QDPExpr< T2, C2 > &r)
MakeReturn< UnaryNode< FnReal, typenameCreateLeaf< QDPExpr< T1, C1 > >::Leaf_t >, typenameUnaryReturn< C1, FnReal >::Type_t >::Expression_t real(const QDPExpr< T1, C1 > &l)
MakeReturn< TrinaryNode< FnWhere, typenameCreateLeaf< QDPType< T1, C1 > >::Leaf_t, typenameCreateLeaf< QDPType< T2, C2 > >::Leaf_t, typenameCreateLeaf< typenameSimpleScalar< typenameWordType< C1 >::Type_t >::Type_t >::Leaf_t >, typenameTrinaryReturn< C1, C2, typenameSimpleScalar< typenameWordType< C1 >::Type_t >::Type_t, FnWhere >::Type_t >::Expression_t where(const QDPType< T1, C1 > &a, const QDPType< T2, C2 > &b, const typename WordType< C1 >::Type_t &c)
MakeReturn< UnaryNode< FnSeedToFloat, typenameCreateLeaf< QDPExpr< T1, C1 > >::Leaf_t >, typenameUnaryReturn< C1, FnSeedToFloat >::Type_t >::Expression_t seedToFloat(const QDPExpr< T1, C1 > &l)
MakeReturn< BinaryNode< OpEQ, typenameCreateLeaf< QDPType< T1, C1 > >::Leaf_t, typenameCreateLeaf< QDPExpr< T2, C2 > >::Leaf_t >, typenameBinaryReturn< C1, C2, OpEQ >::Type_t >::Expression_t operator==(const QDPType< T1, C1 > &l, const QDPExpr< T2, C2 > &r)
MakeReturn< BinaryNode< OpGT, typenameCreateLeaf< QDPType< T1, C1 > >::Leaf_t, typenameCreateLeaf< QDPExpr< T2, C2 > >::Leaf_t >, typenameBinaryReturn< C1, C2, OpGT >::Type_t >::Expression_t operator>(const QDPType< T1, C1 > &l, const QDPExpr< T2, C2 > &r)
MakeReturn< UnaryNode< FnFabs, typenameCreateLeaf< QDPExpr< T1, C1 > >::Leaf_t >, typenameUnaryReturn< C1, FnFabs >::Type_t >::Expression_t fabs(const QDPExpr< T1, C1 > &l)
MakeReturn< UnaryNode< FnTrace, typenameCreateLeaf< QDPExpr< T1, C1 > >::Leaf_t >, typenameUnaryReturn< C1, FnTrace >::Type_t >::Expression_t trace(const QDPExpr< T1, C1 > &l)
MakeReturn< BinaryNode< OpMultiply, typenameCreateLeaf< QDPType< T1, C1 > >::Leaf_t, typenameCreateLeaf< QDPExpr< T2, C2 > >::Leaf_t >, typenameBinaryReturn< C1, C2, OpMultiply >::Type_t >::Expression_t operator*(const QDPType< T1, C1 > &l, const QDPExpr< T2, C2 > &r)
MakeReturn< BinaryNode< OpAdd, typenameCreateLeaf< QDPType< T1, C1 > >::Leaf_t, typenameCreateLeaf< QDPExpr< T2, C2 > >::Leaf_t >, typenameBinaryReturn< C1, C2, OpAdd >::Type_t >::Expression_t operator+(const QDPType< T1, C1 > &l, const QDPExpr< T2, C2 > &r)
MakeReturn< UnaryNode< FnCos, typenameCreateLeaf< QDPExpr< T1, C1 > >::Leaf_t >, typenameUnaryReturn< C1, FnCos >::Type_t >::Expression_t cos(const QDPExpr< T1, C1 > &l)
MakeReturn< BinaryNode< OpSubtract, typenameCreateLeaf< QDPType< T1, C1 > >::Leaf_t, typenameCreateLeaf< QDPExpr< T2, C2 > >::Leaf_t >, typenameBinaryReturn< C1, C2, OpSubtract >::Type_t >::Expression_t operator-(const QDPType< T1, C1 > &l, const QDPExpr< T2, C2 > &r)
MakeReturn< BinaryNode< OpMod, typenameCreateLeaf< QDPType< T1, C1 > >::Leaf_t, typenameCreateLeaf< QDPExpr< T2, C2 > >::Leaf_t >, typenameBinaryReturn< C1, C2, OpMod >::Type_t >::Expression_t operator%(const QDPType< T1, C1 > &l, const QDPExpr< T2, C2 > &r)
MakeReturn< UnaryNode< FnArcTan, typenameCreateLeaf< QDPExpr< T1, C1 > >::Leaf_t >, typenameUnaryReturn< C1, FnArcTan >::Type_t >::Expression_t atan(const QDPExpr< T1, C1 > &l)
MakeReturn< BinaryNode< FnArcTan2, typenameCreateLeaf< QDPType< T1, C1 > >::Leaf_t, typenameCreateLeaf< QDPExpr< T2, C2 > >::Leaf_t >, typenameBinaryReturn< C1, C2, FnArcTan2 >::Type_t >::Expression_t atan2(const QDPType< T1, C1 > &l, const QDPExpr< T2, C2 > &r)
MakeReturn< UnaryNode< FnConjugate, typenameCreateLeaf< QDPExpr< T1, C1 > >::Leaf_t >, typenameUnaryReturn< C1, FnConjugate >::Type_t >::Expression_t conj(const QDPExpr< T1, C1 > &l)
MakeReturn< UnaryNode< OpNot, typenameCreateLeaf< QDPExpr< T1, C1 > >::Leaf_t >, typenameUnaryReturn< C1, OpNot >::Type_t >::Expression_t operator!(const QDPExpr< T1, C1 > &l)
MakeReturn< BinaryNode< FnOuterProduct, typenameCreateLeaf< QDPType< T1, C1 > >::Leaf_t, typenameCreateLeaf< QDPExpr< T2, C2 > >::Leaf_t >, typenameBinaryReturn< C1, C2, FnOuterProduct >::Type_t >::Expression_t outerProduct(const QDPType< T1, C1 > &l, const QDPExpr< T2, C2 > &r)
MakeReturn< BinaryNode< FnLocalColorInnerProduct, typenameCreateLeaf< QDPType< T1, C1 > >::Leaf_t, typenameCreateLeaf< QDPExpr< T2, C2 > >::Leaf_t >, typenameBinaryReturn< C1, C2, FnLocalColorInnerProduct >::Type_t >::Expression_t localColorInnerProduct(const QDPType< T1, C1 > &l, const QDPExpr< T2, C2 > &r)
MakeReturn< BinaryNode< OpBitwiseAnd, typenameCreateLeaf< QDPType< T1, C1 > >::Leaf_t, typenameCreateLeaf< QDPExpr< T2, C2 > >::Leaf_t >, typenameBinaryReturn< C1, C2, OpBitwiseAnd >::Type_t >::Expression_t operator&(const QDPType< T1, C1 > &l, const QDPExpr< T2, C2 > &r)
MakeReturn< BinaryNode< FnLocalInnerProduct, typenameCreateLeaf< QDPType< T1, C1 > >::Leaf_t, typenameCreateLeaf< QDPExpr< T2, C2 > >::Leaf_t >, typenameBinaryReturn< C1, C2, FnLocalInnerProduct >::Type_t >::Expression_t localInnerProduct(const QDPType< T1, C1 > &l, const QDPExpr< T2, C2 > &r)
MakeReturn< UnaryNode< FnArcSin, typenameCreateLeaf< QDPExpr< T1, C1 > >::Leaf_t >, typenameUnaryReturn< C1, FnArcSin >::Type_t >::Expression_t asin(const QDPExpr< T1, C1 > &l)
MakeReturn< UnaryNode< FnExp, typenameCreateLeaf< QDPExpr< T1, C1 > >::Leaf_t >, typenameUnaryReturn< C1, FnExp >::Type_t >::Expression_t exp(const QDPExpr< T1, C1 > &l)
MakeReturn< BinaryNode< OpAnd, typenameCreateLeaf< QDPType< T1, C1 > >::Leaf_t, typenameCreateLeaf< QDPExpr< T2, C2 > >::Leaf_t >, typenameBinaryReturn< C1, C2, OpAnd >::Type_t >::Expression_t operator&&(const QDPType< T1, C1 > &l, const QDPExpr< T2, C2 > &r)
MakeReturn< BinaryNode< OpGE, typenameCreateLeaf< QDPType< T1, C1 > >::Leaf_t, typenameCreateLeaf< QDPExpr< T2, C2 > >::Leaf_t >, typenameBinaryReturn< C1, C2, OpGE >::Type_t >::Expression_t operator>=(const QDPType< T1, C1 > &l, const QDPExpr< T2, C2 > &r)
MakeReturn< BinaryNode< OpBitwiseOr, typenameCreateLeaf< QDPType< T1, C1 > >::Leaf_t, typenameCreateLeaf< QDPExpr< T2, C2 > >::Leaf_t >, typenameBinaryReturn< C1, C2, OpBitwiseOr >::Type_t >::Expression_t operator|(const QDPType< T1, C1 > &l, const QDPExpr< T2, C2 > &r)
MakeReturn< BinaryNode< OpDivide, typenameCreateLeaf< QDPType< T1, C1 > >::Leaf_t, typenameCreateLeaf< QDPExpr< T2, C2 > >::Leaf_t >, typenameBinaryReturn< C1, C2, OpDivide >::Type_t >::Expression_t operator/(const QDPType< T1, C1 > &l, const QDPExpr< T2, C2 > &r)
MakeReturn< UnaryNode< FnSin, typenameCreateLeaf< QDPExpr< T1, C1 > >::Leaf_t >, typenameUnaryReturn< C1, FnSin >::Type_t >::Expression_t sin(const QDPExpr< T1, C1 > &l)
MakeReturn< UnaryNode< FnArcCos, typenameCreateLeaf< QDPExpr< T1, C1 > >::Leaf_t >, typenameUnaryReturn< C1, FnArcCos >::Type_t >::Expression_t acos(const QDPExpr< T1, C1 > &l)
MakeReturn< UnaryNode< FnTranspose, typenameCreateLeaf< QDPExpr< T1, C1 > >::Leaf_t >, typenameUnaryReturn< C1, FnTranspose >::Type_t >::Expression_t transpose(const QDPExpr< T1, C1 > &l)
MakeReturn< UnaryNode< FnImag, typenameCreateLeaf< QDPExpr< T1, C1 > >::Leaf_t >, typenameUnaryReturn< C1, FnImag >::Type_t >::Expression_t imag(const QDPExpr< T1, C1 > &l)
MakeReturn< BinaryNode< OpLT, typenameCreateLeaf< QDPType< T1, C1 > >::Leaf_t, typenameCreateLeaf< QDPExpr< T2, C2 > >::Leaf_t >, typenameBinaryReturn< C1, C2, OpLT >::Type_t >::Expression_t operator<(const QDPType< T1, C1 > &l, const QDPExpr< T2, C2 > &r)
MakeReturn< BinaryNode< OpNE, typenameCreateLeaf< QDPType< T1, C1 > >::Leaf_t, typenameCreateLeaf< QDPExpr< T2, C2 > >::Leaf_t >, typenameBinaryReturn< C1, C2, OpNE >::Type_t >::Expression_t operator!=(const QDPType< T1, C1 > &l, const QDPExpr< T2, C2 > &r)
MakeReturn< BinaryNode< OpOr, typenameCreateLeaf< QDPType< T1, C1 > >::Leaf_t, typenameCreateLeaf< QDPExpr< T2, C2 > >::Leaf_t >, typenameBinaryReturn< C1, C2, OpOr >::Type_t >::Expression_t operator||(const QDPType< T1, C1 > &l, const QDPExpr< T2, C2 > &r)
MakeReturn< UnaryNode< FnSqrt, typenameCreateLeaf< QDPExpr< T1, C1 > >::Leaf_t >, typenameUnaryReturn< C1, FnSqrt >::Type_t >::Expression_t sqrt(const QDPExpr< T1, C1 > &l)
MakeReturn< UnaryNode< FnTan, typenameCreateLeaf< QDPExpr< T1, C1 > >::Leaf_t >, typenameUnaryReturn< C1, FnTan >::Type_t >::Expression_t tan(const QDPExpr< T1, C1 > &l)
MakeReturn< BinaryNode< OpLE, typenameCreateLeaf< QDPType< T1, C1 > >::Leaf_t, typenameCreateLeaf< QDPExpr< T2, C2 > >::Leaf_t >, typenameBinaryReturn< C1, C2, OpLE >::Type_t >::Expression_t operator<=(const QDPType< T1, C1 > &l, const QDPExpr< T2, C2 > &r)
MakeReturn< BinaryNode< OpBitwiseXor, typenameCreateLeaf< QDPType< T1, C1 > >::Leaf_t, typenameCreateLeaf< QDPExpr< T2, C2 > >::Leaf_t >, typenameBinaryReturn< C1, C2, OpBitwiseXor >::Type_t >::Expression_t operator^(const QDPType< T1, C1 > &l, const QDPExpr< T2, C2 > &r)
void fill_random(float &d, T1 &seed, T2 &skewed_seed, const T1 &seed_mult)
dest = random
MakeReturn< UnaryNode< FnLocalNorm2, typenameCreateLeaf< QDPExpr< T1, C1 > >::Leaf_t >, typenameUnaryReturn< C1, FnLocalNorm2 >::Type_t >::Expression_t localNorm2(const QDPExpr< T1, C1 > &l)
MakeReturn< UnaryNode< FnLog, typenameCreateLeaf< QDPExpr< T1, C1 > >::Leaf_t >, typenameUnaryReturn< C1, FnLog >::Type_t >::Expression_t log(const QDPExpr< T1, C1 > &l)
IScalar< typename UnaryReturn< T2, OpUnaryPlus >::Type_t > Type_t
ILattice< typename UnaryReturn< T2, OpUnaryPlus >::Type_t, N > Type_t
IScalar< typename UnaryReturn< T2, OpUnaryPlus >::Type_t > Type_t
IScalar< typename UnaryReturn< T2, OpUnaryPlus >::Type_t > Type_t
ILattice< typename UnaryReturn< T2, OpUnaryPlus >::Type_t, N > Type_t
IScalar< typename UnaryReturn< T2, OpUnaryPlus >::Type_t > Type_t
IScalar< typename BinaryReturn< T1, T2, FnInnerProduct >::Type_t > Type_t
ILattice< typename BinaryReturn< T1, T2, FnLocalInnerProduct >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpAddAssign >::Type_t, N > & Type_t
ILattice< typename BinaryReturn< T1, T2, OpAnd >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpBitwiseAndAssign >::Type_t, N > & Type_t
ILattice< typename BinaryReturn< T1, T2, OpBitwiseAnd >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpBitwiseOrAssign >::Type_t, N > & Type_t
ILattice< typename BinaryReturn< T1, T2, OpBitwiseOr >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpBitwiseXorAssign >::Type_t, N > & Type_t
ILattice< typename BinaryReturn< T1, T2, OpBitwiseXor >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpDivideAssign >::Type_t, N > & Type_t
ILattice< typename BinaryReturn< T1, T2, OpEQ >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpGE >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpGT >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpLE >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpLT >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpLeftShiftAssign >::Type_t, N > & Type_t
ILattice< typename BinaryReturn< T1, T2, OpLeftShift >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpModAssign >::Type_t, N > & Type_t
ILattice< typename BinaryReturn< T1, T2, OpMod >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpMultiplyAssign >::Type_t, N > & Type_t
ILattice< typename BinaryReturn< T1, T2, OpNE >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpOr >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpRightShiftAssign >::Type_t, N > & Type_t
ILattice< typename BinaryReturn< T1, T2, OpRightShift >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpSubtractAssign >::Type_t, N > & Type_t
ILattice< typename BinaryReturn< T1, T2, Op >::Type_t, N > Type_t
IScalar< typename BinaryReturn< T1, T2, FnInnerProduct >::Type_t > Type_t
ILattice< typename BinaryReturn< T1, T2, FnLocalInnerProduct >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpAddAssign >::Type_t, N > & Type_t
ILattice< typename BinaryReturn< T1, T2, OpAnd >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpBitwiseAndAssign >::Type_t, N > & Type_t
ILattice< typename BinaryReturn< T1, T2, OpBitwiseAnd >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpBitwiseOrAssign >::Type_t, N > & Type_t
ILattice< typename BinaryReturn< T1, T2, OpBitwiseOr >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpBitwiseXorAssign >::Type_t, N > & Type_t
ILattice< typename BinaryReturn< T1, T2, OpBitwiseXor >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpDivideAssign >::Type_t, N > & Type_t
ILattice< typename BinaryReturn< T1, T2, OpEQ >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpGE >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpGT >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpLE >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpLT >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpLeftShiftAssign >::Type_t, N > & Type_t
ILattice< typename BinaryReturn< T1, T2, OpLeftShift >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpModAssign >::Type_t, N > & Type_t
ILattice< typename BinaryReturn< T1, T2, OpMod >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpMultiplyAssign >::Type_t, N > & Type_t
ILattice< typename BinaryReturn< T1, T2, OpNE >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpOr >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpRightShiftAssign >::Type_t, N > & Type_t
ILattice< typename BinaryReturn< T1, T2, OpRightShift >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpSubtractAssign >::Type_t, N > & Type_t
ILattice< typename BinaryReturn< T1, T2, Op >::Type_t, N > Type_t
ILattice< typename UnaryReturn< T2, OpUnaryPlus >::Type_t, N > Type_t
ILattice< typename UnaryReturn< T2, OpUnaryPlus >::Type_t, N > Type_t
IScalar< typename BinaryReturn< T1, T2, FnInnerProduct >::Type_t > Type_t
ILattice< typename BinaryReturn< T1, T2, FnLocalInnerProduct >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpAnd >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpBitwiseAnd >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpBitwiseOr >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpBitwiseXor >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpEQ >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpGE >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpGT >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpLE >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpLT >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpLeftShift >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpMod >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpNE >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpOr >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, OpRightShift >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T1, T2, Op >::Type_t, N > Type_t
IScalar< typename BinaryReturn< T1, T2, FnInnerProduct >::Type_t > Type_t
IScalar< typename BinaryReturn< T1, T2, FnLocalColorInnerProduct >::Type_t > Type_t
IScalar< typename BinaryReturn< T1, T2, FnLocalInnerProduct >::Type_t > Type_t
IScalar< typename BinaryReturn< T1, T2, OpAddAssign >::Type_t > & Type_t
IScalar< typename BinaryReturn< T1, T2, OpAnd >::Type_t > Type_t
IScalar< typename BinaryReturn< T1, T2, OpBitwiseAndAssign >::Type_t > & Type_t
IScalar< typename BinaryReturn< T1, T2, OpBitwiseOrAssign >::Type_t > & Type_t
IScalar< typename BinaryReturn< T1, T2, OpBitwiseXorAssign >::Type_t > & Type_t
IScalar< typename BinaryReturn< T1, T2, OpDivideAssign >::Type_t > & Type_t
IScalar< typename BinaryReturn< T1, T2, OpEQ >::Type_t > Type_t
IScalar< typename BinaryReturn< T1, T2, OpGE >::Type_t > Type_t
IScalar< typename BinaryReturn< T1, T2, OpGT >::Type_t > Type_t
IScalar< typename BinaryReturn< T1, T2, OpLE >::Type_t > Type_t
IScalar< typename BinaryReturn< T1, T2, OpLT >::Type_t > Type_t
IScalar< typename BinaryReturn< T1, T2, OpLeftShiftAssign >::Type_t > & Type_t
IScalar< typename BinaryReturn< T1, T2, OpLeftShift >::Type_t > Type_t
IScalar< typename BinaryReturn< T1, T2, OpModAssign >::Type_t > & Type_t
IScalar< typename BinaryReturn< T1, T2, OpMultiplyAssign >::Type_t > & Type_t
IScalar< typename BinaryReturn< T1, T2, OpNE >::Type_t > Type_t
IScalar< typename BinaryReturn< T1, T2, OpOr >::Type_t > Type_t
IScalar< typename BinaryReturn< T1, T2, OpRightShiftAssign >::Type_t > & Type_t
IScalar< typename BinaryReturn< T1, T2, OpRightShift >::Type_t > Type_t
IScalar< typename BinaryReturn< T1, T2, OpSubtractAssign >::Type_t > & Type_t
IScalar< typename BinaryReturn< T1, T2, Op >::Type_t > Type_t
IScalar< typename UnaryReturn< T2, OpUnaryPlus >::Type_t > Type_t
IScalar< typename UnaryReturn< T2, OpUnaryPlus >::Type_t > Type_t
IScalar< typename UnaryReturn< T2, OpUnaryPlus >::Type_t > Type_t
IScalar< typename UnaryReturn< T2, OpUnaryPlus >::Type_t > Type_t
ILattice< typename DoublePrecType< T >::Type_t, N > Type_t
IScalar< typename DoublePrecType< T >::Type_t > Type_t
IScalar< typename InternalScalar< T >::Type_t > Type_t
IScalar< typename InternalScalar< T >::Type_t > Type_t
Construct simple word type used at some level within primitives.
IScalar< typename LatticeScalar< T >::Type_t > Type_t
IScalar< typename LatticeScalar< T >::Type_t > Type_t
Makes a lattice scalar leaving primitive indices alone.
ILattice< typename PrimitiveScalar< T >::Type_t, N > Type_t
IScalar< typename PrimitiveScalar< T >::Type_t > Type_t
Makes a primitive scalar leaving grid alone.
ILattice< typename RealScalar< T >::Type_t, N > Type_t
IScalar< typename RealScalar< T >::Type_t > Type_t
Construct simple word type used at some level within primitives.
ILattice< typename SinglePrecType< T >::Type_t, N > Type_t
IScalar< typename SinglePrecType< T >::Type_t > Type_t
ILattice< typename BinaryReturn< T2, T3, Op >::Type_t, N > Type_t
ILattice< typename TrinaryReturn< T1, T2, T3, FnWhere >::Type_t, N > Type_t
ILattice< typename TrinaryReturn< T1, T2, T3, FnWhere >::Type_t, N > Type_t
ILattice< typename TrinaryReturn< T1, T2, T3, FnColorContract >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T2, T3, Op >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T2, T3, Op >::Type_t, N > Type_t
ILattice< typename TrinaryReturn< T1, T2, T3, FnWhere >::Type_t, N > Type_t
ILattice< typename TrinaryReturn< T1, T2, T3, FnWhere >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T2, T3, Op >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T2, T3, Op >::Type_t, N > Type_t
ILattice< typename TrinaryReturn< T1, T2, T3, FnWhere >::Type_t, N > Type_t
ILattice< typename TrinaryReturn< T1, T2, T3, FnWhere >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T2, T3, Op >::Type_t, N > Type_t
ILattice< typename TrinaryReturn< T1, T2, T3, FnWhere >::Type_t, N > Type_t
ILattice< typename BinaryReturn< T2, T3, Op >::Type_t, N > Type_t
IScalar< typename TrinaryReturn< T1, T2, T3, FnColorContract >::Type_t > Type_t
IScalar< typename TrinaryReturn< T1, T2, T3, FnWhere >::Type_t > Type_t
IScalar< typename BinaryReturn< T2, T3, Op >::Type_t > Type_t
ILattice< typename UnaryReturn< T1, Op >::Type_t, N > Type_t
IScalar< typename UnaryReturn< T, FnGetSite >::Type_t > Type_t
IScalar< typename UnaryReturn< T, FnGlobalMax >::Type_t > Type_t
IScalar< typename UnaryReturn< T, FnGlobalMin >::Type_t > Type_t
ILattice< typename UnaryReturn< T, FnLocalNorm2 >::Type_t, N > Type_t
IScalar< typename UnaryReturn< T, FnNorm2 >::Type_t > Type_t
IScalar< typename UnaryReturn< T, FnPeekSite >::Type_t > Type_t
IScalar< typename UnaryReturn< T, FnSumMulti >::Type_t > Type_t
IScalar< typename UnaryReturn< T, FnSum >::Type_t > Type_t
ILattice< typename UnaryReturn< T, OpNot >::Type_t, N > Type_t
IScalar< typename UnaryReturn< T1, Op >::Type_t > Type_t
IScalar< typename UnaryReturn< T, FnGetSite >::Type_t > Type_t
IScalar< typename UnaryReturn< T, FnGlobalMax >::Type_t > Type_t
IScalar< typename UnaryReturn< T, FnGlobalMin >::Type_t > Type_t
IScalar< typename UnaryReturn< T, FnLocalNorm2 >::Type_t > Type_t
IScalar< typename UnaryReturn< T, FnNorm2 >::Type_t > Type_t
IScalar< typename UnaryReturn< T, FnPeekSite >::Type_t > Type_t
IScalar< typename UnaryReturn< T, FnSumMulti >::Type_t > Type_t
IScalar< typename UnaryReturn< T, FnSum >::Type_t > Type_t
IScalar< typename UnaryReturn< T, OpNot >::Type_t > Type_t
WordType< T >::Type_t Type_t
WordType< T >::Type_t Type_t
Find the underlying word type of a field.