Skip to content

Commit 8eecfcc

Browse files
committed
Fixed some misspellings and grammatical stuff.
1 parent 217112d commit 8eecfcc

File tree

1 file changed

+12
-12
lines changed

1 file changed

+12
-12
lines changed

index.html

Lines changed: 12 additions & 12 deletions
Original file line numberDiff line numberDiff line change
@@ -351,7 +351,7 @@ <h2 id="synchronous-asynchronous-execution">Synchronous &amp; Asynchronous Execu
351351
Task 2 done
352352
</pre></code></p>
353353
<p>In the synchronous case all the tasks are run sequentially,
354-
which results in the main programming <em>blocking</em> (
354+
which results in the main program <em>blocking</em> (
355355
i.e. pausing the execution of the main program )
356356
while each task executes.</p>
357357
<p>The important parts of the program are the
@@ -409,7 +409,7 @@ <h2 id="synchronous-asynchronous-execution">Synchronous &amp; Asynchronous Execu
409409
<h2 id="determinism">Determinism</h2>
410410
<p>As mentioned previously, greenlets are deterministic. Given the same
411411
configuration of greenlets and the same set of inputs and they always
412-
produce the same output. For example lets spread a task across a
412+
produce the same output. For example let's spread a task across a
413413
multiprocessing pool compared to a gevent pool.</p>
414414
<pre>
415415
<code class="python">
@@ -734,7 +734,7 @@ <h2 id="events">Events</h2>
734734
</code>
735735
</pre>
736736

737-
<p>A extension of the Event object is the AsyncResult which
737+
<p>An extension of the Event object is the AsyncResult which
738738
allows you to send a value along with the wakeup call. This is
739739
sometimes called a future or a deferred, since it holds a
740740
reference to a future value that can be set on an arbitrary time
@@ -835,7 +835,7 @@ <h2 id="queues">Queues</h2>
835835
counterpart, <code>put_nowait</code> and
836836
<code>get_nowait</code> which will not block, but instead raise
837837
either <code>gevent.queue.Empty</code> or
838-
<code>gevent.queue.Full</code> in the operation is not possible.</p>
838+
<code>gevent.queue.Full</code> if the operation is not possible.</p>
839839
<p>In this example we have the boss running simultaneously to the
840840
workers and have a restriction on the Queue that it can contain no
841841
more than three elements. This restriction means that the <code>put</code>
@@ -911,7 +911,7 @@ <h2 id="queues">Queues</h2>
911911
</pre></code></p>
912912
<h2 id="groups-and-pools">Groups and Pools</h2>
913913
<p>A group is a collection of running greenlets which are managed
914-
and scheduled together as group. It also doubles as parallel
914+
and scheduled together as group. It also doubles as a parallel
915915
dispatcher that mirrors the Python <code>multiprocessing</code> library.</p>
916916
<pre><code class="python">
917917
import gevent
@@ -946,9 +946,9 @@ <h2 id="groups-and-pools">Groups and Pools</h2>
946946
fizz
947947
fizz
948948
</pre></code></p>
949-
<p>This is very usefull for managing groups of asynchronous tasks
950-
that.</p>
951-
<p>As mentioned above Group also provides an API for dispatching
949+
<p>This is very useful for managing groups of asynchronous tasks
950+
that run in parallel.</p>
951+
<p>As mentioned above, Group also provides an API for dispatching
952952
jobs to grouped greenlets and collecting their results in various
953953
ways.</p>
954954
<pre><code class="python">
@@ -1053,8 +1053,8 @@ <h2 id="groups-and-pools">Groups and Pools</h2>
10531053
<h2 id="locks-and-semaphores">Locks and Semaphores</h2>
10541054
<p>A semaphore is a low level synchronization primitive that allows
10551055
greenlets to coordinate and limit concurrent access or execution. A
1056-
semaphore exposes two methods, <code>acquire</code> and <code>release</code> The
1057-
difference between the number of times and a semaphore has been
1056+
semaphore exposes two methods, <code>acquire</code> and <code>release</code>.
1057+
The difference between the number of times and a semaphore has been
10581058
acquired and released is called the bound of the semaphore. If a
10591059
semaphore bound reaches 0 it will block until another greenlet
10601060
releases its acquisition.</p>
@@ -1096,7 +1096,7 @@ <h2 id="locks-and-semaphores">Locks and Semaphores</h2>
10961096
Worker 5 acquired semaphore
10971097
Worker 5 released semaphore
10981098
</pre></code></p>
1099-
<p>A semaphore with bound of 1 is known as a Lock. it provides
1099+
<p>A semaphore with bound of 1 is known as a Lock. It provides
11001100
exclusive execution to one greenlet. They are often used to
11011101
ensure that resources are only in use at one time in the context
11021102
of a program.</p>
@@ -1173,7 +1173,7 @@ <h2 id="gevent-zeromq">Gevent ZeroMQ</h2>
11731173
distributed applications. </p>
11741174
<p>ZeroMQ provides a variety of socket primitives, the simplest of
11751175
which being a Request-Response socket pair. A socket has two
1176-
methods of interest <code>send</code> and <code>recv</code>, both of which are
1176+
methods of interest: <code>send</code> and <code>recv</code>, both of which are
11771177
normally blocking operations. But this is remedied by a briliant
11781178
library by <a href="https://github.com/traviscline">Travis Cline</a> which
11791179
uses gevent.socket to poll ZeroMQ sockets in a non-blocking

0 commit comments

Comments
 (0)
pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy