mirror of https://github.com/CGAL/cgal
- Make BCC happy.
This commit is contained in:
parent
80dbe7df70
commit
f6e09b89cc
|
|
@ -1,3 +1,6 @@
|
|||
Version 6.32 (8 October 2001)
|
||||
- Make BCC happy.
|
||||
|
||||
Version 6.31 (5 October 2001)
|
||||
- Remove cartesian_classes.h.
|
||||
- Move #include<CGAL/Cartesian/redefine_names_[23].h> to [Simple_]Cartesian.h
|
||||
|
|
|
|||
|
|
@ -89,7 +89,7 @@ public:
|
|||
{
|
||||
// FIXME : We need a precondition like this!!!
|
||||
// CGAL_kernel_precondition(t.is_axis_preserving());
|
||||
return Iso_rectangleC2(t.transform(vertex(0)), t.transform(vertex(2)));
|
||||
return Iso_rectangleC2<R>(t.transform(vertex(0)), t.transform(vertex(2)));
|
||||
}
|
||||
|
||||
Bounded_side bounded_side(const Point_2 &p) const;
|
||||
|
|
|
|||
|
|
@ -85,7 +85,7 @@ public:
|
|||
|
||||
LineC3 transform(const Aff_transformation_3 &t) const
|
||||
{
|
||||
return LineC3(t.transform(point()), t.transform(direction()));
|
||||
return LineC3<R>(t.transform(point()), t.transform(direction()));
|
||||
}
|
||||
};
|
||||
|
||||
|
|
|
|||
|
|
@ -109,10 +109,10 @@ public:
|
|||
PlaneC3 transform(const Aff_transformation_3 &t) const
|
||||
{
|
||||
if (t.is_even())
|
||||
return PlaneC3(t.transform(point()),
|
||||
return PlaneC3<R>(t.transform(point()),
|
||||
t.transpose().inverse().transform(orthogonal_direction()));
|
||||
else
|
||||
return PlaneC3( t.transform(point()),
|
||||
return PlaneC3<R>( t.transform(point()),
|
||||
- t.transpose().inverse().transform(orthogonal_direction()));
|
||||
}
|
||||
|
||||
|
|
|
|||
|
|
@ -70,7 +70,7 @@ public:
|
|||
|
||||
RayC2 transform(const Aff_transformation_2 &t) const
|
||||
{
|
||||
return RayC2(t.transform(source()), t.transform(second_point()));
|
||||
return RayC2<R>(t.transform(source()), t.transform(second_point()));
|
||||
}
|
||||
|
||||
bool is_horizontal() const;
|
||||
|
|
|
|||
|
|
@ -70,7 +70,7 @@ public:
|
|||
|
||||
RayC3 transform(const Aff_transformation_3 &t) const
|
||||
{
|
||||
return RayC3(t.transform(source()), t.transform(second_point()));
|
||||
return RayC3<R>(t.transform(source()), t.transform(second_point()));
|
||||
}
|
||||
|
||||
bool is_degenerate() const;
|
||||
|
|
|
|||
|
|
@ -83,7 +83,7 @@ public:
|
|||
SegmentC2 opposite() const;
|
||||
SegmentC2 transform(const Aff_transformation_2 &t) const
|
||||
{
|
||||
return SegmentC2(t.transform(source()), t.transform(target()));
|
||||
return SegmentC2<R>(t.transform(source()), t.transform(target()));
|
||||
}
|
||||
|
||||
bool is_degenerate() const;
|
||||
|
|
|
|||
|
|
@ -78,7 +78,7 @@ public:
|
|||
SegmentC3 opposite() const;
|
||||
SegmentC3 transform(const Aff_transformation_3 &t) const
|
||||
{
|
||||
return SegmentC3(t.transform(source()), t.transform(target()));
|
||||
return SegmentC3<R>(t.transform(source()), t.transform(target()));
|
||||
}
|
||||
|
||||
bool is_degenerate() const;
|
||||
|
|
|
|||
|
|
@ -61,7 +61,7 @@ public:
|
|||
|
||||
TetrahedronC3 transform(const Aff_transformation_3 &t) const
|
||||
{
|
||||
return TetrahedronC3(t.transform(vertex(0)),
|
||||
return TetrahedronC3<R>(t.transform(vertex(0)),
|
||||
t.transform(vertex(1)),
|
||||
t.transform(vertex(2)),
|
||||
t.transform(vertex(3)));
|
||||
|
|
|
|||
|
|
@ -57,7 +57,7 @@ public:
|
|||
TriangleC2 opposite() const;
|
||||
TriangleC2 transform(const Aff_transformation_2 &t) const
|
||||
{
|
||||
return TriangleC2(t.transform(vertex(0)),
|
||||
return TriangleC2<R>(t.transform(vertex(0)),
|
||||
t.transform(vertex(1)),
|
||||
t.transform(vertex(2)));
|
||||
}
|
||||
|
|
|
|||
|
|
@ -54,7 +54,7 @@ public:
|
|||
|
||||
TriangleC3 transform(const Aff_transformation_3 &t) const
|
||||
{
|
||||
return TriangleC3(t.transform(vertex(0)),
|
||||
return TriangleC3<R>(t.transform(vertex(0)),
|
||||
t.transform(vertex(1)),
|
||||
t.transform(vertex(2)));
|
||||
}
|
||||
|
|
|
|||
Loading…
Reference in New Issue