Skip to content
Snippets Groups Projects
Commit 0410a8be authored by Ben Boeckel's avatar Ben Boeckel
Browse files

clang-format: help out some comment formatting

parent cf111cf6
No related branches found
No related tags found
No related merge requests found
......@@ -162,7 +162,7 @@ int TestPolygon(int,char *[])
// return the element to its original state.
polygon->GetPoints()->SetPoint(3, 0.0, 2.0, 0.0);
//////// Test Normal : void vtkPolygon::ComputeNormal (int numPts, double *pts, double n[3]) ///////////
// Test Normal : void vtkPolygon::ComputeNormal (int numPts, double *pts, double n[3])
double normal[3];
double points[12];
for(int i = 0; i < polygon->GetNumberOfPoints(); i++)
......@@ -182,7 +182,7 @@ int TestPolygon(int,char *[])
return EXIT_FAILURE;
}
///////// Test Normal : void vtkPolygon::ComputeNormal(vtkIdTypeArray *ids, vtkPoints *p, double n[3]) /////////
// Test Normal : void vtkPolygon::ComputeNormal(vtkIdTypeArray *ids, vtkPoints *p, double n[3])
vtkSmartPointer<vtkIdTypeArray> idArray = vtkSmartPointer<vtkIdTypeArray>::New();
for(int i = 0; i < polygon->GetNumberOfPoints(); i++)
{
......@@ -195,7 +195,7 @@ int TestPolygon(int,char *[])
return EXIT_FAILURE;
}
//////////////////// Polygon intersection test //////////////////
// Polygon intersection test
{
vtkSmartPointer<vtkPolygon> polygon1 = vtkSmartPointer<vtkPolygon>::New();
......
......@@ -82,6 +82,7 @@
* If we had also called <code>thr->OutputSet( intervalSets[0] );</code>, there would be two child meshes and
* one would contain all cells with T < 320 [K].
* In that case, the output can be represented by this graph
*
* \dot
* digraph MultiThreshold {
* set0 [shape=rect,style=filled,label="point T(0) in [-Inf,320["]
......@@ -95,6 +96,7 @@
* set3 -> set4
* }
* \enddot
*
* The filled rectangles represent sets that are output.
*/
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment