--- a/Queue.st	Wed Nov 26 09:50:28 2014 +0100
+++ b/Queue.st	Wed Nov 26 09:50:35 2014 +0100
@@ -36,8 +36,9 @@
 
 documentation
 "
-    Queues provides a simple implementation of a queue, 
+    Queues provide a simple implementation of a queue, 
     where elements are added at one end and removed at the other.
+
     Access protocol is somewhat like a streams protocol, i.e. access
     is by #nextPut: and #next.
     The queue is created with a size argument, defining how many elements
@@ -51,10 +52,10 @@
     on write when full or on read when empty.
 
     [Implementation note:]
-        All of queues functionality is also provided by the OrderedCollection (OC)
+        All of queue's functionality is also provided by the OrderedCollection (OC)
         class; OC could easily simulate a queue (using #addLast: / #removeFirst).
-        The reason for providing Queue is not any speed advantage (actually,
-        OC seems to be a tiny bit faster). 
+        The reason for providing Queue is not any speed advantage 
+        (actually, OC seems to be even a tiny bit faster). 
         The point is that an implementation of SharedQueue as a subclass of OC
         would require that many OC methods had to be blocked and/or redefined in
         such a subclass, to care for simultaneous access.
@@ -507,10 +508,10 @@
 !Queue class methodsFor:'documentation'!
 
 version
-    ^ '$Header: /cvs/stx/stx/libbasic2/Queue.st,v 1.37 2014-10-20 16:23:54 stefan Exp $'
+    ^ '$Header: /cvs/stx/stx/libbasic2/Queue.st,v 1.38 2014-11-26 08:50:35 cg Exp $'
 !
 
 version_CVS
-    ^ '$Header: /cvs/stx/stx/libbasic2/Queue.st,v 1.37 2014-10-20 16:23:54 stefan Exp $'
+    ^ '$Header: /cvs/stx/stx/libbasic2/Queue.st,v 1.38 2014-11-26 08:50:35 cg Exp $'
 ! !