Merging upstream version 1.24.1.

Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>

3 files changed, 22 insertions, 22 deletions

diff --git a/doc/lzip.1 b/doc/lzip.1
index 9053c43..9d711e8 100644
--- a/doc/lzip.1
+++ b/doc/lzip.1
@@ -1,5 +1,5 @@
 .\" DO NOT MODIFY THIS FILE!  It was generated by help2man 1.49.2.
-.TH LZIP "1" "January 2024" "lzip 1.24" "User Commands"
+.TH LZIP "1" "March 2024" "lzip 1.24.1" "User Commands"
 .SH NAME
 lzip \- reduces the size of files
 .SH SYNOPSIS
diff --git a/doc/lzip.info b/doc/lzip.info
index 1e23532..04f81c4 100644
--- a/doc/lzip.info
+++ b/doc/lzip.info
@@ -11,7 +11,7 @@ File: lzip.info,  Node: Top,  Next: Introduction,  Up: (dir)
 Lzip Manual
 ***********
 
-This manual is for Lzip (version 1.24, 26 January 2024).
+This manual is for Lzip (version 1.24.1, 1 March 2024).
 
 * Menu:
 
@@ -653,7 +653,7 @@ using the LZMA coding scheme.
 by option '-0') and normal (used by all other compression levels).
 
    The high compression of LZMA comes from combining two basic, well-proven
-compression ideas: sliding dictionaries (LZ77) and markov models (the thing
+compression ideas: sliding dictionaries (LZ77) and Markov models (the thing
 used by every compression algorithm that uses a range encoder or similar
 order-0 entropy coder as its last stage) with segregation of contexts
 according to what the bits are used for.
@@ -1703,22 +1703,22 @@ Concept index
 
 Tag Table:
 Node: Top203
-Node: Introduction1198
-Node: Output7083
-Node: Invoking lzip8678
-Ref: --trailing-error9547
-Node: Quality assurance19645
-Node: Algorithm28458
-Node: File format31859
-Ref: coded-dict-size33288
-Node: Stream format34519
-Ref: what-is-coded36914
-Node: Trailing data45788
-Node: Examples48124
-Ref: concat-example49564
-Node: Problems50785
-Node: Reference source code51317
-Node: Concept index66362
+Node: Introduction1197
+Node: Output7082
+Node: Invoking lzip8677
+Ref: --trailing-error9546
+Node: Quality assurance19644
+Node: Algorithm28457
+Node: File format31858
+Ref: coded-dict-size33287
+Node: Stream format34518
+Ref: what-is-coded36913
+Node: Trailing data45787
+Node: Examples48123
+Ref: concat-example49563
+Node: Problems50784
+Node: Reference source code51316
+Node: Concept index66361
 
 End Tag Table
 
diff --git a/doc/lzip.texi b/doc/lzip.texi
index 6d5cf77..865a413 100644
--- a/doc/lzip.texi
+++ b/doc/lzip.texi
@@ -6,8 +6,8 @@
 @finalout
 @c %**end of header
 
-@set UPDATED 26 January 2024
-@set VERSION 1.24
+@set UPDATED 1 March 2024
+@set VERSION 1.24.1
 
 @dircategory Compression
 @direntry
@@ -711,7 +711,7 @@ Lzip currently implements two variants of the LZMA algorithm: fast
 (used by option @option{-0}) and normal (used by all other compression levels).
 
 The high compression of LZMA comes from combining two basic, well-proven
-compression ideas: sliding dictionaries (LZ77) and markov models (the thing
+compression ideas: sliding dictionaries (LZ77) and Markov models (the thing
 used by every compression algorithm that uses a range encoder or similar
 order-0 entropy coder as its last stage) with segregation of contexts
 according to what the bits are used for.