infrahub-server 1.2.11__py3-none-any.whl → 1.2.12__py3-none-any.whl

infrahub/core/migrations/graph/m030_illegal_edges.py

@@ -0,0 +1,83 @@
+from __future__ import annotations
+
+from typing import TYPE_CHECKING, Any, Sequence
+
+from infrahub.core.migrations.shared import GraphMigration, MigrationResult
+from infrahub.log import get_logger
+
+from ...query import Query, QueryType
+
+if TYPE_CHECKING:
+    from infrahub.database import InfrahubDatabase
+
+log = get_logger()
+
+
+class DeletePosthumousEdges(Query):
+    name = "delete_posthumous_edges_query"
+    type = QueryType.WRITE
+    insert_return = False
+
+    async def query_init(self, db: InfrahubDatabase, **kwargs: dict[str, Any]) -> None:  # noqa: ARG002
+        query = """
+// ------------
+// find deleted nodes
+// ------------
+MATCH (n:Node)-[e:IS_PART_OF]->(:Root)
+WHERE e.status = "deleted" OR e.to IS NOT NULL
+WITH DISTINCT n, e.branch AS delete_branch, e.branch_level AS delete_branch_level, CASE
+    WHEN e.status = "deleted" THEN e.from
+    ELSE e.to
+END AS delete_time
+// ------------
+// find the edges added to the deleted node after the delete time
+// ------------
+MATCH (n)-[added_e]-(peer)
+WHERE added_e.from > delete_time
+AND type(added_e) <> "IS_PART_OF"
+// if the node was deleted on a branch (delete_branch_level > 1), and then updated on main/global (added_e.branch_level = 1), we can ignore it
+AND added_e.branch_level >= delete_branch_level
+AND (added_e.branch = delete_branch OR delete_branch_level = 1)
+WITH DISTINCT n, delete_branch, delete_time, added_e, peer
+// ------------
+// get the branched_from for the branch on which the node was deleted
+// ------------
+CALL {
+    WITH added_e
+    MATCH (b:Branch {name: added_e.branch})
+    RETURN b.branched_from AS added_e_branched_from
+}
+// ------------
+// account for the following situations, given that the edge update time is after the node delete time
+//  - deleted on main/global, updated on branch
+//    - illegal if the delete is before branch.branched_from
+//  - deleted on branch, updated on branch
+//    - illegal
+// ------------
+WITH n, delete_branch, delete_time, added_e, peer
+WHERE delete_branch = added_e.branch
+OR delete_time < added_e_branched_from
+DELETE added_e
+// --------------
+// the peer _should_ only be an Attribute, but I want to make sure we don't
+// inadvertently delete Root or an AttributeValue or a Boolean
+// --------------
+WITH peer
+WHERE "Attribute" IN labels(peer)
+DETACH DELETE peer
+        """
+        self.add_to_query(query)
+
+
+class Migration030(GraphMigration):
+    """
+    Edges could have been added to Nodes after the Node was deleted, so we need to hard-delete those illegal edges
+    """
+
+    name: str = "030_delete_illegal_edges"
+    minimum_version: int = 29
+    queries: Sequence[type[Query]] = [DeletePosthumousEdges]
+
+    async def validate_migration(self, db: InfrahubDatabase) -> MigrationResult:  # noqa: ARG002
+        result = MigrationResult()
+        return result

infrahub/core/migrations/query/attribute_add.py

@@ -63,28 +63,32 @@ class AttributeAddQuery(Query):
         MATCH p = (n:%(node_kind)s)
         CALL {
             WITH n
-            MATCH (root:Root)<-[r1:IS_PART_OF]-(n)
-            OPTIONAL MATCH (n)-[r2:HAS_ATTRIBUTE]-(:Attribute { name: $attr_name })
-            WHERE all(r in [r1, r2] WHERE (%(branch_filter)s))
-            RETURN n as n1, r1 as r11, r2 as r12
-            ORDER BY r2.branch_level DESC, r2.from ASC, r1.branch_level DESC, r1.from ASC
+            MATCH (:Root)<-[r:IS_PART_OF]-(n)
+            WHERE %(branch_filter)s
+            WITH n, r AS is_part_of_e
+            OPTIONAL MATCH (n)-[r:HAS_ATTRIBUTE]-(:Attribute { name: $attr_name })
+            WHERE %(branch_filter)s
+            WITH is_part_of_e, r AS has_attr_e
+            RETURN is_part_of_e, has_attr_e
+            ORDER BY has_attr_e.branch_level DESC, has_attr_e.from ASC, is_part_of_e.branch_level DESC, is_part_of_e.from ASC
             LIMIT 1
         }
-        WITH n1 as n, r11 as r1, r12 as r2, av, is_protected_value, is_visible_value
-        WHERE r1.status = "active" AND (r2 IS NULL OR r2.status = "deleted")
+        WITH n, is_part_of_e, has_attr_e, av, is_protected_value, is_visible_value
+        WHERE is_part_of_e.status = "active" AND (has_attr_e IS NULL OR has_attr_e.status = "deleted")
         CREATE (a:Attribute { name: $attr_name, branch_support: $branch_support })
         CREATE (n)-[:HAS_ATTRIBUTE $rel_props ]->(a)
         CREATE (a)-[:HAS_VALUE $rel_props ]->(av)
         CREATE (a)-[:IS_PROTECTED $rel_props]->(is_protected_value)
         CREATE (a)-[:IS_VISIBLE $rel_props]->(is_visible_value)
         %(uuid_generation)s
-        FOREACH (i in CASE WHEN r2.status = "deleted" THEN [1] ELSE [] END |
-            SET r2.to = $current_time
+        FOREACH (i in CASE WHEN has_attr_e.status = "deleted" THEN [1] ELSE [] END |
+            SET has_attr_e.to = $current_time
         )
         """ % {
             "branch_filter": branch_filter,
             "node_kind": self.node_kind,
             "uuid_generation": db.render_uuid_generation(node_label="a", node_attr="uuid"),
         }
+
         self.add_to_query(query)
         self.return_labels = ["n.uuid", "a.uuid"]

infrahub/core/schema/schema_branch.py

@@ -1957,7 +1957,11 @@ class SchemaBranch:
             )
 
             parent_hfid = f"{relationship.name}__template_name__value"
-            if relationship.kind == RelationshipKind.PARENT and parent_hfid not in template_schema.human_friendly_id:
+            if (
+                not isinstance(template_schema, GenericSchema)
+                and relationship.kind == RelationshipKind.PARENT
+                and parent_hfid not in template_schema.human_friendly_id
+            ):
                 template_schema.human_friendly_id = [parent_hfid] + template_schema.human_friendly_id
                 template_schema.uniqueness_constraints[0].append(relationship.name)
 
@@ -1992,7 +1996,6 @@ class SchemaBranch:
                 include_in_menu=False,
                 display_labels=["template_name__value"],
                 human_friendly_id=["template_name__value"],
-                uniqueness_constraints=[["template_name__value"]],
                 attributes=[template_name_attr],
             )
 
@@ -2011,7 +2014,6 @@ class SchemaBranch:
                 human_friendly_id=["template_name__value"],
                 uniqueness_constraints=[["template_name__value"]],
                 inherit_from=[InfrahubKind.LINEAGESOURCE, InfrahubKind.NODE, core_template_schema.kind],
-                default_filter="template_name__value",
                 attributes=[template_name_attr],
                 relationships=[
                     RelationshipSchema(

infrahub/database/validation.py

@@ -0,0 +1,101 @@
+from infrahub.database import InfrahubDatabase
+
+
+async def verify_no_duplicate_relationships(db: InfrahubDatabase) -> None:
+    """
+    Verify that no duplicate active relationships exist at the database level
+    A duplicate is defined as
+    - connecting the same two nodes
+    - having the same identifier
+    - having the same direction (inbound, outbound, bidirectional)
+    - having the same branch
+    A more thorough check that no duplicates exist at any point in time is possible, but more complex
+    """
+    query = """
+MATCH (a:Node)-[e1:IS_RELATED {status: "active"}]-(rel:Relationship)-[e2:IS_RELATED {branch: e1.branch, status: "active"}]-(b:Node)
+WHERE a.uuid <> b.uuid
+AND e1.to IS NULL
+AND e2.to IS NULL
+WITH a, rel.name AS rel_name, b, e1.branch AS branch, CASE
+    WHEN startNode(e1) = a AND startNode(e2) = rel THEN "out"
+    WHEN startNode(e1) = rel AND startNode(e2) = b THEN "in"
+    ELSE "bidir"
+END AS direction, COUNT(*) AS num_duplicates
+WHERE num_duplicates > 1
+RETURN a.uuid AS node_id1, b.uuid AS node_id2, rel_name, branch, direction, num_duplicates
+    """
+    results = await db.execute_query(query=query)
+    for result in results:
+        node_id1 = result.get("node_id1")
+        node_id2 = result.get("node_id2")
+        rel_name = result.get("rel_name")
+        branch = result.get("branch")
+        direction = result.get("direction")
+        num_duplicates = result.get("num_duplicates")
+        raise ValueError(
+            f"{num_duplicates} duplicate relationships ({branch=},{direction=}) between nodes '{node_id1}' and '{node_id2}'"
+            f" with relationship name '{rel_name}'"
+        )
+
+
+async def verify_no_edges_added_after_node_delete(db: InfrahubDatabase) -> None:
+    """
+    Verify that no edges are added to a Node after it is deleted on a given branch
+    """
+    query = """
+// ------------
+// find deleted nodes
+// ------------
+MATCH (n:Node)-[e:IS_PART_OF]->(:Root)
+WHERE e.status = "deleted" OR e.to IS NOT NULL
+WITH DISTINCT n, e.branch AS delete_branch, e.branch_level AS delete_branch_level, CASE
+    WHEN e.status = "deleted" THEN e.from
+    ELSE e.to
+END AS delete_time
+// ------------
+// find the edges added to the deleted node after the delete time
+// ------------
+MATCH (n)-[added_e]-(peer)
+WHERE added_e.from > delete_time
+AND type(added_e) <> "IS_PART_OF"
+// if the node was deleted on a branch (delete_branch_level > 1), and then updated on main/global (added_e.branch_level = 1), we can ignore it
+AND added_e.branch_level >= delete_branch_level
+AND (added_e.branch = delete_branch OR delete_branch_level = 1)
+WITH DISTINCT n, delete_branch, delete_time, added_e, peer AS added_peer
+// ------------
+// get the branched_from for the branch on which the node was deleted
+// ------------
+CALL {
+    WITH added_e
+    MATCH (b:Branch {name: added_e.branch})
+    RETURN b.branched_from AS added_e_branched_from
+}
+// ------------
+// account for the following situations, given that the edge update time is after the node delete time
+//  - deleted on main/global, updated on branch
+//    - illegal if the delete is before branch.branched_from
+//  - deleted on branch, updated on branch
+//    - illegal
+// ------------
+WITH n, delete_branch, delete_time, added_e, added_peer
+WHERE delete_branch = added_e.branch
+OR delete_time < added_e_branched_from
+RETURN n.uuid AS n_uuid, delete_branch, delete_time, added_e, added_peer
+    """
+    results = await db.execute_query(query=query)
+    error_messages = []
+    for result in results:
+        n_uuid = result.get("n_uuid")
+        delete_branch = result.get("delete_branch")
+        delete_time = result.get("delete_time")
+        added_e = result.get("added_e")
+        added_e_branch = added_e.get("branch")
+        added_e_from = added_e.get("from")
+        added_peer = result.get("added_peer")
+        message = (
+            f"Node {n_uuid} was deleted on {delete_branch} at {delete_time} but has an {added_e.type} edge added on"
+            f" branch {added_e_branch} at {added_e_from} to {added_peer.element_id}"
+        )
+        error_messages.append(message)
+    if error_messages:
+        raise ValueError(error_messages)

infrahub/graphql/mutations/main.py

@@ -533,7 +533,7 @@ class InfrahubMutationMixin:
         except HFIDViolatedError as exc:
             # Only the HFID constraint has been violated, it means the node exists and we can update without rerunning constraints
             if len(exc.matching_nodes_ids) > 1:
-                raise RuntimeError(f"Multiple {schema_name} nodes have the same hfid (database corrupted)") from exc
+                raise RuntimeError(f"Multiple {schema_name} nodes have the same hfid") from exc
             node_id = list(exc.matching_nodes_ids)[0]
             node = await NodeManager.get_one(db=db, id=node_id, kind=schema_name, branch=branch, raise_on_error=True)
             updated_obj, mutation = await cls._call_mutate_update(

infrahub/message_bus/operations/refresh/registry.py

@@ -26,6 +26,6 @@ async def rebased_branch(message: messages.RefreshRegistryRebasedBranch, service
 
     async with lock.registry.local_schema_lock():
         service.log.info("Refreshing rebased branch")
-        registry.branch[message.branch] = await registry.branch_object.get_by_name(
-            name=message.branch, db=service.database
-        )
+
+        async with service.database.start_session(read_only=True) as db:
+            registry.branch[message.branch] = await registry.branch_object.get_by_name(name=message.branch, db=db)

infrahub/message_bus/operations/requests/proposed_change.py

@@ -105,11 +105,11 @@ async def pipeline(message: messages.RequestProposedChangePipeline, service: Inf
 
     await _gather_repository_repository_diffs(repositories=repositories, service=service)
 
-    async with service.database.start_transaction() as dbt:
-        destination_branch = await registry.get_branch(db=dbt, branch=message.destination_branch)
-        source_branch = await registry.get_branch(db=dbt, branch=message.source_branch)
+    async with service.database.start_session() as dbs:
+        destination_branch = await registry.get_branch(db=dbs, branch=message.destination_branch)
+        source_branch = await registry.get_branch(db=dbs, branch=message.source_branch)
         component_registry = get_component_registry()
-        diff_coordinator = await component_registry.get_component(DiffCoordinator, db=dbt, branch=source_branch)
+        diff_coordinator = await component_registry.get_component(DiffCoordinator, db=dbs, branch=source_branch)
         await diff_coordinator.update_branch_diff(base_branch=destination_branch, diff_branch=source_branch)
 
     diff_summary = await service.client.get_diff_summary(branch=message.source_branch)

infrahub/patch/queries/delete_duplicated_edges.py

@@ -4,7 +4,7 @@ from .base import PatchQuery
 
 class DeleteDuplicatedEdgesPatchQuery(PatchQuery):
     """
-    Find duplicated or overlapping edges of the same status, type, and branch to update and delete
+    For all Node vertices, find duplicated or overlapping edges of the same status, type, and branch to update and delete
     - one edge will be kept for each pair of nodes and a given status, type, and branch. it will be
         updated to have the earliest "from" and "to" times in this group
     - all the other duplicate/overlapping edges will be deleted
@@ -17,9 +17,9 @@ class DeleteDuplicatedEdgesPatchQuery(PatchQuery):
     async def plan(self) -> PatchPlan:
         query = """
 // ------------
-// Find node pairs that have duplicate edges
+// Find vertex pairs that have duplicate edges
 // ------------
-MATCH (node_with_dup_edges:Node)-[edge]->(peer)
+MATCH (node_with_dup_edges:Node)-[edge]-(peer)
 WITH node_with_dup_edges, type(edge) AS edge_type, edge.status AS edge_status, edge.branch AS edge_branch, peer, count(*) AS num_dup_edges
 WHERE num_dup_edges > 1
 WITH DISTINCT node_with_dup_edges, edge_type, edge_branch, peer
@@ -28,12 +28,12 @@ CALL {
     // Get the earliest active and deleted edges for this branch
     // ------------
     WITH node_with_dup_edges, edge_type, edge_branch, peer
-    MATCH (node_with_dup_edges)-[active_edge {branch: edge_branch, status: "active"}]->(peer)
+    OPTIONAL MATCH (node_with_dup_edges)-[active_edge {branch: edge_branch, status: "active"}]-(peer)
     WHERE type(active_edge) = edge_type
     WITH node_with_dup_edges, edge_type, edge_branch, peer, active_edge
     ORDER BY active_edge.from ASC
     WITH node_with_dup_edges, edge_type, edge_branch, peer, head(collect(active_edge.from)) AS active_from
-    OPTIONAL MATCH (node_with_dup_edges)-[deleted_edge {branch: edge_branch, status: "deleted"}]->(peer)
+    OPTIONAL MATCH (node_with_dup_edges)-[deleted_edge {branch: edge_branch, status: "deleted"}]-(peer)
     WITH node_with_dup_edges, edge_type, edge_branch, peer, active_from, deleted_edge
     ORDER BY deleted_edge.from ASC
     WITH node_with_dup_edges, edge_type, edge_branch, peer, active_from, head(collect(deleted_edge.from)) AS deleted_from
@@ -42,74 +42,85 @@ CALL {
     // ------------
     CALL {
         WITH node_with_dup_edges, edge_type, edge_branch, peer, active_from, deleted_from
-        MATCH (node_with_dup_edges)-[active_e {branch: edge_branch, status: "active"}]->(peer)
+        OPTIONAL MATCH (node_with_dup_edges)-[active_e {branch: edge_branch, status: "active"}]-(peer)
         WHERE type(active_e) = edge_type
         WITH node_with_dup_edges, edge_type, edge_branch, peer, active_from, deleted_from, active_e
         ORDER BY %(id_func_name)s(active_e)
         LIMIT 1
         WITH active_e, properties(active_e) AS before_props, {from: active_from, to: deleted_from} AS prop_updates
-        RETURN [
-            {
-                db_id: %(id_func_name)s(active_e), before_props: before_props, prop_updates: prop_updates
-            }
-        ] AS active_edges_to_update
+        RETURN CASE
+            WHEN active_e IS NOT NULL THEN [
+                {
+                    db_id: %(id_func_name)s(active_e), before_props: before_props, prop_updates: prop_updates
+                }
+            ]
+            ELSE []
+        END AS active_edges_to_update
     }
     // ------------
     // Plan deletes for all the other active edges of this type on this branch
     // ------------
     CALL {
         WITH node_with_dup_edges, edge_type, edge_branch, peer
-        MATCH (node_with_dup_edges)-[active_e {branch: edge_branch, status: "active"}]->(peer)
+        OPTIONAL MATCH (node_with_dup_edges)-[active_e {branch: edge_branch, status: "active"}]-(peer)
         WHERE type(active_e) = edge_type
         WITH node_with_dup_edges, peer, active_e
         ORDER BY %(id_func_name)s(active_e)
         SKIP 1
-        RETURN collect(
-            {
+        WITH CASE
+            WHEN active_e IS NOT NULL THEN {
                 db_id: %(id_func_name)s(active_e),
-                from_id: %(id_func_name)s(node_with_dup_edges),
-                to_id: %(id_func_name)s(peer),
+                from_id: %(id_func_name)s(startNode(active_e)),
+                to_id: %(id_func_name)s(endNode(active_e)),
                 edge_type: type(active_e),
                 before_props: properties(active_e)
             }
-        ) AS active_edges_to_delete
+            ELSE NULL
+        END AS serialized_edge
+        RETURN collect(serialized_edge) AS active_edges_to_delete
     }
     // ------------
     // Plan one deleted edge update with correct from time
     // ------------
     CALL {
         WITH node_with_dup_edges, edge_type, edge_branch, peer, deleted_from
-        MATCH (node_with_dup_edges)-[deleted_e {branch: edge_branch, status: "deleted"}]->(peer)
+        OPTIONAL MATCH (node_with_dup_edges)-[deleted_e {branch: edge_branch, status: "deleted"}]-(peer)
         WHERE type(deleted_e) = edge_type
         WITH node_with_dup_edges, edge_type, edge_branch, peer, deleted_from, deleted_e
         ORDER BY %(id_func_name)s(deleted_e)
         LIMIT 1
         WITH deleted_e, properties(deleted_e) AS before_props, {from: deleted_from} AS prop_updates
-        RETURN [
-            {
-                db_id: %(id_func_name)s(deleted_e), before_props: before_props, prop_updates: prop_updates
-            }
-        ] AS deleted_edges_to_update
+        RETURN CASE
+            WHEN deleted_e IS NOT NULL THEN [
+                {
+                    db_id: %(id_func_name)s(deleted_e), before_props: before_props, prop_updates: prop_updates
+                }
+            ]
+            ELSE []
+        END AS deleted_edges_to_update
     }
     // ------------
     // Plan deletes for all the other deleted edges of this type on this branch
     // ------------
     CALL {
         WITH node_with_dup_edges, edge_type, edge_branch, peer
-        MATCH (node_with_dup_edges)-[deleted_e {branch: edge_branch, status: "deleted"}]->(peer)
+        OPTIONAL MATCH (node_with_dup_edges)-[deleted_e {branch: edge_branch, status: "deleted"}]-(peer)
         WHERE type(deleted_e) = edge_type
         WITH node_with_dup_edges, peer, deleted_e
         ORDER BY %(id_func_name)s(deleted_e)
         SKIP 1
-        RETURN collect(
-            {
+        WITH CASE
+            WHEN deleted_e IS NOT NULL THEN {
                 db_id: %(id_func_name)s(deleted_e),
-                from_id: %(id_func_name)s(node_with_dup_edges),
-                to_id: %(id_func_name)s(peer),
+                from_id: %(id_func_name)s(startNode(deleted_e)),
+                to_id: %(id_func_name)s(endNode(deleted_e)),
                 edge_type: type(deleted_e),
                 before_props: properties(deleted_e)
             }
-        ) AS deleted_edges_to_delete
+            ELSE NULL
+        END AS serialized_edge
+
+        RETURN collect(serialized_edge) AS deleted_edges_to_delete
     }
     RETURN
         active_edges_to_update + deleted_edges_to_update AS edges_to_update,

infrahub/webhook/tasks.py

@@ -111,7 +111,8 @@ async def webhook_process(
 async def configure_webhook_all(service: InfrahubServices) -> None:
     log = get_run_logger()
 
-    triggers = await gather_trigger_webhook(db=service.database)
+    async with service.database.start_session(read_only=True) as db:
+        triggers = await gather_trigger_webhook(db=db)
 
     async with get_client(sync_client=False) as prefect_client:
         await setup_triggers(

{infrahub_server-1.2.11.dist-info → infrahub_server-1.2.12.dist-info}/METADATA

@@ -1,8 +1,7 @@
-Metadata-Version: 2.1
+Metadata-Version: 2.3
 Name: infrahub-server
-Version: 1.2.11
+Version: 1.2.12
 Summary: Infrahub is taking a new approach to Infrastructure Management by providing a new generation of datastore to organize and control all the data that defines how an infrastructure should run.
-Home-page: https://opsmill.com
 License: AGPL-3.0-only
 Author: OpsMill
 Author-email: info@opsmill.com
@@ -58,6 +57,7 @@ Requires-Dist: ujson (>=5,<6)
 Requires-Dist: uvicorn[standard] (>=0.32,<0.33)
 Requires-Dist: whenever (==0.7.2)
 Project-URL: Documentation, https://docs.infrahub.app/
+Project-URL: Homepage, https://opsmill.com
 Project-URL: Repository, https://github.com/opsmill/infrahub
 Description-Content-Type: text/markdown
 

{infrahub_server-1.2.11.dist-info → infrahub_server-1.2.12.dist-info}/RECORD

@@ -55,7 +55,7 @@ infrahub/core/changelog/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG
 infrahub/core/changelog/diff.py,sha256=0BxCpsgJ-38x5BBz5XDtAvc9FPy82M0NlzXl8nQ-c70,13752
 infrahub/core/changelog/models.py,sha256=UgfJdOFUkMmjeUKe1mPCO7WE3jNENw0UJU3LWFf20HQ,29920
 infrahub/core/constants/__init__.py,sha256=Q2pEX_-Z1-TE5OM_PWKIPIvAOxuYzk2cWZnFjemkT2k,8618
-infrahub/core/constants/database.py,sha256=lxesWX2z6SZgGok1bAY6_pCBm5rFfu7k4ayMBr6w_Vo,336
+infrahub/core/constants/database.py,sha256=x5tWaT3e0WfCxxrHMcSoHUBMfcUzStLi133CqHjSosU,368
 infrahub/core/constants/infrahubkind.py,sha256=lrSae8gu4EOXaDHxX1jDkENkfr0fw5t32FP-vdXLrRs,2544
 infrahub/core/constants/relationship_label.py,sha256=AWbWghu5MoAKg2DBE-ysdzSOXnWoWdBn98zpIHzn_co,87
 infrahub/core/constants/schema.py,sha256=uuddQniyGlSlvKjM5mQ_V2VhgZmQ8fUCAHysbZLvTEU,2006
@@ -109,7 +109,7 @@ infrahub/core/diff/query/has_conflicts_query.py,sha256=kt0Z606vP2r1g7OqW2RrYj9Lb
 infrahub/core/diff/query/merge.py,sha256=g16_h5DRc0htTnmuPOujlQEEFpcjVeIAU2li5YrIxfs,33390
 infrahub/core/diff/query/merge_tracking_id.py,sha256=VLGsKuOCIMYe0I-0r01YHF5iaLYIkfSCVQatHM-ybFA,833
 infrahub/core/diff/query/roots_metadata.py,sha256=FT-48amqoR2RS4CkfnnXGI7Z5uOL4hm7IdZiz3SFHRo,2182
-infrahub/core/diff/query/save.py,sha256=j0YuT_V5kZUHIuD6CXT8bcIVv3fewAckqcuukDYn3EA,21972
+infrahub/core/diff/query/save.py,sha256=fI9UXMLMF38ZyHINyKoD13J6Nlzsmi7gWQ5AW1XYoeI,23424
 infrahub/core/diff/query/summary_counts_enricher.py,sha256=dSmbmbvLx8SE1DyAAw4mbLyW5BWLbMrYOnEchA2uBZc,10239
 infrahub/core/diff/query/time_range_query.py,sha256=0pjsFBur8jcSU6su-iA4IMjnHw3RtNWI787wAPcyepI,3003
 infrahub/core/diff/query/update_conflict_query.py,sha256=kQkFazz88wnApr8UU_qb0ruzhmrhWiqhbErukSAMhLA,1212
@@ -119,7 +119,7 @@ infrahub/core/diff/repository/deserializer.py,sha256=bhN9ao8HxqKyRz273QGLNV9z9_S
 infrahub/core/diff/repository/repository.py,sha256=b54YvGDaFg3FEDNjOTS-WC3Rvtq4bdpDb1NGEKURnqg,25851
 infrahub/core/diff/tasks.py,sha256=7_k-ZNcJZsiDp-xCZvCQfPJjg0xRxpaGTiVVNuRPfBI,3322
 infrahub/core/enums.py,sha256=qGbhRVoH43Xi0iDkUfWdQiKapJbLT9UKsCobFk_paIk,491
-infrahub/core/graph/__init__.py,sha256=Oqh1AEiVhTvWd71qOpyM6Qfxj59fjCI5OQE4mxZgDlM,19
+infrahub/core/graph/__init__.py,sha256=2EUPjmgYV1tf8ln4lfXK57uUCRFRuanN9SNHZmXdy24,19
 infrahub/core/graph/constraints.py,sha256=lmuzrKDFoeSKRiLtycB9PXi6zhMYghczKrPYvfWyy90,10396
 infrahub/core/graph/index.py,sha256=IHLP-zPRp7HJYLGHMRDRXQp8RC69ztP10Tr5NcL2j4Y,1736
 infrahub/core/graph/schema.py,sha256=FmEPPb1XOFv3nnS_XJCuUqlp8HsStX5A2frHjlhoqvE,10105
@@ -138,7 +138,7 @@ infrahub/core/ipam/utilization.py,sha256=d-zpXCaWsHgJxBLopCDd7y4sJYvHcIzzpYhbTMI
 infrahub/core/manager.py,sha256=G_5A2mYkRkxUnDGjdauVdrEX2ZX5HPaHbxEHxDyOb6U,47467
 infrahub/core/merge.py,sha256=bZvToLKyphJlWMbQAzGuSHcrG2DfeqL69KSfqb1wWdc,10430
 infrahub/core/migrations/__init__.py,sha256=syPb3-Irf11dXCHgbT0UdmTnEBbpf4wXJ3m8ADYXDpk,1175
-infrahub/core/migrations/graph/__init__.py,sha256=510-WYc9fi_DG2H1MgXXcs57QuKDmRyf26Sf87f6qRI,2679
+infrahub/core/migrations/graph/__init__.py,sha256=e0OzJEAn1qvtPghPwan8kWrLzDXX9eaw7YgbFlAZevA,2872
 infrahub/core/migrations/graph/m001_add_version_to_graph.py,sha256=YcLN6cFjE6IGheXR4Ujb6CcyY8bJ7WE289hcKJaENOc,1515
 infrahub/core/migrations/graph/m002_attribute_is_default.py,sha256=wB6f2N_ChTvGajqHD-OWCG5ahRMDhhXZuwo79ieq_II,1036
 infrahub/core/migrations/graph/m003_relationship_parent_optional.py,sha256=fRMmcOmBdHgOEjlf-5TaWsZ1Rzs6op1s75-r_jE_tZ0,2345
@@ -167,8 +167,10 @@ infrahub/core/migrations/graph/m025_uniqueness_nulls.py,sha256=n_g09PDLs1yo3dMYL
 infrahub/core/migrations/graph/m026_0000_prefix_fix.py,sha256=7sP6nQZrqgzFyRUHKf5fKSX2LrzKEAAsiDsRSu9noJM,1944
 infrahub/core/migrations/graph/m027_delete_isolated_nodes.py,sha256=aAfDUdhsR05CpehVeyLWQ1tRstgrF0HY2V5V6X5ALxM,1589
 infrahub/core/migrations/graph/m028_delete_diffs.py,sha256=PwesD95KTTJsNbMX3NK6O_rGLR7hB-GEi7JIaXheiuQ,1397
+infrahub/core/migrations/graph/m029_duplicates_cleanup.py,sha256=erCyHFBPCwRcJsSupZ2Be-JdXIbskTeufKxlFREnGAY,28997
+infrahub/core/migrations/graph/m030_illegal_edges.py,sha256=Wyvn3w4PWw7i-9DyD49C2YeyTGebR7T1sa1HjxOufJU,2804
 infrahub/core/migrations/query/__init__.py,sha256=JoWOUWlV6IzwxWxObsfCnAAKUOHJkE7dZlOsfB64ZEo,876
-infrahub/core/migrations/query/attribute_add.py,sha256=zvOwd9afCtfBpR-rEWePEAnbpoeQorzkcSmD4t8myYA,3510
+infrahub/core/migrations/query/attribute_add.py,sha256=iWZ6sRwvGLKckRWEFnrLphwQjkDF7r5AcIk9LTaltNc,3670
 infrahub/core/migrations/query/attribute_rename.py,sha256=-p3AInP1dWRO-v-i8MSajDeK5_2LcJwYr2jqLQ_vbgs,6971
 infrahub/core/migrations/query/delete_element_in_schema.py,sha256=F5m_AM_DGprRClKo_QnkYm49xZVvw_zCDIdNO0oM_QU,7051
 infrahub/core/migrations/query/node_duplicate.py,sha256=EbS4rvA5YDiX5uguXjBRrArEGnYGKK-6M3yPvrs4PWw,8232
@@ -268,7 +270,7 @@ infrahub/core/schema/manager.py,sha256=4lPjjtE_MtJ0acJdYAJEkuK4jap3NnTdxB5esEB71
 infrahub/core/schema/node_schema.py,sha256=ld_Wrqf-RsoEUVz_lKE0tcSf5n_oYZYtRI0lTqtd63o,6150
 infrahub/core/schema/profile_schema.py,sha256=cOPSOt5KLgQ0nbqrAN_o33hY_pUtrKmiwSbY_YpVolI,1092
 infrahub/core/schema/relationship_schema.py,sha256=lVbyQKMP2jPZZwZGK6DBvXdXfEQEsQGMbZ2WYxOZKTw,8261
-infrahub/core/schema/schema_branch.py,sha256=v9wZ92qBGJow6p6E3luD-nvge1FvQV5SvOgVj9Mxre0,97870
+infrahub/core/schema/schema_branch.py,sha256=iEKPbXCbvjT9NOD-iRyYiaSEywy2FLEUt7iJA5VNU5M,97863
 infrahub/core/schema/schema_branch_computed.py,sha256=14UUsQJDLMHkYhg7QMqeLiTF3PO8c8rGa90ul3F2ZZo,10629
 infrahub/core/schema/template_schema.py,sha256=O-PBS9IRM4JX6PxeoyZKwqZ0u0SdQ2zxWMc01PJ2_EA,1084
 infrahub/core/task/__init__.py,sha256=Ied1NvKGJUDmff27z_-yWW8ArenHxGvSvQTaQyx1iHs,128
@@ -317,6 +319,7 @@ infrahub/database/index.py,sha256=ATLqw9Grqbq7haGGm14VSEPmcPniid--YATiffo4sA0,16
 infrahub/database/memgraph.py,sha256=Fg3xHP9s0MiBBmMvcEmsJvuIUSq8U_XCS362HDE9d1s,1742
 infrahub/database/metrics.py,sha256=xU4OSKFbsxcw_yZlt_39PmGtF7S7yPbPuOIlSCu5sI0,739
 infrahub/database/neo4j.py,sha256=ou7PGE9rbcVD4keBEFCDFm30MEexnijbZOo3kqrfW3k,2337
+infrahub/database/validation.py,sha256=lVB9qCCEHd0pEUylD-MmOHXyhRLg-b4wyIEhfAENFtk,4153
 infrahub/dependencies/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 infrahub/dependencies/builder/constraint/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 infrahub/dependencies/builder/constraint/grouped/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
@@ -441,7 +444,7 @@ infrahub/graphql/mutations/diff_conflict.py,sha256=JngQfyKXCVlmtlqQ_VyabmrOEDOEK
 infrahub/graphql/mutations/generator.py,sha256=Ulw4whZm8Gc8lJjwfUFoFSsR0cOUliFKl87Oca4B9O0,3579
 infrahub/graphql/mutations/graphql_query.py,sha256=mp_O2byChneCihUrEAFEiIAgJ1gW9WrgtwPetUQmkJw,3562
 infrahub/graphql/mutations/ipam.py,sha256=wIN8OcTNCHVy32YgatWZi2Of-snFYBd4wlxOAJvE-AY,15961
-infrahub/graphql/mutations/main.py,sha256=EgO0U8U0FmgwuTrDrKuafSOWjO7pNR5YZzYYZbQMfec,26611
+infrahub/graphql/mutations/main.py,sha256=LxzNZQeSJ-03t6MZaVrw0bvwI5NlcGSeZGVdyqsuKbE,26590
 infrahub/graphql/mutations/menu.py,sha256=u2UbOA-TFDRcZRGFkgYTmpGxN2IAUgOvJXd7SnsufyI,3708
 infrahub/graphql/mutations/models.py,sha256=ilkSLr8OxVO9v3Ra_uDyUTJT9qPOmdPMqQbuWIydJMo,264
 infrahub/graphql/mutations/node_getter/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
@@ -533,10 +536,10 @@ infrahub/message_bus/operations/git/__init__.py,sha256=0Fbz1AnU8lWKdX7PS_b0BvjiK
 infrahub/message_bus/operations/git/file.py,sha256=uW1dXVCMrQNC5-DFrVJ6PvfU47CQ2CQJec-bOXoBkjc,1472
 infrahub/message_bus/operations/git/repository.py,sha256=eQ6csfEoCbyOTAgoA5mzHerW8-TlbrQaZQ4Htj6qZu8,2432
 infrahub/message_bus/operations/refresh/__init__.py,sha256=vBuvTL4zRRpOMXATmckQ3bx2GnNwhxicFECA8-8ZZXk,47
-infrahub/message_bus/operations/refresh/registry.py,sha256=dfLLISZ8qxwxFbGD5CaNguTicZBmACPMa82q6lAVXsM,1315
+infrahub/message_bus/operations/refresh/registry.py,sha256=JOR-71kiSgEpbEeLJAxcNv7JoV5ORahV_Gr6ytKgZSQ,1357
 infrahub/message_bus/operations/requests/__init__.py,sha256=7BWa2wc4XSNk13zySOEUdFfcaldSIZT6WXdR6eDxk-U,131
 infrahub/message_bus/operations/requests/generator_definition.py,sha256=AE2x0NiGoyqD5PYp7XmmjzD23SqNCTyzI8KwcTcVurg,6093
-infrahub/message_bus/operations/requests/proposed_change.py,sha256=fILCF3QnsU2c8UAhDyYBjXbfFvj0QF6xbF37A7lLUPM,23044
+infrahub/message_bus/operations/requests/proposed_change.py,sha256=CFxtcoYdmsdt9lKebeD407wEJB-Qo_uR8BB-t3wp-Kk,23040
 infrahub/message_bus/operations/send/__init__.py,sha256=ivuUTAknLiWfArR44SxA40l0UKVkdHjtDIx0mg06IcE,39
 infrahub/message_bus/operations/send/echo.py,sha256=m2z_ij7Bucl8u1E1rLAfL3fsrhKZhk_vNIvLqNErIEI,652
 infrahub/message_bus/types.py,sha256=INOsBhOsPnTSB_6SvMWw1BrnRJZyDgG2c601IjSidgs,4418
@@ -552,8 +555,7 @@ infrahub/patch/plan_reader.py,sha256=uqHNYVBBkpmVIGwaxl2tlMNJd2tPVedNZoSmFSjTdow
 infrahub/patch/plan_writer.py,sha256=x2u5Oe3ME3zXTdkz5hRnvp2EaQwt-r4LyuSATc2LkKs,4822
 infrahub/patch/queries/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 infrahub/patch/queries/base.py,sha256=wXtv4I-7l_u0kXJFbmFZZJ0_2_5yvuAJwmwiLqRq7AY,338
-infrahub/patch/queries/consolidate_duplicated_nodes.py,sha256=R4n6XmACm_wJPd44ZD26VApCavTYtS2QblRvSIeJkDM,3961
-infrahub/patch/queries/delete_duplicated_edges.py,sha256=Td5LeNFASt8JH49ufaCZFHT3G8AocvYSw-ZfndqwP1A,6302
+infrahub/patch/queries/delete_duplicated_edges.py,sha256=GjmdbkRTtZzsM2Pr53nm4AHM5MdI6oxhdaumZDcgUKU,6804
 infrahub/patch/runner.py,sha256=ZB4aOqlG77hJNtDyQtIXmi-2WgM07WSEFtWV2NItIqk,12594
 infrahub/patch/vertex_adder.py,sha256=lhWELYWlHwkopGOECSHRfj1mb0-COheibsu95r2Hwzs,2796
 infrahub/patch/vertex_deleter.py,sha256=czdb8T30k_-WSbcZUVS2-DvaN3Dp4j9ss2lAz8KN0mo,1302
@@ -644,7 +646,7 @@ infrahub/visuals.py,sha256=N62G4oOOIYNFpvMjKq7uos-oZAZybGMp57uh5jsVX9w,627
 infrahub/webhook/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 infrahub/webhook/gather.py,sha256=XNaIGiHDiMjjtSjsVbswOze7cLaL0MKJmvSbZBS-WT0,691
 infrahub/webhook/models.py,sha256=c_6Ng8BeoyUDb4TZInVruB7e8Faq_QQ8-00IVcEBwJM,10031
-infrahub/webhook/tasks.py,sha256=kQz0BzOOKUGogHKN2X_tSKYk-7rpHMQ1FKjmGugzEc0,7235
+infrahub/webhook/tasks.py,sha256=O1M60KuxXO_eDHSXMo-Y3w_F58aRQ34F6UlPPYApTfI,7294
 infrahub/webhook/triggers.py,sha256=v1dzFV4wX0GO2n5hft_qzp-oJOA2P_9Q2eTcSP-i0pk,1574
 infrahub/worker.py,sha256=JtTM-temURUbpEy-bkKJuTt-GKoiHFDrOe9SyVTIXEM,49
 infrahub/workers/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
@@ -761,18 +763,19 @@ infrahub_sdk/uuidt.py,sha256=Tz-4nHkJwbi39UT3gaIe2wJeZNAoBqf6tm3sw7LZbXc,2155
 infrahub_sdk/yaml.py,sha256=512OKgxAYPt4QLBFlucUB4GgwKJ09dzgC86pO57YFFw,5018
 infrahub_testcontainers/__init__.py,sha256=oPpmesGgYBSdKTg1L37FGwYBeao1EHury5SJGul-CT8,216
 infrahub_testcontainers/constants.py,sha256=mZ4hLvcf4rKk9wC7EId4MQxAY0sk4V99deB04N0J2bg,85
-infrahub_testcontainers/container.py,sha256=-NccmHKJw8rnGY4nSgqIJdGBrX8eObi9kq7q7mQz1zs,12308
-infrahub_testcontainers/docker-compose.test.yml,sha256=dePNK3r5DWVysrFr-t838-9LercZQOIJ8ZYOBWv7Mok,8482
+infrahub_testcontainers/container.py,sha256=CpRLoCQjN37Iv9DpMQX2WHgsDObT7_iNfE6OTWL90OE,19559
+infrahub_testcontainers/docker-compose-cluster.test.yml,sha256=noKd7NLr6GQOn1X4qukvpsRvg15unGS7BfPDG4xkKdM,12057
+infrahub_testcontainers/docker-compose.test.yml,sha256=NgQF0un3LNUWhY0-uKb56Ky9ZmCJP0dRssUPx4qZp-o,8562
 infrahub_testcontainers/haproxy.cfg,sha256=QUkG2Xu-hKoknPOeYKAkBT_xJH6U9CfIS0DTMFZJsnk,1305
-infrahub_testcontainers/helpers.py,sha256=zsvBOql5qM2OX1ybPcklqF-nzWYHkZI3Gk3KZhxWOtU,3578
+infrahub_testcontainers/helpers.py,sha256=a6qRHjeFZetkq0zQj5pgz021AI7XhArMG3ze7ZQuEHk,4288
 infrahub_testcontainers/host.py,sha256=Z4_gGoGKKeM_HGVS7SdYL1FTNGyLBk8wzicdSKHpfmM,1486
 infrahub_testcontainers/measurements.py,sha256=gR-uTasSIFCXrwvnNpIpfsQIopKftT7pBiarCgIShaQ,2214
 infrahub_testcontainers/models.py,sha256=ASYyvl7d_WQz_i7y8-3iab9hwwmCl3OCJavqVbe8nXU,954
 infrahub_testcontainers/performance_test.py,sha256=hvwiy6tc_lWniYqGkqfOXVGAmA_IV15VOZqbiD9ezno,6149
-infrahub_testcontainers/plugin.py,sha256=g24SMg4EAqVe2N8i9F66EV34cNqIdDU4mRP7OeOJO1w,5381
+infrahub_testcontainers/plugin.py,sha256=I3RuZQ0dARyKHuqCf0y1Yj731P2Mwf3BJUehRJKeWrs,5645
 infrahub_testcontainers/prometheus.yml,sha256=610xQEyj3xuVJMzPkC4m1fRnCrjGpiRBrXA2ytCLa54,599
-infrahub_server-1.2.11.dist-info/LICENSE.txt,sha256=TfPDBt3ar0uv_f9cqCDMZ5rIzW3CY8anRRd4PkL6ejs,34522
-infrahub_server-1.2.11.dist-info/METADATA,sha256=Yg5ituzKXHWEo3K_-WUf45_fpZU5oVRm8HG6L13B1vE,8194
-infrahub_server-1.2.11.dist-info/WHEEL,sha256=Nq82e9rUAnEjt98J6MlVmMCZb-t9cYE2Ir1kpBmnWfs,88
-infrahub_server-1.2.11.dist-info/entry_points.txt,sha256=UXIeFWDsrV-4IllNvUEd6KieYGzQfn9paga2YyABOQI,393
-infrahub_server-1.2.11.dist-info/RECORD,,
+infrahub_server-1.2.12.dist-info/LICENSE.txt,sha256=TfPDBt3ar0uv_f9cqCDMZ5rIzW3CY8anRRd4PkL6ejs,34522
+infrahub_server-1.2.12.dist-info/METADATA,sha256=LB7mZe_ufD6CAEphVR-SojpySkkZd75NxwQ1n3AOVPw,8206
+infrahub_server-1.2.12.dist-info/WHEEL,sha256=b4K_helf-jlQoXBBETfwnf4B04YC67LOev0jo4fX5m8,88
+infrahub_server-1.2.12.dist-info/entry_points.txt,sha256=UXIeFWDsrV-4IllNvUEd6KieYGzQfn9paga2YyABOQI,393
+infrahub_server-1.2.12.dist-info/RECORD,,

{infrahub_server-1.2.11.dist-info → infrahub_server-1.2.12.dist-info}/WHEEL

@@ -1,4 +1,4 @@
 Wheel-Version: 1.0
-Generator: poetry-core 1.9.1
+Generator: poetry-core 2.1.3
 Root-Is-Purelib: true
 Tag: py3-none-any