Successful build with feature SQS.resultCurves3d

Author: Chengxuan-Li

QuadHypComponent.cs

@@ -135,11 +135,14 @@ protected override void SolveInstance(IGH_DataAccess DA)
                 int id = edges.FindIndex(x => x.GetHashCode().Equals(edge.GetHashCode()));
                 indices.Add(id);
             }
+            
 
+            // .Net C# additional checks required to avoid negative indexing
+            // GH C# is fine with negative indexing
             BrepEdge bottomEdge = edges[indices[0]];
             BrepEdge topEdge = edges[indices[3]];
             BrepEdge rightEdge = edges[(indices[0] - 1)>=0? (indices[0] - 1): (indices.Count - 1)];
-            BrepEdge leftEdge = edges[indices[3] - 1];
+            BrepEdge leftEdge = edges[(indices[3] - 1)>=0? (indices[3] - 1): (indices.Count - 1)];
 
             List<NurbsCurve> trimCurves = new List<NurbsCurve>(){
         topEdge.ToNurbsCurve(),
@@ -190,14 +193,14 @@ protected override void SolveInstance(IGH_DataAccess DA)
             SQS.AddTrim(trimCurve);
             var A = SQS.GetAllTriangulatedPolygons();
 
-            //SQS.CalculateTrims(true, ref SS);
+            SQS.CalculateTrims(true);
 
-            //B = SQS.resultCurves2d;
+            var B = SQS.resultCurves2d;
 
 
 
 
-            DA.SetDataList(1, A);
+            DA.SetDataList(1, B);
 
 
 

SurfaceQuadSubdivision.cs

@@ -23,8 +23,8 @@ public class SurfaceQuadSubdivision
 
         public NurbsCurve TrimCurve3d;
         public NurbsCurve TrimCurve2d;
-        public List<NurbsCurve> resultCurves2d;
-        public List<NurbsCurve> resultCurves3d;
+        public List<NurbsCurve> resultCurves2d = new List<NurbsCurve>();
+        public List<NurbsCurve> resultCurves3d = new List<NurbsCurve>();
 
         public SurfaceQuadSubdivision(NurbsSurface _srf, int _UCount, int _VCount)
         {
@@ -389,7 +389,7 @@ public List<NurbsSurface> GetAllFacetedSurfaces3D()
         }
 
 
-        public void CalculateTrims(bool coarse, ref object S)
+        public void CalculateTrims(bool coarse)
         {
             PolygonPolygonAnalyticalIntersection2d PPI2;
 
@@ -400,15 +400,13 @@ public void CalculateTrims(bool coarse, ref object S)
 
                 if (PPI2.hasResult)
                 {
-                    try
-                    {
+
 
                         resultCurves2d.Add(PPI2.resultCurve);
 
-                    }
-                    catch (Exception e) { }
+
                 }
-                S = 1;
+                
             }
             resultCurves3d = UV2XYZ(resultCurves2d);