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
|
// Copyright (c) 2000,2001
// Utrecht University (The Netherlands),
// ETH Zurich (Switzerland),
// INRIA Sophia-Antipolis (France),
// Max-Planck-Institute Saarbruecken (Germany),
// and Tel-Aviv University (Israel). All rights reserved.
//
// This file is part of CGAL (www.cgal.org)
//
// $URL: https://github.com/CGAL/cgal/blob/v6.1/Kernel_d/include/CGAL/Kernel_d/Vector_d.h $
// $Id: include/CGAL/Kernel_d/Vector_d.h b26b07a1242 $
// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
//
// Author(s) : Michael Seel
#ifndef CGAL_VECTOR_D_H
#define CGAL_VECTOR_D_H
#include <CGAL/Dimension.h>
#include <CGAL/Origin.h>
namespace CGAL {
template <class pR>
class Direction_d;
template <class pR>
class Point_d;
template <class pR>
class Vector_d : public pR::Vector_d_base
{ public:
typedef CGAL::Dynamic_dimension_tag Ambient_dimension;
typedef CGAL::Dimension_tag<0> Feature_dimension;
typedef typename pR::Vector_d_base Base;
typedef Vector_d<pR> Self;
typedef pR R;
typedef typename R::RT RT;
typedef typename R::FT FT;
typedef typename R::LA LA;
typedef typename Base::Base_vector Base_vector;
Vector_d(int d=0) : Base(d) {}
Vector_d(int d, Null_vector v) : Base(d,v) {}
Vector_d(int a, int b, int c = 1) : Base(a,b,c) {}
Vector_d(const RT& a, const RT& b, const RT& c = 1) :
Base(a,b,c) {}
Vector_d(int a, int b, int c, int d) : Base(a,b,c,d) {}
Vector_d(const RT& a, const RT& b, const RT& c, const RT& d) :
Base(a,b,c,d) {}
Vector_d(int d, Base_vector, int i) :
Base(d,Base_vector(),i) {}
template <class InputIterator>
Vector_d (int d, InputIterator first, InputIterator last)
: Base (d, first, last) {}
template <class InputIterator>
Vector_d (int d, InputIterator first, InputIterator last, const RT& D)
: Base (d, first, last, D) {}
Vector_d(const Base& v) : Base(v) {}
Direction_d<R> direction() const { return Base::direction(); }
FT operator* (const Self& w) const
{ return Base::operator*(w); }
Self operator+(const Self& w) const
{ return Base::operator+(w); }
Self operator-(const Self& w) const
{ return Base::operator-(w); }
Self operator-() const
{ return Base::operator-(); }
template <class NT>
Self operator/(const NT& n) const { return Base::operator/(n); }
Self& operator+=(const Self& w)
{ return static_cast<Self&>(Base::operator+=(w)); }
Self& operator-=(const Self& w)
{ return static_cast<Self&>(Base::operator-=(w)); }
template <class NT>
Self& operator*=(const NT& n)
{ return static_cast<Self&>(Base::operator*=(n)); }
template <class NT>
Self& operator/=(const NT& n)
{ return static_cast<Self&>(Base::operator/=(n)); }
bool operator==(const Self& w) const
{ return Base::operator==(w); }
bool operator!=(const Self& w) const
{ return Base::operator!=(w); }
bool operator==(const Base& w) const
{ return Base::operator==(w); }
bool operator!=(const Base& w) const
{ return Base::operator!=(w); }
};
template <class R> Point_d<R>
operator+ (const Origin& o, const Vector_d<R>& v)
{ return Point_d<R>( o + static_cast<const typename Vector_d<R>::Base&>(v) ); }
template <class NT, class R>
Vector_d<R> operator*(const NT& n, const Vector_d<R>& v)
{ return Vector_d<R>( n * static_cast<const typename Vector_d<R>::Base&>(v) ); }
} //namespace CGAL
#endif //CGAL_VECTOR_D_H
|
