Documentation
¶
Overview ¶
Package protoreach provides a predicate-parameterized tree-walk over proto message descriptors. It answers one question: "does any field in this message's subtree satisfy a caller-supplied predicate?" The walk handles cycle-guarding (self-referential messages), diamond-caching (shared sub-messages evaluated once), and skips well-known google.protobuf.* types, lists, and maps.
Designed for protoc-gen-servora-* plugins that need transitive reachability decisions at codegen time (e.g. "does this message need a cascading ApplyDefaults?" or "does it need a cascading CheckRequired?").
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
func IsWellKnown ¶
func IsWellKnown(md protoreflect.MessageDescriptor) bool
IsWellKnown reports whether md is in the google.protobuf.* namespace.
func NeedsCascade ¶
func NeedsCascade( md protoreflect.MessageDescriptor, pred func(protoreflect.FieldDescriptor) bool, memo map[protoreflect.FullName]bool, ) bool
NeedsCascade reports whether md must carry a generated cascade method based on pred. Returns true when any field in md satisfies pred, or when any singular non-well-known message-typed field transitively does.
memo doubles as the recursion guard and the result cache: an entry is written as false on entry (breaking self-referential cycles at the back-edge) and overwritten with the real result on exit, so shared (diamond) subtrees are evaluated correctly. Callers pass a fresh map.
Oneof members ARE traversed for reachability. However, emitters must decide independently whether to allocate them (ApplyDefaults must not; CheckRequired only checks if set).
Types ¶
This section is empty.
Source Files