(keys: ReadonlyArray<unknown>)
| 126 | if (atoms.length === 0) return |
| 127 | yield* Effect.forEach(atoms, (atom) => Effect.sync(() => defaultRegistry.refresh(atom)), { |
| 128 | discard: true |
| 129 | }) |
| 130 | }) |
| 131 | .pipe(Effect.orDie) |
| 132 | |
| 133 | /** |
| 134 | * Invalidate the given keys and AWAIT the result. `keyAtoms` resolves all matching hierarchical |
| 135 | * keys to a deduplicated set of query atoms. Refresh that set directly: sending the whole key set |
| 136 | * through `Reactivity.invalidate` invokes one atom's registered callback once per matching key, |
| 137 | * repeatedly superseding the same fetch when a mutation carries many row/prefix keys. |
| 138 | * |
searching dependent graphs…