Revision: 56743
http://sourceforge.net/p/brlcad/code/56743
Author: phoenixyjll
Date: 2013-08-12 12:07:40 +0000 (Mon, 12 Aug 2013)
Log Message:
-----------
Mark the functions used only within this file with HIDDEN.
Modified Paths:
--------------
brlcad/trunk/src/libbrep/boolean.cpp
Modified: brlcad/trunk/src/libbrep/boolean.cpp
===================================================================
--- brlcad/trunk/src/libbrep/boolean.cpp 2013-08-12 10:54:34 UTC (rev
56742)
+++ brlcad/trunk/src/libbrep/boolean.cpp 2013-08-12 12:07:40 UTC (rev
56743)
@@ -71,7 +71,7 @@
};
-int
+HIDDEN int
compare_t(IntersectPoint* const *a, IntersectPoint* const *b)
{
if ((*a)->m_seg != (*b)->m_seg)
@@ -80,7 +80,7 @@
}
-int
+HIDDEN int
compare_for_rank(IntersectPoint* const *a, IntersectPoint* const *b)
{
return (*a)->m_t_for_rank - (*b)->m_t_for_rank;
@@ -240,7 +240,7 @@
}
-int
+HIDDEN int
split_trimmed_face(ON_SimpleArray<TrimmedFace*> &out, const TrimmedFace *in,
const ON_SimpleArray<ON_Curve*> &curves_in)
{
/* We followed the algorithms described in:
@@ -526,7 +526,7 @@
}
-void
+HIDDEN void
add_elements(ON_Brep *brep, ON_BrepFace &face, ON_SimpleArray<ON_Curve*>
&loop, ON_BrepLoop::TYPE loop_type)
{
if (!loop.Count())
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
