Skip to content

Commit f9b9e93

Browse files
committed
Rewrote a few sentences
1 parent b976fbb commit f9b9e93

5 files changed

+11
-12
lines changed

03-anatomy.rst

+3-3
Original file line numberDiff line numberDiff line change
@@ -379,9 +379,9 @@ you don't need `X` nor `Y` afterwards, an alternate solution would be:
379379
>>> np.multiply(Y, 2, out=Y)
380380
>>> np.add(X, Y, out=X)
381381
382-
Using this alternate solution, no temporary array has been created. Problem is
383-
that there are many other cases where such copies needs to be created and this
384-
impact the performance like demonstrated on the example below:
382+
Using this alternate solution, no temporary array has been created. The problem
383+
is that there are many other cases where such copies need to be created and
384+
this impacts the performance like demonstrated in the example below:
385385
386386
.. code:: pycon
387387

04-code-vectorization.rst

+2-2
Original file line numberDiff line numberDiff line change
@@ -111,8 +111,8 @@ dead. Every cell interacts with its eight neighbours, which are the cells that
111111
are directly horizontally, vertically, or diagonally adjacent. At each step in
112112
time, the following transitions occur:
113113

114-
1. Any live cell with fewer than two live neighbours dies, as if by needs
115-
caused by underpopulation.
114+
1. Any live cell with fewer than two live neighbours dies, as if by
115+
underpopulation.
116116
2. Any live cell with more than three live neighbours dies, as if by
117117
overcrowding.
118118
3. Any live cell with two or three live neighbours lives, unchanged, to the

05-problem-vectorization.rst

+3-3
Original file line numberDiff line numberDiff line change
@@ -104,9 +104,9 @@ compute it only once:
104104
result += X[i]*Ysum
105105
return result
106106
107-
Not so bad, we have removed the inner loop, meaning with transform a
108-
:math:`O(n^2)` complexity into :math:`O(n)` complexity. Using the same
109-
approach, we can now write:
107+
Not so bad, we have removed the inner loop, transforming :math:`O(n^2)`
108+
complexity into :math:`O(n)` complexity. Using the same approach, we can now
109+
write:
110110

111111
.. code:: python
112112

06-custom-vectorization.rst

+2-2
Original file line numberDiff line numberDiff line change
@@ -64,11 +64,11 @@ others) for the creation of a `TypedList` object.
6464
whose __array__ method returns an array, or any (nested) sequence.
6565
6666
sizes: int or 1-D array
67-
If `itemsize is an integer, N, the array will be divided
67+
If `itemsize` is an integer, N, the array will be divided
6868
into elements of size N. If such partition is not possible,
6969
an error is raised.
7070
71-
If `itemsize` is 1-D array, the array will be divided into
71+
If `itemsize` is a 1-D array, the array will be divided into
7272
elements whose successive sizes will be picked from itemsize.
7373
If the sum of itemsize values is different from array size,
7474
an error is raised.

07-beyond-numpy.rst

+1-2
Original file line numberDiff line numberDiff line change
@@ -380,8 +380,7 @@ Glumpy
380380

381381
`Glumpy <http://glumpy.github.io>`_ is an OpenGL-based interactive
382382
visualization library in Python. Its goal is to make it easy to create fast,
383-
scalable, beautiful, interactive and dynamic visualizations. The main
384-
documentation for the site is organized into a couple of sections:
383+
scalable, beautiful, interactive and dynamic visualizations.
385384

386385

387386
Conclusion

0 commit comments

Comments
 (0)