summaryrefslogtreecommitdiff
path: root/doc/source/reference/random
diff options
context:
space:
mode:
authorDimitri Papadopoulos <3234522+DimitriPapadopoulos@users.noreply.github.com>2022-01-13 10:56:00 +0100
committerDimitri Papadopoulos <3234522+DimitriPapadopoulos@users.noreply.github.com>2022-01-13 11:29:51 +0100
commit58dbe260a2e41c31f1ab03e1abdb1f01da4c1edc (patch)
tree8aada9a88cb8718941d16faafb2749462f8325e5 /doc/source/reference/random
parent813a0c11186ded0b5caeb853fd2b22fb9addd511 (diff)
downloadnumpy-58dbe260a2e41c31f1ab03e1abdb1f01da4c1edc.tar.gz
MAINT, DOC: discard repeated words
Diffstat (limited to 'doc/source/reference/random')
-rw-r--r--doc/source/reference/random/parallel.rst4
1 files changed, 2 insertions, 2 deletions
diff --git a/doc/source/reference/random/parallel.rst b/doc/source/reference/random/parallel.rst
index 7f0207bde..bff955948 100644
--- a/doc/source/reference/random/parallel.rst
+++ b/doc/source/reference/random/parallel.rst
@@ -28,8 +28,8 @@ streams.
`~SeedSequence` avoids these problems by using successions of integer hashes
with good `avalanche properties`_ to ensure that flipping any bit in the input
-input has about a 50% chance of flipping any bit in the output. Two input seeds
-that are very close to each other will produce initial states that are very far
+has about a 50% chance of flipping any bit in the output. Two input seeds that
+are very close to each other will produce initial states that are very far
from each other (with very high probability). It is also constructed in such
a way that you can provide arbitrary-sized integers or lists of integers.
`~SeedSequence` will take all of the bits that you provide and mix them