I like that. I think it's is quite a smart way of doing it, I don't think you need to check both maps when choosing a key. Once you've found a candidate key in one map, you can test the other map and if it *does* exist then the two maps aren't equal. You've then saved the insertion and deletion step. I would also prefer to use rand.Int() rather than a linear search.
https://go.dev/play/p/ftBGgQMuvvC On Tuesday, 18 July 2023 at 15:35:38 UTC+1 Jochen Voss wrote: > Dear all, > > To implement the "eq" operator in a simple PostScript interpreter, I need > to determine whether two maps are the same object. > > This can be done by adding a new element to one map, and checking whether > the new entry also appears in the second map, but as you can imagine, the > resulting code is quite ugly. See https://go.dev/play/p/AfembYDt3en for > an implementation of this idea. > > Is there a better way? > > Many thanks, > Jochen > > -- You received this message because you are subscribed to the Google Groups "golang-nuts" group. To unsubscribe from this group and stop receiving emails from it, send an email to golang-nuts+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/golang-nuts/3217b6a4-5c22-43ba-b8a6-6c71745c6d65n%40googlegroups.com.
