-
- for (int k = 1; k <=3; k++)
- {
-- int n = triangulation->Triangles()(j)(k);
-- p[k-1] = triangulation->Nodes()(n).Transformed(loc);
-- par[k-1] = triangulation->UVNodes()(n);
-+ int n = triangulation->Triangle(j)(k);
-+ p[k - 1] = triangulation->Node(n).Transformed(loc);
-+ par[k - 1] = triangulation->UVNode(n);
- }
-
- //double maxside = 0;
+ \r
+ for (int k = 1; k <=3; k++)\r
+ {\r
+- int n = triangulation->Triangles()(j)(k);\r
+- p[k-1] = triangulation->Nodes()(n).Transformed(loc);\r
+- par[k-1] = triangulation->UVNodes()(n);\r
++ int n = triangulation->Triangle(j)(k);\r
++ p[k - 1] = triangulation->Node(n).Transformed(loc);\r
++ par[k - 1] = triangulation->UVNode(n);\r
+ }\r
+ \r
+ //double maxside = 0;\r