Revision: 52558
http://brlcad.svn.sourceforge.net/brlcad/?rev=52558&view=rev
Author: carlmoore
Date: 2012-09-26 18:57:12 +0000 (Wed, 26 Sep 2012)
Log Message:
-----------
remove trailing blanks/tabs
Modified Paths:
--------------
brlcad/trunk/src/librt/test_botpatches.cpp
Modified: brlcad/trunk/src/librt/test_botpatches.cpp
===================================================================
--- brlcad/trunk/src/librt/test_botpatches.cpp 2012-09-26 18:55:50 UTC (rev
52557)
+++ brlcad/trunk/src/librt/test_botpatches.cpp 2012-09-26 18:57:12 UTC (rev
52558)
@@ -147,8 +147,8 @@
void fit_plane(size_t UNUSED(patch_id), std::set<size_t> *faces, struct
Manifold_Info *info, ON_Plane *plane) {
if (faces->size() > 0) {
ON_3dPoint center(0.0, 0.0, 0.0);
- std::set<size_t> verts;
- std::set<size_t>::iterator f_it, v_it;
+ std::set<size_t> verts;
+ std::set<size_t>::iterator f_it, v_it;
for(f_it = faces->begin(); f_it != faces->end(); f_it++) {
verts.insert(info->bot->faces[(*f_it)*3+0]*3);
verts.insert(info->bot->faces[(*f_it)*3+1]*3);
@@ -165,16 +165,16 @@
int vert_cnt = 0;
for(v_it = verts.begin(); v_it != verts.end(); v_it++) {
VMOVE(pt, &info->bot->vertices[*v_it]);
- A(0,vert_cnt) = pt[0] - center.x;
- A(1,vert_cnt) = pt[1] - center.y;
- A(2,vert_cnt) = pt[2] - center.z;
+ A(0,vert_cnt) = pt[0] - center.x;
+ A(1,vert_cnt) = pt[1] - center.y;
+ A(2,vert_cnt) = pt[2] - center.z;
vert_cnt++;
}
Eigen::JacobiSVD<Eigen::MatrixXd> svd(A, Eigen::ComputeThinU);
// 4. Normal is in column 3 of U matrix
- ON_3dVector normal(svd.matrixU()(0,2), svd.matrixU()(1,2),
svd.matrixU()(2,2));
+ ON_3dVector normal(svd.matrixU()(0,2), svd.matrixU()(1,2),
svd.matrixU()(2,2));
// 5. Construct plane
ON_Plane new_plane(center, normal);
@@ -488,7 +488,7 @@
}
void construct_patches(std::set<size_t> *faces, std::map< size_t,
std::set<size_t> > *patches, struct Manifold_Info *info) {
- if (faces->size() > 0){
+ if (faces->size() > 0){
while(faces->size() > 0) {
info->patch_cnt++;
size_t new_patch = info->patch_cnt;
@@ -589,7 +589,7 @@
std::map< size_t, std::set<size_t> >::iterator p_it;
for (p_it = patches->begin(); p_it != patches->end(); p_it++) {
if ((*p_it).second.size() > 0) {
- ON_Plane plane;
+ ON_Plane plane;
fit_plane((*p_it).first, &((*p_it).second), info, &plane);
ON_Xform xf;
xf.PlanarProjection(plane);
@@ -1121,7 +1121,7 @@
if(get_closest_point(pt_2d, &face, pt_3d, st)) {
curve_pnts_2d.Append(pt_2d);
pt_2d_prev = *curve_pnts_2d.Last();
- pullback_successes++;
+ pullback_successes++;
} else {
pt_2d_prev = ON_2dPoint(INT_MAX, INT_MAX);
pullback_failures++;
@@ -1402,8 +1402,8 @@
// Create the Brep data structure to hold curves and topology information
info.brep = ON_Brep::New();
info.brep2 = ON_Brep::New();
-
+
// Now, using the patch sets, construct brep edges
find_edges(&info);
This was sent by the SourceForge.net collaborative development platform, the
world's largest Open Source development site.
------------------------------------------------------------------------------
How fast is your code?
3 out of 4 devs don\\\'t know how their code performs in production.
Find out how slow your code is with AppDynamics Lite.
http://ad.doubleclick.net/clk;262219672;13503038;z?
http://info.appdynamics.com/FreeJavaPerformanceDownload.html
_______________________________________________
BRL-CAD Source Commits mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/brlcad-commits
