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
|
// Copyright (c) 2000 Utrecht University (The Netherlands),
// ETH Zurich (Switzerland), Freie Universitaet Berlin (Germany),
// INRIA Sophia-Antipolis (France), Martin-Luther-University Halle-Wittenberg
// (Germany), Max-Planck-Institute Saarbruecken (Germany), RISC Linz (Austria),
// and Tel-Aviv University (Israel). All rights reserved.
//
// This file is part of CGAL (www.cgal.org); you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public License as
// published by the Free Software Foundation; version 2.1 of the License.
// See the file LICENSE.LGPL distributed with CGAL.
//
// Licensees holding a valid commercial license may use this file in
// accordance with the commercial license agreement provided with the software.
//
// This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
// WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
//
// $URL: svn+ssh://scm.gforge.inria.fr/svn/cgal/branches/CGAL-3.5-branch/Cartesian_kernel/include/CGAL/Cartesian/Vector_2.h $
// $Id: Vector_2.h 49057 2009-04-30 14:03:52Z spion $
//
//
// Author(s) : Andreas Fabri, Herve Bronnimann
#ifndef CGAL_CARTESIAN_VECTOR_2_H
#define CGAL_CARTESIAN_VECTOR_2_H
#include <CGAL/Origin.h>
#include <CGAL/array.h>
#include <CGAL/constant.h>
#include <CGAL/Handle_for.h>
CGAL_BEGIN_NAMESPACE
template < class R_ >
class VectorC2
{
typedef typename R_::FT FT;
typedef typename R_::Point_2 Point_2;
typedef typename R_::Vector_2 Vector_2;
typedef typename R_::Segment_2 Segment_2;
typedef typename R_::Ray_2 Ray_2;
typedef typename R_::Line_2 Line_2;
typedef typename R_::Direction_2 Direction_2;
typedef cpp0x::array<FT, 2> Rep;
typedef typename R_::template Handle<Rep>::type Base;
Base base;
public:
typedef typename Rep::const_iterator Cartesian_const_iterator;
typedef R_ R;
VectorC2() {}
VectorC2(const FT &x, const FT &y)
: base(CGAL::make_array(x, y)) {}
VectorC2(const FT &hx, const FT &hy, const FT &hw)
: base( hw != FT(1) ? CGAL::make_array(hx/hw, hy/hw)
: CGAL::make_array(hx, hy) ) {}
const FT & x() const
{
return CGAL::get(base)[0];
}
const FT & y() const
{
return CGAL::get(base)[1];
}
const FT & hx() const
{
return x();
}
const FT & hy() const
{
return y();
}
const FT& hw() const
{
return constant<FT, 1>();
}
Cartesian_const_iterator cartesian_begin() const
{
return CGAL::get(base).begin();
}
Cartesian_const_iterator cartesian_end() const
{
return CGAL::get(base).end();
}
};
template < class R >
CGAL_KERNEL_INLINE
bool
operator==(const VectorC2<R> &v, const VectorC2<R> &w)
{
return w.x() == v.x() && w.y() == v.y();
}
template < class R >
inline
bool
operator!=(const VectorC2<R> &v, const VectorC2<R> &w)
{
return !(v == w);
}
template < class R >
inline
bool
operator==(const VectorC2<R> &v, const Null_vector &)
{
return CGAL_NTS is_zero(v.x()) && CGAL_NTS is_zero(v.y());
}
template < class R >
inline
bool
operator==(const Null_vector &n, const VectorC2<R> &v)
{
return v == n;
}
template < class R >
inline
bool
operator!=(const VectorC2<R> &v, const Null_vector &n)
{
return !(v == n);
}
template < class R >
inline
bool
operator!=(const Null_vector &n, const VectorC2<R> &v)
{
return !(v == n);
}
CGAL_END_NAMESPACE
#endif // CGAL_CARTESIAN_VECTOR_2_H
|
