summaryrefslogtreecommitdiff
path: root/doc
diff options
context:
space:
mode:
authorBurak Emir <emir@epfl.ch>2005-10-17 16:18:31 +0000
committerBurak Emir <emir@epfl.ch>2005-10-17 16:18:31 +0000
commitd603b33c531caee4250a0c56c18c589fdb69331e (patch)
tree829779ac05b0a41182d0f72a52b464d758a077ce /doc
parentf029fc6649ec5c510a6f5958d1f045682603196c (diff)
downloadscala-d603b33c531caee4250a0c56c18c589fdb69331e.tar.gz
scala-d603b33c531caee4250a0c56c18c589fdb69331e.tar.bz2
scala-d603b33c531caee4250a0c56c18c589fdb69331e.zip
fixed Channel::lastWritten = written
Diffstat (limited to 'doc')
-rw-r--r--doc/reference/ExamplesPart.tex4
1 files changed, 2 insertions, 2 deletions
diff --git a/doc/reference/ExamplesPart.tex b/doc/reference/ExamplesPart.tex
index 4be32641aa..c90ecffa24 100644
--- a/doc/reference/ExamplesPart.tex
+++ b/doc/reference/ExamplesPart.tex
@@ -6383,7 +6383,7 @@ the node which conceptually forms the top of the list.
Empty linked lists start with a dummy node, whose successor is \code{null}.
The channel class uses a linked list to store data that has been sent
-but not read yet. In the opposite direction, a threads that
+but not read yet. At the opposite end, threads that
wish to read from an empty channel, register their presence by
incrementing the \code{nreaders} field and waiting to be notified.
\begin{lstlisting}
@@ -6395,7 +6395,7 @@ class Channel[a] {
var next: LinkedList[a] = null;
}
private var written = new LinkedList[a];
- private var lastWritten = new LinkedList[a];
+ private var lastWritten = written;
private var nreaders = 0;
def write(x: a) = synchronized {