X-Git-Url: https://wimlib.net/git/?p=wimlib;a=blobdiff_plain;f=src%2Flzx-compress.c;fp=src%2Flzx-compress.c;h=db0e7c10f0714b2272626a77abdd71bd97fb7b2c;hp=7510457488b5025be14faf52ce6c8210e1410e49;hb=91b0f909393476f39ed5865dfe4b27c244ba3c48;hpb=2e001b0f49e3d90443c5b782b1256adfee7841b4

diff --git a/src/lzx-compress.c b/src/lzx-compress.c
index 75104574..db0e7c10 100644
--- a/src/lzx-compress.c
+++ b/src/lzx-compress.c
@@ -109,7 +109,7 @@
  * that position at previous positions in the window.  With LZX, the minimum
  * match length is 2 and the maximum match length is 257.  The only restriction
  * on offsets is that LZX does not allow the last 2 bytes of the window to match
- * the the beginning of the window.
+ * the beginning of the window.
  *
  * There are a number of algorithms that can be used for this, including hash
  * chains, binary trees, and suffix arrays.  Binary trees generally work well