Update README.md

README.md

@@ -6,7 +6,7 @@ High performance C++ implementation of producer/consumer queue architecture
 * choose either single or multi-threaded producers
 * choose either single or multi-threaded consumers
 * memory allocations are minimized or avoided entirely: addition to the queues is done by assignment copying (especially useful for stack allocated objects and especially useful to avoid reference counting or other memory tracking).  Removals from the queue are non-copy: they simply use a reference to the entry in the queue itself, and increment a queue counter when done to free up the queue location.
-* the circular queue resizes as necessary if consumers are not keeping pace with producers, up until a max size limit upon which the producers block as necessary
+* The queues are circular but resize as necessary if consumers are not keeping pace with producers, up until a max size limit upon which the producers will block as necessary
 * designed to be fast
 * easy to customize to enqueue any data types.  See the sample folder for an implementation using two data types that can be enqueued (SampleQueueEntry1 and 2), and some test code which starts up writer threads, a queue consumer engine with multiple readers, a single consumer class SampleQueueEntryConsumer, and adds numerous entries to the queue for consumption in testQueues.