From 2c5f04476cffe74be3cb8b9c6882b53446ea6479 Mon Sep 17 00:00:00 2001 From: Russ Cox Date: Fri, 6 Jun 2014 22:07:11 -0400 Subject: [release-branch.go1.3] doc: fix happens-before rules for buffered channels ??? CL 101980047 / 12c9a9ff50d8 doc: fix happens-before rules for buffered channels The current wording is reversed in 2 places. Not sure how it got 4 LGTMs (mine was there as well). Update issue 6242. LGTM=dan.kortschak, r, rsc R=golang-codereviews, 0xjnml, dan.kortschak, r, rsc CC=golang-codereviews https://codereview.appspot.com/101980047 ??? LGTM=iant R=golang-codereviews, iant CC=golang-codereviews, r https://codereview.appspot.com/106830047 --- doc/go_mem.html | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) diff --git a/doc/go_mem.html b/doc/go_mem.html index 69e7c8ce7..2ea1ded7a 100644 --- a/doc/go_mem.html +++ b/doc/go_mem.html @@ -1,6 +1,6 @@ @@ -275,17 +275,17 @@ crash, or do something else.)

-The kth send on a channel with capacity C happens before the k+Cth receive from that channel completes. +The kth receive on a channel with capacity C happens before the k+Cth send from that channel completes.

This rule generalizes the previous rule to buffered channels. It allows a counting semaphore to be modeled by a buffered channel: -the number of items in the channel corresponds to the semaphore count, -the capacity of the channel corresponds to the semaphore maximum, +the number of items in the channel corresponds to the number of active uses, +the capacity of the channel corresponds to the maximum number of simultaneous uses, sending an item acquires the semaphore, and receiving an item releases the semaphore. -This is a common idiom for rate-limiting work. +This is a common idiom for limiting concurrency.

-- cgit v1.2.1