Revision: 57203
http://sourceforge.net/p/brlcad/code/57203
Author: phoenixyjll
Date: 2013-08-28 03:31:25 +0000 (Wed, 28 Aug 2013)
Log Message:
-----------
Eliminate dead code.
Modified Paths:
--------------
brlcad/trunk/src/libbrep/boolean.cpp
Modified: brlcad/trunk/src/libbrep/boolean.cpp
===================================================================
--- brlcad/trunk/src/libbrep/boolean.cpp 2013-08-28 03:29:15 UTC (rev
57202)
+++ brlcad/trunk/src/libbrep/boolean.cpp 2013-08-28 03:31:25 UTC (rev
57203)
@@ -1010,20 +1010,6 @@
newface->m_innerloop = in->m_innerloop;
newface->m_innerloop.insert(newface->m_innerloop.end(),
innerloops.begin(), innerloops.end());
#if USE_CONNECTIVITY_GRAPH
- /* if (intersect.Count()) {
- // Eliminate the parts of outerloop used by other sub-faces
- for (int i = 0; i < out.Count(); i++) {
- if (out[i]->parts.Count() == 0)
- continue;
- IntersectPoint& start = intersect[0];
- for (int j = 0; j < out[i]->parts.Count(); j++) {
- newface->parts.Append(std::make_pair(start,
out[i]->parts[j].first));
- start = out[i]->parts[j].second;
- }
- }
- } else {
- newface->parts = in->parts;
- } */
for (int i = 0; i < outerloop_start_end.Count(); i++)
if (outerloop_start_end[i].first.m_seg != -1)
newface->m_parts.Append(outerloop_start_end[i]);
This was sent by the SourceForge.net collaborative development platform, the
world's largest Open Source development site.
------------------------------------------------------------------------------
Learn the latest--Visual Studio 2012, SharePoint 2013, SQL 2012, more!
Discover the easy way to master current and previous Microsoft technologies
and advance your career. Get an incredible 1,500+ hours of step-by-step
tutorial videos with LearnDevNow. Subscribe today and save!
http://pubads.g.doubleclick.net/gampad/clk?id=58040911&iu=/4140/ostg.clktrk
_______________________________________________
BRL-CAD Source Commits mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/brlcad-commits
