[80] | 1 | /*************************************************************************** |
---|
| 2 | * blitz/array/indirect.h Array indirection |
---|
| 3 | * |
---|
| 4 | * Copyright (C) 1997-2001 Todd Veldhuizen <tveldhui@oonumerics.org> |
---|
| 5 | * |
---|
| 6 | * This program is free software; you can redistribute it and/or |
---|
| 7 | * modify it under the terms of the GNU General Public License |
---|
| 8 | * as published by the Free Software Foundation; either version 2 |
---|
| 9 | * of the License, or (at your option) any later version. |
---|
| 10 | * |
---|
| 11 | * This program is distributed in the hope that it will be useful, |
---|
| 12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
---|
| 13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
---|
| 14 | * GNU General Public License for more details. |
---|
| 15 | * |
---|
| 16 | * Suggestions: blitz-dev@oonumerics.org |
---|
| 17 | * Bugs: blitz-bugs@oonumerics.org |
---|
| 18 | * |
---|
| 19 | * For more information, please see the Blitz++ Home Page: |
---|
| 20 | * http://oonumerics.org/blitz/ |
---|
| 21 | * |
---|
| 22 | ****************************************************************************/ |
---|
| 23 | |
---|
| 24 | #ifndef BZ_ARRAY_INDIRECT_H |
---|
| 25 | #define BZ_ARRAY_INDIRECT_H |
---|
| 26 | |
---|
| 27 | #include <blitz/array/asexpr.h> |
---|
| 28 | #include <blitz/array/cartesian.h> |
---|
| 29 | |
---|
| 30 | BZ_NAMESPACE(blitz) |
---|
| 31 | |
---|
| 32 | template<typename T_array, typename T_index> |
---|
| 33 | class IndirectArray { |
---|
| 34 | |
---|
| 35 | public: |
---|
| 36 | IndirectArray(T_array& array, T_index& index) |
---|
| 37 | : array_(array), index_(index) |
---|
| 38 | { } |
---|
| 39 | |
---|
| 40 | template<typename T_expr> |
---|
| 41 | void operator=(T_expr expr); |
---|
| 42 | |
---|
| 43 | protected: |
---|
| 44 | T_array& array_; |
---|
| 45 | T_index& index_; |
---|
| 46 | }; |
---|
| 47 | |
---|
| 48 | // Forward declarations |
---|
| 49 | template<typename T_array, typename T_arrayiter, typename T_subdomain, typename T_expr> |
---|
| 50 | inline void applyOverSubdomain(const T_array& array, T_arrayiter& arrayIter, |
---|
| 51 | T_subdomain subdomain, T_expr expr); |
---|
| 52 | template<typename T_array, typename T_arrayiter, int N_rank, typename T_expr> |
---|
| 53 | inline void applyOverSubdomain(const T_array& array, T_arrayiter& arrayIter, |
---|
| 54 | RectDomain<N_rank> subdomain, |
---|
| 55 | T_expr expr); |
---|
| 56 | |
---|
| 57 | template<typename T_array, typename T_index> template<typename T_rhs> |
---|
| 58 | void IndirectArray<T_array, T_index>::operator=(T_rhs rhs) |
---|
| 59 | { |
---|
| 60 | typedef _bz_typename asExpr<T_rhs>::T_expr T_expr; |
---|
| 61 | T_expr expr(rhs); |
---|
| 62 | |
---|
| 63 | _bz_typename T_array::T_iterator arrayIter(array_); |
---|
| 64 | |
---|
| 65 | _bz_typename T_index::iterator iter = index_.begin(), |
---|
| 66 | end = index_.end(); |
---|
| 67 | |
---|
| 68 | for (; iter != end; ++iter) |
---|
| 69 | { |
---|
| 70 | _bz_typename T_index::value_type subdomain = *iter; |
---|
| 71 | applyOverSubdomain(array_, arrayIter, subdomain, expr); |
---|
| 72 | } |
---|
| 73 | } |
---|
| 74 | |
---|
| 75 | template<typename T_array, typename T_arrayiter, typename T_subdomain, typename T_expr> |
---|
| 76 | inline void applyOverSubdomain(const T_array& BZ_DEBUG_PARAM(array), T_arrayiter& arrayIter, |
---|
| 77 | T_subdomain subdomain, T_expr expr) |
---|
| 78 | { |
---|
| 79 | BZPRECHECK(array.isInRange(subdomain), |
---|
| 80 | "In indirection using an STL container of TinyVector<int," |
---|
| 81 | << array.rank() << ">, one of the" << endl << "positions is out of" |
---|
| 82 | " range: " << endl << subdomain << endl |
---|
| 83 | << "Array lower bounds: " << array.lbound() << endl |
---|
| 84 | << "Array upper bounds: " << array.ubound() << endl) |
---|
| 85 | |
---|
| 86 | arrayIter.moveTo(subdomain); |
---|
| 87 | expr.moveTo(subdomain); |
---|
| 88 | |
---|
| 89 | *const_cast<_bz_typename T_arrayiter::T_numtype*>(arrayIter.data()) = *expr; |
---|
| 90 | } |
---|
| 91 | |
---|
| 92 | // Specialization for RectDomain<N> |
---|
| 93 | template<typename T_array, typename T_arrayiter, int N_rank, typename T_expr> |
---|
| 94 | inline void applyOverSubdomain(const T_array& BZ_DEBUG_PARAM(array), T_arrayiter& arrayIter, |
---|
| 95 | RectDomain<N_rank> subdomain, |
---|
| 96 | T_expr expr) |
---|
| 97 | { |
---|
| 98 | typedef _bz_typename T_array::T_numtype T_numtype; |
---|
| 99 | |
---|
| 100 | // Assume that the RectDomain<N_rank> is a 1-D strip. |
---|
| 101 | // Find the dimension in which the strip is oriented. This |
---|
| 102 | // variable is static so that we cache the value; likely to be |
---|
| 103 | // the same for all strips within a container. |
---|
| 104 | |
---|
| 105 | static int stripDim = 0; |
---|
| 106 | |
---|
| 107 | if (subdomain.lbound(stripDim) == subdomain.ubound(stripDim)) |
---|
| 108 | { |
---|
| 109 | // Cached value was wrong, find the correct value of stripDim |
---|
| 110 | for (stripDim=0; stripDim < N_rank; ++stripDim) |
---|
| 111 | if (subdomain.lbound(stripDim) != subdomain.ubound(stripDim)) |
---|
| 112 | break; |
---|
| 113 | |
---|
| 114 | // Handle case where the strip is just a single point |
---|
| 115 | if (stripDim == N_rank) |
---|
| 116 | stripDim = 0; |
---|
| 117 | } |
---|
| 118 | |
---|
| 119 | #ifdef BZ_DEBUG |
---|
| 120 | // Check that this is in fact a 1D strip |
---|
| 121 | for (int i=0; i < N_rank; ++i) |
---|
| 122 | if ((i != stripDim) && (subdomain.lbound(i) != subdomain.ubound(i))) |
---|
| 123 | BZPRECHECK(0, "In indirection using an STL container of RectDomain<" |
---|
| 124 | << N_rank << ">, one of" << endl << "the RectDomain objects was not" |
---|
| 125 | " a one-dimensional strip:" << endl << "RectDomain<" << N_rank |
---|
| 126 | << ">::lbound() = " << subdomain.lbound() << endl |
---|
| 127 | << "RectDomain<" << N_rank << ">::ubound() = " << subdomain.ubound()) |
---|
| 128 | #endif |
---|
| 129 | |
---|
| 130 | // Check that the start and end position are in range |
---|
| 131 | BZPRECHECK(array.isInRange(subdomain.lbound()), |
---|
| 132 | "In indirection using an STL container of RectDomain<" |
---|
| 133 | << N_rank << ">, one of" << endl << "the RectDomain objects has a" |
---|
| 134 | " lbound which is out of range:" << endl |
---|
| 135 | << subdomain.lbound() << endl |
---|
| 136 | << "Array lower bounds: " << array.lbound() << endl |
---|
| 137 | << "Array upper bounds: " << array.ubound() << endl) |
---|
| 138 | |
---|
| 139 | BZPRECHECK(array.isInRange(subdomain.ubound()), |
---|
| 140 | "In indirection using an STL container of RectDomain<" |
---|
| 141 | << N_rank << ">, one of" << endl << "the RectDomain objects has a" |
---|
| 142 | " ubound which is out of range:" << endl |
---|
| 143 | << subdomain.lbound() << endl |
---|
| 144 | << "Array lower bounds: " << array.lbound() << endl |
---|
| 145 | << "Array upper bounds: " << array.ubound() << endl) |
---|
| 146 | |
---|
| 147 | // Position at the beginning of the strip |
---|
| 148 | arrayIter.moveTo(subdomain.lbound()); |
---|
| 149 | expr.moveTo(subdomain.lbound()); |
---|
| 150 | |
---|
| 151 | // Loop through the strip |
---|
| 152 | |
---|
| 153 | #ifdef BZ_USE_FAST_READ_ARRAY_EXPR |
---|
| 154 | |
---|
| 155 | bool useUnitStride = arrayIter.isUnitStride(stripDim) |
---|
| 156 | && expr.isUnitStride(stripDim); |
---|
| 157 | |
---|
| 158 | int lbound = subdomain.lbound(stripDim); |
---|
| 159 | int ubound = subdomain.ubound(stripDim); |
---|
| 160 | |
---|
| 161 | if (useUnitStride) |
---|
| 162 | { |
---|
| 163 | T_numtype* restrict data = const_cast<T_numtype*>(arrayIter.data()); |
---|
| 164 | |
---|
| 165 | int length = ubound - lbound + 1; |
---|
| 166 | for (int i=0; i < length; ++i) |
---|
| 167 | *data++ = expr.fastRead(i); |
---|
| 168 | } |
---|
| 169 | else { |
---|
| 170 | #endif |
---|
| 171 | |
---|
| 172 | arrayIter.loadStride(stripDim); |
---|
| 173 | expr.loadStride(stripDim); |
---|
| 174 | |
---|
| 175 | for (int i=lbound; i <= ubound; ++i) |
---|
| 176 | { |
---|
| 177 | *const_cast<_bz_typename T_arrayiter::T_numtype*>(arrayIter.data()) |
---|
| 178 | = *expr; |
---|
| 179 | expr.advance(); |
---|
| 180 | arrayIter.advance(); |
---|
| 181 | } |
---|
| 182 | |
---|
| 183 | #ifdef BZ_USE_FAST_READ_ARRAY_EXPR |
---|
| 184 | } |
---|
| 185 | #endif |
---|
| 186 | } |
---|
| 187 | |
---|
| 188 | // Global functions for cartesian product of index sets |
---|
| 189 | template<typename T_container> |
---|
| 190 | CartesianProduct<TinyVector<int,2>,T_container,2> |
---|
| 191 | indexSet(const T_container& container0, const T_container& container1) |
---|
| 192 | { |
---|
| 193 | return CartesianProduct<TinyVector<int,2>,T_container,2>( |
---|
| 194 | const_cast<T_container&>(container0), |
---|
| 195 | const_cast<T_container&>(container1)); |
---|
| 196 | } |
---|
| 197 | |
---|
| 198 | template<typename T_container> |
---|
| 199 | CartesianProduct<TinyVector<int,3>,T_container,3> |
---|
| 200 | indexSet(const T_container& container0, const T_container& container1, |
---|
| 201 | const T_container& container2) |
---|
| 202 | { |
---|
| 203 | return CartesianProduct<TinyVector<int,3>,T_container,3>( |
---|
| 204 | const_cast<T_container&>(container0), |
---|
| 205 | const_cast<T_container&>(container1), |
---|
| 206 | const_cast<T_container&>(container2)); |
---|
| 207 | } |
---|
| 208 | |
---|
| 209 | template<typename T_container> |
---|
| 210 | CartesianProduct<TinyVector<int,4>,T_container,4> |
---|
| 211 | indexSet(const T_container& container0, const T_container& container1, |
---|
| 212 | const T_container& container2, const T_container& container3) |
---|
| 213 | { |
---|
| 214 | return CartesianProduct<TinyVector<int,4>,T_container,4>( |
---|
| 215 | const_cast<T_container&>(container0), |
---|
| 216 | const_cast<T_container&>(container1), |
---|
| 217 | const_cast<T_container&>(container2), |
---|
| 218 | const_cast<T_container&>(container3)); |
---|
| 219 | } |
---|
| 220 | |
---|
| 221 | template<typename T_container> |
---|
| 222 | CartesianProduct<TinyVector<int,5>,T_container,5> |
---|
| 223 | indexSet(const T_container& container0, const T_container& container1, |
---|
| 224 | const T_container& container2, const T_container& container3, |
---|
| 225 | const T_container& container4) |
---|
| 226 | { |
---|
| 227 | return CartesianProduct<TinyVector<int,5>,T_container,5>( |
---|
| 228 | const_cast<T_container&>(container0), |
---|
| 229 | const_cast<T_container&>(container1), |
---|
| 230 | const_cast<T_container&>(container2), |
---|
| 231 | const_cast<T_container&>(container3), |
---|
| 232 | const_cast<T_container&>(container4)); |
---|
| 233 | } |
---|
| 234 | |
---|
| 235 | template<typename T_container> |
---|
| 236 | CartesianProduct<TinyVector<int,6>,T_container,6> |
---|
| 237 | indexSet(const T_container& container0, const T_container& container1, |
---|
| 238 | const T_container& container2, const T_container& container3, |
---|
| 239 | const T_container& container4, const T_container& container5) |
---|
| 240 | { |
---|
| 241 | return CartesianProduct<TinyVector<int,6>,T_container,6>( |
---|
| 242 | const_cast<T_container&>(container0), |
---|
| 243 | const_cast<T_container&>(container1), |
---|
| 244 | const_cast<T_container&>(container2), |
---|
| 245 | const_cast<T_container&>(container3), |
---|
| 246 | const_cast<T_container&>(container4), |
---|
| 247 | const_cast<T_container&>(container5)); |
---|
| 248 | } |
---|
| 249 | |
---|
| 250 | template<typename T_container> |
---|
| 251 | CartesianProduct<TinyVector<int,7>,T_container,7> |
---|
| 252 | indexSet(const T_container& container0, const T_container& container1, |
---|
| 253 | const T_container& container2, const T_container& container3, |
---|
| 254 | const T_container& container4, const T_container& container5, |
---|
| 255 | const T_container& container6) |
---|
| 256 | { |
---|
| 257 | return CartesianProduct<TinyVector<int,7>,T_container,7>( |
---|
| 258 | const_cast<T_container&>(container0), |
---|
| 259 | const_cast<T_container&>(container1), |
---|
| 260 | const_cast<T_container&>(container2), |
---|
| 261 | const_cast<T_container&>(container3), |
---|
| 262 | const_cast<T_container&>(container4), |
---|
| 263 | const_cast<T_container&>(container5), |
---|
| 264 | const_cast<T_container&>(container6)); |
---|
| 265 | } |
---|
| 266 | |
---|
| 267 | template<typename T_container> |
---|
| 268 | CartesianProduct<TinyVector<int,8>,T_container,8> |
---|
| 269 | indexSet(const T_container& container0, const T_container& container1, |
---|
| 270 | const T_container& container2, const T_container& container3, |
---|
| 271 | const T_container& container4, const T_container& container5, |
---|
| 272 | const T_container& container6, const T_container& container7) |
---|
| 273 | { |
---|
| 274 | return CartesianProduct<TinyVector<int,8>,T_container,8>( |
---|
| 275 | const_cast<T_container&>(container0), |
---|
| 276 | const_cast<T_container&>(container1), |
---|
| 277 | const_cast<T_container&>(container2), |
---|
| 278 | const_cast<T_container&>(container3), |
---|
| 279 | const_cast<T_container&>(container4), |
---|
| 280 | const_cast<T_container&>(container5), |
---|
| 281 | const_cast<T_container&>(container6), |
---|
| 282 | const_cast<T_container&>(container7)); |
---|
| 283 | } |
---|
| 284 | |
---|
| 285 | template<typename T_container> |
---|
| 286 | CartesianProduct<TinyVector<int,9>,T_container,9> |
---|
| 287 | indexSet(const T_container& container0, const T_container& container1, |
---|
| 288 | const T_container& container2, const T_container& container3, |
---|
| 289 | const T_container& container4, const T_container& container5, |
---|
| 290 | const T_container& container6, const T_container& container7, |
---|
| 291 | const T_container& container8) |
---|
| 292 | { |
---|
| 293 | return CartesianProduct<TinyVector<int,9>,T_container,9>( |
---|
| 294 | const_cast<T_container&>(container0), |
---|
| 295 | const_cast<T_container&>(container1), |
---|
| 296 | const_cast<T_container&>(container2), |
---|
| 297 | const_cast<T_container&>(container3), |
---|
| 298 | const_cast<T_container&>(container4), |
---|
| 299 | const_cast<T_container&>(container5), |
---|
| 300 | const_cast<T_container&>(container6), |
---|
| 301 | const_cast<T_container&>(container7), |
---|
| 302 | const_cast<T_container&>(container8)); |
---|
| 303 | } |
---|
| 304 | |
---|
| 305 | template<typename T_container> |
---|
| 306 | CartesianProduct<TinyVector<int,10>,T_container,10> |
---|
| 307 | indexSet(const T_container& container0, const T_container& container1, |
---|
| 308 | const T_container& container2, const T_container& container3, |
---|
| 309 | const T_container& container4, const T_container& container5, |
---|
| 310 | const T_container& container6, const T_container& container7, |
---|
| 311 | const T_container& container8, const T_container& container9) |
---|
| 312 | { |
---|
| 313 | return CartesianProduct<TinyVector<int,10>,T_container,10>( |
---|
| 314 | const_cast<T_container&>(container0), |
---|
| 315 | const_cast<T_container&>(container1), |
---|
| 316 | const_cast<T_container&>(container2), |
---|
| 317 | const_cast<T_container&>(container3), |
---|
| 318 | const_cast<T_container&>(container4), |
---|
| 319 | const_cast<T_container&>(container5), |
---|
| 320 | const_cast<T_container&>(container6), |
---|
| 321 | const_cast<T_container&>(container7), |
---|
| 322 | const_cast<T_container&>(container8), |
---|
| 323 | const_cast<T_container&>(container9)); |
---|
| 324 | } |
---|
| 325 | |
---|
| 326 | template<typename T_container> |
---|
| 327 | CartesianProduct<TinyVector<int,11>,T_container,11> |
---|
| 328 | indexSet(const T_container& container0, const T_container& container1, |
---|
| 329 | const T_container& container2, const T_container& container3, |
---|
| 330 | const T_container& container4, const T_container& container5, |
---|
| 331 | const T_container& container6, const T_container& container7, |
---|
| 332 | const T_container& container8, const T_container& container9, |
---|
| 333 | const T_container& container10) |
---|
| 334 | { |
---|
| 335 | return CartesianProduct<TinyVector<int,11>,T_container,11>( |
---|
| 336 | const_cast<T_container&>(container0), |
---|
| 337 | const_cast<T_container&>(container1), |
---|
| 338 | const_cast<T_container&>(container2), |
---|
| 339 | const_cast<T_container&>(container3), |
---|
| 340 | const_cast<T_container&>(container4), |
---|
| 341 | const_cast<T_container&>(container5), |
---|
| 342 | const_cast<T_container&>(container6), |
---|
| 343 | const_cast<T_container&>(container7), |
---|
| 344 | const_cast<T_container&>(container8), |
---|
| 345 | const_cast<T_container&>(container9), |
---|
| 346 | const_cast<T_container&>(container10)); |
---|
| 347 | } |
---|
| 348 | |
---|
| 349 | // Mixture of singletons and containers, e.g. A[indexSet(I,3,K)] |
---|
| 350 | |
---|
| 351 | // cp_findContainerType<T1,T2,T3,...,Tn>::T_container |
---|
| 352 | // The set of parameters T1, T2, T3, ... Tn is a mixture of |
---|
| 353 | // int and T_container. This traits class finds the container |
---|
| 354 | // type, and sets T_container. |
---|
| 355 | // |
---|
| 356 | // e.g. cp_findContainerType<int,int,list<int>,int>::T_container is list<int> |
---|
| 357 | // cp_findContainerType<int,deque<int>,deque<int>>::T_container |
---|
| 358 | // is deque<int> |
---|
| 359 | |
---|
| 360 | template<typename T1, typename T2, typename T3=int, typename T4=int, |
---|
| 361 | typename T5=int, typename T6=int, typename T7=int, typename T8=int, |
---|
| 362 | typename T9=int, typename T10=int, typename T11=int> |
---|
| 363 | struct cp_findContainerType { |
---|
| 364 | typedef T1 T_container; |
---|
| 365 | }; |
---|
| 366 | |
---|
| 367 | template<typename T2, typename T3, typename T4, typename T5, typename T6, |
---|
| 368 | typename T7, typename T8, typename T9, typename T10, typename T11> |
---|
| 369 | struct cp_findContainerType<int,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11> { |
---|
| 370 | typedef _bz_typename |
---|
| 371 | cp_findContainerType<T2,T3,T4,T5,T6,T7,T8,T9,T10,T11>::T_container |
---|
| 372 | T_container; |
---|
| 373 | }; |
---|
| 374 | |
---|
| 375 | |
---|
| 376 | // The cp_traits class handles promotion of singleton integers to |
---|
| 377 | // containers. It takes two template parameters: |
---|
| 378 | // T = argument type |
---|
| 379 | // T2 = container type |
---|
| 380 | // If T is an integer, then a container of type T2 is created and the |
---|
| 381 | // integer is inserted. This container is returned. |
---|
| 382 | // Otherwise, T is assumed to be the same type as T2, and the original |
---|
| 383 | // container is returned. |
---|
| 384 | |
---|
| 385 | template<typename T, typename T2> |
---|
| 386 | struct cp_traits { |
---|
| 387 | typedef T T_container; |
---|
| 388 | |
---|
| 389 | static const T_container& make(const T& x) |
---|
| 390 | { return x; } |
---|
| 391 | }; |
---|
| 392 | |
---|
| 393 | template<typename T2> |
---|
| 394 | struct cp_traits<int,T2> { |
---|
| 395 | typedef T2 T_container; |
---|
| 396 | |
---|
| 397 | static T2 make(int x) |
---|
| 398 | { |
---|
| 399 | T2 singleton; |
---|
| 400 | singleton.push_back(x); |
---|
| 401 | return singleton; |
---|
| 402 | } |
---|
| 403 | }; |
---|
| 404 | |
---|
| 405 | // These versions of indexSet() allow mixtures of integer |
---|
| 406 | // and container arguments. At least one integer must be |
---|
| 407 | // specified. |
---|
| 408 | |
---|
| 409 | template<typename T1, typename T2> |
---|
| 410 | CartesianProduct<TinyVector<int,2>, _bz_typename |
---|
| 411 | cp_findContainerType<T1,T2>::T_container,2> |
---|
| 412 | indexSet(const T1& c1, const T2& c2) |
---|
| 413 | { |
---|
| 414 | typedef _bz_typename cp_findContainerType<T1,T2>::T_container |
---|
| 415 | T_container; |
---|
| 416 | |
---|
| 417 | return CartesianProduct<TinyVector<int,2>, T_container, 2>( |
---|
| 418 | cp_traits<T1,T_container>::make(c1), |
---|
| 419 | cp_traits<T2,T_container>::make(c2)); |
---|
| 420 | } |
---|
| 421 | |
---|
| 422 | template<typename T1, typename T2, typename T3> |
---|
| 423 | CartesianProduct<TinyVector<int,3>, _bz_typename |
---|
| 424 | cp_findContainerType<T1,T2,T3>::T_container, 3> |
---|
| 425 | indexSet(const T1& c1, const T2& c2, const T3& c3) |
---|
| 426 | { |
---|
| 427 | typedef _bz_typename cp_findContainerType<T1,T2,T3>::T_container |
---|
| 428 | T_container; |
---|
| 429 | |
---|
| 430 | return CartesianProduct<TinyVector<int,3>, T_container, 3>( |
---|
| 431 | cp_traits<T1,T_container>::make(c1), |
---|
| 432 | cp_traits<T2,T_container>::make(c2), |
---|
| 433 | cp_traits<T3,T_container>::make(c3)); |
---|
| 434 | } |
---|
| 435 | |
---|
| 436 | template<typename T1, typename T2, typename T3, typename T4> |
---|
| 437 | CartesianProduct<TinyVector<int,4>, _bz_typename |
---|
| 438 | cp_findContainerType<T1,T2,T3,T4>::T_container, 4> |
---|
| 439 | indexSet(const T1& c1, const T2& c2, const T3& c3, const T4& c4) |
---|
| 440 | { |
---|
| 441 | typedef _bz_typename cp_findContainerType<T1,T2,T3,T4>::T_container |
---|
| 442 | T_container; |
---|
| 443 | |
---|
| 444 | return CartesianProduct<TinyVector<int,4>, T_container, 4>( |
---|
| 445 | cp_traits<T1,T_container>::make(c1), |
---|
| 446 | cp_traits<T2,T_container>::make(c2), |
---|
| 447 | cp_traits<T3,T_container>::make(c3), |
---|
| 448 | cp_traits<T4,T_container>::make(c4)); |
---|
| 449 | } |
---|
| 450 | |
---|
| 451 | template<typename T1, typename T2, typename T3, typename T4, typename T5> |
---|
| 452 | CartesianProduct<TinyVector<int,5>, _bz_typename |
---|
| 453 | cp_findContainerType<T1,T2,T3,T4,T5>::T_container, 5> |
---|
| 454 | indexSet(const T1& c1, const T2& c2, const T3& c3, const T4& c4, const T5& c5) |
---|
| 455 | { |
---|
| 456 | typedef _bz_typename cp_findContainerType<T1,T2,T3,T4,T5>::T_container |
---|
| 457 | T_container; |
---|
| 458 | |
---|
| 459 | return CartesianProduct<TinyVector<int,5>, T_container, 5>( |
---|
| 460 | cp_traits<T1,T_container>::make(c1), |
---|
| 461 | cp_traits<T2,T_container>::make(c2), |
---|
| 462 | cp_traits<T3,T_container>::make(c3), |
---|
| 463 | cp_traits<T4,T_container>::make(c4), |
---|
| 464 | cp_traits<T5,T_container>::make(c5)); |
---|
| 465 | } |
---|
| 466 | |
---|
| 467 | template<typename T1, typename T2, typename T3, typename T4, typename T5, |
---|
| 468 | typename T6> |
---|
| 469 | CartesianProduct<TinyVector<int,6>, _bz_typename |
---|
| 470 | cp_findContainerType<T1,T2,T3,T4,T5,T6>::T_container, 6> |
---|
| 471 | indexSet(const T1& c1, const T2& c2, const T3& c3, const T4& c4, const T5& c5, |
---|
| 472 | const T6& c6) |
---|
| 473 | { |
---|
| 474 | typedef _bz_typename cp_findContainerType<T1,T2,T3,T4,T5,T6>::T_container |
---|
| 475 | T_container; |
---|
| 476 | |
---|
| 477 | return CartesianProduct<TinyVector<int,6>, T_container, 6>( |
---|
| 478 | cp_traits<T1,T_container>::make(c1), |
---|
| 479 | cp_traits<T2,T_container>::make(c2), |
---|
| 480 | cp_traits<T3,T_container>::make(c3), |
---|
| 481 | cp_traits<T4,T_container>::make(c4), |
---|
| 482 | cp_traits<T5,T_container>::make(c5), |
---|
| 483 | cp_traits<T6,T_container>::make(c6)); |
---|
| 484 | } |
---|
| 485 | |
---|
| 486 | template<typename T1, typename T2, typename T3, typename T4, typename T5, |
---|
| 487 | typename T6, typename T7> |
---|
| 488 | CartesianProduct<TinyVector<int,7>, _bz_typename |
---|
| 489 | cp_findContainerType<T1,T2,T3,T4,T5,T6,T7>::T_container, 7> |
---|
| 490 | indexSet(const T1& c1, const T2& c2, const T3& c3, const T4& c4, const T5& c5, |
---|
| 491 | const T6& c6, const T7& c7) |
---|
| 492 | { |
---|
| 493 | typedef _bz_typename |
---|
| 494 | cp_findContainerType<T1,T2,T3,T4,T5,T6,T7>::T_container |
---|
| 495 | T_container; |
---|
| 496 | |
---|
| 497 | return CartesianProduct<TinyVector<int,7>, T_container, 7>( |
---|
| 498 | cp_traits<T1,T_container>::make(c1), |
---|
| 499 | cp_traits<T2,T_container>::make(c2), |
---|
| 500 | cp_traits<T3,T_container>::make(c3), |
---|
| 501 | cp_traits<T4,T_container>::make(c4), |
---|
| 502 | cp_traits<T5,T_container>::make(c5), |
---|
| 503 | cp_traits<T6,T_container>::make(c6), |
---|
| 504 | cp_traits<T7,T_container>::make(c7)); |
---|
| 505 | } |
---|
| 506 | |
---|
| 507 | template<typename T1, typename T2, typename T3, typename T4, typename T5, |
---|
| 508 | typename T6, typename T7, typename T8> |
---|
| 509 | CartesianProduct<TinyVector<int,8>, _bz_typename |
---|
| 510 | cp_findContainerType<T1,T2,T3,T4,T5,T6,T7,T8>::T_container, 8> |
---|
| 511 | indexSet(const T1& c1, const T2& c2, const T3& c3, const T4& c4, const T5& c5, |
---|
| 512 | const T6& c6, const T7& c7, const T8& c8) |
---|
| 513 | { |
---|
| 514 | typedef _bz_typename |
---|
| 515 | cp_findContainerType<T1,T2,T3,T4,T5,T6,T7,T8>::T_container |
---|
| 516 | T_container; |
---|
| 517 | |
---|
| 518 | return CartesianProduct<TinyVector<int,8>, T_container, 8>( |
---|
| 519 | cp_traits<T1,T_container>::make(c1), |
---|
| 520 | cp_traits<T2,T_container>::make(c2), |
---|
| 521 | cp_traits<T3,T_container>::make(c3), |
---|
| 522 | cp_traits<T4,T_container>::make(c4), |
---|
| 523 | cp_traits<T5,T_container>::make(c5), |
---|
| 524 | cp_traits<T6,T_container>::make(c6), |
---|
| 525 | cp_traits<T7,T_container>::make(c7), |
---|
| 526 | cp_traits<T8,T_container>::make(c8)); |
---|
| 527 | } |
---|
| 528 | |
---|
| 529 | template<typename T1, typename T2, typename T3, typename T4, typename T5, |
---|
| 530 | typename T6, typename T7, typename T8, typename T9> |
---|
| 531 | CartesianProduct<TinyVector<int,9>, _bz_typename |
---|
| 532 | cp_findContainerType<T1,T2,T3,T4,T5,T6,T7,T8,T9>::T_container, 9> |
---|
| 533 | indexSet(const T1& c1, const T2& c2, const T3& c3, const T4& c4, const T5& c5, |
---|
| 534 | const T6& c6, const T7& c7, const T8& c8, const T9& c9) |
---|
| 535 | { |
---|
| 536 | typedef _bz_typename |
---|
| 537 | cp_findContainerType<T1,T2,T3,T4,T5,T6,T7,T8,T9>::T_container |
---|
| 538 | T_container; |
---|
| 539 | |
---|
| 540 | return CartesianProduct<TinyVector<int,9>, T_container, 9>( |
---|
| 541 | cp_traits<T1,T_container>::make(c1), |
---|
| 542 | cp_traits<T2,T_container>::make(c2), |
---|
| 543 | cp_traits<T3,T_container>::make(c3), |
---|
| 544 | cp_traits<T4,T_container>::make(c4), |
---|
| 545 | cp_traits<T5,T_container>::make(c5), |
---|
| 546 | cp_traits<T6,T_container>::make(c6), |
---|
| 547 | cp_traits<T7,T_container>::make(c7), |
---|
| 548 | cp_traits<T8,T_container>::make(c8), |
---|
| 549 | cp_traits<T9,T_container>::make(c9)); |
---|
| 550 | } |
---|
| 551 | |
---|
| 552 | template<typename T1, typename T2, typename T3, typename T4, typename T5, |
---|
| 553 | typename T6, typename T7, typename T8, typename T9, typename T10> |
---|
| 554 | CartesianProduct<TinyVector<int,10>, _bz_typename |
---|
| 555 | cp_findContainerType<T1,T2,T3,T4,T5,T6,T7,T8,T9,T10>::T_container, 10> |
---|
| 556 | indexSet(const T1& c1, const T2& c2, const T3& c3, const T4& c4, const T5& c5, |
---|
| 557 | const T6& c6, const T7& c7, const T8& c8, const T9& c9, const T10& c10) |
---|
| 558 | { |
---|
| 559 | typedef _bz_typename |
---|
| 560 | cp_findContainerType<T1,T2,T3,T4,T5,T6,T7,T8,T9,T10>::T_container |
---|
| 561 | T_container; |
---|
| 562 | |
---|
| 563 | return CartesianProduct<TinyVector<int,10>, T_container, 10>( |
---|
| 564 | cp_traits<T1,T_container>::make(c1), |
---|
| 565 | cp_traits<T2,T_container>::make(c2), |
---|
| 566 | cp_traits<T3,T_container>::make(c3), |
---|
| 567 | cp_traits<T4,T_container>::make(c4), |
---|
| 568 | cp_traits<T5,T_container>::make(c5), |
---|
| 569 | cp_traits<T6,T_container>::make(c6), |
---|
| 570 | cp_traits<T7,T_container>::make(c7), |
---|
| 571 | cp_traits<T8,T_container>::make(c8), |
---|
| 572 | cp_traits<T9,T_container>::make(c9), |
---|
| 573 | cp_traits<T10,T_container>::make(c10)); |
---|
| 574 | } |
---|
| 575 | |
---|
| 576 | template<typename T1, typename T2, typename T3, typename T4, typename T5, |
---|
| 577 | typename T6, typename T7, typename T8, typename T9, typename T10, |
---|
| 578 | typename T11> |
---|
| 579 | CartesianProduct<TinyVector<int,11>, _bz_typename |
---|
| 580 | cp_findContainerType<T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11>::T_container, 11> |
---|
| 581 | indexSet(const T1& c1, const T2& c2, const T3& c3, const T4& c4, const T5& c5, |
---|
| 582 | const T6& c6, const T7& c7, const T8& c8, const T9& c9, const T10& c10, |
---|
| 583 | const T11& c11) |
---|
| 584 | { |
---|
| 585 | typedef _bz_typename |
---|
| 586 | cp_findContainerType<T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11>::T_container |
---|
| 587 | T_container; |
---|
| 588 | |
---|
| 589 | return CartesianProduct<TinyVector<int,11>, T_container, 11>( |
---|
| 590 | cp_traits<T1,T_container>::make(c1), |
---|
| 591 | cp_traits<T2,T_container>::make(c2), |
---|
| 592 | cp_traits<T3,T_container>::make(c3), |
---|
| 593 | cp_traits<T4,T_container>::make(c4), |
---|
| 594 | cp_traits<T5,T_container>::make(c5), |
---|
| 595 | cp_traits<T6,T_container>::make(c6), |
---|
| 596 | cp_traits<T7,T_container>::make(c7), |
---|
| 597 | cp_traits<T8,T_container>::make(c8), |
---|
| 598 | cp_traits<T9,T_container>::make(c9), |
---|
| 599 | cp_traits<T10,T_container>::make(c10), |
---|
| 600 | cp_traits<T11,T_container>::make(c11)); |
---|
| 601 | } |
---|
| 602 | |
---|
| 603 | BZ_NAMESPACE_END |
---|
| 604 | |
---|
| 605 | #endif // BZ_ARRAY_INDIRECT_H |
---|