RelationGraph.inverse_entries_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 39-42 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=39&end_line=42

import Base
import entity_key.bend as K
import relation_types.bend as T

def inverse_entries_erased(-S: Data,entries: List<&2,T.Inverse<S>>,+descriptor: T.Descriptor<S>,+target: K.Key) -> List<&2,K.Key>:
  match entries:
    case []: []
    case T.Inverse{other,id,sources} <> rest: chosen_inverse(Bool.and(U32.is_eq(key_erased(S,other),key_erased(S,descriptor)),K.equal(id,target)),sources,_ => inverse_entries_erased(S,rest,descriptor,target))

Uses (9):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool.and
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32.is_eq
  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/entity_key.bend&name=equal
  https://jend.leeeet.dev/definition.txt?path=bendvy-ecs-core@0.1.0.3/relation_graph.bend&name=chosen_inverse
  https://jend.leeeet.dev/definition.txt?path=bendvy-ecs-core@0.1.0.3/relation_graph.bend&name=key_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=Inverse