From 8e3a59a27b55ca58ec34e5941cb7df85f709e017 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Fri, 28 Nov 2025 14:41:18 +0100
Subject: [PATCH] simplify the code

---
 .../Constrained_triangulation_3/ccdt_3_from_soup.cpp      | 8 +++-----
 1 file changed, 3 insertions(+), 5 deletions(-)

diff --git a/Constrained_triangulation_3/examples/Constrained_triangulation_3/ccdt_3_from_soup.cpp b/Constrained_triangulation_3/examples/Constrained_triangulation_3/ccdt_3_from_soup.cpp
index 3447ecf729d..8ba8a825e2d 100644
--- a/Constrained_triangulation_3/examples/Constrained_triangulation_3/ccdt_3_from_soup.cpp
+++ b/Constrained_triangulation_3/examples/Constrained_triangulation_3/ccdt_3_from_soup.cpp
@@ -6,7 +6,6 @@
 
 #include <vector>
 #include <algorithm>
-#include <list>
 
 using K = CGAL::Exact_predicates_inexact_constructions_kernel;
 
@@ -32,17 +31,16 @@ int main(int argc, char* argv[])
             << ccdt.number_of_constrained_facets() << '\n';
 
   // Collect constrained facets per polygon
-  using Facet = typename decltype(ccdt)::Triangulation::Facet;
-  std::vector<std::list<Facet>> constrained_facets(polygons.size());
+  std::vector<std::size_t> constrained_facets(polygons.size());
   for(auto facet : ccdt.constrained_facets())
   {
     int i = ccdt.face_constraint_index(facet);
-    constrained_facets[i].push_back(facet);
+    ++constrained_facets[i];
   }
   auto it = std::max_element(constrained_facets.begin(), constrained_facets.end());
 
   std::cout << "The polygon with the most constrained facets has index "
-            << (it - constrained_facets.begin()) << " and " << it->size() << " facets.\n";
+            << (it - constrained_facets.begin()) << " and " << *it << " facets.\n";
 
   std::ofstream ofs(argc > 2 ? argv[2] : "out.mesh");
   ofs.precision(17);