rework property tables

Author: avivkeller

src/generators/jsx-ast/utils/__tests__/createSignatureElements.test.mjs

@@ -218,59 +218,48 @@ const createDocumentLayout = (entries, sideBarProps, metaBarProps) => {
 };
 
 /**
- * Identifies and removes duplicate headings across metadata entries while tracking them
+ * Identifies and removes duplicate headings that follow a heading with the same name
  * @param {Array<ApiDocMetadataEntry>} metadataEntries - API documentation metadata entries
  * @returns {Array<ApiDocMetadataEntry>} Processed entries with duplicates removed
  */
 const removeDuplicates = metadataEntries => {
-  // Group entries by their heading's full name
-  const entriesByName = {};
+  const headingMap = new Map();
+  let lastSeenName = null;
 
-  // First pass: identify headings with method signatures
+  // Process each entry in place
   metadataEntries.forEach(entry => {
-    visit(entry.content, createQueries.UNIST.isHeading, node => {
-      if (TYPES_WITH_METHOD_SIGNATURES.includes(node.data.type)) {
+    visit(
+      entry.content,
+      createQueries.UNIST.isHeading,
+      (node, index, parent) => {
+        // Early return if not a method signature type
+        if (!TYPES_WITH_METHOD_SIGNATURES.includes(node.data.type)) {
+          return;
+        }
+
         const fullName = getFullName(node.data);
-        (entriesByName[fullName] ??= []).push({ entry, node });
+
+        if (fullName === lastSeenName) {
+          // Remove duplicate heading
+          parent.children.splice(index, 1);
+          // Add entry to the original heading's entries list
+          headingMap.get(fullName).entries.push(entry);
+        } else {
+          // Update last seen name
+          lastSeenName = fullName;
+
+          // Store original heading
+          headingMap.set(fullName, {
+            node,
+            entries: [entry],
+          });
+        }
       }
-    });
+    );
   });
 
-  // Second pass: remove duplicates, keeping only the last occurrence
-  for (const matches of Object.values(entriesByName)) {
-    if (matches.length > 1) {
-      // Get the last match which will be kept
-      const lastMatch = matches[matches.length - 1];
-
-      // Add all entries to the last entry's node data
-      lastMatch.node.data.entries = matches.map(match => match.entry);
-
-      // Remove all but the last duplicate from their parent nodes
-      matches.slice(0, -1).forEach(match => {
-        const { entry, node } = match;
-
-        // Find the parent of the node to remove
-        visit(entry.content, parent => {
-          // Check if this parent contains our node
-          const index = (parent.children || []).indexOf(node);
-          if (index !== -1) {
-            // Remove the node from its parent's children
-            parent.children.splice(index, 1);
-            return true; // Stop traversal once found and removed
-          }
-          return false;
-        });
-      });
-    }
-  }
-
-  // Filter out any entries that are now empty after removal
-  return metadataEntries.filter(
-    entry =>
-      entry.content &&
-      entry.content.children &&
-      entry.content.children.length > 0
-  );
+  // Filter out entries with empty content or no children
+  return metadataEntries.filter(entry => entry.content?.children?.length > 0);
 };
 
 /**