return true
			}
		}
	}
	return false
}

func (h *manyCollection[I, O]) _internalHandler() {
}

func (h *manyCollection[I, O]) GetKey(k Key[O]) (res *O) {
	h.mu.Lock()
	defer h.mu.Unlock()
	rf, f := h.collectionState.outputs[k]
	if f {
		return &rf
	}
	return nil
}

func (h *manyCollection[I, O]) List() (res []O) {
	h.mu.Lock()
	defer h.mu.Unlock()

Additionally, if a single `Pod` changes we only recompute one `SimplePod`.

Above we have a one-to-one mapping of input and output.
We may have one-to-many mappings, though.
In these cases, usually its best to use a `ManyCollection`.
Like the above examples, its *possible* to express these as normal `Collection`s, but likely inefficient.

Example computing a list of all container names across all pods:

```go