2 files changed, 6 insertions, 6 deletions
diff --git a/examples/corelib/threads/doc/src/mandelbrot.qdoc b/examples/corelib/threads/doc/src/mandelbrot.qdoc
index b8a5930d8c..23633e17dc 100644
--- a/examples/corelib/threads/doc/src/mandelbrot.qdoc
+++ b/examples/corelib/threads/doc/src/mandelbrot.qdoc
@@ -13,11 +13,11 @@
 
     \image mandelbrot-example.png Screenshot of the Mandelbrot example
 
-    The heavy computation here is the Mandelbrot set, probably the
-    world's most famous fractal. These days, while sophisticated
-    programs such as \l{http://matek.hu/xaos/doku.php}{XaoS} that provide real-time zooming in the
-    Mandelbrot set, the standard Mandelbrot algorithm is just slow
-    enough for our purposes.
+    The heavy computation here is the Mandelbrot set, probably the world's most
+    famous fractal. These days, while sophisticated programs, such as
+    \l{https://xaos-project.github.io/}{XaoS}, provide real-time zooming in
+    the Mandelbrot set, the standard Mandelbrot algorithm is just slow enough
+    for our purposes.
 
     In real life, the approach described here is applicable to a
     large set of problems, including synchronous network I/O and
diff --git a/examples/corelib/threads/doc/src/waitconditions.qdoc b/examples/corelib/threads/doc/src/waitconditions.qdoc
index 90f911aab3..ae9e767c13 100644
--- a/examples/corelib/threads/doc/src/waitconditions.qdoc
+++ b/examples/corelib/threads/doc/src/waitconditions.qdoc
@@ -109,7 +109,7 @@
     thread is the only one that can do anything; the consumer is
     blocked waiting for the \c bufferNotEmpty condition to be
     signalled (\c numUsedBytes is 0). Once the producer has put one
-    byte in the buffer, \c numUsedBytes is \c BufferSize - 1 and the
+    byte in the buffer, \c numUsedBytes is strictly greater than 0, and the
     \c bufferNotEmpty condition is signalled. At that point, two
     things can happen: Either the consumer thread takes over and
     reads that byte, or the producer gets to produce a second byte.