Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Spelling correction #8788

Merged
merged 2 commits into from
Mar 24, 2025
Merged

Spelling correction #8788

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
e7fcddb
Spelling correction
albert-github Mar 17, 2025
03dd5e0
colinear -> collinear
sloriot Mar 17, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 3 additions & 3 deletions Distance_3/include/CGAL/Distance_3/Point_3_Triangle_3.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -69,7 +69,7 @@ squared_distance_to_triangle_RT(const typename K::Point_3& pt,
if(normal == NULL_VECTOR)
{
// The case normal==NULL_VECTOR covers the case when the triangle
// is colinear, or even more degenerate. In that case, we can
// is collinear, or even more degenerate. In that case, we can
// simply take also the distance to the three segments.
squared_distance_RT(pt, segment(t2, t0), num, den, k);

Expand Down Expand Up @@ -206,7 +206,7 @@ squared_distance_to_triangle(const typename K::Point_3& pt,
if(normal == NULL_VECTOR)
{
// The case normal == NULL_VECTOR covers the case when the triangle
// is colinear, or even more degenerate. In that case, we can
// is collinear, or even more degenerate. In that case, we can
// simply take also the distance to the three segments.
//
// Note that in the degenerate case, at most 2 edges cover the full triangle,
Expand Down Expand Up @@ -318,7 +318,7 @@ compare_squared_distance_to_triangle(const typename K::Point_3& pt,
if(normal == NULL_VECTOR)
{
// The case normal == NULL_VECTOR covers the case when the triangle
// is colinear, or even more degenerate. In that case, we can
// is collinear, or even more degenerate. In that case, we can
// simply take also the distance to the three segments.
//
// Note that in the degenerate case, at most 2 edges cover the full triangle,
Expand Down
2 changes: 1 addition & 1 deletion Distance_3/test/Distance_3/test_compare_distance_3.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -159,7 +159,7 @@ struct Test
const bool res_l_o1o2 = (CGAL::compare_squared_distance(o1, o2, expected_result*(1-epsilon)-1) == CGAL::LARGER);
const bool res_l_o2o1 = (CGAL::compare_squared_distance(o2, o1, expected_result*(1-epsilon)-1) == CGAL::LARGER);

// The equal result is guaranted only on exact construction kernel
// The equal result is guaranteed only on exact construction kernel
if(epsilon==0)
{
assert(res_e_o1o2);
Expand Down
4 changes: 2 additions & 2 deletions .../CGAL/Set_movable_separability_2/Single_mold_translational_casting/is_pullout_direction.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -55,7 +55,7 @@ bool is_pullout_direction
{
//NOT CHECKED AT ALL
CGAL_precondition(pgn.is_simple());
CGAL_precondition(!internal::is_any_edge_colinear(pgn, traits));
CGAL_precondition(!internal::is_any_edge_collinear(pgn, traits));

auto e_it = pgn.edges_begin();
auto cc_in_between = traits.counterclockwise_in_between_2_object();
Expand Down Expand Up @@ -137,7 +137,7 @@ is_pullout_direction(const CGAL::Polygon_2<CastingTraits_2>& pgn,
typedef typename Polygon_2::Edge_const_iterator Edge_iter;

CGAL_precondition(pgn.is_simple());
CGAL_precondition(!internal::is_any_edge_colinear(pgn, traits));
CGAL_precondition(!internal::is_any_edge_collinear(pgn, traits));

Edge_iter e_it = pgn.edges_begin();
auto segment_outer_circle =
Expand Down
2 changes: 1 addition & 1 deletion ...de/CGAL/Set_movable_separability_2/Single_mold_translational_casting/pullout_directions.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -73,7 +73,7 @@ pullout_directions
CastingTraits_2& traits)
{
CGAL_precondition(pgn.is_simple());
CGAL_precondition(!internal::is_any_edge_colinear(pgn, traits));
CGAL_precondition(!internal::is_any_edge_collinear(pgn, traits));
CGAL_precondition(pgn.edges_end()!=i);

typedef CastingTraits_2 Casting_traits_2;
Expand Down
2 changes: 1 addition & 1 deletion ...y_2/include/CGAL/Set_movable_separability_2/Single_mold_translational_casting/top_edges.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -75,7 +75,7 @@ OutputIterator top_edges(const CGAL::Polygon_2<CastingTraits_2>& polygon,
typedef CastingTraits_2 Traits;

CGAL_precondition(polygon.is_simple());
CGAL_precondition(!internal::is_any_edge_colinear(polygon, traits));
CGAL_precondition(!internal::is_any_edge_collinear(polygon, traits));

auto e_it = polygon.edges_begin();
auto segment_outer_circle =
Expand Down
2 changes: 1 addition & 1 deletion Set_movable_separability_2/include/CGAL/Set_movable_separability_2/internal/Utils.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -41,7 +41,7 @@ get_segment_outer_circle(const typename Kernel::Segment_2 seg,
}

template <typename Kernel>
bool is_any_edge_colinear(const CGAL::Polygon_2<Kernel>& pgn, Kernel& kernel)
bool is_any_edge_collinear(const CGAL::Polygon_2<Kernel>& pgn, Kernel& kernel)
{
typedef typename Kernel::Point_2 Point_2;
typedef typename CGAL::Polygon_2<Kernel> Polygon_2;
Expand Down