Revision: 54050
          http://brlcad.svn.sourceforge.net/brlcad/?rev=54050&view=rev
Author:   carlmoore
Date:     2012-12-12 20:03:37 +0000 (Wed, 12 Dec 2012)
Log Message:
-----------
remove trailing blanks

Modified Paths:
--------------
    brlcad/trunk/src/librt/test_subdivision.cpp

Modified: brlcad/trunk/src/librt/test_subdivision.cpp
===================================================================
--- brlcad/trunk/src/librt/test_subdivision.cpp 2012-12-12 19:56:24 UTC (rev 
54049)
+++ brlcad/trunk/src/librt/test_subdivision.cpp 2012-12-12 20:03:37 UTC (rev 
54050)
@@ -104,13 +104,13 @@
    return pmv;
 }
 
-// Break edge handling cases into functions.  For each 
+// Break edge handling cases into functions.  For each
 
 /* Case 1 - edge with no boundary points, face is internal to mesh
-/ 
-/                                 C 
-/                                / \ 
-/                               / ' \ 
+/
+/                                 C
+/                                / \
+/                               / ' \
 /                              /  '  \
 /                     P1      /   '   \     P2
 /                            /    '    \
@@ -119,19 +119,19 @@
 /                         / '           ' \
 /                        /'_______________'\
 /                        A                 B
-/ 
+/
 /                                 P3
-*/ 
+*/
 // Edge is A->B, all face edges have an additional ajoint face.  New
 // faces associated with A->B are A->P3->P and P->P3->B.
 
 /* Case 2 - edge with one boundary point, face is on border of mesh
-/ 
+/
 /  Edge is A->B.  If iteration count is odd:
-/ 
-/                                 C 
-/                                / \ 
-/                               / ' \ 
+/
+/                                 C
+/                                / \
+/                               / ' \
 /                              /  '  \
 /                             /   '   \     P2
 /                            /    '    \
@@ -140,7 +140,7 @@
 /                         / '           ' \
 /                        /'_______________'\
 /                        A                 B
-/ 
+/
 /                                 P3
 */
 // new faces are A->P3->P and P->P3->B
@@ -149,11 +149,11 @@
 // If iteration count is even, there are two possible cases - depending on 
P3's A->X edge and
 // whether it has one or two boundary points.
 //
-/* A->X has one boundary point: 
-/ 
-/                                 C 
-/                                / \ 
-/                               /   \ 
+/* A->X has one boundary point:
+/
+/                                 C
+/                                / \
+/                               /   \
 /                         E2   /     \
 /                             /       \     P2
 /                            /         \
@@ -172,17 +172,17 @@
 /                               \   /
 /                                \ /
 /                                 X
-/                                 
-/ 
-/ 
+/
+/
+/
 */
 // insert faces  B->E1->P3 and P3->E1->A
 //
-/* A->X has two boundary points: 
-/ 
-/                                 C 
-/                                / \ 
-/                               /   \ 
+/* A->X has two boundary points:
+/
+/                                 C
+/                                / \
+/                               /   \
 /                         E2   /     \
 /                             /       \     P2
 /                            /         \
@@ -201,8 +201,8 @@
 /                          E4   \   /
 /                                \ /
 /                                 X
-/                                 
-*/ 
+/
+*/
 //
 //
 // insert faces  B->E1->E3 and E1->A->E3
@@ -210,42 +210,42 @@
 
 // Case 3 - edge with two boundary points, face is on border of mesh
 //
-//                                
+//
 /* Edge is A->B.  If iteration count is odd
-/ 
-/ 
-/                                 C 
-/                                / \ 
-/                               / ' \ 
+/
+/
+/                                 C
+/                                / \
+/                               / ' \
 /                              /  '  \
-/                             /   '   \       
+/                             /   '   \
 /                            /    '    \
 /                           /   ' P '   \
 /                          /  '       '  \
 /                         / '           ' \
 /                        /'_______________'\
 /                        A                 B
-/ 
+/
 */
 // insert one face - A->B->P
 //
-/*  If iteration count is even, 
-/ 
-/ 
-/                                 C 
-/                                / \ 
-/                               /   \ 
+/*  If iteration count is even,
+/
+/
+/                                 C
+/                                / \
+/                               /   \
 /                              /     \
-/                             /       \       
+/                             /       \
 /                            /         \
 /                           /           \
 /                          /             \
 /                         /               \
 /                        / _______________ \
 /                        A                 B
-/ 
+/
 /                            E1      E2
-*/ 
+*/
 // insert one face - E1 -> E2 -> C
 
 

This was sent by the SourceForge.net collaborative development platform, the 
world's largest Open Source development site.


------------------------------------------------------------------------------
LogMeIn Rescue: Anywhere, Anytime Remote support for IT. Free Trial
Remotely access PCs and mobile devices and provide instant support
Improve your efficiency, and focus on delivering more value-add services
Discover what IT Professionals Know. Rescue delivers
http://p.sf.net/sfu/logmein_12329d2d
_______________________________________________
BRL-CAD Source Commits mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/brlcad-commits

Reply via email to