-
Notifications
You must be signed in to change notification settings - Fork 36
Expand file tree
/
Copy pathVector.h
More file actions
816 lines (725 loc) · 28.9 KB
/
Copy pathVector.h
File metadata and controls
816 lines (725 loc) · 28.9 KB
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
// -*- c++ -*-
/*
* Copyright (c) 2010-2012, Jim Bosch
* All rights reserved.
*
* ndarray is distributed under a simple BSD-like license;
* see the LICENSE file that should be present in the root
* of the source distribution, or alternately available at:
* https://github.com/ndarray/ndarray
*/
#ifndef NDARRAY_Vector_h_INCLUDED
#define NDARRAY_Vector_h_INCLUDED
/// @file ndarray/Vector.h Definition for Vector.
#include <boost/type_traits/is_arithmetic.hpp>
#include <boost/iterator/reverse_iterator.hpp>
#include <boost/utility/enable_if.hpp>
#include <boost/type_traits/is_convertible.hpp>
#include <boost/mpl/int.hpp>
#include <boost/preprocessor/repetition/repeat.hpp>
#include <boost/preprocessor/repetition/repeat_from_to.hpp>
#include <boost/preprocessor/repetition/enum.hpp>
#include <iostream>
#include "ndarray_fwd.h"
#include "ndarray/types.h"
/// \cond MACROS
#define NDARRAY_MAKE_VECTOR_MAX 8
#define NDARRAY_MAKE_VECTOR_ARG_SPEC(Z,I,DATA) T v ## I
#define NDARRAY_MAKE_VECTOR_SET_SPEC(Z,I,DATA) r[I] = v ## I;
#define NDARRAY_MAKE_VECTOR_SPEC(Z,N,DATA) \
template <typename T> \
inline Vector<T,N> makeVector( \
BOOST_PP_ENUM(N,NDARRAY_MAKE_VECTOR_ARG_SPEC,unused) \
) { \
Vector<T,N> r; \
BOOST_PP_REPEAT(N,NDARRAY_MAKE_VECTOR_SET_SPEC,unused) \
return r; \
}
/// \endcond
namespace ndarray {
namespace detail {
template <typename T, bool isArithmetic=boost::is_arithmetic<T>::value>
struct DefaultValue {
static T get() { return T(); }
};
template <typename T>
struct DefaultValue<T,true> {
static T get() { return T(0); }
};
} // namespace detail
/// \addtogroup ndarrayVectorGroup
/// @{
/**
* @class Vector
* @brief A fixed-size 1D array class.
*
* Vector is primarily used as the data type for the shape
* (with T==Size) and strides (with T==Offset) attributes of Array.
*
* Vector is implemented almost exactly as a non-aggregate
* boost::array, but with the addition of mathematical
* operators and a few other utility functions.
*/
template <
typename T, ///< Data type.
int N ///< Number of elements.
>
struct Vector {
typedef T Element;
typedef T Value;
typedef T & Reference;
typedef T const & ConstReference;
typedef T * Iterator;
typedef T const * ConstIterator;
typedef Value value_type;
typedef Iterator iterator;
typedef ConstIterator const_iterator;
typedef Reference reference;
typedef ConstReference const_reference;
typedef boost::reverse_iterator<T*> reverse_iterator;
typedef boost::reverse_iterator<const T*> const_reverse_iterator;
typedef T * pointer;
typedef int difference_type;
typedef int size_type;
typedef boost::mpl::int_<N> ND;
/// @brief Return the size of the Vector.
size_type size() const { return N; }
/// @brief Return the size of the Vector.
size_type max_size() const { return N; }
///< @brief Return true if size() == 0.
bool empty() const { return N==0; }
/// @brief Return an iterator to the beginning of the Vector.
iterator begin() { return elems; }
/// @brief Return a const_iterator to the beginning of the Vector.
const_iterator begin() const { return elems; }
/// @brief Return an iterator to the end of the Vector.
iterator end() { return elems+N; }
/// @brief Return a const_iterator to the end of the Vector.
const_iterator end() const { return elems+N; }
/// @brief Return a reverse_iterator to the beginning of the reversed Vector.
reverse_iterator rbegin() { return reverse_iterator(end()); }
/// @brief Return a const_reverse_iterator to the beginning of the reversed Vector.
const_reverse_iterator rbegin() const { return const_reverse_iterator(end()); }
/// @brief Return a reverse_iterator to the end of the reversed Vector.
reverse_iterator rend() { return reverse_iterator(begin()); }
/// @brief Return a const_reverse_iterator to the end of the reversed Vector.
const_reverse_iterator rend() const { return const_reverse_iterator(begin()); }
/// @brief Return a reference to the first element.
reference front() { return *elems; }
/// @brief Return a reference to the last element.
reference back() { return *(elems+N-1); }
/// @brief Return a const_reference to the first element.
const_reference front() const { return *elems; }
/// @brief Return a const_reference to the last element.
const_reference back() const { return *(elems+N-1); }
/// @brief Return a reference to the element with the given index.
reference operator[](int i) { return elems[i]; }
/// @brief Return a const_reference to the element with the given index.
const_reference operator[](int i) const { return elems[i]; }
/// @brief Create a new Vector that is a subset of this.
template <int Start, int Stop>
Vector<T,Stop-Start> getRange() const {
Vector<T,Stop-Start> r;
std::copy(begin() + Start, begin()+Stop, r.begin());
return r;
}
/// @brief Create a new Vector from the first M elements of this.
template <int M> Vector<T,M> first() const {
Vector<T,M> r;
std::copy(begin(), begin() + M, r.begin());
return r;
}
/// @brief Create a new Vector from the last M elements of this.
template <int M> Vector<T,M> last() const {
Vector<T,M> r;
std::copy(begin() + (N - M), begin() + N, r.begin());
return r;
}
/** @brief Stream output. */
friend std::ostream& operator<<(std::ostream& os, Vector<T,N> const & obj) {
os << "(";
std::copy(obj.begin(), obj.end(), std::ostream_iterator<T>(os,","));
return os << ")";
}
/**
* @brief Default constructor.
*
* Initializes the elements to zero.
*/
Vector() { this->
#ifndef _MSC_VER
template
#endif
operator=(detail::DefaultValue<T>::get()); }
/// @brief Construct with copies of a scalar.
explicit Vector(T scalar) {
this->operator=(scalar);
}
/// @brief Converting copy constructor.
template <typename U>
Vector(Vector<U,N> const & other) {
this->
#ifndef _MSC_VER
template
#endif
operator=(other);
}
/// @brief Return true if elements of other are equal to the elements of this.
bool operator==(Vector const & other) const {
return std::equal(begin(), end(), other.begin());
}
/// @brief Return false if any elements of other are not equal to the elements of this.
bool operator!=(Vector const & other) const {
return !(*this == other);
}
/// @brief Return the sum of all elements.
T sum() const {
T r = 0;
for (ConstIterator i = begin(); i != end(); ++i) r += (*i);
return r;
}
/// @brief Return the product of all elements.
T product() const {
T r = 1;
for (ConstIterator i = begin(); i != end(); ++i) r *= (*i);
return r;
}
/// @brief Return a Vector with the elements reversed.
Vector reverse() const {
Vector r;
std::copy(begin(), end(), r.rbegin());
return r;
}
/// @brief Cast the vector element-wise to another type.
template <typename U>
Vector<U,N> cast() const {
Vector<U,N> r;
for (int i = 0; i < N; ++i) {
r[i] = static_cast<U>((*this)[i]);
}
return r;
}
/// @brief Augmented = assignment from another vector.
template <typename U>
typename boost::enable_if<boost::is_convertible<U,T>,Vector&>::type
operator = (Vector<U,N> const & other) {
typename Vector<U,N>::ConstIterator j = other.begin();
for (Iterator i = begin(); i != end(); ++i, ++j) (*i) = (*j);
return *this;
}
/// @brief Augmented = assignment from a scalar.
template <typename U>
typename boost::enable_if<boost::is_convertible<U,T>,Vector&>::type
operator = (U scalar) {
for (Iterator i = begin(); i != end(); ++i) (*i) = scalar;
return *this;
}
/// @brief Augmented += assignment from another vector.
template <typename U>
typename boost::enable_if<boost::is_convertible<U,T>,Vector&>::type
operator += (Vector<U,N> const & other) {
typename Vector<U,N>::ConstIterator j = other.begin();
for (Iterator i = begin(); i != end(); ++i, ++j) (*i) += (*j);
return *this;
}
/// @brief Augmented += assignment from a scalar.
template <typename U>
typename boost::enable_if<boost::is_convertible<U,T>,Vector&>::type
operator += (U scalar) {
for (Iterator i = begin(); i != end(); ++i) (*i) += scalar;
return *this;
}
/// @brief Augmented -= assignment from another vector.
template <typename U>
typename boost::enable_if<boost::is_convertible<U,T>,Vector&>::type
operator -= (Vector<U,N> const & other) {
typename Vector<U,N>::ConstIterator j = other.begin();
for (Iterator i = begin(); i != end(); ++i, ++j) (*i) -= (*j);
return *this;
}
/// @brief Augmented -= assignment from a scalar.
template <typename U>
typename boost::enable_if<boost::is_convertible<U,T>,Vector&>::type
operator -= (U scalar) {
for (Iterator i = begin(); i != end(); ++i) (*i) -= scalar;
return *this;
}
/// @brief Augmented *= assignment from another vector.
template <typename U>
typename boost::enable_if<boost::is_convertible<U,T>,Vector&>::type
operator *= (Vector<U,N> const & other) {
typename Vector<U,N>::ConstIterator j = other.begin();
for (Iterator i = begin(); i != end(); ++i, ++j) (*i) *= (*j);
return *this;
}
/// @brief Augmented *= assignment from a scalar.
template <typename U>
typename boost::enable_if<boost::is_convertible<U,T>,Vector&>::type
operator *= (U scalar) {
for (Iterator i = begin(); i != end(); ++i) (*i) *= scalar;
return *this;
}
/// @brief Augmented /= assignment from another vector.
template <typename U>
typename boost::enable_if<boost::is_convertible<U,T>,Vector&>::type
operator /= (Vector<U,N> const & other) {
typename Vector<U,N>::ConstIterator j = other.begin();
for (Iterator i = begin(); i != end(); ++i, ++j) (*i) /= (*j);
return *this;
}
/// @brief Augmented /= assignment from a scalar.
template <typename U>
typename boost::enable_if<boost::is_convertible<U,T>,Vector&>::type
operator /= (U scalar) {
for (Iterator i = begin(); i != end(); ++i) (*i) /= scalar;
return *this;
}
/// @brief Augmented %= assignment from another vector.
template <typename U>
typename boost::enable_if<boost::is_convertible<U,T>,Vector&>::type
operator %= (Vector<U,N> const & other) {
typename Vector<U,N>::ConstIterator j = other.begin();
for (Iterator i = begin(); i != end(); ++i, ++j) (*i) %= (*j);
return *this;
}
/// @brief Augmented %= assignment from a scalar.
template <typename U>
typename boost::enable_if<boost::is_convertible<U,T>,Vector&>::type
operator %= (U scalar) {
for (Iterator i = begin(); i != end(); ++i) (*i) %= scalar;
return *this;
}
/// @brief Augmented &= assignment from another vector.
template <typename U>
typename boost::enable_if<boost::is_convertible<U,T>,Vector&>::type
operator &= (Vector<U,N> const & other) {
typename Vector<U,N>::ConstIterator j = other.begin();
for (Iterator i = begin(); i != end(); ++i, ++j) (*i) &= (*j);
return *this;
}
/// @brief Augmented &= assignment from a scalar.
template <typename U>
typename boost::enable_if<boost::is_convertible<U,T>,Vector&>::type
operator &= (U scalar) {
for (Iterator i = begin(); i != end(); ++i) (*i) &= scalar;
return *this;
}
/// @brief Augmented ^= assignment from another vector.
template <typename U>
typename boost::enable_if<boost::is_convertible<U,T>,Vector&>::type
operator ^= (Vector<U,N> const & other) {
typename Vector<U,N>::ConstIterator j = other.begin();
for (Iterator i = begin(); i != end(); ++i, ++j) (*i) ^= (*j);
return *this;
}
/// @brief Augmented ^= assignment from a scalar.
template <typename U>
typename boost::enable_if<boost::is_convertible<U,T>,Vector&>::type
operator ^= (U scalar) {
for (Iterator i = begin(); i != end(); ++i) (*i) ^= scalar;
return *this;
}
/// @brief Augmented |= assignment from another vector.
template <typename U>
typename boost::enable_if<boost::is_convertible<U,T>,Vector&>::type
operator |= (Vector<U,N> const & other) {
typename Vector<U,N>::ConstIterator j = other.begin();
for (Iterator i = begin(); i != end(); ++i, ++j) (*i) |= (*j);
return *this;
}
/// @brief Augmented |= assignment from a scalar.
template <typename U>
typename boost::enable_if<boost::is_convertible<U,T>,Vector&>::type
operator |= (U scalar) {
for (Iterator i = begin(); i != end(); ++i) (*i) |= scalar;
return *this;
}
/// @brief Augmented <<= assignment from another vector.
template <typename U>
typename boost::enable_if<boost::is_convertible<U,T>,Vector&>::type
operator <<= (Vector<U,N> const & other) {
typename Vector<U,N>::ConstIterator j = other.begin();
for (Iterator i = begin(); i != end(); ++i, ++j) (*i) <<= (*j);
return *this;
}
/// @brief Augmented <<= assignment from a scalar.
template <typename U>
typename boost::enable_if<boost::is_convertible<U,T>,Vector&>::type
operator <<= (U scalar) {
for (Iterator i = begin(); i != end(); ++i) (*i) <<= scalar;
return *this;
}
/// @brief Augmented >>= assignment from another vector.
template <typename U>
typename boost::enable_if<boost::is_convertible<U,T>,Vector&>::type
operator >>= (Vector<U,N> const & other) {
typename Vector<U,N>::ConstIterator j = other.begin();
for (Iterator i = begin(); i != end(); ++i, ++j) (*i) >>= (*j);
return *this;
}
/// @brief Augmented >>= assignment from a scalar.
template <typename U>
typename boost::enable_if<boost::is_convertible<U,T>,Vector&>::type
operator >>= (U scalar) {
for (Iterator i = begin(); i != end(); ++i) (*i) >>= scalar;
return *this;
}
T elems[N];
};
/// @brief PArtial specialization for zero-size vectors to avoid compiler errors on some platforms.
template <typename T>
struct Vector<T,0> {
typedef T Element;
typedef T Value;
typedef T & Reference;
typedef T const & ConstReference;
typedef T * Iterator;
typedef T const * ConstIterator;
typedef Value value_type;
typedef Iterator iterator;
typedef ConstIterator const_iterator;
typedef Reference reference;
typedef ConstReference const_reference;
typedef boost::reverse_iterator<T*> reverse_iterator;
typedef boost::reverse_iterator<const T*> const_reverse_iterator;
typedef T * pointer;
typedef int difference_type;
typedef int size_type;
typedef boost::mpl::int_<0> ND;
size_type size() const { return 0; } ///< @brief Return the size of the Vector.
size_type max_size() const { return 0; } ///< @brief Return the size of the Vector.
bool empty() const { return true; } ///< @brief Return true if size() == 0.
/// @brief Return an iterator to the beginning of the Vector.
iterator begin() { return 0; }
/// @brief Return a const_iterator to the beginning of the Vector.
const_iterator begin() const { return 0; }
/// @brief Return an iterator to the end of the Vector.
iterator end() { return 0; }
/// @brief Return a const_iterator to the end of the Vector.
const_iterator end() const { return 0; }
/// @brief Return a reverse_iterator to the beginning of the reversed Vector.
reverse_iterator rbegin() { return reverse_iterator(); }
/// @brief Return a const_reverse_iterator to the beginning of the reversed Vector.
const_reverse_iterator rbegin() const { return const_reverse_iterator(); }
/// @brief Return a reverse_iterator to the end of the reversed Vector.
reverse_iterator rend() { return reverse_iterator(); }
/// @brief Return a const_reverse_iterator to the end of the reversed Vector.
const_reverse_iterator rend() const { return const_reverse_iterator(); }
/// @brief Return a reference to the first element.
reference front() { NDARRAY_ASSERT(false); return 0; }
/// @brief Return a reference to the last element.
reference back() { return NDARRAY_ASSERT(false); return 0; }
/// @brief Return a const_reference to the first element.
const_reference front() const { NDARRAY_ASSERT(false); return 0; }
/// @brief Return a const_reference to the last element.
const_reference back() const { NDARRAY_ASSERT(false); return 0; }
/// @brief Return a reference to the element with the given index.
reference operator[](int i) { NDARRAY_ASSERT(false); return 0; }
/// @brief Return a const_reference to the element with the given index.
const_reference operator[](int i) const { NDARRAY_ASSERT(false); return 0; }
/// @brief Create a new Vector that is a subset of this.
template <int Start, int Stop>
Vector<T,Stop-Start> getRange() const {
return Vector<T,Stop-Start>();
}
/// @brief Create a new Vector from the first M elements of this.
template <int M> Vector<T,M> first() const {
return Vector<T,M>();
}
/// @brief Create a new Vector from the last M elements of this.
template <int M> Vector<T,M> last() const {
return Vector<T,M>();
}
/** @brief Stream output. */
friend std::ostream& operator<<(std::ostream& os, Vector<T,0> const & obj) {
return os << "()";
}
/**
* @brief Default constructor.
*
* Initializes the elements to zero.
*/
Vector() {}
/// @brief Construct with copies of a scalar.
explicit Vector(T scalar) {}
/// @brief Converting copy constructor.
template <typename U>
Vector(Vector<U,0> const & other) {}
/// @brief Return true if elements of other are equal to the elements of this.
bool operator==(Vector const & other) const { return true; }
/// @brief Return false if any elements of other are not equal to the elements of this.
bool operator!=(Vector const & other) const { return false; }
/// @brief Return the sum of all elements.
T sum() const { return 0; }
/// @brief Return the product of all elements.
T product() const { return 1; }
/// @brief Return a Vector with the elements reversed.
Vector reverse() const { return Vector(); }
/// @brief Cast the vector element-wise to another type.
template <typename U>
Vector<U,0> cast() const { return Vector<U,0>(); }
};
/// @brief Concatenate two Vectors into a single long Vector.
template <typename T, int N, int M>
inline Vector<T,N+M> concatenate(Vector<T,N> const & a, Vector<T,M> const & b) {
Vector<T,N+M> r;
std::copy(a.begin(),a.end(),r.begin());
std::copy(b.begin(),b.end(),r.begin()+N);
return r;
}
/// @brief Return a new Vector with the given scalar appended to the original.
template <typename T, int N, typename U>
inline typename boost::enable_if<boost::is_convertible<U,T>,Vector<T,N+1> >::type
concatenate(Vector<T,N> const & a, U b) {
Vector<T,N+1> r;
std::copy(a.begin(),a.end(),r.begin());
r[N] = b;
return r;
}
/// @brief Return a new Vector with the given scalar prepended to the original.
template <typename T, int N, typename U>
inline typename boost::enable_if<boost::is_convertible<U,T>,Vector<T,N+1> >::type
concatenate(U a, Vector<T,N> const & b) {
Vector<T,N+1> r;
r[0] = a;
std::copy(b.begin(),b.end(),r.begin()+1);
return r;
}
#ifndef DOXYGEN
BOOST_PP_REPEAT_FROM_TO(1, NDARRAY_MAKE_VECTOR_MAX, NDARRAY_MAKE_VECTOR_SPEC, unused)
#else
/**
* @brief Variadic constructor for Vector.
*
* Defined for N in [0 - NDARRAY_MAKE_VECTOR_MAX).
*/
template <typename T, int N>
Vector<T,N> makeVector(T v1, T v2, ..., T vN);
#endif
/** @brief Unary bitwise NOT for Vector. */
template <typename T, int N>
inline Vector<T,N> operator~(Vector<T,N> const & vector) {
Vector<T,N> r(vector);
for (typename Vector<T,N>::Iterator i = r.begin(); i != r.end(); ++i) (*i) = ~(*i);
return r;
}
/** @brief Unary negation for Vector. */
template <typename T, int N>
inline Vector<T,N> operator!(Vector<T,N> const & vector) {
Vector<T,N> r(vector);
for (typename Vector<T,N>::Iterator i = r.begin(); i != r.end(); ++i) (*i) = !(*i);
return r;
}
/// @brief Operator overload for Vector + Vector.
template <typename T, typename U, int N>
Vector<typename Promote<T,U>::Type,N>
operator +(Vector<T,N> const & a, Vector<U,N> const & b) {
Vector<typename Promote<T,U>::Type,N> r(a);
return r += b;
}
/** @brief Operator overload for Vector + Scalar. */
template <typename T, typename U, int N>
Vector<typename Promote<T,U>::Type,N>
operator +(Vector<T,N> const & a, U b) {
Vector<typename Promote<T,U>::Type,N> r(a);
return r += b;
}
/** @brief Operator overload for Scalar + Vector. */
template <typename T, typename U, int N>
Vector<typename Promote<T,U>::Type,N>
operator +(U a, Vector<T,N> const & b) {
Vector<typename Promote<T,U>::Type,N> r(a);
return r += b;
}
/// @brief Operator overload for Vector - Vector.
template <typename T, typename U, int N>
Vector<typename Promote<T,U>::Type,N>
operator -(Vector<T,N> const & a, Vector<U,N> const & b) {
Vector<typename Promote<T,U>::Type,N> r(a);
return r -= b;
}
/** @brief Operator overload for Vector - Scalar. */
template <typename T, typename U, int N>
Vector<typename Promote<T,U>::Type,N>
operator -(Vector<T,N> const & a, U b) {
Vector<typename Promote<T,U>::Type,N> r(a);
return r -= b;
}
/** @brief Operator overload for Scalar - Vector. */
template <typename T, typename U, int N>
Vector<typename Promote<T,U>::Type,N>
operator -(U a, Vector<T,N> const & b) {
Vector<typename Promote<T,U>::Type,N> r(a);
return r -= b;
}
/// @brief Operator overload for Vector * Vector.
template <typename T, typename U, int N>
Vector<typename Promote<T,U>::Type,N>
operator *(Vector<T,N> const & a, Vector<U,N> const & b) {
Vector<typename Promote<T,U>::Type,N> r(a);
return r *= b;
}
/** @brief Operator overload for Vector * Scalar. */
template <typename T, typename U, int N>
Vector<typename Promote<T,U>::Type,N>
operator *(Vector<T,N> const & a, U b) {
Vector<typename Promote<T,U>::Type,N> r(a);
return r *= b;
}
/** @brief Operator overload for Scalar * Vector. */
template <typename T, typename U, int N>
Vector<typename Promote<T,U>::Type,N>
operator *(U a, Vector<T,N> const & b) {
Vector<typename Promote<T,U>::Type,N> r(a);
return r *= b;
}
/// @brief Operator overload for Vector / Vector.
template <typename T, typename U, int N>
Vector<typename Promote<T,U>::Type,N>
operator /(Vector<T,N> const & a, Vector<U,N> const & b) {
Vector<typename Promote<T,U>::Type,N> r(a);
return r /= b;
}
/** @brief Operator overload for Vector / Scalar. */
template <typename T, typename U, int N>
Vector<typename Promote<T,U>::Type,N>
operator /(Vector<T,N> const & a, U b) {
Vector<typename Promote<T,U>::Type,N> r(a);
return r /= b;
}
/** @brief Operator overload for Scalar / Vector. */
template <typename T, typename U, int N>
Vector<typename Promote<T,U>::Type,N>
operator /(U a, Vector<T,N> const & b) {
Vector<typename Promote<T,U>::Type,N> r(a);
return r /= b;
}
/// @brief Operator overload for Vector % Vector.
template <typename T, typename U, int N>
Vector<typename Promote<T,U>::Type,N>
operator %(Vector<T,N> const & a, Vector<U,N> const & b) {
Vector<typename Promote<T,U>::Type,N> r(a);
return r %= b;
}
/** @brief Operator overload for Vector % Scalar. */
template <typename T, typename U, int N>
Vector<typename Promote<T,U>::Type,N>
operator %(Vector<T,N> const & a, U b) {
Vector<typename Promote<T,U>::Type,N> r(a);
return r %= b;
}
/** @brief Operator overload for Scalar % Vector. */
template <typename T, typename U, int N>
Vector<typename Promote<T,U>::Type,N>
operator %(U a, Vector<T,N> const & b) {
Vector<typename Promote<T,U>::Type,N> r(a);
return r %= b;
}
/// @brief Operator overload for Vector & Vector.
template <typename T, typename U, int N>
Vector<typename Promote<T,U>::Type,N>
operator &(Vector<T,N> const & a, Vector<U,N> const & b) {
Vector<typename Promote<T,U>::Type,N> r(a);
return r &= b;
}
/** @brief Operator overload for Vector & Scalar. */
template <typename T, typename U, int N>
Vector<typename Promote<T,U>::Type,N>
operator &(Vector<T,N> const & a, U b) {
Vector<typename Promote<T,U>::Type,N> r(a);
return r &= b;
}
/** @brief Operator overload for Scalar & Vector. */
template <typename T, typename U, int N>
Vector<typename Promote<T,U>::Type,N>
operator &(U a, Vector<T,N> const & b) {
Vector<typename Promote<T,U>::Type,N> r(a);
return r &= b;
}
/// @brief Operator overload for Vector ^ Vector.
template <typename T, typename U, int N>
Vector<typename Promote<T,U>::Type,N>
operator ^(Vector<T,N> const & a, Vector<U,N> const & b) {
Vector<typename Promote<T,U>::Type,N> r(a);
return r ^= b;
}
/** @brief Operator overload for Vector ^ Scalar. */
template <typename T, typename U, int N>
Vector<typename Promote<T,U>::Type,N>
operator ^(Vector<T,N> const & a, U b) {
Vector<typename Promote<T,U>::Type,N> r(a);
return r ^= b;
}
/** @brief Operator overload for Scalar ^ Vector. */
template <typename T, typename U, int N>
Vector<typename Promote<T,U>::Type,N>
operator ^(U a, Vector<T,N> const & b) {
Vector<typename Promote<T,U>::Type,N> r(a);
return r ^= b;
}
/// @brief Operator overload for Vector | Vector.
template <typename T, typename U, int N>
Vector<typename Promote<T,U>::Type,N>
operator |(Vector<T,N> const & a, Vector<U,N> const & b) {
Vector<typename Promote<T,U>::Type,N> r(a);
return r |= b;
}
/** @brief Operator overload for Vector | Scalar. */
template <typename T, typename U, int N>
Vector<typename Promote<T,U>::Type,N>
operator |(Vector<T,N> const & a, U b) {
Vector<typename Promote<T,U>::Type,N> r(a);
return r |= b;
}
/** @brief Operator overload for Scalar | Vector. */
template <typename T, typename U, int N>
Vector<typename Promote<T,U>::Type,N>
operator |(U a, Vector<T,N> const & b) {
Vector<typename Promote<T,U>::Type,N> r(a);
return r |= b;
}
/// @brief Operator overload for Vector << Vector.
template <typename T, typename U, int N>
Vector<typename Promote<T,U>::Type,N>
operator <<(Vector<T,N> const & a, Vector<U,N> const & b) {
Vector<typename Promote<T,U>::Type,N> r(a);
return r <<= b;
}
/** @brief Operator overload for Vector << Scalar. */
template <typename T, typename U, int N>
Vector<typename Promote<T,U>::Type,N>
operator <<(Vector<T,N> const & a, U b) {
Vector<typename Promote<T,U>::Type,N> r(a);
return r <<= b;
}
/** @brief Operator overload for Scalar << Vector. */
template <typename T, typename U, int N>
Vector<typename Promote<T,U>::Type,N>
operator <<(U a, Vector<T,N> const & b) {
Vector<typename Promote<T,U>::Type,N> r(a);
return r <<= b;
}
/// @brief Operator overload for Vector >> Vector.
template <typename T, typename U, int N>
Vector<typename Promote<T,U>::Type,N>
operator >>(Vector<T,N> const & a, Vector<U,N> const & b) {
Vector<typename Promote<T,U>::Type,N> r(a);
return r >>= b;
}
/** @brief Operator overload for Vector >> Scalar. */
template <typename T, typename U, int N>
Vector<typename Promote<T,U>::Type,N>
operator >>(Vector<T,N> const & a, U b) {
Vector<typename Promote<T,U>::Type,N> r(a);
return r >>= b;
}
/** @brief Operator overload for Scalar >> Vector. */
template <typename T, typename U, int N>
Vector<typename Promote<T,U>::Type,N>
operator >>(U a, Vector<T,N> const & b) {
Vector<typename Promote<T,U>::Type,N> r(a);
return r >>= b;
}
/// @}
} // namespace ndarray
#endif // !NDARRAY_Vector_h_INCLUDED