Repository navigation
Release v19.134.0
A graph projection mapping can now name a collection property of the event, and its key, source, target, identity and property expressions run once per item, so one event can produce a node or an edge for every item it carries.
Added
ForEachon the node and edgeFromandRemovedWithgraph definitions, in the kernel concepts, the gRPC contracts and their converters. The items' properties are addressed ascollection.property; an absent or empty collection yields nothing; stored definitions without it behave as before.- Documentation of the collection form in the graph projection guide.
Changed
- The graph changeset builder maps each item through the existing resolvers by giving it the event content with the collection replaced by that item, so counters, identity and every sink behave unchanged and operations stay idempotent on replay.