[games/kpat] /: Proofreading

[Marius P]

Git commit 70a7651e530de71f731834460cddddb63ab0c78c by Marius P.
Committed on 09/04/2024 at 12:24.
Pushed by redstrate into branch 'master'.

Proofreading

M  +1    -1    doc/index.docbook
M  +1    -1    src/mod3.cpp
M  +2    -2    src/patsolve/patsolve.cpp

https://invent.kde.org/games/kpat/-/commit/70a7651e530de71f731834460cddddb63ab0c78c

diff --git a/doc/index.docbook b/doc/index.docbook
index fa5a69cb..3312b8ad 100644
--- a/doc/index.docbook
+++ b/doc/index.docbook
@@ -70,7 +70,7 @@
 	<para>This documentation describes the game of &kpatience; version 21.04</para>
 </abstract>
 
-<!--List of relevan keywords-->
+<!--List of relevant keywords-->
 <keywordset>
 	<keyword>KDE</keyword> <!-- do not change this! -->
 	<keyword>kdegames</keyword> <!-- do not change this! -->
diff --git a/src/mod3.cpp b/src/mod3.cpp
index fa89f4d4..070fa0b2 100644
--- a/src/mod3.cpp
+++ b/src/mod3.cpp
@@ -59,7 +59,7 @@ void Mod3::initialize()
     const qreal bottomRowY = 3 * dist_y + 0.2;
     const qreal rightColumX = 8 * dist_x + 0.8;
 
-    // This patience uses 2 deck of cards.
+    // This patience uses 2 decks of cards.
     setDeckContents(2);
 
     talon = new PatPile(this, 0, QStringLiteral("talon"));
diff --git a/src/patsolve/patsolve.cpp b/src/patsolve/patsolve.cpp
index 37f85431..11a0ecf7 100644
--- a/src/patsolve/patsolve.cpp
+++ b/src/patsolve/patsolve.cpp
@@ -476,8 +476,8 @@ void Solver<NumberPiles>::free_buckets(void)
     }
 }
 
-/* Solve patience games.  Prioritized breadth-first search.  Simple breadth-
-first uses exponential memory.  Here the work queue is kept sorted to give
+/* Solve patience games. Prioritized breadth-first search. Simple breadth-
+first uses exponential memory. Here the work queue is kept sorted to give
 priority to positions with more cards out, so the solution found is not
 guaranteed to be the shortest, but it'll be better than with a depth-first
 search. */