refactor: use native queue list in auto holes

---

This commit fully replaces `NativeQueue<T>` with `NativeQueueList<T>`.
Additionally, auto planting seeds algorithm is faster (increased performance by 3.5%).

Runtime/Triangulator.cs

@@ -3045,7 +3045,7 @@ private int FindTriangle(T2 p)
 
             private void PlantAuto(Allocator allocator)
             {
-                using var heQueue = new NativeQueue<int>(allocator);
+                using var heQueue = new NativeQueueList<int>(allocator);
                 using var loop = new NativeList<int>(allocator);
                 var heVisited = new NativeArray<bool>(halfedges.Length, allocator);
 
@@ -3113,7 +3113,7 @@ private void PlantAuto(Allocator allocator)
                 }
 
                 // Plant seeds for non visited constraint edges
-                foreach (var h1 in loop)
+                foreach (var h1 in loop.AsReadOnly())
                 {
                     var h2 = NextHalfedge(h1);
                     if (!heVisited[h2])