cleanups

[wimlib] / src / lzx-compress.c

diff --git a/src/lzx-compress.c b/src/lzx-compress.c
index 7510457488b5025be14faf52ce6c8210e1410e49..db0e7c10f0714b2272626a77abdd71bd97fb7b2c 100644 (file)
--- 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
  * 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
  *
  * 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