Mesh: Reimplement and unify topology maps

Combine the newer less efficient C++ implementations and the older
less convenient C functions. The maps now contain one large array of
indices, split into groups by a separate array of offset indices.
Though performance of creating the maps is relatively unchanged, the
new implementation uses 4 bytes less per source element than the C
maps, and 20 bytes less than the newer C++ functions (which also
had move overhead with larger N-gons). The usage syntax is simpler
than the C functions as well.

The reduced memory usage is helpful for when these maps are cached
in the near future. It will also allow sharing the offsets between
maps for different domains like vertex to corner and vertex to face.

A simple `GroupedSpan` class is introduced to make accessing the
topology maps much simpler. It combines offset indices and a separate
span, splitting it into chunks in an efficient way.

@@ -226,3 +223,1 @@
-    MEM_SAFE_FREE(vlmap_);
-    MEM_SAFE_FREE(vlmap_mem_);
-  }
+  ~MeshFairingContext() override {}

@@ -95,0 +97,4 @@
+ * store many grouped arrays, without requiring many small allocations, giving the general benefits
+ * of using contiguous memory.
+ */
+template<typename T> struct GroupedSpan {

@@ -95,0 +104,4 @@
+  GroupedSpan() = default;
+  GroupedSpan(OffsetIndices<int> offsets, Span<T> data) : offsets(offsets), data(data)
+  {
+    BLI_assert(offsets.total_size() == data.size());

@@ -95,0 +107,4 @@
+    BLI_assert(offsets.total_size() == data.size());
+  }
+
+  Span<T> operator[](const int64_t vert_index) const

@@ -95,0 +112,4 @@
+    return data.slice(offsets[vert_index]);
+  }
+
+  bool is_empty() const

@@ -174,10 +174,6 @@ static int sculpt_mask_filter_exec(bContext *C, wmOperator *op)
 
   SCULPT_vertex_random_access_ensure(ss);
 
-  if (!ob->sculpt->pmap) {

@@ -577,10 +577,6 @@ void SCULPT_geometry_preview_lines_update(bContext *C, SculptSession *ss, float
 
   BKE_sculpt_update_object_for_edit(depsgraph, ob, true, true, false);
 
-  if (!ss->pmap) {

@@ -141,2 +139,2 @@
-  }
-  return map;
+  bke::mesh::build_vert_to_edge_map(edges, verts_num, r_offsets, r_indices);
+  const OffsetIndices<int> offsets(r_offsets);

@@ -143,0 +142,4 @@
+    for (const int vert : range) {
+      MutableSpan<int> neighbors = r_indices.as_mutable_span().slice(offsets[vert]);
+      for (const int i : neighbors.index_range()) {
+        neighbors[i] = bke::mesh::edge_other_vert(edges[neighbors[i]], vert);