Revision: 56780
http://sourceforge.net/p/brlcad/code/56780
Author: phoenixyjll
Date: 2013-08-13 13:18:47 +0000 (Tue, 13 Aug 2013)
Log Message:
-----------
Remove temporal debug message, and print more infomation for the stack error
and sort failure.
Modified Paths:
--------------
brlcad/trunk/src/libbrep/boolean.cpp
Modified: brlcad/trunk/src/libbrep/boolean.cpp
===================================================================
--- brlcad/trunk/src/libbrep/boolean.cpp 2013-08-13 13:16:50 UTC (rev
56779)
+++ brlcad/trunk/src/libbrep/boolean.cpp 2013-08-13 13:18:47 UTC (rev
56780)
@@ -323,7 +323,6 @@
// The start point cannot be on the boundary of the loop, because
// there is no intersections between curves[i] and the loop.
if (IsPointInsideLoop(curves[i]->PointAtStart(), in->outerloop)) {
- bu_log("*********inside loop.\n");
if (curves[i]->IsClosed()) {
ON_SimpleArray<ON_Curve*> iloop;
iloop.Append(curves[i]);
@@ -431,6 +430,8 @@
IntersectPoint *q = sorted_pointers[i];
if (compare_t(&p, &q) > 0 || q->m_pos < p->m_pos) {
bu_log("stack error or sort failure.\n");
+ bu_log("s.top() = %d, i = %d\n", s.top(), i);
+ bu_log("p->m_pos = %d, q->m_pos = %d\n", p->m_pos, q->m_pos);
continue;
}
if (q->m_type != p->m_type) {
This was sent by the SourceForge.net collaborative development platform, the
world's largest Open Source development site.
------------------------------------------------------------------------------
Get 100% visibility into Java/.NET code with AppDynamics Lite!
It's a free troubleshooting tool designed for production.
Get down to code-level detail for bottlenecks, with <2% overhead.
Download for free and get started troubleshooting in minutes.
http://pubads.g.doubleclick.net/gampad/clk?id=48897031&iu=/4140/ostg.clktrk
_______________________________________________
BRL-CAD Source Commits mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/brlcad-commits
