Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
K
kicad-source-mirror
Project
Project
Details
Activity
Releases
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Commits
Open sidebar
Elphel
kicad-source-mirror
Commits
e659d535
Commit
e659d535
authored
Jan 03, 2014
by
Dick Hollenbeck
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
fix compiler warnings
parent
eb22bf42
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
5 additions
and
4 deletions
+5
-4
sweep.cc
polygon/poly2tri/sweep/sweep.cc
+5
-4
No files found.
polygon/poly2tri/sweep/sweep.cc
View file @
e659d535
...
...
@@ -115,7 +115,7 @@ void Sweep::EdgeEvent(SweepContext& tcx, Point& ep, Point& eq, Triangle* triangl
if
(
o1
==
COLLINEAR
)
{
if
(
triangle
->
Contains
(
&
eq
,
p1
))
{
triangle
->
MarkConstrainedEdge
(
&
eq
,
p1
);
// We are modifying the constraint maybe it would be better to
// We are modifying the constraint maybe it would be better to
// not change the given constraint and just keep a variable for the new constraint
tcx
.
edge_event
.
constrained_edge
->
q
=
p1
;
triangle
=
&
triangle
->
NeighborAcross
(
point
);
...
...
@@ -132,7 +132,7 @@ void Sweep::EdgeEvent(SweepContext& tcx, Point& ep, Point& eq, Triangle* triangl
if
(
o2
==
COLLINEAR
)
{
if
(
triangle
->
Contains
(
&
eq
,
p2
))
{
triangle
->
MarkConstrainedEdge
(
&
eq
,
p2
);
// We are modifying the constraint maybe it would be better to
// We are modifying the constraint maybe it would be better to
// not change the given constraint and just keep a variable for the new constraint
tcx
.
edge_event
.
constrained_edge
->
q
=
p2
;
triangle
=
&
triangle
->
NeighborAcross
(
point
);
...
...
@@ -252,7 +252,7 @@ void Sweep::FillAdvancingFront(SweepContext& tcx, Node& n)
// True if HoleAngle exceeds 90 degrees.
bool
Sweep
::
LargeHole_DontFill
(
Node
*
node
)
{
Node
*
nextNode
=
node
->
next
;
Node
*
prevNode
=
node
->
prev
;
if
(
!
AngleExceeds90Degrees
(
node
->
point
,
nextNode
->
point
,
prevNode
->
point
))
...
...
@@ -803,7 +803,8 @@ void Sweep::FlipScanEdgeEvent(SweepContext& tcx, Point& ep, Point& eq, Triangle&
Sweep
::~
Sweep
()
{
// Clean up memory
for
(
int
i
=
0
;
i
<
nodes_
.
size
();
i
++
)
{
for
(
unsigned
i
=
0
;
i
<
nodes_
.
size
();
i
++
)
{
delete
nodes_
[
i
];
}
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment