RelationGraph.updated_erased: def of bendvy-ecs-core@0.1.0.3 Import: import bendvy-ecs-core@0.1.0.3/relation_graph.bend as RelationGraph Lines 118-121 of bendvy-ecs-core@0.1.0.3/relation_graph.bend: https://jend.leeeet.dev/read.txt?path=bendvy-ecs-core@0.1.0.3/relation_graph.bend&start_line=118&end_line=121 import Base import entity_key.bend as K import relation_types.bend as T def updated_erased(-S: Data,same: Bool,+edges: List<&2,T.Edge>,inverses: List<&2,T.Inverse>,+descriptor: T.Descriptor,+source: K.Key,+target: K.Key) -> T.Graph: match same: case True{}: T.Graph{edges,inverses} case False{}: T.Graph{List.append(&2,T.Edge,remove_edge_erased(S,edges,descriptor,source),[T.Edge{descriptor,source,target}]),inverse_add_erased(S,remove_previous_erased(S,target_edges_erased(S,edges,descriptor,source),inverses,descriptor,source),descriptor,target,source)} Uses (12): https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List.append https://jend.leeeet.dev/definition.txt?path=bendvy-ecs-core@0.1.0.3/entity_key.bend&name=Key https://jend.leeeet.dev/definition.txt?path=bendvy-ecs-core@0.1.0.3/relation_graph.bend&name=inverse_add_erased https://jend.leeeet.dev/definition.txt?path=bendvy-ecs-core@0.1.0.3/relation_graph.bend&name=remove_edge_erased https://jend.leeeet.dev/definition.txt?path=bendvy-ecs-core@0.1.0.3/relation_graph.bend&name=remove_previous_erased https://jend.leeeet.dev/definition.txt?path=bendvy-ecs-core@0.1.0.3/relation_graph.bend&name=target_edges_erased https://jend.leeeet.dev/definition.txt?path=bendvy-ecs-core@0.1.0.3/relation_types.bend&name=Descriptor https://jend.leeeet.dev/definition.txt?path=bendvy-ecs-core@0.1.0.3/relation_types.bend&name=Edge https://jend.leeeet.dev/definition.txt?path=bendvy-ecs-core@0.1.0.3/relation_types.bend&name=Graph https://jend.leeeet.dev/definition.txt?path=bendvy-ecs-core@0.1.0.3/relation_types.bend&name=Inverse