Re:Representing State as Interfaces in Go
by ReleaseCandidat on Thursday March 28, 2024 @02:24PM
(#39855520)
> Maybe I misunderstand the example, but in what way is that "the whole point"?
I wanted to express that having functions
f(a) -> b {}
f(b) -> c {}
f(c) -> d {}
...
would be quite trivial.I would say that the whole point of the builder pattern is _not_ having an ordering of the "chained" functions.
Re:Representing State as Interfaces in Go
by iainmerrick on Thursday March 28, 2024 @04:33PM
(#39856976)
Isn’t the point of the builder pattern to separate the builder object (which is mutable) from the final built object (which can be immutable)?
That seems like the same thing as the example in the original post.
Re:Representing State as Interfaces in Go
by ReleaseCandidat on Thursday March 28, 2024 @05:03PM
(#39857289)
For me a "builder pattern" is also something like this with immutable data:
built = empty().configA(a).configB(b). ... .configZ(z)
where each config?(this : T, k : K) -> T
For me the defining feature of a builder is the (possibility of a) gradual "configuration" (or whatever) of the data structure being "built". A state change is something else in my opinion, but of course, the difference between a "state change" and a "configuration" (which does change state) isn't a clear one, so if for you that is still a builder, that's fine for me too ;).
The given example looks like a Builder pattern. Although that name smells strongly of Java, so Go users might prefer to avoid it. :)