X-Git-Url: https://wimlib.net/git/?p=wimlib;a=blobdiff_plain;f=src%2Flzx.h;h=027186976b675842650c0f810067fa719e8973e9;hp=b44fecffb74c0c1710923bb45b75e5699a257703;hb=5cdd60306facd14cc9dcc24471386451294ca73c;hpb=6f77434ea6ff1407603410e28d1edb966c40e568

diff --git a/src/lzx.h b/src/lzx.h
index b44fecff..02718697 100644
--- a/src/lzx.h
+++ b/src/lzx.h
@@ -40,7 +40,7 @@
  * read_code_lens() function and built using the make_decode_table() function.
  * The decode table is not a real tree but rather a table that we can index by
  * some number of bits (*_TABLEBITS) of the input to quickly look up the symbol
- * corresponding to a Huffman code. 
+ * corresponding to a Huffman code.
  *
  * The ALIGNED tree is only present on ALIGNED blocks.
  *
@@ -83,7 +83,7 @@ struct lru_queue {
 	int R2;
 };
 
-extern int lzx_decompress(const void *compressed_data, uint compressed_len, 
+extern int lzx_decompress(const void *compressed_data, uint compressed_len,
 			  void *uncompressed_data, uint uncompressed_len);
 
 extern int lzx_compress(const void *uncompressed_data, uint uncompressed_len,