encapsulated to make methed easier to read

Author: tocsoft

src/ImageSharp.Drawing/Shapes/ComplexPolygon.cs

@@ -193,25 +193,7 @@ public int FindIntersections(PointF start, PointF end, PointF[] buffer, int offs
         /// <inheritdoc />
         public int FindIntersections(PointF start, PointF end, Span<PointF> buffer, IntersectionRule intersectionRule)
         {
-            if (this.internalPaths == null)
-            {
-                lock (this.paths)
-                {
-                    if (this.internalPaths == null)
-                    {
-                        this.internalPaths = new List<InternalPath>(this.paths.Length);
-
-                        foreach (var p in this.paths)
-                        {
-                            foreach (var s in p.Flatten())
-                            {
-                                var ip = new InternalPath(s.Points, s.IsClosed);
-                                this.internalPaths.Add(ip);
-                            }
-                        }
-                    }
-                }
-            }
+            this.EnsureInternalPathsInitalized();
 
             int totalAdded = 0;
             Orientation[] orientations = ArrayPool<Orientation>.Shared.Rent(buffer.Length); // the largest number of intersections of any sub path of the set is the max size with need for this buffer.
@@ -250,6 +232,29 @@ public int FindIntersections(PointF start, PointF end, Span<PointF> buffer, Inte
             return totalAdded;
         }
 
+        private void EnsureInternalPathsInitalized()
+        {
+            if (this.internalPaths == null)
+            {
+                lock (this.paths)
+                {
+                    if (this.internalPaths == null)
+                    {
+                        this.internalPaths = new List<InternalPath>(this.paths.Length);
+
+                        foreach (var p in this.paths)
+                        {
+                            foreach (var s in p.Flatten())
+                            {
+                                var ip = new InternalPath(s.Points, s.IsClosed);
+                                this.internalPaths.Add(ip);
+                            }
+                        }
+                    }
+                }
+            }
+        }
+
         /// <summary>
         /// Determines whether the <see cref="IPath" /> contains the specified point
         /// </summary>