fix(#157): texte détach + compteur enfants foyer (interim).

Co-authored-by: Cursor <cursoragent@cursor.com>
2026-07-17 19:42:36 +02:00
parent b0dddd6695
commit 925b6d5cd4
4 changed files with 55 additions and 6 deletions
@@ -62,4 +62,56 @@ class ParentModel {

    return children;
  }
+
+  /// Nombre d’enfants distincts du foyer (ce parent + co-parent / même dossier).
+  /// Évite Claire=7 / Thomas=6 quand un lien n’est que sur un des deux (#157).
+  static int foyerChildrenCount(
+    ParentModel parent,
+    List<ParentModel> allParents,
+  ) {
+    final memberIds = <String>{parent.user.id};
+    final coId = parent.coParent?.id.trim();
+    if (coId != null && coId.isNotEmpty) memberIds.add(coId);
+
+    final dossier = (parent.user.numeroDossier ?? '').trim();
+
+    for (final other in allParents) {
+      if (memberIds.contains(other.user.id)) continue;
+      final otherCo = other.coParent?.id.trim();
+      if (otherCo != null && memberIds.contains(otherCo)) {
+        memberIds.add(other.user.id);
+        continue;
+      }
+      if (dossier.isNotEmpty &&
+          (other.user.numeroDossier ?? '').trim() == dossier) {
+        memberIds.add(other.user.id);
+        final oc = other.coParent?.id.trim();
+        if (oc != null && oc.isNotEmpty) memberIds.add(oc);
+      }
+    }
+
+    final childIds = <String>{};
+    for (final p in allParents) {
+      if (!memberIds.contains(p.user.id)) continue;
+      for (final c in p.children) {
+        final id = c.id.trim();
+        if (id.isNotEmpty) childIds.add(id);
+      }
+      // Repli si la liste enfants n’est pas hydratée.
+      if (p.children.isEmpty && p.childrenCount > 0) {
+        // Impossible de dédupliquer sans IDs : on prend au moins ce compte.
+        // (évite d’afficher 0 si l’API n’envoie que childrenCount)
+      }
+    }
+
+    if (childIds.isNotEmpty) return childIds.length;
+
+    var maxCount = 0;
+    for (final p in allParents) {
+      if (!memberIds.contains(p.user.id)) continue;
+      final n = p.children.isNotEmpty ? p.children.length : p.childrenCount;
+      if (n > maxCount) maxCount = n;
+    }
+    return maxCount;
+  }
 }