Description
π We can now observe struct, optional, and enum state in the Composable Architecture, but what
about collections? Let's explore what it takes to get rid of the `ForEachStore` wrapper view
for a vanilla `ForEach` view instead, while still observing updates to collection state in the
most minimal way possible.
π We've studied `Equatable` and `Hashable`, their laws, and saw how value types as simple bags of data easily conform via "structural" equality. What about reference types? Reference types are an amalgamation of data _and_ behavior, and that data can be mutated in place at any time, so how can...
Published 10/21/24
π While the documentation for `Equatable` discusses the notions of "equivalence relation" _and_ "substitutability", there are conformances in the Standard Library that run afoul, but for pragmatic reasons. Letβs explore them and then dive deeper into a related protocol: `Hashable`.
Published 10/14/24