Hi Kurtis, I am aware that you are talking about the happen-before algorithm which is basically the vector clock.
However, this discussion aims for the discussion regarding this proposal: "the close statement should happens-before select statement that starts choosing which case should be executing, and select a closed channel with the highest priority to prevent another receive case being executed once more." We are not entering write any code before we confirm that it is worthy. On Sunday, September 8, 2019 at 5:46:43 PM UTC+2, Kurtis Rader wrote: > > On Sun, Sep 8, 2019 at 8:40 AM changkun <euryu...@gmail.com <javascript:>> > wrote: > >> The provided code snipped on my machine can result in different outputs, >> which basically shows that it could occur in any order. >> > > Yes > > >> The randomization mechanism in select statement made the verification >> hard. Logically, my argument is rigorous >> > > No, it isn't. You need to learn a lot more about concurrency and race > conditions. > > -- > Kurtis Rader > Caretaker of the exceptional canines Junior and Hank > -- 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/d1c412e6-c775-49a6-8d1d-c417497dc9be%40googlegroups.com.
