Windows Vista is removed from supported OS.

Add files via upload
2024-11-30 13:13:15 +09:00 · 2024-11-30 13:10:42 +09:00 · 2024-11-30 13:10:12 +09:00 · 2024-11-30 13:09:46 +09:00 · 2024-11-30 13:09:19 +09:00 · 2024-11-30 13:08:09 +09:00
96 changed files with 817 additions and 378 deletions
--- a/README.md
+++ b/README.md
@@ -1,45 +1,55 @@
 # MultiPar

-### v1.3.3.2 is public
+### v1.3.3.3 is public

-&nbsp; This is a small fix version to improve performance of GPU acceleration. 
-It will become faster on AMD Radeon graphics boards. 
-It may be slightly faster on Nvidia GeForce graphics boards. 
-There is no difference in CPU calculation. 
-Because this isn't tested so much, there may be a bug, failure, or mistake. 
-If you see a problem, please report the incident. 
-I will try to solve as possible as I can.
+&nbsp; I fixed a few rare bugs in this version. 
+While most users were not affected by those problems, 
+those who saw the matter would better use new version. 
+If there is a problem still, I will fix as possible as I can. 
+I updated some help documents about Batch script. 
+I mentioned the location of help files in ReadMe text.

-&nbsp; I changed 3 points in my OpenCL implementation. 
-It's possible to test them by `lc` option at command-line. 
-Thanks [cavalia88, Slava46, and Anime Tosho for many tests and wonderful idea](https://github.com/Yutaka-Sawada/MultiPar/issues/107). 
-OpenCL perfomance is varied in every graphics boards. 
-If you have a fast graphics board, enabling "GPU acceleration" would be faster. 
-If it's not so fast (or is slow) on your PC, just un-check the feature.
-1) Data transfur between PC's RAM and GPU's VRAM
-2) Calculation over GPU
-3) Calculate 2 blocks at once to reduce number of table lookup
+&nbsp; New version supports a PC with max 8 OpenCL devices. 
+Thanks [Yi Gu for reporting bug in a rare environment](https://github.com/Yutaka-Sawada/MultiPar/issues/110). 
+I didn't think a user put so many OpenCL devices on a PC. 
+It will detect a Graphics board correctly.
+
+&nbsp; I improved source file splitting feature at creating PAR2 files. 
+Thanks [AreteOne for reporting bug and suggestion of improvment](https://github.com/Yutaka-Sawada/MultiPar/issues/117). 
+When file extension is a number, it didn't handle properly. 
+If someone saw strange behavior at file splitting ago, it should have been solved in this version.
+
+&nbsp; I fixed a bug in verifying external files. 
+It might not find the last slice in a source file, when the file data is redundant. 
+Thanks [dle-fr for reporting bug and testing many times](https://github.com/Yutaka-Sawada/MultiPar/issues/130). 
+This solution may improve verification of damaged files, too. 
+When source files are mostly random data like commpressed archive, there was no problem.


-[ Changes from 1.3.3.1 to 1.3.3.2 ]  
+[ Changes from 1.3.3.2 to 1.3.3.3 ]  
+
+Installer update
+- Inno Setup was updated from v6.2.2 to v6.3.1.

 PAR2 client update
- Improvement
-  - GPU acceleration will work well on AMD graphics boards.
+- Bug fix
+  - Fixed a bug in GPU acceleration, when there are many OpenCL devices.
+  - Failure of splitting source files with numerical extension was fixed.
+  - Faulty prediction of the last block in a file with repeated data was fixed.


 [ Hash value ]  

-MultiPar1332.zip  
-MD5: 5F2848ED7F65C632D1FED42A39B66F95  
-SHA1: CFA2CC6D217704BE2AF9DEDE15B117E9DC26A25B  
+MultiPar1333.zip  
+MD5: 01A201CA340C33053E6D7D2604D54019  
+SHA1: F7C30A7BDEB4152820C9CFF8D0E3DA719F69D7C6  

-MultiPar1332_setup.exe  
-MD5: 338F9D0842762338DC83921BBE546AF8  
-SHA1: 2A11FD544D49AA7B952214733C9D8E53F647592E  
+MultiPar1333_setup.exe  
+MD5: 33F9E441F5C1B2C00040E9BAFA7CC1A9  
+SHA1: 6CEBED8CECC9AAC5E8070CD5E8D1EDF7BBBC523A  
 &nbsp; To install under "Program Files" or "Program Files (x86)" directory, 
 you must select "Install for all users" at the first dialog.

 &nbsp; Old versions and source code packages are available at 
 [GitHub](https://github.com/Yutaka-Sawada/MultiPar/releases) or 
-[OneDrive](https://1drv.ms/u/s!AtGhNMUyvbWOaSo1n_R8awJ_hg0).
+[OneDrive](https://1drv.ms/f/c/8eb5bd32c534a1d1/QtGhNMUyvbUggI5pAAAAAAAAKjWf9HxrAn-GDQ).
--- a/alpha/MultiPar.exe
+++ b/alpha/MultiPar.exe
--- a/alpha/MultiParShlExt.dll
+++ b/alpha/MultiParShlExt.dll
--- a/alpha/MultiParShlExt.ini
+++ b/alpha/MultiParShlExt.ini
--- a/alpha/MultiParShlExt64.dll
+++ b/alpha/MultiParShlExt64.dll
--- a/alpha/ReadMe_English.txt
+++ b/alpha/ReadMe_English.txt
@@ -25,7 +25,13 @@ Be careful to use those special features.

 [ System requirement ]

- MultiPar requires a PC with Windows Vista or later (Windows 7, 8, 10).
+ MultiPar requires a PC with Windows 7 or later (Windows 8, 10, 11).
+
+[ Usage manual or Help documents ]
+
+ There are some usage manual or help documents in "help" folder.
+English pages exists in "help/0409" folder.
+You may open the manual by pushing "F1-key", while using MultiPar.


 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
@@ -140,9 +146,6 @@ so you need to move "MultiPar.ini" into the folder, too.
 They are written by Yutaka Sawada.
 Though console applications are open source (PAR clients are GPL),
 GUI application is closed source.
-Some article are available at my web site.
-(URL: "https://hp.vector.co.jp/authors/VA021385/")
-If you want source code, contact with me by e-mail.


 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
@@ -168,10 +171,8 @@ mail server may delete it automatically, and I won't see it.

 [ Link ]

- I use Vector 's author page to introduce MultiPar.
-(URL: "https://hp.vector.co.jp/authors/VA021385/")
-Because there is another official download page,
+ You may download the latest version of MultiPar on GitHub.
+(URL: "https://github.com/Yutaka-Sawada/MultiPar")
+There is a Japanese download page on Vector.
 (URL: "https://www.vector.co.jp/soft/dl/winnt/util/se460801.html")
-using direct link to files on the page isn't preferable.
-When you write a link on somewhere, please don't include filename.

--- a/alpha/ReadMe_Japanese.txt
+++ b/alpha/ReadMe_Japanese.txt
@@ -54,7 +54,13 @@ QuickPar など他の PAR クライアントはコメント機能に対応して

 [ 動作環境 ]

-　Windows Vista かそれ以降 (Windows 7, 8, 10) のパソコンが必要です。
+　Windows 7 かそれ以降 (Windows 8, 10, 11) のパソコンが必要です。
+
+[ 使い方や解説文章 ]
+
+　ほとんど英語ですが、help フォルダーの中に使い方や解説文章が入ってます。
+日本語のページは help\0411 フォルダーの中にあります。
+MultiPar の使用中に、F1-key を押すと、マニュアルが表示されます。


 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
@@ -213,9 +219,9 @@ GitHubのissueページに書き込んでもいいです。

 [ リンク ]

-　ベクターの作者ページでは外国人向けに MultiPar を紹介しています。
-(URL: "https://hp.vector.co.jp/authors/VA021385/")
-ベクターの正式なダウンロード・ページは別にあります。
+　MultiPar の最新版は GitHub からダウンロードできます。
+(URL: "https://github.com/Yutaka-Sawada/MultiPar")
+ベクターの日本語ダウンロード・ページもあります。
 (URL: "https://www.vector.co.jp/soft/dl/winnt/util/se460801.html")
 日本人向けにリンクを載せる際は、ベクターの作品紹介ページにしてください。
 (URL: "https://www.vector.co.jp/soft/winnt/util/se460801.html")
--- a/alpha/Update_English.txt
+++ b/alpha/Update_English.txt
@@ -1,6 +1,37 @@
 Release note of v1.3.3 tree

 par2j's "lc" option was changed to support more threads.
+ Windows Vista was removed from supported OS.
+
+/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
+
+[ Changes from 1.3.3.3 to 1.3.3.4 ] (2024/11/30)
+
+Installer update
+ Korean language is available at installation.
+
+GUI update
+ New
+  Korean language UI is added.
+  It's possible to add options for par2j on MultiPar.ini file.
+
+ Change
+  Link of Vector's author page is removed. Use GitHub's MultiPar page.
+
+/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
+
+[ Changes from 1.3.3.2 to 1.3.3.3 ] (2024/06/15)
+
+Installer update
+ Inno Setup was updated from v6.2.2 to v6.3.1.
+
+PAR2 client update
+ Bug fix
+  Fixed a bug in GPU acceleration, when there are many OpenCL devices.
+  Failure of splitting source files with numerical extension was fixed.
+  Faulty prediction of the last block in a file with repeated data was fixed.
+
+/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */

 [ Changes from 1.3.3.1 to 1.3.3.2 ] (2024/01/10)

--- a/alpha/Update_Japanese.txt
+++ b/alpha/Update_Japanese.txt
@@ -1,6 +1,9 @@
-v1.3.3 の更新情報 (2024/01/10)
+v1.3.3 の更新情報 (2024/11/30)
+
+　Windows Vista を動作対象の OS から外しました。
+　Vector のページが無くなるので、GitHub のページを使ってください。
+https://github.com/Yutaka-Sawada/MultiPar

-　まだ動作実験中ですので、不安な人は前のバージョンを使ってください。

 [ 1.3.2 から 1.3.3 への変更点 ]

--- a/alpha/help/0409/batch.htm
+++ b/alpha/help/0409/batch.htm
@@ -16,7 +16,7 @@ textarea{width:100%;}

 <p>&nbsp
 Because MultiPar consists of PAR clients and GUI, 
-it is possible to use a PAR client on Command prompt. 
+it is possible to use a PAR client on Command Prompt. 
 Read a manual of command line for the details of command and option. 
 It's available by batch file (or command script).
 </p>
@@ -27,13 +27,57 @@ Modify the options for PAR2 files, and set the path of <tt>par2j.exe</tt>.
 Write absolute path like;<br>
 <code>SET par2_path="C:\something directory\MultiPar\par2j.exe"</code><br>
 Read manuals (<tt>Command_***.txt</tt>) to know the detail of options. 
-Read Windows OS 's help for Command prompt's usage.
+Read Windows OS 's help for Command Prompt's usage.
 </p>
 <p>&nbsp
 Save a sample script to a file like <tt>batch.bat</tt> or <tt>batch.cmd</tt>. 
-To specify path of files or folders, Drag & Drop them on the batch file. 
-When you put a shortcut icon of the batch file in "SendTo" menu, 
-you can call the batch file by selecting files then Righ-Click & SendTo.
+There are some ways to specify a file or folder.<br>
+<ol>
+<li>Type everytime by keyboard on Command Prompt
+<p>&nbsp
+If you use the batch file at Command Prompt, change directory to the batch file at first. 
+Next, type <tt>batch.bat "path of the file or folder"</tt>. 
+If there is no space in the path, no need to cover by <tt>""</tt>. 
+The path may be absolute path or relative path from the batch file. 
+Normally absolute path would be safe.
+</p>
+<p>&nbsp
+If you want to specify multiple files or folders, 
+type <tt>batch.bat "path of the first file or folder" "path of second file or folder" "path of third file or folder"</tt>. 
+You may add some pathes after a script filename.
+</p>
+</li>
+<li>Drag & Drop a file or folder by mouse
+<p>&nbsp
+On Windows Explorer, drag a file or folder and drop it on your batch file. 
+If you put the batch file on Desktop, it will be easy to Drag & Drop.
+</p>
+<p>&nbsp
+If you want to specify multiple files or folders, 
+select them at once on Windows Explorer, and Drag & Drop the group on the batch file. 
+While dragging, number of items may be shown.
+</p>
+</li>
+<li>Select SendTo at Windows Explorer's right click menu
+<p>&nbsp
+At first, create Short-cut icon of your batch file. 
+Name it to be something easy to understand like "Create PAR2". 
+Then, put the Short-cut icon in your <tt>SendTo</tt> folder. 
+You can open the <tt>SendTo</tt> folder by typing <tt>shell:sendto</tt> on path-box of Windows Explorer.
+</p>
+<p>&nbsp
+After you select a file or folder on Windows Explorer, click mouse's right button. 
+Select "SendTo" item on the right-click menu. 
+As your created Short-cut item will exist in the SendTo sub-menu, select the Short-cut icon.
+</p>
+<p>&nbsp
+If you want to specify multiple files or folders, 
+select them at once on Windows Explorer. 
+While mouse cursor over there, click mouse's right button. 
+Later action is same as single item.
+</p>
+</li>
+</ol>
 </p>
 <p>&nbsp
 If you want to confirm the result of scripting, 
--- a/alpha/help/0409/index.htm
+++ b/alpha/help/0409/index.htm
@@ -51,7 +51,7 @@ There are command-line manuals in "<tt>help</tt>" folder.
 </table>

 <hr>
-<small>last update 2023/11/11 for version 1.3.3.1</small>
+<small>last update 2024/11/30 for version 1.3.3.4</small>

 </body>
 </html>
--- a/alpha/help/0409/python.htm
+++ b/alpha/help/0409/python.htm
@@ -178,12 +178,15 @@ Furthermore, you must set proper <tt>save_path</tt> in the script.
 </table>
 </p>
 <p>&nbsp
-In this sample, it tries verification only. 
-If you want to repair a damaged set automatically, use <tt>repair</tt> command instead of <tt>verify</tt> of par2j. 
+In this sample, it tries verification at first. 
+If you want to repair a damaged set automatically, check "Repair" item on the GUI panel. 
 When you want to confirm result by MultiPar, select a PAR2 set and push "Open with MultiPar" button. 
-You may repair on the MultiPar GUI.
+You may repair on the MultiPar GUI manually.
 </p>
 <p>&nbsp
+After you start verification queue, you may stop next verification by pushing "Stop" button. 
+After the queue was stopped, you may re-start queue by pushing "Start" button again. 
+Or, you may select another folder by pushing "Folder" button. 
 While verification, it shows details on Command Prompt window. 
 You can control the progress by pushing a key on the Command Prompt. 
 You may pause the process by pushing P-key. 
@@ -194,7 +197,8 @@ Even when you stop the verification task, it may save result partially.
 <p>&nbsp
 When you push "Folder" button, it searches PAR2 sets in the selected folder. 
 By default, It doesn't search files recursively, because it may be slow. 
-If you want to search all sub-directories, you need to edit the script. 
+If you want to search all sub-directories, select "Recursive" item on the GUI panel. 
+While you don't start verification yet, you may select another folder by pushing "Stop" button. 
 You may change behavior of starting verification automatically or not by editing the script.
 </p>

--- a/alpha/help/0409/readme1.htm
+++ b/alpha/help/0409/readme1.htm
@@ -31,7 +31,14 @@ Be careful to use those special features.

 <h3>System requirement</h3>
 <p>&nbsp
-MultiPar requires a PC with Windows Vista or later (Windows 7, 8, 10).
+MultiPar requires a PC with Windows 7 or later (Windows 8, 10, 11).
+</p>
+
+<h3>Usage manual or Help documents</h3>
+<p>&nbsp
+There are some usage manual or help documents in "help" folder.
+English pages exists in "help/0409" folder.
+You may open the manual by pushing "F1-key", while using MultiPar.
 </p>

 </body>
--- a/alpha/help/0409/readme4.htm
+++ b/alpha/help/0409/readme4.htm
@@ -13,9 +13,6 @@ MultiPar consists of PAR clients and GUI to control them.
 They are written by Yutaka Sawada. 
 Though console applications are open source (PAR clients are GPL), 
 GUI application is closed source. 
-Some article are available at 
-<a href="https://hp.vector.co.jp/authors/VA021385/" target="_blank" title="Announcement page on Vector">my web site</a>. 
-There are source code packages on <a href="https://github.com/Yutaka-Sawada/MultiPar" target="_blank" title="GitHub page">GitHub</a>.
 </p>

 <hr>
@@ -42,10 +39,8 @@ mail server may delete it automatically, and I won't see it.

 <h3>Link</h3>
 <p>&nbsp
-I use <i>vector.co.jp</i>'s <a href="https://hp.vector.co.jp/authors/VA021385/" target="_blank" title="Announcement page on Vector">author page</a> to introduce MultiPar. 
-Because there is another <a href="https://www.vector.co.jp/soft/dl/winnt/util/se460801.html" target="_blank" title="Download page on Vector">official download page</a>, 
-using direct link to files on the page isn't preferable. 
-When you write a link on somewhere, please don't include filename. 
+You may download the latest version of <a href="https://github.com/Yutaka-Sawada/MultiPar" target="_blank">MultiPar on GitHub</a>. 
+There is <a href="https://www.vector.co.jp/soft/dl/winnt/util/se460801.html" target="_blank">a Japanese download page on Vector</a>.
 </p>

 </body>
--- a/alpha/help/0411/index.htm
+++ b/alpha/help/0411/index.htm
@@ -51,7 +51,7 @@
 </table>

 <hr>
-<small><EFBFBD>ŏI<EFBFBD>X<EFBFBD>V 2023/11/11 (<28>o<EFBFBD>[<5B>W<EFBFBD><57><EFBFBD><EFBFBD> 1.3.3.1)</small>
+<small><EFBFBD>ŏI<EFBFBD>X<EFBFBD>V 2024/11/30 (<28>o<EFBFBD>[<5B>W<EFBFBD><57><EFBFBD><EFBFBD> 1.3.3.4)</small>

 </body>
 </html>
--- a/alpha/help/0411/readme1.htm
+++ b/alpha/help/0411/readme1.htm
@@ -25,7 +25,14 @@ QuickPar

 <h3><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD></h3>
 <p>&nbsp
-Windows Vista <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ȍ~ (Windows 7, 8, 10) <20>̃p<CC83>\<5C>R<EFBFBD><52><EFBFBD><EFBFBD><EFBFBD>K<EFBFBD>v<EFBFBD>ł<EFBFBD><C582>B
+Windows 7 <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ȍ~ (Windows 8, 10, 11) <20>̃p<CC83>\<5C>R<EFBFBD><52><EFBFBD><EFBFBD><EFBFBD>K<EFBFBD>v<EFBFBD>ł<EFBFBD><C582>B
+</p>
+
+<h3><EFBFBD>g<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD></h3>
+<p>&nbsp
+<EFBFBD>قƂ<EFBFBD><EFBFBD>ǉp<EFBFBD><EFBFBD><EFBFBD>ł<EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ahelp <20>t<EFBFBD>H<EFBFBD><48><EFBFBD>_<EFBFBD>[<5B>̒<EFBFBD><CC92>Ɏg<C98E><67><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>͂<EFBFBD><CD82><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ă܂<C482><DC82>B
+<EFBFBD><EFBFBD><EFBFBD>{<7B><><EFBFBD>̃y<CC83>[<5B>W<EFBFBD><57> help\0411 <20>t<EFBFBD>H<EFBFBD><48><EFBFBD>_<EFBFBD>[<5B>̒<EFBFBD><CC92>ɂ<EFBFBD><C982><EFBFBD><EFBFBD>܂<EFBFBD><DC82>B
+MultiPar <20>̎g<CC8E>p<EFBFBD><70><EFBFBD>ɁAF1-key <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ƁA<C681>}<7D>j<EFBFBD><6A><EFBFBD>A<EFBFBD><41><EFBFBD><EFBFBD><EFBFBD>\<5C><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>܂<EFBFBD><DC82>B
 </p>

 </body>
--- a/alpha/help/0411/readme4.htm
+++ b/alpha/help/0411/readme4.htm
@@ -14,7 +14,7 @@ PAR
 <EFBFBD><EFBFBD><EFBFBD>̑<EFBFBD><EFBFBD>̃R<EFBFBD><EFBFBD><EFBFBD>\<5C>[<5B><><EFBFBD>E<EFBFBD>A<EFBFBD>v<EFBFBD><76><EFBFBD>P<EFBFBD>[<5B>V<EFBFBD><56><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
 GUI <20>A<EFBFBD>v<EFBFBD><76><EFBFBD>P<EFBFBD>[<5B>V<EFBFBD><56><EFBFBD><EFBFBD> (<tt>MultiPar.exe</tt>) <20>͕<EFBFBD><CD95>ʂ̃t<CC83><74><EFBFBD>[<5B>\<5C>t<EFBFBD>g<EFBFBD>ł<EFBFBD><C582>B
 MultiPar <20><><EFBFBD><EFBFBD><EFBFBD>̂܂܎g<DC8E><67><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ȃ<EFBFBD><C882>A<EFBFBD><41><EFBFBD>ꂼ<EFBFBD><EA82BC><EFBFBD>̃<EFBFBD><CC83>C<EFBFBD>Z<EFBFBD><5A><EFBFBD>X<EFBFBD>̈Ⴂ<CC88><E182A2><EFBFBD>C<EFBFBD>ɂ<EFBFBD><C982>Ȃ<EFBFBD><C882>Ă<EFBFBD><C482><EFBFBD><EFBFBD>ł<EFBFBD><C582>B
-<EFBFBD>\<5C>[<5B>X<EFBFBD>E<EFBFBD>R<EFBFBD>[<5B>h<EFBFBD><68><a href="https://github.com/Yutaka-Sawada/MultiPar" target="_blank" title="GitHub page">GitHub</a><EFBFBD>ɒu<EFBFBD><EFBFBD><EFBFBD>Ă܂<EFBFBD><EFBFBD>B
+<EFBFBD>\<5C>[<5B>X<EFBFBD>E<EFBFBD>R<EFBFBD>[<5B>h<EFBFBD><68> <a href="https://github.com/Yutaka-Sawada/MultiPar" target="_blank" title="GitHub page">GitHub</a> <EFBFBD>ɒu<EFBFBD><EFBFBD><EFBFBD>Ă܂<EFBFBD><EFBFBD>B
 </p>

 <hr>
@@ -33,9 +33,9 @@ MultiPar

 <h3><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>N</h3>
 <p>&nbsp
-<EFBFBD>x<EFBFBD>N<EFBFBD>^<5E>[<5B><><a href="https://hp.vector.co.jp/authors/VA021385/" target="_blank" title="<22>x<EFBFBD>N<EFBFBD>^<5E>[<5B>ɂ<EFBFBD><C982><EFBFBD><EFBFBD>L<EFBFBD><4C><EFBFBD>y<EFBFBD>[<5B>W"><EFBFBD><EFBFBD><EFBFBD>҃y<EFBFBD>[<5B>W</a><EFBFBD>ł͊O<EFBFBD><EFBFBD><EFBFBD>l<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> MultiPar <20><><EFBFBD>Љ<D089>Ă<EFBFBD><EFBFBD>܂<EFBFBD><EFBFBD>B
-<EFBFBD>x<EFBFBD>N<EFBFBD>^<5E>[<5B><><a href="https://www.vector.co.jp/soft/dl/winnt/util/se460801.html" target="_blank" title="<22>x<EFBFBD>N<EFBFBD>^<5E>[<5B>ɂ<EFBFBD><C982><EFBFBD><EFBFBD>_<EFBFBD>E<EFBFBD><45><EFBFBD><EFBFBD><EFBFBD>[<5B>h<EFBFBD>E<EFBFBD>y<EFBFBD>[<5B>W"><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ȃ_<EFBFBD>E<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>[<5B>h<EFBFBD>E<EFBFBD>y<EFBFBD>[<5B>W</a><EFBFBD>͕ʂɂ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>܂<EFBFBD><EFBFBD>B
-<EFBFBD><EFBFBD><EFBFBD>{<7B>l<EFBFBD><6C><EFBFBD><EFBFBD><EFBFBD>Ƀ<EFBFBD><C983><EFBFBD><EFBFBD>N<EFBFBD><4E><EFBFBD>ڂ<EFBFBD><DA82><EFBFBD><EFBFBD>ۂ́A<CD81>x<EFBFBD>N<EFBFBD>^<5E>[<5B><><a href="https://www.vector.co.jp/soft/winnt/util/se460801.html" target="_blank" title="<22>x<EFBFBD>N<EFBFBD>^<5E>[<5B>ɂ<EFBFBD><C982><EFBFBD><EFBFBD><EFBFBD><EFBFBD>i<EFBFBD>Љ<EFBFBD><D089>y<EFBFBD>[<5B>W"><EFBFBD><EFBFBD><EFBFBD>i<EFBFBD>Љ<EFBFBD><EFBFBD>y<EFBFBD>[<5B>W</a><EFBFBD>ɂ<EFBFBD><EFBFBD>Ă<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>B
+MultiPar <20>̍ŐV<C590>ł<EFBFBD> <a href="https://github.com/Yutaka-Sawada/MultiPar" target="_blank">GitHub <20><><EFBFBD><EFBFBD></a><EFBFBD>_<EFBFBD>E<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>[<5B>h<EFBFBD>ł<EFBFBD><EFBFBD>܂<EFBFBD><EFBFBD>B
+<EFBFBD>x<EFBFBD>N<EFBFBD>^<5E>[<5B><><a href="https://www.vector.co.jp/soft/dl/winnt/util/se460801.html" target="_blank"><EFBFBD><EFBFBD><EFBFBD>{<7B><EFBFBD><EFBFBD>_<EFBFBD>E<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>[<5B>h<EFBFBD>E<EFBFBD>y<EFBFBD>[<5B>W</a><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>܂<EFBFBD><EFBFBD>B
+<EFBFBD><EFBFBD><EFBFBD>{<7B>l<EFBFBD><6C><EFBFBD><EFBFBD><EFBFBD>Ƀ<EFBFBD><C983><EFBFBD><EFBFBD>N<EFBFBD><4E><EFBFBD>ڂ<EFBFBD><DA82><EFBFBD><EFBFBD>ۂ́A<CD81>x<EFBFBD>N<EFBFBD>^<5E>[<5B><><a href="https://www.vector.co.jp/soft/winnt/util/se460801.html" target="_blank"><EFBFBD><EFBFBD><EFBFBD>i<EFBFBD>Љ<EFBFBD><EFBFBD>y<EFBFBD>[<5B>W</a><EFBFBD>ɂ<EFBFBD><EFBFBD>Ă<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>B
 </p>

 </body>
--- a/alpha/help/0804/index.htm
+++ b/alpha/help/0804/index.htm
@@ -50,7 +50,7 @@
 </table>

 <hr>
-<small>最新更新于2023年11月11日，适用于1.3.3.1版本，简体中文化 Deng Shiqing</small>
+<small>最新更新于2024年11月30日，适用于1.3.3.4版本，简体中文化 Deng Shiqing</small>

 </body>
 </html>
--- a/alpha/help/0804/readme1.htm
+++ b/alpha/help/0804/readme1.htm
@@ -22,7 +22,7 @@ MultiPar支持PAR1.0和PAR2.0规范。请访问“<a href="http://parchive.sourc

 <h3>系统要求</h3>
 <p>&nbsp
-MultiPar需要电脑安装Windows Vista或更高的版本（Windows 7, 8, 10）。
+MultiPar需要电脑安装Windows 7或更高的版本（Windows 8, 10, 11）。
 </p>

 </body>
--- a/alpha/help/0804/readme4.htm
+++ b/alpha/help/0804/readme4.htm
@@ -7,7 +7,7 @@
 <body>
 <h3>许可证</h3>
 <p>&nbsp
-MultiPar由PAR客户端和用于控制它们的图形用户界面（GUI）组成，由Yutaka Sawada编写。尽管控制台应用程序是开源的（PAR客户端采用GPL协议），但GUI程序是闭源的。有些文章可以在<a href="https://hp.vector.co.jp/authors/VA021385/" target="_blank" title="Announcement page on Vector">我的网站</a>上找到。
+MultiPar由PAR客户端和用于控制它们的图形用户界面（GUI）组成，由Yutaka Sawada编写。尽管控制台应用程序是开源的（PAR客户端采用GPL协议），但GUI程序是闭源的。
 There are source code packages on <a href="https://github.com/Yutaka-Sawada/MultiPar" target="_blank" title="GitHub page">GitHub</a>.
 </p>

@@ -26,7 +26,7 @@ I use <a href="https://github.com/Yutaka-Sawada/MultiPar/issues" target="_blank"

 <h3>链接</h3>
 <p>&nbsp
-我在<a href="https://hp.vector.co.jp/authors/VA021385/" target="_blank" title="Announcement page on Vector">个人主页</a><i>vector.co.jp</i>有介绍MultiPar。使用这个页面上的文件直链可能不太合适，这还有一个<a href="https://www.vector.co.jp/soft/dl/winnt/util/se460801.html" target="_blank" title="Download page on Vector">官方下载页面</a>。当您在某处输入一个链接时，请不要包含文件名。
+You may download the latest version of <a href="https://github.com/Yutaka-Sawada/MultiPar" target="_blank">MultiPar on GitHub</a>.
 </p>

 </body>
--- a/alpha/help/Command_GUI.txt
+++ b/alpha/help/Command_GUI.txt
@@ -1,4 +1,4 @@
-[ MultiPar GUI - version 1.3.3.0 or later ]
+[ MultiPar GUI - version 1.3.3.4 or later ]

 Usage: MultiPar.exe [command] [/base path] [/list path] [files]

@@ -99,6 +99,11 @@ write a line of "RecoveryFileLimit=1" under "[Option]" section.
 It's same as an option:
 "Variable (limited to size of largest data file)" on QuickPar.

+ If you want to limit size of Recovery Files by a specific value,
+write a line of "RecoveryFileLimit=2" under "[Option]" section.
+"Limit Size to" value is enabled, even when "Split Files" isn't checked.
+This setting is useful, if you don't want to split source files.
+
 If you want to enable "Most Resent Used List",
 write this line "MRUMax=5" under "[Path]" section.
 You may change the number of items after "MRUMax=".
@@ -112,6 +117,14 @@ Because the name and size are splitted by ":",
 you cannot include ":" in the name.
 The max size is 999999999999 bytes. (931 GB)

+ If you want to add more options for par2j (par2j.exe or par2j64.exe),
+write this line "par2jOption=/something" under "[Option]" section.
+You may add multiple options like; "par2jOption=/m1 /lc32"
+The total length must be less than 30 characters.
+When you set an option at MultiPar's Option windows,
+you should not set the same option on .INI file manually.
+If you write wrong or strange text, par2j will fail.
+

 Example of lines on "MultiPar.ini";

@@ -121,5 +134,6 @@ RedundancyMax=10
 Sort=8
 RecoveryFileLimit=1
 MediaList4=7.9GB DVD:8480000000
+par2jOption=/lc32
 [Path]
 MRUMax=5
--- a/alpha/help/Command_par2j.txt
+++ b/alpha/help/Command_par2j.txt
@@ -1,4 +1,4 @@
-[ par2j.exe - version 1.3.3.2 or later ]
+[ par2j.exe - version 1.3.3.4 or later ]

 Type "par2j.exe" to see version, test integrity, and show usage below.

@@ -386,6 +386,25 @@ The format is "/lc#" (# is from 1 to 32 as the number of using threads).

 for example,  /lc1 to use single Core, /lc508 to use half Cores and GPU

+ /lcb :
+ This is for Cache Blocking. (CPU cache optimization)
+By default, this value is set-associative size of CPU L2 cache.
+Maximum value is 32767. It will be multipled by 64 KB.
+To disable cache optimization, set "/lcb0".
+
+ /lcs :
+ This is for large buffer size at calculating multiple files' hashes.
+By default, this value is set-associative size of CPU L3 cache.
+Maximum value is 65535. It will be multipled by 64 KB.
+When you set "/lcs0", large buffer size will become 2 MB by default.
+
+ /lcm :
+ This is for max number of chunks to calculate at once. (CPU shared cache optimization)
+By default, this value may be rate of L3 cache size / L2 cache size.
+The value may be changed by some factors in experimental results.
+Maximum value is 32768. Lower values than 8 will be same as 32768.
+To disable cache optimization, set "/lcm0".
+
 /m :
 Set this, if you want to set memory usage.
 If too many memory is allocated, system will use swap file.
--- a/alpha/help/ReadMe1_English.txt
+++ b/alpha/help/ReadMe1_English.txt
@@ -18,7 +18,7 @@ Parchive 1.0 client by Yutaka Sawada
 You cannot specify Non-Recovery-Set files. (Empty files are set.)
 Number of recovery files are limited to 99.

- This requires a PC of Windows Vista or later (Windows 7, 8, 10, 11).
+ This requires a PC of Windows 7 or later (Windows 8, 10, 11).
 This is developed with Visual Studio 2022 on Windows 10.


--- a/alpha/help/ReadMe2_English.txt
+++ b/alpha/help/ReadMe2_English.txt
@@ -31,7 +31,7 @@ Parchive 2.0 client by Yutaka Sawada
 Verifying file use same memory as the file or double of block size.
 Recovering block use more memory as the number of block is many.

- This requires a PC of Windows Vista or later (Windows 7, 8, 10, 11).
+ This requires a PC of Windows 7 or later (Windows 8, 10, 11).
 This is developed with Visual Studio 2022 on Windows 10.


--- a/alpha/par1j.exe
+++ b/alpha/par1j.exe
--- a/alpha/par2j.exe
+++ b/alpha/par2j.exe
--- a/alpha/par2j64.exe
+++ b/alpha/par2j64.exe
--- a/alpha/sfv_md5.exe
+++ b/alpha/sfv_md5.exe
--- a/alpha/tool/queue_verify.py
+++ b/alpha/tool/queue_verify.py
@@ -43,25 +43,31 @@ def search_par_set(one_path):
            continue
        listbox_list1.insert(tk.END, base_name)

-
    # Add found PAR sets in sub-directories
-    # This searches 1 level child only, because recursive search may be slow.
-    for par_path in glob.glob(glob.escape(one_path) + "/*/*.par2"):
-    # If you want to search recursively, use below line instead of above line.
-    #for par_path in glob.glob(glob.escape(one_path) + "/**/*.par2", recursive=True):
-        # Get relative path and convert to UNIX style directory mark
-        rel_path = os.path.relpath(par_path, one_path)
-        rel_path = rel_path.replace('\\', '/')
-        # Remove extension ".par2"
-        one_name = os.path.splitext(rel_path)[0]
-        # Compare filename in case insensitive
-        base_name = one_name.lower()
-        # Remove ".vol#-#", ".vol#+#", or ".vol_#" at the last
-        base_name = re.sub(r'[.]vol\d*[-+_]\d+$', "", base_name)
-        # Ignore same base, if the name exists in the list already.
-        if "'" + base_name + "'" in s_list1.get():
-            continue
-        listbox_list1.insert(tk.END, base_name)
+    s_recursive = s_combo.get()
+    if s_recursive != "No child":
+        if s_recursive == "Recursive":
+            # This will search all sub-directories recursively.
+            search_path = glob.escape(one_path) + "/**/*.par2"
+            recursive_flag = True
+        else:
+            # This searches 1 level child only, because recursive search may be slow.
+            search_path = glob.escape(one_path) + "/*/*.par2"
+            recursive_flag = False
+        for par_path in glob.glob(search_path, recursive=recursive_flag):
+            # Get relative path and convert to UNIX style directory mark
+            rel_path = os.path.relpath(par_path, one_path)
+            rel_path = rel_path.replace('\\', '/')
+            # Remove extension ".par2"
+            one_name = os.path.splitext(rel_path)[0]
+            # Compare filename in case insensitive
+            base_name = one_name.lower()
+            # Remove ".vol#-#", ".vol#+#", or ".vol_#" at the last
+            base_name = re.sub(r'[.]vol\d*[-+_]\d+$', "", base_name)
+            # Ignore same base, if the name exists in the list already.
+            if "'" + base_name + "'" in s_list1.get():
+                continue
+            listbox_list1.insert(tk.END, base_name)

    item_count = listbox_list1.size()
    one_name = os.path.basename(one_path)
@@ -70,13 +76,14 @@ def search_par_set(one_path):
        label_status.config(text= "There are no PAR sets in \"" + one_path + "\".")
    else:
        button_folder.config(state=tk.DISABLED)
+        button_stop.config(state=tk.NORMAL)
        button_open2.config(state=tk.DISABLED)
        button_open3.config(state=tk.DISABLED)
+        combo_recursive.config(state=tk.DISABLED)
        # If you want to start manually, use these lines instead of below lines.
-        #label_status.config(text= str(item_count) + " sets were found in \"" + one_path + "\".")
+        label_status.config(text= str(item_count) + " sets were found in \"" + one_path + "\".")
        button_start.config(state=tk.NORMAL)
-        # If you want to start verification automatically, use these lines instead of above lines.
-        #button_stop.config(state=tk.NORMAL)
+        # If you want to start verification automatically, use this line instead of above lines.
        #root.after(100, queue_run)


@@ -105,6 +112,8 @@ def queue_run():
        button_start.config(state=tk.NORMAL)
        button_open2.config(state=tk.NORMAL)
        button_open3.config(state=tk.NORMAL)
+        combo_recursive.config(state=tk.NORMAL)
+        check_repair.config(state=tk.NORMAL)
        label_status.config(text= "Stopped queue")
        return

@@ -120,9 +129,14 @@ def queue_run():
    label_status.config(text= "Verifying " + base_name)

    # Set command-line
-    # Cover path by " for possible space   
-    cmd = "\"" + client_path + "\" v /fo /vs2 /vd\"" + save_path + "\" \"" + one_path + "\""
-    # If you want to repair a damaged set automatically, use "r" command instead of "v".
+    # Cover path by " for possible space
+    cmd = "\"" + client_path + "\" "
+    if i_check.get() == 0:
+        cmd += "v"
+    else:
+        # If you want to repair a damaged set automatically, use "r" command instead of "v".
+        cmd += "r"
+    cmd += " /fo /vs2 /vd\"" + save_path + "\" \"" + one_path + "\""
    #print(cmd)

    # Run PAR2 client
@@ -163,6 +177,8 @@ def queue_result():
        button_stop.config(state=tk.DISABLED)
        button_open2.config(state=tk.NORMAL)
        button_open3.config(state=tk.NORMAL)
+        combo_recursive.config(state=tk.NORMAL)
+        check_repair.config(state=tk.NORMAL)
        label_status.config(text= "Failed queue")
        return

@@ -173,6 +189,8 @@ def queue_result():
        button_stop.config(state=tk.DISABLED)
        button_open2.config(state=tk.NORMAL)
        button_open3.config(state=tk.NORMAL)
+        combo_recursive.config(state=tk.NORMAL)
+        check_repair.config(state=tk.NORMAL)
        label_status.config(text= "Canceled queue")
        return

@@ -194,6 +212,8 @@ def queue_result():
        button_stop.config(state=tk.DISABLED)
        button_open2.config(state=tk.NORMAL)
        button_open3.config(state=tk.NORMAL)
+        combo_recursive.config(state=tk.NORMAL)
+        check_repair.config(state=tk.NORMAL)
        label_status.config(text= "Verified all PAR sets")

    elif "disabled" in button_stop.state():
@@ -201,8 +221,10 @@ def queue_result():
        button_start.config(state=tk.NORMAL)
        button_open2.config(state=tk.NORMAL)
        button_open3.config(state=tk.NORMAL)
+        combo_recursive.config(state=tk.NORMAL)
+        check_repair.config(state=tk.NORMAL)
        label_status.config(text= "Interrupted queue")
- 
+
    else:
        root.after(100, queue_run)

@@ -216,6 +238,8 @@ def button_start_clicked():
    button_stop.config(state=tk.NORMAL)
    button_open2.config(state=tk.DISABLED)
    button_open3.config(state=tk.DISABLED)
+    combo_recursive.config(state=tk.DISABLED)
+    check_repair.config(state=tk.DISABLED)

    if sub_proc == None:
        queue_run()
@@ -225,8 +249,19 @@ def button_start_clicked():

 # Stop running queue
 def button_stop_clicked():
+    global sub_proc
+
    button_stop.config(state=tk.DISABLED)
-    if sub_proc != None:
+    if sub_proc is None:
+        # When verification was not started yet, it's possible to select another folder.
+        button_folder.config(state=tk.NORMAL)
+        button_start.config(state=tk.DISABLED)
+        combo_recursive.config(state=tk.NORMAL)
+        listbox_list1.delete(0, tk.END)
+        label_head1.config(text='? sets in a folder')
+        label_status.config(text='Select a folder to search PAR files.')
+    else:
+        # When it's verifying, it will stop next verification.
        label_status.config(text= "Waiting finish of current task")


@@ -293,7 +328,7 @@ frame_middle.columnconfigure(2, weight=1)
 frame_list1 = ttk.Frame(frame_middle, padding=(6,2,6,6), relief='groove')
 frame_list1.grid(row=0, column=0, padx=4, sticky=(tk.E,tk.W,tk.S,tk.N))
 frame_list1.columnconfigure(0, weight=1)
-frame_list1.rowconfigure(2, weight=1)
+frame_list1.rowconfigure(3, weight=1)

 frame_top1 = ttk.Frame(frame_list1, padding=(0,4,0,3))
 frame_top1.grid(row=0, column=0, columnspan=2, sticky=(tk.E,tk.W))
@@ -307,19 +342,31 @@ button_start.pack(side=tk.LEFT, padx=2)
 button_stop = ttk.Button(frame_top1, text="Stop", width=6, command=button_stop_clicked, state=tk.DISABLED)
 button_stop.pack(side=tk.LEFT, padx=2)

+frame_top11 = ttk.Frame(frame_list1, padding=(0,3,0,3))
+frame_top11.grid(row=1, column=0, columnspan=2, sticky=(tk.E,tk.W))
+
+s_combo = tk.StringVar()
+combo_recursive = ttk.Combobox(frame_top11, values=["No child", "Children", "Recursive"], textvariable=s_combo, state="readonly", width=9)
+combo_recursive.current(0)
+combo_recursive.pack(side=tk.LEFT, padx=4)
+
+i_check = tk.IntVar(value=0)
+check_repair = ttk.Checkbutton(frame_top11, text="Repair", variable=i_check)
+check_repair.pack(side=tk.LEFT, padx=10)
+
 label_head1 = ttk.Label(frame_list1, text='? sets in a folder')
-label_head1.grid(row=1, column=0, columnspan=2)
+label_head1.grid(row=2, column=0, columnspan=2)

 s_list1 = tk.StringVar()
 listbox_list1 = tk.Listbox(frame_list1, listvariable=s_list1, activestyle='none')
-listbox_list1.grid(row=2, column=0, sticky=(tk.E,tk.W,tk.S,tk.N))
+listbox_list1.grid(row=3, column=0, sticky=(tk.E,tk.W,tk.S,tk.N))

 scrollbar_list1 = ttk.Scrollbar(frame_list1, orient=tk.VERTICAL, command=listbox_list1.yview)
-scrollbar_list1.grid(row=2, column=1, sticky=(tk.N, tk.S))
+scrollbar_list1.grid(row=3, column=1, sticky=(tk.N, tk.S))
 listbox_list1["yscrollcommand"] = scrollbar_list1.set

 xscrollbar_list1 = ttk.Scrollbar(frame_list1, orient=tk.HORIZONTAL, command=listbox_list1.xview)
-xscrollbar_list1.grid(row=3, column=0, sticky=(tk.E, tk.W))
+xscrollbar_list1.grid(row=4, column=0, sticky=(tk.E, tk.W))
 listbox_list1["xscrollcommand"] = xscrollbar_list1.set

 # List of bad files
--- a/alpha/ui/0407.dll
+++ b/alpha/ui/0407.dll
--- a/alpha/ui/0409.dll
+++ b/alpha/ui/0409.dll
--- a/alpha/ui/040c.dll
+++ b/alpha/ui/040c.dll
--- a/alpha/ui/0410.dll
+++ b/alpha/ui/0410.dll
--- a/alpha/ui/0411.dll
+++ b/alpha/ui/0411.dll
--- a/alpha/ui/0412.dll
+++ b/alpha/ui/0412.dll
--- a/alpha/ui/0413.dll
+++ b/alpha/ui/0413.dll
--- a/alpha/ui/0419.dll
+++ b/alpha/ui/0419.dll
--- a/alpha/ui/0804.dll
+++ b/alpha/ui/0804.dll
--- a/alpha/ui/0c0a.dll
+++ b/alpha/ui/0c0a.dll
--- a/alpha/ui/3009.dll
+++ b/alpha/ui/3009.dll
--- a/source/ResourceUI/0407/Res0407.rc
+++ b/source/ResourceUI/0407/Res0407.rc
--- a/source/ResourceUI/0409/Res0409.rc
+++ b/source/ResourceUI/0409/Res0409.rc
--- a/source/ResourceUI/040c/Res040c.rc
+++ b/source/ResourceUI/040c/Res040c.rc
--- a/source/ResourceUI/0410/Res0410.rc
+++ b/source/ResourceUI/0410/Res0410.rc
--- a/source/ResourceUI/0411/Res0411.rc
+++ b/source/ResourceUI/0411/Res0411.rc
--- a/source/ResourceUI/0412/0412.vcxproj
+++ b/source/ResourceUI/0412/0412.vcxproj
@@ -0,0 +1,62 @@
+<?xml version="1.0" encoding="utf-8"?>
+<Project DefaultTargets="Build" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
+  <ItemGroup Label="ProjectConfigurations">
+    <ProjectConfiguration Include="Release|Win32">
+      <Configuration>Release</Configuration>
+      <Platform>Win32</Platform>
+    </ProjectConfiguration>
+  </ItemGroup>
+  <PropertyGroup Label="Globals">
+    <VCProjectVersion>17.0</VCProjectVersion>
+    <Keyword>Win32Proj</Keyword>
+    <ProjectGuid>{e8d64ddc-9687-4d16-b2a6-224cab82f8b3}</ProjectGuid>
+    <RootNamespace>My0412</RootNamespace>
+    <WindowsTargetPlatformVersion>10.0</WindowsTargetPlatformVersion>
+  </PropertyGroup>
+  <Import Project="$(VCTargetsPath)\Microsoft.Cpp.Default.props" />
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'" Label="Configuration">
+    <ConfigurationType>DynamicLibrary</ConfigurationType>
+    <PlatformToolset>v143</PlatformToolset>
+    <CharacterSet>Unicode</CharacterSet>
+    <WholeProgramOptimization>false</WholeProgramOptimization>
+  </PropertyGroup>
+  <Import Project="$(VCTargetsPath)\Microsoft.Cpp.props" />
+  <ImportGroup Label="ExtensionSettings">
+  </ImportGroup>
+  <ImportGroup Label="Shared">
+  </ImportGroup>
+  <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <PropertyGroup Label="UserMacros" />
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
+    <GenerateManifest>false</GenerateManifest>
+  </PropertyGroup>
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
+    <ClCompile>
+      <IntrinsicFunctions>true</IntrinsicFunctions>
+      <WarningLevel>Level3</WarningLevel>
+      <FunctionLevelLinking>true</FunctionLevelLinking>
+      <SDLCheck>true</SDLCheck>
+      <PreprocessorDefinitions>WIN32;NDEBUG;MY0412_EXPORTS;_WINDOWS;_USRDLL;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <ConformanceMode>true</ConformanceMode>
+    </ClCompile>
+    <Link>
+      <GenerateDebugInformation>false</GenerateDebugInformation>
+      <SubSystem>Windows</SubSystem>
+      <OptimizeReferences>true</OptimizeReferences>
+      <EnableCOMDATFolding>true</EnableCOMDATFolding>
+      <NoEntryPoint>true</NoEntryPoint>
+      <SetChecksum>true</SetChecksum>
+    </Link>
+  </ItemDefinitionGroup>
+  <ItemGroup>
+    <ClInclude Include="resource.h" />
+  </ItemGroup>
+  <ItemGroup>
+    <ResourceCompile Include="Res0412.rc" />
+  </ItemGroup>
+  <Import Project="$(VCTargetsPath)\Microsoft.Cpp.targets" />
+  <ImportGroup Label="ExtensionTargets">
+  </ImportGroup>
+</Project>
--- a/source/ResourceUI/0412/Res0412.rc
+++ b/source/ResourceUI/0412/Res0412.rc
--- a/source/ResourceUI/0412/resource.h
+++ b/source/ResourceUI/0412/resource.h
--- a/source/ResourceUI/0413/Res0413.rc
+++ b/source/ResourceUI/0413/Res0413.rc
--- a/source/ResourceUI/0419/Res0419.rc
+++ b/source/ResourceUI/0419/Res0419.rc
--- a/source/ResourceUI/0804/Res0804.rc
+++ b/source/ResourceUI/0804/Res0804.rc
--- a/source/ResourceUI/0c0a/Res0c0a.rc
+++ b/source/ResourceUI/0c0a/Res0c0a.rc
--- a/source/ResourceUI/3009/Res3009.rc
+++ b/source/ResourceUI/3009/Res3009.rc
--- a/source/ResourceUI/MultiParUI.sln
+++ b/source/ResourceUI/MultiParUI.sln
@@ -23,52 +23,101 @@ Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "3009", "3009\3009.vcxproj",
 EndProject
 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "0c0a", "0c0a\0c0a.vcxproj", "{7BC2D258-305F-4BAE-8249-66A4711CB761}"
 EndProject
+Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "0412", "0412\0412.vcxproj", "{E8D64DDC-9687-4D16-B2A6-224CAB82F8B3}"
+EndProject
 Global
 	GlobalSection(SolutionConfigurationPlatforms) = preSolution
 		Debug|Win32 = Debug|Win32
+		Debug|x64 = Debug|x64
 		Release|Win32 = Release|Win32
+		Release|x64 = Release|x64
 	EndGlobalSection
 	GlobalSection(ProjectConfigurationPlatforms) = postSolution
 		{058F9846-C6FE-4BA6-A8B3-F941711876E5}.Debug|Win32.ActiveCfg = Release|Win32
 		{058F9846-C6FE-4BA6-A8B3-F941711876E5}.Debug|Win32.Build.0 = Release|Win32
+		{058F9846-C6FE-4BA6-A8B3-F941711876E5}.Debug|x64.ActiveCfg = Release|Win32
+		{058F9846-C6FE-4BA6-A8B3-F941711876E5}.Debug|x64.Build.0 = Release|Win32
 		{058F9846-C6FE-4BA6-A8B3-F941711876E5}.Release|Win32.ActiveCfg = Release|Win32
 		{058F9846-C6FE-4BA6-A8B3-F941711876E5}.Release|Win32.Build.0 = Release|Win32
+		{058F9846-C6FE-4BA6-A8B3-F941711876E5}.Release|x64.ActiveCfg = Release|Win32
+		{058F9846-C6FE-4BA6-A8B3-F941711876E5}.Release|x64.Build.0 = Release|Win32
 		{A6B4CE94-B0F5-46C2-8D65-2ACBA4444B80}.Debug|Win32.ActiveCfg = Release|Win32
 		{A6B4CE94-B0F5-46C2-8D65-2ACBA4444B80}.Debug|Win32.Build.0 = Release|Win32
+		{A6B4CE94-B0F5-46C2-8D65-2ACBA4444B80}.Debug|x64.ActiveCfg = Release|Win32
+		{A6B4CE94-B0F5-46C2-8D65-2ACBA4444B80}.Debug|x64.Build.0 = Release|Win32
 		{A6B4CE94-B0F5-46C2-8D65-2ACBA4444B80}.Release|Win32.ActiveCfg = Release|Win32
 		{A6B4CE94-B0F5-46C2-8D65-2ACBA4444B80}.Release|Win32.Build.0 = Release|Win32
+		{A6B4CE94-B0F5-46C2-8D65-2ACBA4444B80}.Release|x64.ActiveCfg = Release|Win32
+		{A6B4CE94-B0F5-46C2-8D65-2ACBA4444B80}.Release|x64.Build.0 = Release|Win32
 		{8BE95D56-2B92-40CD-A8D9-506BA9AFD213}.Debug|Win32.ActiveCfg = Release|Win32
 		{8BE95D56-2B92-40CD-A8D9-506BA9AFD213}.Debug|Win32.Build.0 = Release|Win32
+		{8BE95D56-2B92-40CD-A8D9-506BA9AFD213}.Debug|x64.ActiveCfg = Release|Win32
+		{8BE95D56-2B92-40CD-A8D9-506BA9AFD213}.Debug|x64.Build.0 = Release|Win32
 		{8BE95D56-2B92-40CD-A8D9-506BA9AFD213}.Release|Win32.ActiveCfg = Release|Win32
 		{8BE95D56-2B92-40CD-A8D9-506BA9AFD213}.Release|Win32.Build.0 = Release|Win32
+		{8BE95D56-2B92-40CD-A8D9-506BA9AFD213}.Release|x64.ActiveCfg = Release|Win32
+		{8BE95D56-2B92-40CD-A8D9-506BA9AFD213}.Release|x64.Build.0 = Release|Win32
 		{386E588F-363C-4763-830F-4738F947B5D9}.Debug|Win32.ActiveCfg = Release|Win32
 		{386E588F-363C-4763-830F-4738F947B5D9}.Debug|Win32.Build.0 = Release|Win32
+		{386E588F-363C-4763-830F-4738F947B5D9}.Debug|x64.ActiveCfg = Release|Win32
+		{386E588F-363C-4763-830F-4738F947B5D9}.Debug|x64.Build.0 = Release|Win32
 		{386E588F-363C-4763-830F-4738F947B5D9}.Release|Win32.ActiveCfg = Release|Win32
 		{386E588F-363C-4763-830F-4738F947B5D9}.Release|Win32.Build.0 = Release|Win32
+		{386E588F-363C-4763-830F-4738F947B5D9}.Release|x64.ActiveCfg = Release|Win32
+		{386E588F-363C-4763-830F-4738F947B5D9}.Release|x64.Build.0 = Release|Win32
 		{9BFFB67E-6EAB-452B-AB40-10C13A894895}.Debug|Win32.ActiveCfg = Release|Win32
 		{9BFFB67E-6EAB-452B-AB40-10C13A894895}.Debug|Win32.Build.0 = Release|Win32
+		{9BFFB67E-6EAB-452B-AB40-10C13A894895}.Debug|x64.ActiveCfg = Release|Win32
+		{9BFFB67E-6EAB-452B-AB40-10C13A894895}.Debug|x64.Build.0 = Release|Win32
 		{9BFFB67E-6EAB-452B-AB40-10C13A894895}.Release|Win32.ActiveCfg = Release|Win32
 		{9BFFB67E-6EAB-452B-AB40-10C13A894895}.Release|Win32.Build.0 = Release|Win32
+		{9BFFB67E-6EAB-452B-AB40-10C13A894895}.Release|x64.ActiveCfg = Release|Win32
+		{9BFFB67E-6EAB-452B-AB40-10C13A894895}.Release|x64.Build.0 = Release|Win32
 		{41E89B6A-B137-4756-8C7A-E4A4309627DB}.Debug|Win32.ActiveCfg = Release|Win32
 		{41E89B6A-B137-4756-8C7A-E4A4309627DB}.Debug|Win32.Build.0 = Release|Win32
+		{41E89B6A-B137-4756-8C7A-E4A4309627DB}.Debug|x64.ActiveCfg = Release|Win32
+		{41E89B6A-B137-4756-8C7A-E4A4309627DB}.Debug|x64.Build.0 = Release|Win32
 		{41E89B6A-B137-4756-8C7A-E4A4309627DB}.Release|Win32.ActiveCfg = Release|Win32
 		{41E89B6A-B137-4756-8C7A-E4A4309627DB}.Release|Win32.Build.0 = Release|Win32
+		{41E89B6A-B137-4756-8C7A-E4A4309627DB}.Release|x64.ActiveCfg = Release|Win32
+		{41E89B6A-B137-4756-8C7A-E4A4309627DB}.Release|x64.Build.0 = Release|Win32
 		{F5774034-4459-41E4-A34C-5694159088C7}.Debug|Win32.ActiveCfg = Release|Win32
 		{F5774034-4459-41E4-A34C-5694159088C7}.Debug|Win32.Build.0 = Release|Win32
+		{F5774034-4459-41E4-A34C-5694159088C7}.Debug|x64.ActiveCfg = Release|Win32
+		{F5774034-4459-41E4-A34C-5694159088C7}.Debug|x64.Build.0 = Release|Win32
 		{F5774034-4459-41E4-A34C-5694159088C7}.Release|Win32.ActiveCfg = Release|Win32
 		{F5774034-4459-41E4-A34C-5694159088C7}.Release|Win32.Build.0 = Release|Win32
+		{F5774034-4459-41E4-A34C-5694159088C7}.Release|x64.ActiveCfg = Release|Win32
+		{F5774034-4459-41E4-A34C-5694159088C7}.Release|x64.Build.0 = Release|Win32
 		{25EB68DE-0594-4D2F-B31F-50375524D04A}.Debug|Win32.ActiveCfg = Release|Win32
 		{25EB68DE-0594-4D2F-B31F-50375524D04A}.Debug|Win32.Build.0 = Release|Win32
+		{25EB68DE-0594-4D2F-B31F-50375524D04A}.Debug|x64.ActiveCfg = Release|Win32
+		{25EB68DE-0594-4D2F-B31F-50375524D04A}.Debug|x64.Build.0 = Release|Win32
 		{25EB68DE-0594-4D2F-B31F-50375524D04A}.Release|Win32.ActiveCfg = Release|Win32
 		{25EB68DE-0594-4D2F-B31F-50375524D04A}.Release|Win32.Build.0 = Release|Win32
+		{25EB68DE-0594-4D2F-B31F-50375524D04A}.Release|x64.ActiveCfg = Release|Win32
+		{25EB68DE-0594-4D2F-B31F-50375524D04A}.Release|x64.Build.0 = Release|Win32
 		{B316EAF0-4D5E-446C-8520-D720ECD1F3AC}.Debug|Win32.ActiveCfg = Release|Win32
 		{B316EAF0-4D5E-446C-8520-D720ECD1F3AC}.Debug|Win32.Build.0 = Release|Win32
+		{B316EAF0-4D5E-446C-8520-D720ECD1F3AC}.Debug|x64.ActiveCfg = Release|Win32
+		{B316EAF0-4D5E-446C-8520-D720ECD1F3AC}.Debug|x64.Build.0 = Release|Win32
 		{B316EAF0-4D5E-446C-8520-D720ECD1F3AC}.Release|Win32.ActiveCfg = Release|Win32
 		{B316EAF0-4D5E-446C-8520-D720ECD1F3AC}.Release|Win32.Build.0 = Release|Win32
+		{B316EAF0-4D5E-446C-8520-D720ECD1F3AC}.Release|x64.ActiveCfg = Release|Win32
+		{B316EAF0-4D5E-446C-8520-D720ECD1F3AC}.Release|x64.Build.0 = Release|Win32
 		{7BC2D258-305F-4BAE-8249-66A4711CB761}.Debug|Win32.ActiveCfg = Release|Win32
 		{7BC2D258-305F-4BAE-8249-66A4711CB761}.Debug|Win32.Build.0 = Release|Win32
+		{7BC2D258-305F-4BAE-8249-66A4711CB761}.Debug|x64.ActiveCfg = Release|Win32
+		{7BC2D258-305F-4BAE-8249-66A4711CB761}.Debug|x64.Build.0 = Release|Win32
 		{7BC2D258-305F-4BAE-8249-66A4711CB761}.Release|Win32.ActiveCfg = Release|Win32
 		{7BC2D258-305F-4BAE-8249-66A4711CB761}.Release|Win32.Build.0 = Release|Win32
+		{7BC2D258-305F-4BAE-8249-66A4711CB761}.Release|x64.ActiveCfg = Release|Win32
+		{7BC2D258-305F-4BAE-8249-66A4711CB761}.Release|x64.Build.0 = Release|Win32
+		{E8D64DDC-9687-4D16-B2A6-224CAB82F8B3}.Debug|Win32.ActiveCfg = Release|Win32
+		{E8D64DDC-9687-4D16-B2A6-224CAB82F8B3}.Debug|x64.ActiveCfg = Release|Win32
+		{E8D64DDC-9687-4D16-B2A6-224CAB82F8B3}.Release|Win32.ActiveCfg = Release|Win32
+		{E8D64DDC-9687-4D16-B2A6-224CAB82F8B3}.Release|Win32.Build.0 = Release|Win32
+		{E8D64DDC-9687-4D16-B2A6-224CAB82F8B3}.Release|x64.ActiveCfg = Release|Win32
 	EndGlobalSection
 	GlobalSection(SolutionProperties) = preSolution
 		HideSolutionNode = FALSE
--- a/source/ShellExt/Command_ShlExt.txt
+++ b/source/ShellExt/Command_ShlExt.txt
@@ -64,7 +64,7 @@ append something to the section name like "[0x0409ignore]".
 If you erase these strings or lines, default strings are used.

 "CreateHelp" and "VerifyHelp" in old version were removed,
-because they are ignored on recent Windows OS like (Vista, 7, 8).
+because they are ignored on recent Windows OS like (Windows 7, 8, 10).

 Strings may contain one "&" for keyboard short-cut.
 Each strings should be reasonably short (under 40 characters).
--- a/source/ShellExt/MultiParShlExt.ini
+++ b/source/ShellExt/MultiParShlExt.ini
--- a/source/ShellExt/ShellExt.cpp
+++ b/source/ShellExt/ShellExt.cpp
@@ -1,4 +1,4 @@
-// Copyright : 2023-03-24 Yutaka Sawada
+// Copyright : 2024-11-30 Yutaka Sawada
 // License : The MIT license

 // ShellExt.cpp : DLL アプリケーション用のエントリ ポイントを定義します。
@@ -11,7 +11,7 @@
 #define UNICODE
 #endif
 #ifndef _WIN32_WINNT
-#define _WIN32_WINNT 0x0600	// Windows Vista or later
+#define _WIN32_WINNT 0x0601	// Windows 7 or later
 #endif

 #include <windows.h>
--- a/source/ShellExt/ShellExt.rc
+++ b/source/ShellExt/ShellExt.rc
--- a/source/par1j/ReadMe1_English.txt
+++ b/source/par1j/ReadMe1_English.txt
@@ -18,7 +18,7 @@ Parchive 1.0 client by Yutaka Sawada
 You cannot specify Non-Recovery-Set files. (Empty files are set.)
 Number of recovery files are limited to 99.

- This requires a PC of Windows Vista or later (Windows 7, 8, 10, 11).
+ This requires a PC of Windows 7 or later (Windows 8, 10, 11).
 This is developed with Visual Studio 2022 on Windows 10.


--- a/source/par1j/ReadMe1_Japanese.txt
+++ b/source/par1j/ReadMe1_Japanese.txt
@@ -61,7 +61,7 @@ WinRAR
 <EFBFBD>\<5C>[<5B>X<EFBFBD>E<EFBFBD>u<EFBFBD><75><EFBFBD>b<EFBFBD>N<EFBFBD>ƃp<C683><70><EFBFBD>e<EFBFBD>B<EFBFBD>E<EFBFBD>u<EFBFBD><75><EFBFBD>b<EFBFBD>N<EFBFBD>̍<EFBFBD><CC8D>v<EFBFBD><76> 256<35>܂łł<C582><C582>B
 <EFBFBD><EFBFBD><EFBFBD>J<EFBFBD>o<EFBFBD><EFBFBD><EFBFBD>E<EFBFBD>t<EFBFBD>@<40>C<EFBFBD><43><EFBFBD>͍ő<CD8D><C591><EFBFBD> 99<39>܂łł<C582><C582>B

-<EFBFBD>@<40><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><C28B><EFBFBD> Windows Vista <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ȍ~ (Windows 7, 8, 10, 11) <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>p<EFBFBD>\<5C>R<EFBFBD><52><EFBFBD>ł<EFBFBD><C582>B
+<EFBFBD>@<40><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><C28B><EFBFBD> Windows 7 <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ȍ~ (Windows 8, 10, 11) <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>p<EFBFBD>\<5C>R<EFBFBD><52><EFBFBD>ł<EFBFBD><C582>B
 Win32 API <20><> VC <20><><EFBFBD><EFBFBD><EFBFBD>^<5E>C<EFBFBD><43><EFBFBD><EFBFBD><EFBFBD>g<EFBFBD><67><EFBFBD>Ă<EFBFBD><C482>̂ŁA
 <EFBFBD>\<5C>[<5B>X<EFBFBD>E<EFBFBD>R<EFBFBD>[<5B>h<EFBFBD><68><EFBFBD>R<EFBFBD><52><EFBFBD>p<EFBFBD>C<EFBFBD><43><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ɂ<EFBFBD> Visual Studio 2022 <20>ȍ~<7E><><EFBFBD>K<EFBFBD>v<EFBFBD>ł<EFBFBD><C582>B

--- a/source/par1j/common1.c
+++ b/source/par1j/common1.c
@@ -1,5 +1,5 @@
 // common.c
-// Copyright : 2023-03-13 Yutaka Sawada
+// Copyright : 2024-11-30 Yutaka Sawada
 // License : GPL

 #ifndef _UNICODE
@@ -9,7 +9,7 @@
 #define UNICODE
 #endif
 #ifndef _WIN32_WINNT
-#define _WIN32_WINNT 0x0600	// Windows Vista or later
+#define _WIN32_WINNT 0x0601	// Windows 7 or later
 #endif

 #include <conio.h>
--- a/source/par1j/ini.c
+++ b/source/par1j/ini.c
@@ -1,5 +1,5 @@
 // ini.c
-// Copyright : 2022-01-15 Yutaka Sawada
+// Copyright : 2024-11-30 Yutaka Sawada
 // License : GPL

 #ifndef _UNICODE
@@ -9,7 +9,7 @@
 #define UNICODE
 #endif
 #ifndef _WIN32_WINNT
-#define _WIN32_WINNT 0x0600	// Windows Vista or later
+#define _WIN32_WINNT 0x0601	// Windows 7 or later
 #endif

 #include <malloc.h>
--- a/source/par1j/par1.c
+++ b/source/par1j/par1.c
@@ -1,5 +1,5 @@
 // par1.c
-// Copyright : 2022-02-16 Yutaka Sawada
+// Copyright : 2024-11-30 Yutaka Sawada
 // License : GPL

 #ifndef _UNICODE
@@ -9,7 +9,7 @@
 #define UNICODE
 #endif
 #ifndef _WIN32_WINNT
-#define _WIN32_WINNT 0x0600	// Windows Vista or later
+#define _WIN32_WINNT 0x0601	// Windows 7 or later
 #endif

 #include <stdio.h>
--- a/source/par1j/par1_cmd.c
+++ b/source/par1j/par1_cmd.c
@@ -1,5 +1,5 @@
 // par1_cmd.c
-// Copyright : 2023-03-14 Yutaka Sawada
+// Copyright : 2024-11-30 Yutaka Sawada
 // License : GPL

 #ifndef _UNICODE
@@ -9,7 +9,7 @@
 #define UNICODE
 #endif
 #ifndef _WIN32_WINNT
-#define _WIN32_WINNT 0x0600	// Windows Vista or later
+#define _WIN32_WINNT 0x0601	// Windows 7 or later
 #endif

 #include <stdio.h>
--- a/source/par1j/res_par1j.rc
+++ b/source/par1j/res_par1j.rc
--- a/source/par1j/version.h
+++ b/source/par1j/version.h
@@ -1,2 +1,2 @@
-#define FILE_VERSION "1.3.2.8"	// ファイルのバージョン番号
-#define PRODUCT_VERSION 0x132	// クライアントのバージョン番号
+#define FILE_VERSION "1.3.3.4"	// ファイルのバージョン番号
+#define PRODUCT_VERSION 0x133	// クライアントのバージョン番号
--- a/source/par2j/Command_par2j.txt
+++ b/source/par2j/Command_par2j.txt
@@ -1,4 +1,4 @@
-[ par2j.exe - version 1.3.3.2 or later ]
+[ par2j.exe - version 1.3.3.4 or later ]

 Type "par2j.exe" to see version, test integrity, and show usage below.

@@ -386,6 +386,25 @@ The format is "/lc#" (# is from 1 to 32 as the number of using threads).

 for example,  /lc1 to use single Core, /lc508 to use half Cores and GPU

+ /lcb :
+ This is for Cache Blocking. (CPU cache optimization)
+By default, this value is set-associative size of CPU L2 cache.
+Maximum value is 32767. It will be multipled by 64 KB.
+To disable cache optimization, set "/lcb0".
+
+ /lcs :
+ This is for large buffer size at calculating multiple files' hashes.
+By default, this value is set-associative size of CPU L3 cache.
+Maximum value is 65535. It will be multipled by 64 KB.
+When you set "/lcs0", large buffer size will become 2 MB by default.
+
+ /lcm :
+ This is for max number of chunks to calculate at once. (CPU shared cache optimization)
+By default, this value may be rate of L3 cache size / L2 cache size.
+The value may be changed by some factors in experimental results.
+Maximum value is 32768. Lower values than 8 will be same as 32768.
+To disable cache optimization, set "/lcm0".
+
 /m :
 Set this, if you want to set memory usage.
 If too many memory is allocated, system will use swap file.
--- a/source/par2j/ReadMe2_English.txt
+++ b/source/par2j/ReadMe2_English.txt
@@ -31,7 +31,7 @@ Parchive 2.0 client by Yutaka Sawada
 Verifying file use same memory as the file or double of block size.
 Recovering block use more memory as the number of block is many.

- This requires a PC of Windows Vista or later (Windows 7, 8, 10, 11).
+ This requires a PC of Windows 7 or later (Windows 8, 10, 11).
 This is developed with Visual Studio 2022 on Windows 10.


--- a/source/par2j/ReadMe2_Japanese.txt
+++ b/source/par2j/ReadMe2_Japanese.txt
@@ -1,140 +1,140 @@
+
+PAR 2.0 の修復用データを作ってファイルの破損や消失に備えます

-PAR 2.0 <20>̏C<CC8F><43><EFBFBD>p<EFBFBD>f<EFBFBD>[<5B>^<5E><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ăt<C483>@<40>C<EFBFBD><43><EFBFBD>̔j<CC94><6A><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ɔ<EFBFBD><C994><EFBFBD><EFBFBD>܂<EFBFBD>
-
-<EFBFBD>V<EFBFBD>c <20>L <20>ɂ<EFBFBD><C982><EFBFBD> Parchive 2.0 <20>N<EFBFBD><4E><EFBFBD>C<EFBFBD>A<EFBFBD><41><EFBFBD>g
+澤田 豊 による Parchive 2.0 クライアント

 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */

-[ <EFBFBD>ȒP<EFBFBD>ȉ<EFBFBD><EFBFBD><EFBFBD> ]
+[ 簡単な解説 ]

-<EFBFBD>@<40><><EFBFBD><EFBFBD><EFBFBD>̃\<5C>[<5B>X<EFBFBD>E<EFBFBD>t<EFBFBD>@<40>C<EFBFBD><43><EFBFBD><EFBFBD><EFBFBD>烊<EFBFBD>J<EFBFBD>o<EFBFBD><6F><EFBFBD>E<EFBFBD>t<EFBFBD>@<40>C<EFBFBD><43><EFBFBD><EFBFBD><EFBFBD>쐬<EFBFBD><EC90AC><EFBFBD>āA
-<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>̃t<EFBFBD>@<40>C<EFBFBD><43><EFBFBD>̈ꕔ<CC88><EA9594><EFBFBD>j<EFBFBD><6A><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ă<EFBFBD><C482>A
-<EFBFBD>c<EFBFBD><EFBFBD><EFBFBD>ꂽ<EFBFBD>\<5C>[<5B>X<EFBFBD>E<EFBFBD>t<EFBFBD>@<40>C<EFBFBD><43><EFBFBD>ƃ<EFBFBD><C683>J<EFBFBD>o<EFBFBD><6F><EFBFBD>E<EFBFBD>t<EFBFBD>@<40>C<EFBFBD><43><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>A
-<EFBFBD>t<EFBFBD>@<40>C<EFBFBD><43><EFBFBD><EFBFBD><EFBFBD>C<EFBFBD><43><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ׂ̃\<5C>t<EFBFBD>g<EFBFBD>ł<EFBFBD><C582>B
-PAR 1.0 <EFBFBD><EFBFBD><EFBFBD>t<EFBFBD>@<40>C<EFBFBD><43><EFBFBD>P<EFBFBD>ʂŏC<C58F><43><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>̂ɔ<CC82><C994>ׂāA
-PAR 2.0 <EFBFBD>̓t<EFBFBD>@<40>C<EFBFBD><43><EFBFBD>𕡐<EFBFBD><F095A190>u<EFBFBD><75><EFBFBD>b<EFBFBD>N<EFBFBD>ɕ<EFBFBD><C995><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ă<EFBFBD><C482>̃u<CC83><75><EFBFBD>b<EFBFBD>N<EFBFBD>P<EFBFBD>ʂŏC<C58F><43><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>̂ŁA
-<EFBFBD>t<EFBFBD>@<40>C<EFBFBD><43><EFBFBD>̈ꕔ<CC88><EA9594><EFBFBD>j<EFBFBD><6A><EFBFBD><EFBFBD><EFBFBD>Ă<EFBFBD><C482>j<EFBFBD><6A><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ȊO<C88A>̃u<CC83><75><EFBFBD>b<EFBFBD>N<EFBFBD>͖<EFBFBD><CD96><EFBFBD><EFBFBD>Ŏ<EFBFBD><C58E><EFBFBD><EFBFBD>o<EFBFBD><6F><EFBFBD><EFBFBD><EFBFBD>Ƃ<EFBFBD><C682>ł<EFBFBD><C582>܂<EFBFBD><DC82>B
-<EFBFBD><EFBFBD><EFBFBD>̂<EFBFBD><EFBFBD>߁A<EFBFBD><EFBFBD><EFBFBD>蕡<EFBFBD>G<EFBFBD>ȃG<EFBFBD><EFBFBD><EFBFBD>[<5B>ɂ<EFBFBD><C982><EFBFBD><EFBFBD>Ȃ<EFBFBD><C882>璷<EFBFBD><E792B7><EFBFBD>őΏ<C591><CE8F><EFBFBD><EFBFBD>邱<EFBFBD>Ƃ<EFBFBD><C682>ł<EFBFBD><C582>܂<EFBFBD><DC82>B
+　複数のソース・ファイルからリカバリ・ファイルを作成して、
+それらのファイルの一部が破損したり消失しても、
+残されたソース・ファイルとリカバリ・ファイルから、
+ファイルを修復する為のソフトです。
+PAR 1.0 がファイル単位で修復するのに比べて、
+PAR 2.0 はファイルを複数ブロックに分割してそのブロック単位で修復するので、
+ファイルの一部が破損しても破損部分以外のブロックは無傷で取り出すことができます。
+そのため、より複雑なエラーにも少ない冗長性で対処することができます。

-<EFBFBD>@<40><><EFBFBD>J<EFBFBD>o<EFBFBD><6F><EFBFBD>E<EFBFBD>t<EFBFBD>@<40>C<EFBFBD><43><EFBFBD><EFBFBD><EFBFBD>X<C281>ɓƗ<C993><C697><EFBFBD><EFBFBD><EFBFBD><EFBFBD>p<EFBFBD>P<EFBFBD>b<EFBFBD>g<EFBFBD>ō\<5C><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>\<5C><><EFBFBD>Ȃ̂ŁA
-<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>I<EFBFBD>Ȕj<EFBFBD><EFBFBD><EFBFBD>ɋ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>āA<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>L<EFBFBD><EFBFBD><EFBFBD>Ɏg<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ƃ<EFBFBD><EFBFBD>ł<EFBFBD><EFBFBD>܂<EFBFBD><EFBFBD>B
-<EFBFBD>u<EFBFBD><EFBFBD><EFBFBD>b<EFBFBD>N<EFBFBD>E<EFBFBD>T<EFBFBD>C<EFBFBD>Y<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>قǋǒn<EFBFBD>I<EFBFBD>ȃG<EFBFBD><EFBFBD><EFBFBD>[<5B><><EFBFBD><EFBFBD><EFBFBD>ɉe<C989><65><EFBFBD><EFBFBD><EFBFBD>ɂ<EFBFBD><C982><EFBFBD><EFBFBD>Ȃ<EFBFBD><C882>A
-<EFBFBD>C<EFBFBD><EFBFBD><EFBFBD>ɕK<EFBFBD>v<EFBFBD>ȃ<EFBFBD><EFBFBD>J<EFBFBD>o<EFBFBD><EFBFBD><EFBFBD>E<EFBFBD>t<EFBFBD>@<40>C<EFBFBD><43><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ȃ<EFBFBD><C882>čς݂܂<DD82><DC82>B
-<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>A<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ꂽ<EFBFBD>\<5C>[<5B>X<EFBFBD>E<EFBFBD>u<EFBFBD><75><EFBFBD>b<EFBFBD>N<EFBFBD>𕜌<EFBFBD><F0959C8C><EFBFBD><EFBFBD>邽<EFBFBD>߂ɂ<DF82>
-<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>̃p<EFBFBD><EFBFBD><EFBFBD>e<EFBFBD>B<EFBFBD>E<EFBFBD>u<EFBFBD><EFBFBD><EFBFBD>b<EFBFBD>N<EFBFBD><EFBFBD><EFBFBD>K<EFBFBD>v<EFBFBD>ɂȂ<EFBFBD><EFBFBD>Ƃ<EFBFBD><EFBFBD><EFBFBD> PAR <20>̊<EFBFBD><CC8A>{<7B><><EFBFBD><EFBFBD><EFBFBD>͓<EFBFBD><CD93><EFBFBD><EFBFBD>ł<EFBFBD><C582>B
-<EFBFBD>쐬<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>p<EFBFBD><EFBFBD><EFBFBD>e<EFBFBD>B<EFBFBD>E<EFBFBD>u<EFBFBD><EFBFBD><EFBFBD>b<EFBFBD>N<EFBFBD>̐<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ł<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʂŁA
-<EFBFBD>u<EFBFBD><EFBFBD><EFBFBD>b<EFBFBD>N<EFBFBD>E<EFBFBD>T<EFBFBD>C<EFBFBD>Y<EFBFBD>͂<EFBFBD><EFBFBD>̕<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>P<EFBFBD>ʂɂȂ<EFBFBD><EFBFBD>܂<EFBFBD><EFBFBD>B
+　リカバリ・ファイルも個々に独立したパケットで構成される構造なので、
+部分的な破損に強くて、より有効に使うことができます。
+ブロック・サイズが小さいほど局地的なエラーが他に影響しにくくなり、
+修復に必要なリカバリ・ファイルも少なくて済みます。
+しかし、失われたソース・ブロックを復元するためには
+同数のパリティ・ブロックが必要になるという PAR の基本原理は同じです。
+作成するパリティ・ブロックの数が復元できる量で、
+ブロック・サイズはその復元する単位になります。

-<EFBFBD>@PAR 2.0 <EFBFBD>̓t<EFBFBD>@<40>C<EFBFBD><43><EFBFBD><EFBFBD><EFBFBD>Ƀf<C983>B<EFBFBD><42><EFBFBD>N<EFBFBD>g<EFBFBD><67><EFBFBD><EFBFBD><EFBFBD>܂ނ<DC82><DE82>Ƃ<EFBFBD><C682>ł<EFBFBD><C582><EFBFBD><EFBFBD>̂ŁA
-<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>̃t<EFBFBD>H<EFBFBD><EFBFBD><EFBFBD>_<EFBFBD>ɎU<EFBFBD><EFBFBD><EFBFBD>΂<EFBFBD><EFBFBD><EFBFBD><EFBFBD>t<EFBFBD>@<40>C<EFBFBD><43><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>̂܂܏C<DC8F><43><EFBFBD><EFBFBD><EFBFBD>邱<EFBFBD>Ƃ<EFBFBD><C682>ł<EFBFBD><C582><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ƁA
-PAR 1.0 <EFBFBD>ɔ<EFBFBD><EFBFBD>ׂĂ<EFBFBD><EFBFBD>葽<EFBFBD><EFBFBD><EFBFBD>̃t<EFBFBD>@<40>C<EFBFBD><43><EFBFBD><EFBFBD><EFBFBD>_<EFBFBD><5F><EFBFBD>ɏC<C98F><43><EFBFBD>ł<EFBFBD><C582>Ďg<C48E><67><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>͂悭<CD82>Ȃ<EFBFBD><C882>Ă܂<C482><DC82>B
-<EFBFBD><EFBFBD><EFBFBD>̔<EFBFBD><EFBFBD>ʁA<EFBFBD>傫<EFBFBD>ȃt<EFBFBD>@<40>C<EFBFBD><43><EFBFBD>⑽<EFBFBD><E291BD><EFBFBD>̃u<CC83><75><EFBFBD>b<EFBFBD>N<EFBFBD><4E><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ƁA
-<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>[<5B><><EFBFBD><EFBFBD><EF82AA><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>v<EFBFBD>Z<EFBFBD>ɂ₽<C982><E282BD><EFBFBD>Ǝ<EFBFBD><C68E>Ԃ<EFBFBD><D482><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>܂<EFBFBD><DC82>B
-<EFBFBD>@<40>\<5C>I<EFBFBD>ɂ<EFBFBD> PAR 2.0 <20>̕<EFBFBD><CC95><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʔłł<C582><C582><EFBFBD><EFBFBD>A<EFBFBD>\<5C><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>G<EFBFBD>őΉ<C591><CE89>\<5C>t<EFBFBD>g<EFBFBD><67><EFBFBD>قƂ<D982><C682>ǂȂ<C782><C882>A
-<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>\<5C>ȃp<C883>\<5C>R<EFBFBD><52><EFBFBD>łȂ<C582><C882>Ǝ<EFBFBD><C68E>p<EFBFBD>I<EFBFBD>ȏ<EFBFBD><C88F><EFBFBD><EFBFBD><EFBFBD><EFBFBD>x<EFBFBD>𓾂<EFBFBD><F093BE82><EFBFBD><EFBFBD>Ȃ<EFBFBD><C882><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>܂<EFBFBD><DC82><EFBFBD><EFBFBD>B
-<EFBFBD><EFBFBD><EFBFBD>ɔ<EFBFBD><EFBFBD>͂ȃp<EFBFBD>\<5C>R<EFBFBD><52><EFBFBD>ł̓V<CD83><56><EFBFBD>v<EFBFBD><76><EFBFBD>Ōy<C58C><79><EFBFBD><EFBFBD> PAR 1.0 <20>̕<EFBFBD><CC95><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ă邱<C482>Ƃ<EFBFBD><C682><EFBFBD><EFBFBD><EFBFBD><EFBFBD>̂ŁA
-<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>p<EFBFBD>r<EFBFBD>ɉ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ďg<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ă<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>B
+　PAR 2.0 はファイル名にディレクトリも含むことができるので、
+複数のフォルダに散らばったファイルをそのまま修復することができたりと、
+PAR 1.0 に比べてより多くのファイルを柔軟に修復できて使い勝手はよくなってます。
+その反面、大きなファイルや多数のブロックを処理すると、
+メモリー消費が増えたり計算にやたらと時間がかかります。
+機能的には PAR 2.0 の方が上位版ですが、構造が複雑で対応ソフトがほとんどなく、
+高性能なパソコンでないと実用的な処理速度を得られないかもしれません。
+特に非力なパソコンではシンプルで軽快な PAR 1.0 の方が向いてることもあるので、
+環境や用途に応じて使い分けてください。



 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */

-[ <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>d<EFBFBD>l<EFBFBD>Ȃ<EFBFBD> ]
+[ 特徴や仕様など ]

-<EFBFBD>@Parity Archive 2.0 <EFBFBD>̖{<7B><> par2cmdline <EFBFBD><EFBFBD> QuickPar <EFBFBD>ɔ<EFBFBD><EFBFBD>ׂāA
-<EFBFBD><EFBFBD><EFBFBD>J<EFBFBD>o<EFBFBD><EFBFBD><EFBFBD>E<EFBFBD>t<EFBFBD>@<40>C<EFBFBD><43><EFBFBD>ɃR<C983><52><EFBFBD><EFBFBD><EFBFBD>g<EFBFBD><67><EFBFBD>t<EFBFBD><74><EFBFBD>邱<EFBFBD>Ƃ<EFBFBD><C682>ł<EFBFBD><C582>܂<EFBFBD><DC82>B
-<EFBFBD><EFBFBD><EFBFBD>j<EFBFBD>R<EFBFBD>[<5B>h<EFBFBD><68><EFBFBD>ǂݏ<C782><DD8F><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>̂Ń}<7D><><EFBFBD>`<60>o<EFBFBD>C<EFBFBD>g<EFBFBD><67><EFBFBD><EFBFBD><EFBFBD>ɂ<EFBFBD><C982>Ή<EFBFBD><CE89><EFBFBD><EFBFBD>Ă܂<C482><DC82>B
-<EFBFBD>T<EFBFBD>C<EFBFBD>Y<EFBFBD><EFBFBD> 0<>̋<EFBFBD><CC8B>t<EFBFBD>@<40>C<EFBFBD><43><EFBFBD>ɂ<EFBFBD><C982>Ή<EFBFBD><CE89><EFBFBD><EFBFBD>Ă܂<C482><DC82>B
-par2cmdline <EFBFBD>̓T<EFBFBD>u<EFBFBD>E<EFBFBD>f<EFBFBD>B<EFBFBD><EFBFBD><EFBFBD>N<EFBFBD>g<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>t<EFBFBD>@<40>C<EFBFBD><43><EFBFBD><EFBFBD><EFBFBD>Ƃ<EFBFBD><C682>ĔF<C494><46><EFBFBD><EFBFBD><EFBFBD>A
-QuickPar <EFBFBD>͖<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>܂<EFBFBD><EFBFBD><EFBFBD><EFBFBD>A<EFBFBD><EFBFBD><EFBFBD>̃A<EFBFBD>v<EFBFBD><EFBFBD><EFBFBD>P<EFBFBD>[<5B>V<EFBFBD><56><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
-<EFBFBD>t<EFBFBD>H<EFBFBD><EFBFBD><EFBFBD>_<EFBFBD><EFBFBD><EFBFBD>T<EFBFBD>u<EFBFBD>E<EFBFBD>f<EFBFBD>B<EFBFBD><EFBFBD><EFBFBD>N<EFBFBD>g<EFBFBD><EFBFBD><EFBFBD>Ȃǂ̃f<EFBFBD>B<EFBFBD><EFBFBD><EFBFBD>N<EFBFBD>g<EFBFBD><EFBFBD><EFBFBD>\<5C><><EFBFBD>𕜌<EFBFBD><F0959C8C><EFBFBD><EFBFBD>邱<EFBFBD>Ƃ<EFBFBD><C682>ł<EFBFBD><C582>܂<EFBFBD><DC82>B
+　Parity Archive 2.0 の本家 par2cmdline や QuickPar に比べて、
+リカバリ・ファイルにコメントを付けることができます。
+ユニコードを読み書きするのでマルチバイト文字にも対応してます。
+サイズが 0の空ファイルにも対応してます。
+par2cmdline はサブ・ディレクトリをファイル名として認識し、
+QuickPar は無視しますが、このアプリケーションは
+フォルダやサブ・ディレクトリなどのディレクトリ構造を復元することができます。

-<EFBFBD>@QuickPar <EFBFBD>͖<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ɃS<EFBFBD>~<7E><><EFBFBD>t<EFBFBD><74><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ԂŔ<D482><C594>[<5B>ȃu<C883><75><EFBFBD>b<EFBFBD>N<EFBFBD>̒<EFBFBD><CC92>O<EFBFBD>̃u<CC83><75><EFBFBD>b<EFBFBD>N<EFBFBD><4E><EFBFBD>j<EFBFBD><6A><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
-<EFBFBD><EFBFBD><EFBFBD>̃u<EFBFBD><EFBFBD><EFBFBD>b<EFBFBD>N<EFBFBD><EFBFBD><EFBFBD>F<EFBFBD><EFBFBD><EFBFBD>ł<EFBFBD><EFBFBD>Ȃ<EFBFBD><EFBFBD>Ȃ<EFBFBD><EFBFBD>܂<EFBFBD><EFBFBD><EFBFBD><EFBFBD>A<EFBFBD><EFBFBD><EFBFBD>̃A<EFBFBD>v<EFBFBD><EFBFBD><EFBFBD>P<EFBFBD>[<5B>V<EFBFBD><56><EFBFBD><EFBFBD><EFBFBD>ł͂<C582><CD82><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ɣ<EFBFBD><C694>肵<EFBFBD>܂<EFBFBD><DC82>B
-<EFBFBD>܂<EFBFBD><EFBFBD>A<EFBFBD>u<EFBFBD><EFBFBD><EFBFBD>b<EFBFBD>N<EFBFBD>E<EFBFBD>T<EFBFBD>C<EFBFBD>Y<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ē<EFBFBD><EFBFBD><EFBFBD><EFBFBD>t<EFBFBD>@<40>C<EFBFBD><43><EFBFBD><EFBFBD><EFBFBD>œ<EFBFBD><C593>e<EFBFBD><65><EFBFBD>d<EFBFBD><64><EFBFBD><EFBFBD><EFBFBD>Ă<EFBFBD><C482>ƁA
-<EFBFBD>j<EFBFBD><EFBFBD><EFBFBD>u<EFBFBD><EFBFBD><EFBFBD>b<EFBFBD>N<EFBFBD>ȍ~<7E>Ɍ<EFBFBD><C98C>̃u<CC83><75><EFBFBD>b<EFBFBD>N<EFBFBD><4E><EFBFBD><EFBFBD><EFBFBD>Ɍ<EFBFBD><C98C>o<EFBFBD><6F><EFBFBD>錻<EFBFBD>ۂ<EFBFBD><DB82>N<EFBFBD><4E><EFBFBD>āA
-<EFBFBD><EFBFBD><EFBFBD>̌<EFBFBD><EFBFBD>Ŗ{<7B><><EFBFBD>̏<EFBFBD><CC8F>Ԃ̃u<CC83><75><EFBFBD>b<EFBFBD>N<EFBFBD><4E><EFBFBD>F<EFBFBD><46><EFBFBD>ł<EFBFBD><C582>Ȃ<EFBFBD><C882>Ȃ<EFBFBD><C882>Ă<EFBFBD><C482>܂<EFBFBD><DC82><EFBFBD><EFBFBD>肪<EFBFBD><E882AA><EFBFBD><EFBFBD><EFBFBD>܂<EFBFBD><DC82><EFBFBD><EFBFBD>A
-<EFBFBD><EFBFBD><EFBFBD>̃A<EFBFBD>v<EFBFBD><EFBFBD><EFBFBD>P<EFBFBD>[<5B>V<EFBFBD><56><EFBFBD><EFBFBD><EFBFBD>ł͌<C582><CD8C>o<EFBFBD><6F><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ԂɊւ<C98A><D682>炸<EFBFBD><E782B8><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ƔF<C694><46><EFBFBD><EFBFBD><EFBFBD>܂<EFBFBD><DC82>B
-<EFBFBD>j<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>̌<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> 1<>o<EFBFBD>C<EFBFBD>g<EFBFBD><67><EFBFBD><EFBFBD><C288>v<EFBFBD><76><EFBFBD><EFBFBD><EFBFBD>u<EFBFBD><75><EFBFBD>b<EFBFBD>N<EFBFBD>𒲂ׂĂ<D782><C482><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ߎ<EFBFBD><DF8E>Ԃ͂<D482><CD82><EFBFBD><EFBFBD><EFBFBD><EFBFBD>܂<EFBFBD><DC82><EFBFBD><EFBFBD>A
-<EFBFBD>j<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>t<EFBFBD>@<40>C<EFBFBD><43><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>葽<EFBFBD><E891BD><EFBFBD>̗<EFBFBD><CC97>p<EFBFBD>\<5C>ȃu<C883><75><EFBFBD>b<EFBFBD>N<EFBFBD><4E><EFBFBD><EFBFBD><EFBFBD>o<EFBFBD><6F><EFBFBD>邩<EFBFBD><E982A9><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>܂<EFBFBD><DC82><EFBFBD><EFBFBD>B
+　QuickPar は末尾にゴミが付いた状態で半端なブロックの直前のブロックが破損すると
+そのブロックを認識できなくなりますが、このアプリケーションではきちんと判定します。
+また、ブロック・サイズが小さくて同一ファイル内で内容が重複してると、
+破損ブロック以降に後のブロックを先に検出する現象が起きて、
+その後で本来の順番のブロックを認識できなくなってしまう問題がありますが、
+このアプリケーションでは検出した順番に関わらずきちんと認識します。
+破損部分の検査で 1バイトずつ一致するブロックを調べていくため時間はかかりますが、
+破損したファイルからより多くの利用可能なブロックを検出するかもしれません。

-<EFBFBD>@QuickPar <EFBFBD>͔j<EFBFBD><EFBFBD><EFBFBD>t<EFBFBD>@<40>C<EFBFBD><43><EFBFBD><EFBFBD><EFBFBD>C<EFBFBD><43><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ۂɁA<C981><41><EFBFBD><EFBFBD><EFBFBD>̔j<CC94><6A><EFBFBD>u<EFBFBD><75><EFBFBD>b<EFBFBD>N<EFBFBD>̈ʒu<CA92>ƏC<C68F><43><EFBFBD>Ɏg<C98E><67>
-<EFBFBD>p<EFBFBD><EFBFBD><EFBFBD>e<EFBFBD>B<EFBFBD>E<EFBFBD>u<EFBFBD><EFBFBD><EFBFBD>b<EFBFBD>N<EFBFBD>̑g<EFBFBD>ݍ<EFBFBD><EFBFBD>킹<EFBFBD>ɂ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ẮA<EFBFBD>p<EFBFBD><EFBFBD><EFBFBD>e<EFBFBD>B<EFBFBD>E<EFBFBD>u<EFBFBD><EFBFBD><EFBFBD>b<EFBFBD>N<EFBFBD>̐<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ă<EFBFBD><EFBFBD>Ă<EFBFBD>
-<EFBFBD>C<EFBFBD><EFBFBD><EFBFBD>ł<EFBFBD><EFBFBD>Ȃ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ƃ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>܂<EFBFBD><EFBFBD>B<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>́A<EFBFBD>C<EFBFBD><EFBFBD><EFBFBD>Ɏg<EFBFBD><EFBFBD><EFBFBD>p<EFBFBD><EFBFBD><EFBFBD>e<EFBFBD>B<EFBFBD>E<EFBFBD>u<EFBFBD><EFBFBD><EFBFBD>b<EFBFBD>N<EFBFBD><EFBFBD>
-<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ƂŕύX<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ƃ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>߂<EFBFBD><EFBFBD>ǂ<EFBFBD><EFBFBD>ȍ<EFBFBD><EFBFBD>Ƃ<EFBFBD><EFBFBD>K<EFBFBD>v<EFBFBD>ɂȂ<EFBFBD><EFBFBD>܂<EFBFBD><EFBFBD>B
-<EFBFBD><EFBFBD><EFBFBD>̃A<EFBFBD>v<EFBFBD><EFBFBD><EFBFBD>P<EFBFBD>[<5B>V<EFBFBD><56><EFBFBD><EFBFBD><EFBFBD>ł͖<C582><CD96><EFBFBD><EFBFBD>̂<EFBFBD><CC82><EFBFBD><EFBFBD>p<EFBFBD><70><EFBFBD>e<EFBFBD>B<EFBFBD>E<EFBFBD>u<EFBFBD><75><EFBFBD>b<EFBFBD>N<EFBFBD><4E><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ď<EFBFBD><C48E><EFBFBD><EFBFBD>I<EFBFBD><49>
-<EFBFBD>ēx<EFBFBD>C<EFBFBD><EFBFBD><EFBFBD>ł<EFBFBD><EFBFBD>邩<EFBFBD><EFBFBD><EFBFBD>݂Ă<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>̂Ŋy<EFBFBD>ł<EFBFBD><EFBFBD>B
+　QuickPar は破損ファイルを修復する際に、特定の破損ブロックの位置と修復に使う
+パリティ・ブロックの組み合わせによっては、パリティ・ブロックの数が足りていても
+修復できないことがあります。そういう時は、修復に使うパリティ・ブロックを
+手作業で変更するというめんどうな作業が必要になります。
+このアプリケーションでは問題のあるパリティ・ブロックを除いて自動的に
+再度修復できるか試みてくれるので楽です。

-<EFBFBD>@<40><><EFBFBD><EFBFBD><EFBFBD>ꂽ<EFBFBD>\<5C>[<5B>X<EFBFBD>E<EFBFBD>u<EFBFBD><75><EFBFBD>b<EFBFBD>N<EFBFBD>Ɠ<EFBFBD><C693><EFBFBD><EFBFBD><EFBFBD><EFBFBD>e<EFBFBD>̃u<CC83><75><EFBFBD>b<EFBFBD>N<EFBFBD><4E><EFBFBD><EFBFBD><EFBFBD>݂<EFBFBD><DD82>ė<EFBFBD><C497>p<EFBFBD>ł<EFBFBD><C582>邩<EFBFBD><E982A9>
-<EFBFBD>`<60>F<EFBFBD>b<EFBFBD>N<EFBFBD>T<EFBFBD><54><EFBFBD><EFBFBD><EFBFBD>g<EFBFBD><67><EFBFBD>Č<EFBFBD><C48C><EFBFBD><EFBFBD><EFBFBD><EFBFBD>A<EFBFBD><41><EFBFBD><EFBFBD><C282><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ꍇ<EFBFBD>͒<EFBFBD><CD92>ڃR<DA83>s<EFBFBD>[<5B><><EFBFBD>܂<EFBFBD><DC82>B
-<EFBFBD><EFBFBD><EFBFBD>̂<EFBFBD><EFBFBD>߁A<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>e<EFBFBD>̃\<5C>[<5B>X<EFBFBD>E<EFBFBD>u<EFBFBD><75><EFBFBD>b<EFBFBD>N<EFBFBD><4E><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>܂܂<DC82><DC82>鎞<EFBFBD>́A
-<EFBFBD>C<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>̌v<EFBFBD>Z<EFBFBD>ʂ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ƌ<EFBFBD><EFBFBD>ɏ<EFBFBD><EFBFBD>Ȃ<EFBFBD><EFBFBD>p<EFBFBD><EFBFBD><EFBFBD>e<EFBFBD>B<EFBFBD>E<EFBFBD>u<EFBFBD><EFBFBD><EFBFBD>b<EFBFBD>N<EFBFBD>ł<EFBFBD><EFBFBD>C<EFBFBD><EFBFBD><EFBFBD>ł<EFBFBD><EFBFBD>܂<EFBFBD><EFBFBD>B
-<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>I<EFBFBD>ɓ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>e<EFBFBD>̃t<EFBFBD>@<40>C<EFBFBD><43><EFBFBD><EFBFBD><EFBFBD>܂܂<DC82><DC82><EFBFBD><EFBFBD>Ȃ<EFBFBD><C882>AQuickPar <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>C<EFBFBD><43><EFBFBD>ł<EFBFBD><C582><EFBFBD><EFBFBD>\<5C><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ł<EFBFBD><C582>B
+　失われたソース・ブロックと同じ内容のブロックが存在して利用できるかを
+チェックサムを使って検索し、見つかった場合は直接コピーします。
+そのため、同じ内容のソース・ブロックが複数含まれる時は、
+修復時の計算量が減ると共に少ないパリティ・ブロックでも修復できます。
+部分的に同じ内容のファイルが含まれるなら、QuickPar よりも修復できる可能性が高いです。

-<EFBFBD>@<40>u<EFBFBD><75><EFBFBD>b<EFBFBD>N<EFBFBD>E<EFBFBD>T<EFBFBD>C<EFBFBD>Y<EFBFBD><59> 4<>o<EFBFBD>C<EFBFBD>g<EFBFBD>̏ꍇ<CC8F>́A
-<EFBFBD>j<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>\<5C>[<5B>X<EFBFBD>E<EFBFBD>u<EFBFBD><75><EFBFBD>b<EFBFBD>N<EFBFBD>̃`<60>F<EFBFBD>b<EFBFBD>N<EFBFBD>T<EFBFBD><54><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>e<EFBFBD><65><EFBFBD>t<EFBFBD>Z<EFBFBD><5A><EFBFBD><EFBFBD><EFBFBD>̂ŁA
-<EFBFBD>p<EFBFBD><EFBFBD><EFBFBD>e<EFBFBD>B<EFBFBD>E<EFBFBD>u<EFBFBD><EFBFBD><EFBFBD>b<EFBFBD>N<EFBFBD><EFBFBD><EFBFBD>S<EFBFBD><EFBFBD><EFBFBD>g<EFBFBD><EFBFBD><EFBFBD>Ȃ<EFBFBD><EFBFBD>ŏC<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>邱<EFBFBD>Ƃ<EFBFBD><EFBFBD>ł<EFBFBD><EFBFBD>܂<EFBFBD><EFBFBD>B
-<EFBFBD>u<EFBFBD><EFBFBD><EFBFBD>b<EFBFBD>N<EFBFBD>E<EFBFBD>T<EFBFBD>C<EFBFBD>Y<EFBFBD><EFBFBD> 8<>o<EFBFBD>C<EFBFBD>g<EFBFBD>̏ꍇ<CC8F>̏<EFBFBD><CC8F><EFBFBD><EFBFBD>́A
-1<EFBFBD>u<EFBFBD><EFBFBD><EFBFBD>b<EFBFBD>N<EFBFBD><EFBFBD><EFBFBD>t<EFBFBD>Z<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>̂ɉ<EFBFBD><EFBFBD>\<5C><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>̂Ŏ<CC82><C58E><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ă<EFBFBD><C482>܂<EFBFBD><DC82><EFBFBD><EFBFBD>B
-<EFBFBD>\<5C>[<5B>X<EFBFBD>E<EFBFBD>R<EFBFBD>[<5B>h<EFBFBD><68><EFBFBD>ɂ͂<C982><CD82><EFBFBD><EFBFBD>̂Ŋ<CC82><C58A>]<5D><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> 8<>o<EFBFBD>C<EFBFBD>g<EFBFBD>p<EFBFBD><70><EFBFBD>ǉ<EFBFBD><C789>ł<EFBFBD><C582>܂<EFBFBD><DC82>B
+　ブロック・サイズが 4バイトの場合は、
+破損したソース・ブロックのチェックサムから内容を逆算するので、
+パリティ・ブロックを全く使わないで修復することができます。
+ブロック・サイズが 8バイトの場合の処理は、
+1ブロックを逆算するのに何十分もかかるので実装していません。
+ソース・コード上にはあるので希望があれば 8バイト用も追加できます。

-<EFBFBD>@<40><><EFBFBD><EFBFBD><EFBFBD>t<EFBFBD>@<40>C<EFBFBD><43><EFBFBD>̍<EFBFBD><CC8D>v<EFBFBD>T<EFBFBD>C<EFBFBD>Y<EFBFBD><59><EFBFBD>󂫃<EFBFBD><F382AB83><EFBFBD><EFBFBD><EFBFBD><EFBFBD>[<5B>ʂ̔<CA82><CC94><EFBFBD><EFBFBD>ȉ<EFBFBD><C889>Ȃ<EFBFBD><C882>΁A
-<EFBFBD><EFBFBD><EFBFBD><EFBFBD> PAR 2.0 <EFBFBD>N<EFBFBD><EFBFBD><EFBFBD>C<EFBFBD>A<EFBFBD><EFBFBD><EFBFBD>g<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ƍ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ɏC<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>܂<EFBFBD><EFBFBD>B
-<EFBFBD>}<7D><><EFBFBD>`<60>E<EFBFBD>R<EFBFBD>A CPU <20>ɑΉ<C991><CE89><EFBFBD><EFBFBD>ă}<7D><><EFBFBD>`<60>E<EFBFBD>X<EFBFBD><58><EFBFBD>b<EFBFBD>h<EFBFBD>ōs<C58D>񉉎Z<F189898E><5A>
-<EFBFBD><EFBFBD><EFBFBD>[<5B>h<EFBFBD>E<EFBFBD>\<5C><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>̌v<CC8C>Z<EFBFBD><5A><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>̂ŁACPU <20>R<EFBFBD>A<EFBFBD><41> 2<>ȏ゠<C88F><E382A0><EFBFBD>ƍX<C68D>ɑ<EFBFBD><C991><EFBFBD><EFBFBD>Ȃ<EFBFBD><C882>܂<EFBFBD><DC82>B
-<EFBFBD>V<EFBFBD><EFBFBD><EFBFBD>O<EFBFBD><EFBFBD><EFBFBD>E<EFBFBD>R<EFBFBD>A<EFBFBD>ł<EFBFBD> QuickPar <EFBFBD><EFBFBD> 2<>{<7B>A
-<EFBFBD>f<EFBFBD><EFBFBD><EFBFBD>A<EFBFBD><EFBFBD><EFBFBD>E<EFBFBD>R<EFBFBD>A<EFBFBD><EFBFBD><EFBFBD><EFBFBD> QuickPar <20><> 3<>{<7B><><EFBFBD>炢<EFBFBD>̑<EFBFBD><CC91>x<EFBFBD><78><EFBFBD>ł܂<C582><DC82>B
-<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>A<EFBFBD>󂫃<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>[<5B><><EFBFBD><EFBFBD><EFBFBD>Ȃ<EFBFBD><C882><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>t<EFBFBD>@<40>C<EFBFBD><43><EFBFBD><EFBFBD><EFBFBD>傫<EFBFBD><E582AB><EFBFBD>ƁA
-<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ȃ<EFBFBD><EFBFBD>ċɒ[<5B>ɏ<EFBFBD><C98F><EFBFBD><EFBFBD><EFBFBD><EFBFBD>x<EFBFBD><78><EFBFBD>ቺ<EFBFBD><E189BA><EFBFBD>܂<EFBFBD><DC82>B
+　扱うファイルの合計サイズが空きメモリー量の半分以下ならば、
+他の PAR 2.0 クライアントよりもずっと高速に修復します。
+マルチ・コア CPU に対応してマルチ・スレッドで行列演算と
+リード・ソロモン符号の計算をするので、CPU コアが 2個以上あると更に速くなります。
+シングル・コアでも QuickPar の 2倍、
+デュアル・コアだと QuickPar の 3倍ぐらいの速度がでます。
+ただし、空きメモリーが少なかったりファイルが大きいと、
+効率が悪くなって極端に処理速度が低下します。

-<EFBFBD>@<40><><EFBFBD>{<7B><><EFBFBD>̊J<CC8A><4A><EFBFBD><EFBFBD><C28B>ō<EFBFBD><C58D><EFBFBD><EFBFBD>Ă<EFBFBD><C482>̂ŁA
-<EFBFBD><EFBFBD><EFBFBD>{<7B><><EFBFBD>̃t<CC83>@<40>C<EFBFBD><43><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>f<EFBFBD>B<EFBFBD><42><EFBFBD>N<EFBFBD>g<EFBFBD><67><EFBFBD>ɑΉ<C991><CE89><EFBFBD><EFBFBD>Ă܂<C482><DC82>B
-4GB <EFBFBD>ȏ<EFBFBD><EFBFBD>̃t<EFBFBD>@<40>C<EFBFBD><43><EFBFBD>ɂ<EFBFBD><C982>Ή<EFBFBD><CE89><EFBFBD><EFBFBD>Ă܂<C482><DC82><EFBFBD><EFBFBD>A
-<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>C<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>x<EFBFBD>̓t<EFBFBD>@<40>C<EFBFBD><43><EFBFBD>E<EFBFBD>A<EFBFBD>N<EFBFBD>Z<EFBFBD>X<EFBFBD><58><EFBFBD>x<EFBFBD>ɑ傫<C991><E582AB><EFBFBD>ˑ<EFBFBD><CB91><EFBFBD><EFBFBD>܂<EFBFBD><DC82>B
+　日本語の開発環境で作ってるので、
+日本語のファイル名やディレクトリに対応してます。
+4GB 以上のファイルにも対応してますが、
+検査や修復速度はファイル・アクセス速度に大きく依存します。

-<EFBFBD>@<40>J<EFBFBD><4A><EFBFBD>Ҍ<EFBFBD><D28C><EFBFBD><EFBFBD>ɁA
-<EFBFBD>\<5C>[<5B>X<EFBFBD>E<EFBFBD>R<EFBFBD>[<5B>h<EFBFBD><68><EFBFBD><EFBFBD><EFBFBD>J<EFBFBD><4A><EFBFBD><EFBFBD><EFBFBD>Ă<EFBFBD><C482>̂ŁA<C581>ׂ<EFBFBD><D782><EFBFBD><EFBFBD>d<EFBFBD>l<EFBFBD><6C><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ŕύX<CF8D>ł<EFBFBD><C582>܂<EFBFBD><DC82>B
-<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ɕs<EFBFBD><EFBFBD><EFBFBD>ȓ_<EFBFBD><EFBFBD><EFBFBD>o<EFBFBD>O<EFBFBD><EFBFBD><EFBFBD>ۂ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ă<EFBFBD><EFBFBD>A<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ŋm<EFBFBD>F<EFBFBD><EFBFBD><EFBFBD>邱<EFBFBD>Ƃ<EFBFBD><EFBFBD>ł<EFBFBD><EFBFBD>Ĉ<EFBFBD><EFBFBD>S<EFBFBD>ł<EFBFBD><EFBFBD>B
-<EFBFBD>\<5C>[<5B>X<EFBFBD>E<EFBFBD>t<EFBFBD>@<40>C<EFBFBD><43><EFBFBD><EFBFBD><EFBFBD>t<EFBFBD>@<40>C<EFBFBD><43><EFBFBD>E<EFBFBD><45><EFBFBD>X<EFBFBD>g<EFBFBD>Ŏw<C58E>肷<EFBFBD>邱<EFBFBD>Ƃ<EFBFBD><C682>ł<EFBFBD><C582>܂<EFBFBD><DC82>B
-<EFBFBD>\<5C>[<5B>X<EFBFBD>E<EFBFBD>t<EFBFBD>@<40>C<EFBFBD><43><EFBFBD>ƃ<EFBFBD><C683>J<EFBFBD>o<EFBFBD><6F><EFBFBD>E<EFBFBD>t<EFBFBD>@<40>C<EFBFBD><43><EFBFBD><EFBFBD><EFBFBD>قȂ<D982><C882>ꏊ<EFBFBD>ɂ<EFBFBD><C982><EFBFBD><EFBFBD>Ă<EFBFBD><C482><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ł<EFBFBD><C582>܂<EFBFBD><DC82>B
+　開発者向けに、
+ソース・コードが公開されてるので、細かい仕様を自分で変更できます。
+動作に不明な点やバグっぽい挙動があっても、自分で確認することができて安心です。
+ソース・ファイルをファイル・リストで指定することができます。
+ソース・ファイルとリカバリ・ファイルが異なる場所にあっても処理できます。

-<EFBFBD>@<40><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ƃ<EFBFBD><C682>ẮA
-<EFBFBD>u<EFBFBD><EFBFBD><EFBFBD>b<EFBFBD>N<EFBFBD>E<EFBFBD>T<EFBFBD>C<EFBFBD>Y<EFBFBD><EFBFBD> 2 GB <20><><EFBFBD><EFBFBD><EFBFBD>ɂ<EFBFBD><C982><EFBFBD><EFBFBD>Ή<EFBFBD><CE89><EFBFBD><EFBFBD>Ă܂<C482><DC82><EFBFBD><EFBFBD>B
-<EFBFBD>p<EFBFBD><EFBFBD><EFBFBD>e<EFBFBD>B<EFBFBD>v<EFBFBD>Z<EFBFBD>Ɋ܂߂Ȃ<EFBFBD><EFBFBD>t<EFBFBD>@<40>C<EFBFBD><43> (<28>m<EFBFBD><6D><EFBFBD>E<EFBFBD><45><EFBFBD>J<EFBFBD>o<EFBFBD><6F><EFBFBD>E<EFBFBD>Z<EFBFBD>b<EFBFBD>g) <20>̎w<CC8E><77><EFBFBD>͂ł<CD82><C582>܂<EFBFBD><DC82><EFBFBD><EFBFBD>B
-<EFBFBD>\<5C>[<5B>X<EFBFBD>E<EFBFBD>u<EFBFBD><75><EFBFBD>b<EFBFBD>N<EFBFBD>͍ő<CD8D><C591><EFBFBD> 32768<36>܂łł<C582><C582>B(<28>t<EFBFBD>@<40>C<EFBFBD><43><EFBFBD><EFBFBD><EFBFBD><EFBFBD> 65536<EFBFBD>܂<EFBFBD>)
-<EFBFBD>쐬<EFBFBD>ł<EFBFBD><EFBFBD><EFBFBD><EFBFBD>p<EFBFBD><EFBFBD><EFBFBD>e<EFBFBD>B<EFBFBD>E<EFBFBD>u<EFBFBD><EFBFBD><EFBFBD>b<EFBFBD>N<EFBFBD>͍ő<EFBFBD><EFBFBD><EFBFBD> 65535<33>܂łł<C582><C582>B
+　制限事項としては、
+ブロック・サイズは 2 GB 未満にしか対応してません。
+パリティ計算に含めないファイル (ノン・リカバリ・セット) の指定はできません。
+ソース・ブロックは最大で 32768個までです。(ファイル数は 65536個まで)
+作成できるパリティ・ブロックは最大で 65535個までです。

-<EFBFBD>@<40><><EFBFBD>ӓ_<D393>̓<EFBFBD><CD83><EFBFBD><EFBFBD><EFBFBD><EFBFBD>[<5B><><EFBFBD><EFBFBD><EFBFBD>ʂ<EFBFBD><CA82>c<EFBFBD><63><EFBFBD>Ȃ<EFBFBD><C882>Ƃł<C682><C582>B
-<EFBFBD><EFBFBD><EFBFBD>J<EFBFBD>o<EFBFBD><EFBFBD><EFBFBD>E<EFBFBD>t<EFBFBD>@<40>C<EFBFBD><43><EFBFBD>ŏC<C58F><43><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ۂɂ́A<CD81><41><EFBFBD>[<5B>h<EFBFBD>E<EFBFBD>\<5C><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>̍s<CC8D><73><EFBFBD><EFBFBD><EFBFBD>ϊ<EFBFBD><CF8A><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ׂ<EFBFBD>
-<EFBFBD>u <20>\<5C>[<5B>X<EFBFBD>E<EFBFBD>u<EFBFBD><75><EFBFBD>b<EFBFBD>N<EFBFBD><4E> * <20><><EFBFBD><EFBFBD><EFBFBD>ꂽ<EFBFBD>\<5C>[<5B>X<EFBFBD>E<EFBFBD>u<EFBFBD><75><EFBFBD>b<EFBFBD>N<EFBFBD><4E> * 2 <20>v<EFBFBD>̃<EFBFBD><CC83><EFBFBD><EFBFBD><EFBFBD><EFBFBD>[<5B><><EFBFBD>K<EFBFBD>v<EFBFBD>Ƃ<EFBFBD><C682>܂<EFBFBD><DC82>B
-<EFBFBD>Ⴆ<EFBFBD>΁A<EFBFBD>u<EFBFBD><EFBFBD><EFBFBD>b<EFBFBD>N<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ő<EFBFBD><EFBFBD><EFBFBD> 32768 <20>ɂ<EFBFBD><C982><EFBFBD><EFBFBD>ƁA25% <20>̃u<CC83><75><EFBFBD>b<EFBFBD>N<EFBFBD>𕜌<EFBFBD><F0959C8C><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ɂ<EFBFBD>
-32768 * 8192 * 2 = 500MB <EFBFBD>ȏ<EFBFBD><EFBFBD>̃<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>[<5B><><EFBFBD>K<EFBFBD>v<EFBFBD>Ƃ<EFBFBD><C682>܂<EFBFBD><DC82>B
-<EFBFBD><EFBFBD><EFBFBD>ʂ͏璷<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>傫<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>邱<EFBFBD>Ƃ͖<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>A<EFBFBD>S<EFBFBD>u<EFBFBD><EFBFBD><EFBFBD>b<EFBFBD>N<EFBFBD><EFBFBD><EFBFBD>j<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>邱<EFBFBD>Ƃ<EFBFBD><EFBFBD>܂<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>̂ŁA
-<EFBFBD><EFBFBD><EFBFBD>ۂɎg<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>郁<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>[<5B>͂<EFBFBD><CD82><EFBFBD><EFBFBD>Ə<EFBFBD><C68F>Ȃ<EFBFBD><C882>ł<EFBFBD><C582><EFBFBD><EFBFBD>A<EFBFBD><41><EFBFBD><EFBFBD><EFBFBD>Ȃ<EFBFBD><C882><EFBFBD><EFBFBD>΃G<CE83><47><EFBFBD>[<5B>ɂȂ<C982><C882>܂<EFBFBD><DC82>B
+　注意点はメモリー消費量が膨大なことです。
+リカバリ・ファイルで修復する際には、リード・ソロモン符号の行列を変換する為に
+「 ソース・ブロック数 * 失われたソース・ブロック数 * 2 」のメモリーを必要とします。
+例えば、ブロック数を最大の 32768 にすると、25% のブロックを復元するには
+32768 * 8192 * 2 = 500MB 以上のメモリーを必要とします。
+普通は冗長性を大きくすることは無いし、全ブロックが破損することもまず無いので、
+実際に使われるメモリーはもっと少ないですが、足りなければエラーになります。

-<EFBFBD>@<40>t<EFBFBD>@<40>C<EFBFBD><43><EFBFBD>E<EFBFBD>A<EFBFBD>N<EFBFBD>Z<EFBFBD>X<EFBFBD>p<EFBFBD>o<EFBFBD>b<EFBFBD>t<EFBFBD>@<40>[<5B>́u (<28>\<5C>[<5B>X<EFBFBD>E<EFBFBD>u<EFBFBD><75><EFBFBD>b<EFBFBD>N<EFBFBD><4E> + 2) * <20>u<EFBFBD><75><EFBFBD>b<EFBFBD>N<EFBFBD>E<EFBFBD>T<EFBFBD>C<EFBFBD>Y <20>v
-<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>{<7B>̑傫<CC91><E582AB><EFBFBD>ɂȂ<C982><C882>A<EFBFBD><41><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>[<5B><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ȃ<EFBFBD><C882>ꍇ<EFBFBD>̓u<CD83><75><EFBFBD>b<EFBFBD>N<EFBFBD><4E><EFBFBD>f<EFBFBD>Љ<EFBFBD><D089><EFBFBD><EFBFBD>ď<EFBFBD><C48F><EFBFBD><EFBFBD><EFBFBD><EFBFBD>܂<EFBFBD><DC82>B
-<EFBFBD>f<EFBFBD>ЃT<EFBFBD>C<EFBFBD>Y<EFBFBD>́u 1KB<4B>`<60>u<EFBFBD><75><EFBFBD>b<EFBFBD>N<EFBFBD>E<EFBFBD>T<EFBFBD>C<EFBFBD>Y<EFBFBD>̔<EFBFBD><CC94><EFBFBD> <20>v<EFBFBD>ł<EFBFBD><C582>B
-<EFBFBD>s<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>i<EFBFBD>[<5B><><EFBFBD><EFBFBD><EFBFBD>ׂ̃<D782><CC83><EFBFBD><EFBFBD><EFBFBD><EFBFBD>[<5B><><EFBFBD>D<EFBFBD>悵<EFBFBD>āA<C481>󂫃<EFBFBD><F382AB83><EFBFBD><EFBFBD><EFBFBD><EFBFBD>[<5B><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ȃ<EFBFBD><C882>ꍇ<EFBFBD>ɂ́A
-<EFBFBD>t<EFBFBD>@<40>C<EFBFBD><43><EFBFBD>E<EFBFBD>A<EFBFBD>N<EFBFBD>Z<EFBFBD>X<EFBFBD>p<EFBFBD>o<EFBFBD>b<EFBFBD>t<EFBFBD>@<40>[<5B><><EFBFBD><EFBFBD><EFBFBD>炵<EFBFBD>܂<EFBFBD><DC82><EFBFBD><EFBFBD>A<EFBFBD><41><EFBFBD><EFBFBD><EFBFBD>ł<EFBFBD><C582><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ȃ<EFBFBD><C882><EFBFBD><EFBFBD>΃G<CE83><47><EFBFBD>[<5B><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>܂<EFBFBD><DC82>B
-<EFBFBD>܂<EFBFBD><EFBFBD>A<EFBFBD>u<EFBFBD><EFBFBD><EFBFBD>b<EFBFBD>N<EFBFBD>̒f<EFBFBD>Љ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ƌɒ[<5B>ɏ<EFBFBD><C98F><EFBFBD><EFBFBD><EFBFBD><EFBFBD>x<EFBFBD><78><EFBFBD>ቺ<EFBFBD><E189BA><EFBFBD>܂<EFBFBD><DC82>B
+　ファイル・アクセス用バッファーは「 (ソース・ブロック数 + 2) * ブロック・サイズ 」
+が基本の大きさになり、メモリーが足りない場合はブロックを断片化して処理します。
+断片サイズは「 1KB～ブロック・サイズの半分 」です。
+行列を格納する為のメモリーを優先して、空きメモリーが足りない場合には、
+ファイル・アクセス用バッファーを減らしますが、それでも足りなければエラーが発生します。
+また、ブロックの断片化が激しいと極端に処理速度が低下します。

-<EFBFBD>@<40><><EFBFBD>J<EFBFBD>o<EFBFBD><6F><EFBFBD>E<EFBFBD>t<EFBFBD>@<40>C<EFBFBD><43><EFBFBD><EFBFBD><EFBFBD>\<5C>[<5B>X<EFBFBD>E<EFBFBD>t<EFBFBD>@<40>C<EFBFBD><43><EFBFBD>̌<EFBFBD><CC8C><EFBFBD><EFBFBD>ł́A
-<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>[<5B><><EFBFBD>\<5C><><EFBFBD>ɂ<EFBFBD><C982><EFBFBD><EFBFBD>Ă<EFBFBD> CPU <20><><EFBFBD>\<5C><><EFBFBD>t<EFBFBD>@<40>C<EFBFBD><43><EFBFBD>E<EFBFBD>A<EFBFBD>N<EFBFBD>Z<EFBFBD>X<EFBFBD><58><EFBFBD>x<EFBFBD>Ȃǂɂ<C782><C982><EFBFBD><EFBFBD>ẮA
-<EFBFBD>傫<EFBFBD>ȃt<EFBFBD>@<40>C<EFBFBD><43><EFBFBD>̌<EFBFBD><CC8C><EFBFBD><EFBFBD>ɉ<EFBFBD><C989><EFBFBD><EFBFBD><EFBFBD><EFBFBD>҂<D282><C282>ƂɂȂ邩<C882><E982A9><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>܂<EFBFBD><DC82><EFBFBD><EFBFBD>B
-<EFBFBD>W<EFBFBD><EFBFBD><EFBFBD>ł̓<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>[<5B>ʂ<EFBFBD><CA82>\<5C><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ΏڍׂȌ<D782><C88C><EFBFBD><EFBFBD><EFBFBD><EFBFBD>s<EFBFBD><73><EFBFBD>A<EFBFBD><41><EFBFBD><EFBFBD><EFBFBD>Ȃ<EFBFBD><C882><EFBFBD><EFBFBD>ΊȈՌ<C888><D58C><EFBFBD><EFBFBD>ɂȂ<C982><C882>܂<EFBFBD><DC82>B
-<EFBFBD>j<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ă邩<EFBFBD>ǂ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>̊m<EFBFBD>F<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>̏ꍇ<EFBFBD><EFBFBD><EFBFBD>A<EFBFBD>j<EFBFBD><EFBFBD><EFBFBD>̒<EFBFBD><EFBFBD>x<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ꍇ<EFBFBD>́A
-<EFBFBD>ȈՌ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ł<EFBFBD><EFBFBD>\<5C><><EFBFBD>Ȃ̂ŁA<C581>I<EFBFBD>v<EFBFBD>V<EFBFBD><56><EFBFBD><EFBFBD><EFBFBD>ŏڍ׌<DA8D><D78C><EFBFBD><EFBFBD>𖳌<EFBFBD><F096B38C>ɂ<EFBFBD><C982>邱<EFBFBD>Ƃ<EFBFBD><C682>ł<EFBFBD><C582>܂<EFBFBD><DC82>B
+　リカバリ・ファイルやソース・ファイルの検査では、
+メモリーが十分にあっても CPU 性能やファイル・アクセス速度などによっては、
+大きなファイルの検査に何分も待つことになるかもしれません。
+標準ではメモリー量が十分あれば詳細な検査を行い、足りなければ簡易検査になります。
+破損してるかどうかの確認をしたいだけの場合や、破損の程度が小さい場合は、
+簡易検査でも十分なので、オプションで詳細検査を無効にすることもできます。

-<EFBFBD>@<40><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><C28B><EFBFBD> Windows Vista <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ȍ~ (Windows 7, 8, 10, 11) <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>p<EFBFBD>\<5C>R<EFBFBD><52><EFBFBD>ł<EFBFBD><C582>B
-Win32 API <EFBFBD><EFBFBD> VC <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>^<5E>C<EFBFBD><43><EFBFBD><EFBFBD><EFBFBD>g<EFBFBD><67><EFBFBD>Ă<EFBFBD><C482>̂ŁA
-<EFBFBD>\<5C>[<5B>X<EFBFBD>E<EFBFBD>R<EFBFBD>[<5B>h<EFBFBD><68><EFBFBD>R<EFBFBD><52><EFBFBD>p<EFBFBD>C<EFBFBD><43><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ɂ<EFBFBD> Visual Studio 2022 <EFBFBD>ȍ~<7E><><EFBFBD>K<EFBFBD>v<EFBFBD>ł<EFBFBD><C582>B
+　動作環境は Windows 7 かそれ以降 (Windows 8, 10, 11) が動くパソコンです。
+Win32 API と VC ランタイムを使ってるので、
+ソース・コードをコンパイルするには Visual Studio 2022 以降が必要です。



 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */

-[ <EFBFBD>Q<EFBFBD>l<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>◘<EFBFBD>p<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>\<5C>[<5B>X<EFBFBD>E<EFBFBD>R<EFBFBD>[<5B>h<EFBFBD>A<EFBFBD><41><EFBFBD>C<EFBFBD>u<EFBFBD><75><EFBFBD><EFBFBD><EFBFBD>[<5B>Ȃ<EFBFBD> ]
+[ 参考文献や利用したソース・コード、ライブラリーなど ]

 par2-specifications.pdf
 Parity Volume Set Specification 2.0
@@ -220,31 +220,31 @@ This module is Public Domain.

 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */

-[ <EFBFBD><EFBFBD><EFBFBD>C<EFBFBD>Z<EFBFBD><EFBFBD><EFBFBD>X<EFBFBD>Ȃ<EFBFBD> ]
+[ ライセンスなど ]

-<EFBFBD>@PAR 2.0 <EFBFBD>̃t<EFBFBD>H<EFBFBD>[<5B>}<7D>b<EFBFBD>g<EFBFBD>ɂ<C982><C282>Ă͐<C482><CD90><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>R<EFBFBD>[<5B>h<EFBFBD><68><EFBFBD><EFBFBD><EFBFBD>āA
-<EFBFBD>݊<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ێ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ĂȂ<EFBFBD><EFBFBD>ׂ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ɂȂ<EFBFBD><EFBFBD>悤<EFBFBD>ɂ<EFBFBD><EFBFBD>Ă܂<EFBFBD><EFBFBD>B
-<EFBFBD><EFBFBD><EFBFBD>̐l<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>R<EFBFBD>[<5B>h<EFBFBD>𗬗p<F097AC97><70><EFBFBD>Ă镔<C482><E99594><EFBFBD>̒<EFBFBD><CC92>쌠<EFBFBD>͂<EFBFBD><CD82>̐l<CC90>ɂ<EFBFBD><C982><EFBFBD><EFBFBD>܂<EFBFBD><DC82>B
-<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ȊO<EFBFBD>̕<EFBFBD><EFBFBD><EFBFBD><EFBFBD>̒<EFBFBD><EFBFBD>쌠<EFBFBD><EFBFBD> <20>V<EFBFBD>c <20>L <20>ɂ<EFBFBD><C982><EFBFBD><EFBFBD>܂<EFBFBD><DC82>B
+　PAR 2.0 のフォーマットについては説明書や実装コードを見て、
+互換性を維持してなるべく同じになるようにしてます。
+他の人が書いたコードを流用してる部分の著作権はその人にあります。
+それ以外の部分の著作権は 澤田 豊 にあります。

-<EFBFBD>@<40><><EFBFBD>C<EFBFBD>Z<EFBFBD><5A><EFBFBD>X<EFBFBD><58> GPL <20>Ƃ<EFBFBD><C682><EFBFBD><EFBFBD><EFBFBD><EFBFBD>̂ɏ<CC82><C98F><EFBFBD><EFBFBD><EFBFBD><EFBFBD>܂<EFBFBD><DC82>B
-par2cmdline <EFBFBD><EFBFBD> phpar2 <EFBFBD>̃R<EFBFBD>[<5B>h<EFBFBD>𗬗p<F097AC97><70><EFBFBD>Ă<EFBFBD><C482>āA<C481><41><EFBFBD><EFBFBD><EFBFBD>炪 GPL <20>Ŕz<C594>z<EFBFBD><7A><EFBFBD><EFBFBD><EFBFBD>Ă邩<C482><E982A9><EFBFBD>ł<EFBFBD><C582>B
-GPL <EFBFBD>̃<EFBFBD><EFBFBD>C<EFBFBD>Z<EFBFBD><EFBFBD><EFBFBD>X<EFBFBD>̏ڍׂ͂悭<EFBFBD>킩<EFBFBD><EFBFBD><EFBFBD>Ȃ<EFBFBD><EFBFBD>̂ł<EFBFBD><EFBFBD><EFBFBD><EFBFBD>A
-<EFBFBD><EFBFBD><EFBFBD>p<EFBFBD><EFBFBD><EFBFBD>𕥂<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ƂȂ<EFBFBD><EFBFBD>g<EFBFBD><EFBFBD><EFBFBD>ă\<5C>[<5B>X<EFBFBD>E<EFBFBD>R<EFBFBD>[<5B>h<EFBFBD><68><EFBFBD><EFBFBD><EFBFBD>J<EFBFBD><4A><EFBFBD>邱<EFBFBD>Ƃ<EFBFBD><C682><EFBFBD><EFBFBD><EFBFBD><EFBFBD>݂<EFBFBD><DD82><EFBFBD><EFBFBD>ł<EFBFBD><C582>B
-<EFBFBD>ڂ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ƃ͕t<EFBFBD><EFBFBD><EFBFBD>̉p<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>C<EFBFBD>Z<EFBFBD><EFBFBD><EFBFBD>X<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ǂނ<EFBFBD><EFBFBD>A
-<EFBFBD><EFBFBD><EFBFBD>{<7B><><EFBFBD>̉<EFBFBD><CC89><EFBFBD><EFBFBD>ł<EFBFBD><C582>T<EFBFBD><54><EFBFBD>ēǂ<C493><C782>ł݂Ă<DD82><C482><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>B
+　ライセンスは GPL というものに準拠します。
+par2cmdline や phpar2 のコードを流用していて、それらが GPL で配布されてるからです。
+GPL のライセンスの詳細はよくわからないのですが、
+利用料を払うことなく使えてソース・コードを公開することが条件みたいです。
+詳しいことは付属の英文ライセンス文を読むか、
+日本語の解説でも探して読んでみてください。



 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */

-[ <EFBFBD>A<EFBFBD><EFBFBD><EFBFBD><EFBFBD> ]
+[ 連絡先 ]

-<EFBFBD>@<40><><EFBFBD>͂<EFBFBD><CD82>܂<EFBFBD> (<28>T<EFBFBD>ꂮ<EFBFBD>炢) <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>[<5B><><EFBFBD>m<EFBFBD>F<EFBFBD>ł<EFBFBD><C582>܂<EFBFBD><DC82>񂵁A
-<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> (<28>ꃖ<EFBFBD><EA8396><EFBFBD><EFBFBD><EFBFBD>炢) <20>C<EFBFBD><43><EFBFBD>^<5E>[<5B>l<EFBFBD>b<EFBFBD>g<EFBFBD><67><EFBFBD>g<EFBFBD><67><EFBFBD>Ȃ<EFBFBD><C882><EFBFBD><EFBFBD>Ƃ<EFBFBD><C682><EFBFBD><EFBFBD><EFBFBD><EFBFBD>܂<EFBFBD><DC82>B
-<EFBFBD><EFBFBD><EFBFBD>{<7B>I<EFBFBD>ɃT<C983>|<7C>[<5B>g<EFBFBD>̓<EFBFBD><CD83>[<5B><><EFBFBD>ōs<C58D><73><EFBFBD><EFBFBD><EFBFBD>ƂɂȂ<C982><C882>܂<EFBFBD><DC82><EFBFBD><EFBFBD>A
-<EFBFBD>Ԏ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>߂<EFBFBD><EFBFBD>Ă<EFBFBD><EFBFBD>邩<EFBFBD>͋C<EFBFBD><EFBFBD><EFBFBD>ɂ<EFBFBD><EFBFBD>҂<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>B
+　私はたまに (週一ぐらい) しかメール確認できませんし、
+長期間 (一ヶ月ぐらい) インターネットを使えないこともあります。
+基本的にサポートはメールで行うことになりますが、
+返事がいつ戻ってくるかは気長にお待ちください。

-<EFBFBD><EFBFBD><EFBFBD>O<EFBFBD><EFBFBD> <20>V<EFBFBD>c <20>L <20>ł<EFBFBD><C582>B
-<EFBFBD><EFBFBD><EFBFBD>[<5B><><EFBFBD>E<EFBFBD>A<EFBFBD>h<EFBFBD><68><EFBFBD>X<EFBFBD><58> tenfon (at mark) outlook.jp <EFBFBD>ł<EFBFBD>
-<EFBFBD><EFBFBD><EFBFBD>f<EFBFBD><EFBFBD><EFBFBD>[<5B><><EFBFBD><EFBFBD><EFBFBD>ۂ̕\<5C>L<EFBFBD>Ȃ̂ŁA<C581><41><EFBFBD>ۂ̃<DB82><CC83>[<5B><><EFBFBD>ł<EFBFBD> (at mark) <EFBFBD><EFBFBD> @ <EFBFBD>Ɋ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ă<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>B
+名前は 澤田 豊 です。
+メール・アドレスは tenfon (at mark) outlook.jp です
+迷惑メール拒否の表記なので、実際のメールでは (at mark) を @ に換えてください。
--- a/source/par2j/com.cpp
+++ b/source/par2j/com.cpp
@@ -1,5 +1,5 @@
 // com.c
-// Copyright : 2022-01-30 Yutaka Sawada
+// Copyright : 2024-11-30 Yutaka Sawada
 // License : GPL

 #ifndef _UNICODE
@@ -9,7 +9,7 @@
 #define UNICODE
 #endif
 #ifndef _WIN32_WINNT
-#define _WIN32_WINNT 0x0600	// Windows Vista or later
+#define _WIN32_WINNT 0x0601	// Windows 7 or later
 #endif

 #include <windows.h>
--- a/source/par2j/common2.c
+++ b/source/par2j/common2.c
@@ -1,5 +1,5 @@
 // common2.c
-// Copyright : 2023-10-13 Yutaka Sawada
+// Copyright : 2024-11-30 Yutaka Sawada
 // License : GPL

 #ifndef _UNICODE
@@ -9,7 +9,7 @@
 #define UNICODE
 #endif
 #ifndef _WIN32_WINNT
-#define _WIN32_WINNT 0x0600	// Windows Vista or later
+#define _WIN32_WINNT 0x0601	// Windows 7 or later
 #endif

 #include <conio.h>
@@ -2008,8 +2008,11 @@ void check_cpu(void)
 		if (cache3_size > 0){
 			//printf("L3 cache: %d KB (%d way)\n", cache3_size >> 10 , cache3_way);
 			cpu_cache = cache3_size / cache3_way;	// set-associative のサイズにする
-			if (cpu_cache < 131072)
+			if (cpu_cache < 131072){
 				cpu_cache = 128 << 10;	// 128 KB 以上にする
+			} else {
+				cpu_cache = (cpu_cache + 0xFFFF) & 0xFFFF0000;	// 64 KB の倍数にする
+			}
 		}
 		if (cache2_size > 0){
 			//printf("L2 cache: %d KB (%d way)\n", cache2_size >> 10, cache2_way);
@@ -2030,7 +2033,9 @@ void check_cpu(void)
 						returnLength += returnLength / 2;
 				}
 			}
-			cpu_cache |= returnLength & 0x1FFFF;
+			if (returnLength > 0x8000)
+				returnLength = 0x8000;
+			cpu_cache |= returnLength & 0xFFFF;
 		}
 	}

@@ -2038,7 +2043,7 @@ void check_cpu(void)
 		limit_size = 128 << 10;
 	//printf("Limit size of Cache Blocking: %d KB\n", limit_size >> 10);
 	// cpu_flag の上位 16-bit にキャッシュの制限サイズを置く
-	cpu_flag |= limit_size & 0xFFFF0000;	// 64 KB 未満は無視する
+	cpu_flag |= (limit_size + 0xFFFF) & 0xFFFF0000;	// 64 KB の倍数にする

 	if (core_count == 0){	// 物理コア数が不明なら、論理コア数と同じにする
 		core_count = cpu_num;
--- a/source/par2j/crc.c
+++ b/source/par2j/crc.c
@@ -1,9 +1,9 @@
 // crc.c
-// Copyright : 2022-02-09 Yutaka Sawada
+// Copyright : 2024-11-30 Yutaka Sawada
 // License : GPL

 #ifndef _WIN32_WINNT
-#define _WIN32_WINNT 0x0600	// Windows Vista or later
+#define _WIN32_WINNT 0x0601	// Windows 7 or later
 #endif

 #include <stdio.h>
--- a/source/par2j/create.c
+++ b/source/par2j/create.c
@@ -1,5 +1,5 @@
 // create.c
-// Copyright : 2023-12-12 Yutaka Sawada
+// Copyright : 2024-11-30 Yutaka Sawada
 // License : GPL

 #ifndef _UNICODE
@@ -9,7 +9,7 @@
 #define UNICODE
 #endif
 #ifndef _WIN32_WINNT
-#define _WIN32_WINNT 0x0600	// Windows Vista or later
+#define _WIN32_WINNT 0x0601	// Windows 7 or later
 #endif

 #include <process.h>
@@ -1829,10 +1829,12 @@ int split_files(
 		}
 		if (ext_len > 0){	// 全て数字の拡張子を持つソース・ファイルがあるなら
 			//printf_cp("\n risky name = %s \n", file_name);
+			wcscpy(file_path, file_name);	// 比較用に拡張子を取り除く
+			file_path[name_len] = 0;
 			for (num2 = 0; num2 < file_num; num2++){
 				if (num2 == num)
 					continue;
-				if (_wcsnicmp(list_buf + files[num2].name, file_name, name_len) == 0){
+				if (_wcsicmp(list_buf + files[num2].name, file_path) == 0){
 					//printf_cp(" match name = %s \n", list_buf + files[num2].name);
 					num8 = (files[num2].size + (__int64)split_size - 1) / split_size;
 					split_max = (int)num8;
@@ -1843,7 +1845,7 @@ int split_files(
 					if (((split_max < 1000) && (ext_len >= 5)) || ((split_max < 10000) && (ext_len >= 6)))
 						continue;	// 拡張子の桁数が異なる
 					// 上書きする危険性があるのでエラーにする
-					printf_cp("split bad file, %s\n", file_name);
+					printf_cp("split bad file, %s\n", list_buf + files[num2].name);
 					*cur_num = -1;
 					*cur_id = 0;
 					return 1;
--- a/source/par2j/gf16.c
+++ b/source/par2j/gf16.c
@@ -49,7 +49,7 @@ POSSIBILITY OF SUCH DAMAGE.

 */

-#define _WIN32_WINNT 0x0600	// Windows Vista or later
+#define _WIN32_WINNT 0x0601	// Windows 7 or later

 #include <stdlib.h>
 #include <stdio.h>
--- a/source/par2j/ini.c
+++ b/source/par2j/ini.c
@@ -1,5 +1,5 @@
 // ini.c
-// Copyright : 2022-10-12 Yutaka Sawada
+// Copyright : 2024-11-30 Yutaka Sawada
 // License : GPL

 #ifndef _UNICODE
@@ -9,7 +9,7 @@
 #define UNICODE
 #endif
 #ifndef _WIN32_WINNT
-#define _WIN32_WINNT 0x0600	// Windows Vista or later
+#define _WIN32_WINNT 0x0601	// Windows 7 or later
 #endif

 #include <malloc.h>
--- a/source/par2j/json.c
+++ b/source/par2j/json.c
@@ -1,5 +1,5 @@
 // json.c
-// Copyright : 2023-02-06 Yutaka Sawada
+// Copyright : 2024-11-30 Yutaka Sawada
 // License : GPL

 #ifndef _UNICODE
@@ -9,7 +9,7 @@
 #define UNICODE
 #endif
 #ifndef _WIN32_WINNT
-#define _WIN32_WINNT 0x0600	// Windows Vista or later
+#define _WIN32_WINNT 0x0601	// Windows 7 or later
 #endif

 #include <stdio.h>
--- a/source/par2j/lib_opencl.c
+++ b/source/par2j/lib_opencl.c
@@ -1,9 +1,9 @@
 // lib_opencl.c
-// Copyright : 2023-12-26 Yutaka Sawada
+// Copyright : 2024-11-30 Yutaka Sawada
 // License : GPL

 #ifndef _WIN32_WINNT
-#define _WIN32_WINNT 0x0600	// Windows Vista or later
+#define _WIN32_WINNT 0x0601	// Windows 7 or later
 #endif

 #include <stdio.h>
@@ -75,7 +75,7 @@ typedef cl_int (CL_API_CALL *API_clEnqueueNDRangeKernel)(cl_command_queue, cl_ke
 extern unsigned int cpu_flag;	// declared in common2.h
 extern int cpu_num;

-#define MAX_DEVICE 3
+#define MAX_DEVICE 8

 HMODULE hLibOpenCL = NULL;

@@ -235,6 +235,8 @@ int init_OpenCL(unsigned int unit_size, int *src_max)
 	ret = fn_clGetPlatformIDs(MAX_DEVICE, platform_id, &num_platforms);
 	if (ret != CL_SUCCESS)
 		return (ret << 8) | 10;
+	if (num_platforms > MAX_DEVICE)
+		num_platforms = MAX_DEVICE;
 	if (OpenCL_method & 0x200){	// 選択する順序と初期値を変える
 		gpu_power = INT_MIN;
 	} else {
@@ -254,6 +256,8 @@ int init_OpenCL(unsigned int unit_size, int *src_max)
 		// 環境内の OpenCL 対応機器の数
 		if (fn_clGetDeviceIDs(platform_id[i], CL_DEVICE_TYPE_GPU, MAX_DEVICE, device_id, &num_devices) != CL_SUCCESS)
 			continue;
+		if (num_devices > MAX_DEVICE)
+			num_devices = MAX_DEVICE;

 		for (j = 0; j < (int)num_devices; j++){
 			// デバイスが利用可能か確かめる
@@ -702,7 +706,9 @@ int init_OpenCL(unsigned int unit_size, int *src_max)
 	}
 	if (OpenCL_group_num > data_size){
 		OpenCL_group_num = data_size;
+#ifdef DEBUG_OUTPUT
 		printf("Number of work groups is reduced to %zd\n", OpenCL_group_num);
+#endif
 	}

 	// データへのアクセス方法をデバイスによって変える
--- a/source/par2j/list.c
+++ b/source/par2j/list.c
@@ -1,5 +1,5 @@
 // list.c
-// Copyright : 2023-12-12 Yutaka Sawada
+// Copyright : 2024-11-30 Yutaka Sawada
 // License : GPL

 #ifndef _UNICODE
@@ -9,7 +9,7 @@
 #define UNICODE
 #endif
 #ifndef _WIN32_WINNT
-#define _WIN32_WINNT 0x0600	// Windows Vista or later
+#define _WIN32_WINNT 0x0601	// Windows 7 or later
 #endif

 #include <process.h>
--- a/source/par2j/md5_crc.c
+++ b/source/par2j/md5_crc.c
@@ -1,5 +1,5 @@
 // md5_crc.c
-// Copyright : 2023-12-12 Yutaka Sawada
+// Copyright : 2024-11-30 Yutaka Sawada
 // License : GPL

 #ifndef _UNICODE
@@ -9,7 +9,7 @@
 #define UNICODE
 #endif
 #ifndef _WIN32_WINNT
-#define _WIN32_WINNT 0x0600	// Windows Vista or later
+#define _WIN32_WINNT 0x0601	// Windows 7 or later
 #endif

 #include <stdio.h>
@@ -677,7 +677,7 @@ time1_start = clock();

 	// バッファー・サイズが大きいのでヒープ領域を使う
 	for (io_size = IO_SIZE; io_size <= MAX_BUF_SIZE; io_size += IO_SIZE){	// IO_SIZE の倍数にする
-		if ((io_size + IO_SIZE > (cpu_cache & 0xFFFE0000)) || ((__int64)(io_size + IO_SIZE) * 4 > file_left))
+		if ((io_size + IO_SIZE > (cpu_cache & 0xFFFF0000)) || ((__int64)(io_size + IO_SIZE) * 4 > file_left))
 			break;
 	}
 	buf1 = _aligned_malloc(io_size * 2, 64);
@@ -873,7 +873,7 @@ DWORD WINAPI file_hash_crc2(LPVOID lpParameter)
 	// バッファー・サイズが大きいのでヒープ領域を使う
 	prog_tick = 1;
 	for (io_size = IO_SIZE; io_size <= MAX_BUF_SIZE; io_size += IO_SIZE){	// IO_SIZE の倍数にする
-		if ((io_size + IO_SIZE > (cpu_cache & 0xFFFE0000)) || ((__int64)(io_size + IO_SIZE) * 4 > file_left))
+		if ((io_size + IO_SIZE > (cpu_cache & 0xFFFF0000)) || ((__int64)(io_size + IO_SIZE) * 4 > file_left))
 			break;
 		prog_tick++;
 	}
@@ -1311,7 +1311,7 @@ DWORD WINAPI file_hash_background(LPVOID lpParameter)

 	// バッファー・サイズが大きいのでヒープ領域を使う
 	for (io_size = IO_SIZE; io_size <= MAX_BUF_SIZE; io_size += IO_SIZE){	// IO_SIZE の倍数にする
-		if ((io_size + IO_SIZE > (cpu_cache & 0xFFFE0000)) || ((__int64)(io_size + IO_SIZE) * 4 > file_size))
+		if ((io_size + IO_SIZE > (cpu_cache & 0xFFFF0000)) || ((__int64)(io_size + IO_SIZE) * 4 > file_size))
 			break;
 	}
 	//printf("\n io_size = %d\n", io_size);
--- a/source/par2j/par2.c
+++ b/source/par2j/par2.c
@@ -1,5 +1,5 @@
 // par2.c
-// Copyright : 2023-10-15 Yutaka Sawada
+// Copyright : 2024-11-30 Yutaka Sawada
 // License : GPL

 #ifndef _UNICODE
@@ -9,7 +9,7 @@
 #define UNICODE
 #endif
 #ifndef _WIN32_WINNT
-#define _WIN32_WINNT 0x0600	// Windows Vista or later
+#define _WIN32_WINNT 0x0601	// Windows 7 or later
 #endif

 #include <malloc.h>
--- a/source/par2j/par2_cmd.c
+++ b/source/par2j/par2_cmd.c
@@ -1,5 +1,5 @@
 // par2_cmd.c
-// Copyright : 2023-12-09 Yutaka Sawada
+// Copyright : 2024-11-30 Yutaka Sawada
 // License : GPL

 #ifndef _UNICODE
@@ -9,7 +9,7 @@
 #define UNICODE
 #endif
 #ifndef _WIN32_WINNT
-#define _WIN32_WINNT 0x0600	// Windows Vista or later
+#define _WIN32_WINNT 0x0601	// Windows 7 or later
 #endif

 #include <stdio.h>
@@ -86,7 +86,7 @@ static void print_environment(void)

 	printf("CPU thread\t: %d / %d\n", cpu_num & 0xFFFF, cpu_num >> 24);
 	cpu_num &= 0xFFFF;	// 利用するコア数だけにしておく
-	printf("CPU cache limit : %d KB, %d KB\n", (cpu_flag & 0xFFFF0000) >> 10, (cpu_cache & 0xFFFE0000) >> 10);
+	printf("CPU cache limit : %d KB, %d KB (%d)\n", (cpu_flag & 0xFFFF0000) >> 10, (cpu_cache & 0xFFFF0000) >> 10, cpu_cache & 0xFFFF);
 #ifndef _WIN64	// 32-bit 版は MMX, SSE2, SSSE3, AVX2 のどれかを表示する
 	printf("CPU extra\t:");
 	if (((cpu_flag & 16) != 0) && ((cpu_flag & 256) == 0)){
@@ -1477,48 +1477,77 @@ ri= switch_set & 0x00040000
 					switch_v |= j;
 			// 共通のオプション (数値)
 			} else if (wcsncmp(tmp_p, L"lc", 2) == 0){
-				k = 0;
-				j = 2;
-				while ((j < 2 + 7) && (tmp_p[j] >= '0') && (tmp_p[j] <= '9')){
-					k = (k * 10) + (tmp_p[j] - '0');
-					j++;
-				}
-				if (k & 0x300){	// GPU を使う
-					OpenCL_method = k & 0x003F0300;
-				}
-				if (k & 1024)	// CLMUL と ALTMAP を使わない
-					cpu_flag = (cpu_flag & 0xFFFFFFF7) | 256;
-				if (k & 2048)	// JIT(SSE2) を使わない
-					cpu_flag &= 0xFFFFFF7F;
-				if (k & 4096)	// SSSE3 を使わない
-					cpu_flag &= 0xFFFFFFFE;
-				if (k & 8192)	// AVX2 を使わない
-					cpu_flag &= 0xFFFFFFEF;
-				if (k & 255){	// 使用するコア数を変更する
-					k &= 255;	// 1～255 の範囲
-					// printf("\n lc# = %d , logical = %d, physical = %d \n", k, cpu_num >> 24, (cpu_num & 0x00FF0000) >> 16);
-					if (k == 251){	// 物理コア数の 1/4 にする
-						k = ((cpu_num & 0x00FF0000) >> 16) / 4;
-					} else if (k == 252){	// 物理コア数の半分にする
-						k = ((cpu_num & 0x00FF0000) >> 16) / 2;
-					} else if (k == 253){	// 物理コア数の 3/4 にする
-						k = (((cpu_num & 0x00FF0000) >> 16) * 3) / 4;
-					} else if (k == 254){	// 物理コア数より減らす
-						k = ((cpu_num & 0x00FF0000) >> 16) - 1;
-					} else if (k == 255){	// 物理コア数より増やす
-						k = cpu_num >> 16;
-						k = ((k & 0xFF) + (k >> 8)) / 2;	// 物理コア数と論理コア数の中間にする？
-						// タスクマネージャーにおける CPU使用率は 100%になるけど、速くはならない・・・
-						// k = (k & 0xFF) + ((k >> 8) - (k & 0xFF)) / 4;	// 物理コア数の 5/4 にする？
+				if (tmp_p[2] == 'b'){	// Size of Cache Blocking (CPU's L2 cache optimization)
+					k = 0;
+					j = 3;
+					while ((j < 3 + 5) && (tmp_p[j] >= '0') && (tmp_p[j] <= '9')){
+						k = (k * 10) + (tmp_p[j] - '0');
+						j++;
 					}
-					if (k > MAX_CPU){
-						k = MAX_CPU;
-					} else if (k < 1){
-						k = 1;
-					} else if (k > (cpu_num >> 24)){
-						k = cpu_num >> 24;	// 論理コア数を超えないようにする
+					if (k <= 0x7FFF)	// 上位 16-bit に上書きする
+						cpu_flag = (cpu_flag & 0xFFFF) | (k << 16);
+				} else if (tmp_p[2] == 's'){	// Size of Shared Cache
+					k = 0;
+					j = 3;
+					while ((j < 3 + 5) && (tmp_p[j] >= '0') && (tmp_p[j] <= '9')){
+						k = (k * 10) + (tmp_p[j] - '0');
+						j++;
+					}
+					if (k <= 0xFFFF)	// 上位 16-bit に上書きする
+						cpu_cache = (cpu_cache & 0xFFFF) | (k << 16);
+				} else if (tmp_p[2] == 'm'){	// Max number of chunks (CPU's shared L3 cache optimization)
+					k = 0;
+					j = 3;
+					while ((j < 3 + 5) && (tmp_p[j] >= '0') && (tmp_p[j] <= '9')){
+						k = (k * 10) + (tmp_p[j] - '0');
+						j++;
+					}
+					if (k <= 0x8000)	// CACHE_MIN_NUM 未満なら 0x8000 になる
+						cpu_cache = (cpu_cache & 0xFFFF0000) | k;	// 下位 16-bit に上書きする
+				} else {	// Extra と GPU も別にしてもいいかも？
+					k = 0;
+					j = 2;
+					while ((j < 2 + 7) && (tmp_p[j] >= '0') && (tmp_p[j] <= '9')){
+						k = (k * 10) + (tmp_p[j] - '0');
+						j++;
+					}
+					if (k & 0x300){	// GPU を使う
+						OpenCL_method = k & 0x003F0300;
+					}
+					if (k & 1024)	// CLMUL と ALTMAP を使わない
+						cpu_flag = (cpu_flag & 0xFFFFFFF7) | 256;
+					if (k & 2048)	// JIT(SSE2) を使わない
+						cpu_flag &= 0xFFFFFF7F;
+					if (k & 4096)	// SSSE3 を使わない
+						cpu_flag &= 0xFFFFFFFE;
+					if (k & 8192)	// AVX2 を使わない
+						cpu_flag &= 0xFFFFFFEF;
+					if (k & 255){	// 使用するコア数を変更する
+						k &= 255;	// 1～255 の範囲
+						// printf("\n lc# = %d , logical = %d, physical = %d \n", k, cpu_num >> 24, (cpu_num & 0x00FF0000) >> 16);
+						if (k == 251){	// 物理コア数の 1/4 にする
+							k = ((cpu_num & 0x00FF0000) >> 16) / 4;
+						} else if (k == 252){	// 物理コア数の半分にする
+							k = ((cpu_num & 0x00FF0000) >> 16) / 2;
+						} else if (k == 253){	// 物理コア数の 3/4 にする
+							k = (((cpu_num & 0x00FF0000) >> 16) * 3) / 4;
+						} else if (k == 254){	// 物理コア数より減らす
+							k = ((cpu_num & 0x00FF0000) >> 16) - 1;
+						} else if (k == 255){	// 物理コア数より増やす
+							k = cpu_num >> 16;
+							k = ((k & 0xFF) + (k >> 8)) / 2;	// 物理コア数と論理コア数の中間にする？
+							// タスクマネージャーにおける CPU使用率は 100%になるけど、速くはならない・・・
+							// k = (k & 0xFF) + ((k >> 8) - (k & 0xFF)) / 4;	// 物理コア数の 5/4 にする？
+						}
+						if (k > MAX_CPU){
+							k = MAX_CPU;
+						} else if (k < 1){
+							k = 1;
+						} else if (k > (cpu_num >> 24)){
+							k = cpu_num >> 24;	// 論理コア数を超えないようにする
+						}
+						cpu_num = (cpu_num & 0xFFFF0000) | k;	// 指定されたコア数を下位に配置する
 					}
-					cpu_num = (cpu_num & 0xFFFF0000) | k;	// 指定されたコア数を下位に配置する
 				}
 			} else if (wcsncmp(tmp_p, L"m", 1) == 0){
 				memory_use = 0;
--- a/source/par2j/reedsolomon.c
+++ b/source/par2j/reedsolomon.c
@@ -1,5 +1,5 @@
 // reedsolomon.c
-// Copyright : 2023-12-12 Yutaka Sawada
+// Copyright : 2024-11-30 Yutaka Sawada
 // License : GPL

 #ifndef _UNICODE
@@ -9,7 +9,7 @@
 #define UNICODE
 #endif
 #ifndef _WIN32_WINNT
-#define _WIN32_WINNT 0x0600	// Windows Vista or later
+#define _WIN32_WINNT 0x0601	// Windows 7 or later
 #endif

 #include <malloc.h>
--- a/source/par2j/repair.c
+++ b/source/par2j/repair.c
@@ -1,5 +1,5 @@
 // repair.c
-// Copyright : 2022-10-14 Yutaka Sawada
+// Copyright : 2024-11-30 Yutaka Sawada
 // License : GPL

 #ifndef _UNICODE
@@ -9,7 +9,7 @@
 #define UNICODE
 #endif
 #ifndef _WIN32_WINNT
-#define _WIN32_WINNT 0x0600	// Windows Vista or later
+#define _WIN32_WINNT 0x0601	// Windows 7 or later
 #endif

 #include <stdio.h>
--- a/source/par2j/res_par2j.rc
+++ b/source/par2j/res_par2j.rc
@@ -1,7 +1,7 @@
 1 RT_STRING ".\\source.cl"

 1 VERSIONINFO
-FILEVERSION 1,3,3,2
+FILEVERSION 1,3,3,4
 PRODUCTVERSION 1,3,3,0
 FILEOS 0x40004
 FILETYPE 0x1
@@ -13,7 +13,7 @@ BLOCK "StringFileInfo"
 		VALUE "FileDescription", "PAR2 client"
 		VALUE "LegalCopyright", "Copyright (C) 2024 Yutaka Sawada"
 		VALUE "ProductName", "par2j"
-		VALUE "FileVersion", "1.3.3.2"
+		VALUE "FileVersion", "1.3.3.4"
 		VALUE "ProductVersion", "1.3.3.0"
 	}
 }
--- a/source/par2j/rs_decode.c
+++ b/source/par2j/rs_decode.c
@@ -1,5 +1,5 @@
 // rs_decode.c
-// Copyright : 2023-12-13 Yutaka Sawada
+// Copyright : 2024-11-30 Yutaka Sawada
 // License : GPL

 #ifndef _UNICODE
@@ -9,7 +9,7 @@
 #define UNICODE
 #endif
 #ifndef _WIN32_WINNT
-#define _WIN32_WINNT 0x0600	// Windows Vista or later
+#define _WIN32_WINNT 0x0601	// Windows 7 or later
 #endif

 #include <malloc.h>
--- a/source/par2j/rs_encode.c
+++ b/source/par2j/rs_encode.c
@@ -1,5 +1,5 @@
 // rs_encode.c
-// Copyright : 2023-12-18 Yutaka Sawada
+// Copyright : 2024-11-30 Yutaka Sawada
 // License : GPL

 #ifndef _UNICODE
@@ -9,7 +9,7 @@
 #define UNICODE
 #endif
 #ifndef _WIN32_WINNT
-#define _WIN32_WINNT 0x0600	// Windows Vista or later
+#define _WIN32_WINNT 0x0601	// Windows 7 or later
 #endif

 #include <malloc.h>
--- a/source/par2j/search.c
+++ b/source/par2j/search.c
@@ -1,5 +1,5 @@
 // search.c
-// Copyright : 2022-10-14 Yutaka Sawada
+// Copyright : 2024-11-30 Yutaka Sawada
 // License : GPL

 #ifndef _UNICODE
@@ -9,7 +9,7 @@
 #define UNICODE
 #endif
 #ifndef _WIN32_WINNT
-#define _WIN32_WINNT 0x0600	// Windows Vista or later
+#define _WIN32_WINNT 0x0601	// Windows 7 or later
 #endif

 #include <stdio.h>
--- a/source/par2j/verify.c
+++ b/source/par2j/verify.c
@@ -1,5 +1,5 @@
 // verify.c
-// Copyright : 2022-10-14 Yutaka Sawada
+// Copyright : 2024-11-30 Yutaka Sawada
 // License : GPL

 #ifndef _UNICODE
@@ -9,7 +9,7 @@
 #define UNICODE
 #endif
 #ifndef _WIN32_WINNT
-#define _WIN32_WINNT 0x0600	// Windows Vista or later
+#define _WIN32_WINNT 0x0601	// Windows 7 or later
 #endif

 #include <process.h>
@@ -1253,21 +1253,22 @@ static int search_block_slide(
 	slice_ctx *sc)
 {
 	unsigned char *buf, hash[16], hash2[16], err_mag, *short_use;
-	int i, j, find_num, find_flag, find_next, find_last, short_next;
+	int i, j, find_num, find_flag, find_next, find_last, short_next, short2_next, tmp_next;
 	int block_count, short_count, tiny_count, tiny_skip, num, i1, i2, i3, i4;
 	int *order, *index, index_shift;
 	unsigned int len, off, end_off, err_off;
 	unsigned int prev_crc, fail_count, rear_off, overlap_count;
 	unsigned int crc, *crcs, *short_crcs;
 	unsigned int time_last, time_slide;
-	__int64 file_off, file_next, short_off, fail_off;
+	__int64 file_off, file_next, short_off, short2_off, tmp_off, fail_off;

 	if (file_size + 1 < last_off + (__int64)(sc->min_size))
 		return 0;	// 小さすぎるファイルは調べない
 	find_num = 0;	// このファイル内で何ブロック見つけたか
 	find_next = -1;	// 次に見つかると予想したブロックの番号
 	find_last = -1;	// 最後に見つけたブロックの番号 (-1=不明)
-	short_next = -1;
+	short_next = -1;	// 予想される末尾ブロックの番号
+	short2_next = -1;
 	fail_count = 0;	// CRC は一致したけど MD5 が違った回数
 	fail_off = 0;
 	rear_off = 0;
@@ -1278,24 +1279,32 @@ static int search_block_slide(
 			find_last = find_next - 1;	// 最後に見つけたブロックの番号
 		if ((last_off >= files[num1].size) || (last_off + block_size > file_size + 1))
 			find_next = -1;	// 予想位置がファイル・サイズを超えると駄目
-		if ((last_size < block_size) && (files[num1].b_num >= 2) &&	// 末尾の半端なブロックの番号と想定位置
-				(last_off < files[num1].size) && (files[num1].size <= file_size + 1)){
-			short_next = files[num1].b_off + files[num1].b_num - 1;	// 末尾ブロックの番号
-			if (find_next == short_next)
+		if ((last_size < block_size) && (last_off < files[num1].size)){	// 末尾の半端なブロックの番号と想定位置
+			tmp_next = files[num1].b_off + files[num1].b_num - 1;	// 末尾ブロックの番号
+			if (find_next == tmp_next)
 				find_next = -1;	// 予想が重複したら末尾ブロックとして探す
-			short_off = files[num1].size - last_size;
-		// ファイルサイズが1ブロック未満でも、同じサイズならエラー訂正を試みる
-		} else if ((last_off == 0) && (file_size == files[num1].size) && (file_size < (__int64)block_size)){
-			short_off = 0;
-			short_next = files[num1].b_off;
+			if ((files[num1].b_num >= 2) && (files[num1].size <= file_size + 1)){	// 本来の位置を調べる
+				short_next = tmp_next;
+				short_off = files[num1].size - last_size;
+			} else if ((last_off == 0) && (file_size == last_size)){	// ファイルが1ブロック未満でも、同じサイズならエラー訂正を試みる
+				short_next = tmp_next;
+				short_off = 0;
+			}
+			if (last_size < file_size){	// 末尾を調べる
+				short2_next = tmp_next;
+				short2_off = file_size - last_size;
+			}
 		}
 		if (file_size > files[num1].size){
 			rear_off = (unsigned int)((file_size - files[num1].size) % (__int64)block_size);
 		} else if (file_size < files[num1].size){
 			rear_off = block_size - (unsigned int)((files[num1].size - file_size) % (__int64)block_size);
 		}
-		//printf("file = %d, find_next = %d, find_last = %d\n", num1, find_next, find_last);
-		//printf("short_off = %I64d, short_next = %d, rear_off = %d\n", short_off, short_next, rear_off);
+/*		printf("file = %d, find_next = %d, find_last = %d, rear_off = %d\n", num1, find_next, find_last, rear_off);
+		if (short_next >= 0)
+			printf("short_off  = %I64d, short_next  = %d\n", short_off, short_next);
+		if (short2_next >= 0)
+			printf("short2_off = %I64d, short2_next = %d\n", short2_off, short2_next);*/
 	}
 	file_off = last_off;	// 検査開始位置から調べる
 	buf = sc->buf;
@@ -1374,8 +1383,11 @@ static int search_block_slide(
 						if (last_off < file_off + last_size)
 							last_off = file_off + last_size;	// 一番大きな半端なブロックの終端
 						find_next = -2;	// 小さなファイルが見つかった = ブロック検出の予想が外れた
-						if (i == short_next)
-							short_next = -1;	// 末尾ブロックは検出済み
+						if (i == short_next){	// この末尾ブロックは検出済み
+							short_next = -1;
+						} else if (i == short2_next){
+							short2_next = -1;
+						}

 						// 経過表示
 						if (GetTickCount() - time_last >= UPDATE_TIME){
@@ -1416,7 +1428,7 @@ static int search_block_slide(

 	// ブロック・サイズごとに探す
 	if (((block_count > 0) && ((file_off + (__int64)block_size <= file_size)
-			|| (find_next >= 0))) || (short_next >= 0)){	// ブロックの位置を予想して探す
+			|| (find_next >= 0))) || (short_next >= 0) || (short2_next >= 0)){	// ブロックの位置を予想して探す
 		// 前からスライドさせながらチェックサムを比較する
 		//printf("slide search from %I64d, file %d, next = %d\n", file_off, num1, find_next);
 		off = 0;	// buf 内でのオフセット
@@ -1445,8 +1457,13 @@ static int search_block_slide(
 			while (off < end_off){
 				find_flag = -2;
 				// 次の番号のブロックがその位置にあるかを先に調べる (発見済みでも)
-				if ((short_next >= 0) && (file_off + off == short_off)){	// 半端なブロックなら
-					i = short_next;
+				if (((short_next >= 0) && (file_off + off == short_off)) ||
+						((short2_next >= 0) && (file_off + off == short2_off))){	// 半端なブロックなら
+					if ((short_next >= 0) && (file_off + off == short_off)){
+						i = short_next;
+					} else {
+						i = short2_next;
+					}
 					num = s_blk[i].file;
 					if ((short_use[num] & 4) == 0){	// パディング部分を取り除いた CRC-32 を逆算する
 						short_crcs[num] = crc_reverse_zero(s_blk[i].crc, block_size - s_blk[i].size);
@@ -1456,7 +1473,8 @@ static int search_block_slide(
 					find_flag = correct_error(buf + off, s_blk[i].size, s_blk[i].hash, short_crcs[num], &err_off, &err_mag);
 					if (find_flag == 0)
 						find_flag = 2;
-				} else if ((find_next >= 0) && (file_off + off == last_off)){	// フルサイズのブロックなら
+				}
+				if ((find_flag < 0) && (find_next >= 0) && (file_off + off == last_off)){	// フルサイズのブロックなら
 					i = find_next;
 					if (crc == s_blk[i].crc){
 						data_md5(buf + off, block_size, hash);
@@ -1661,20 +1679,81 @@ static int search_block_slide(
 					find_next = i + 1;
 					if ((find_next >= source_num) || (s_blk[find_next].file != num)){
 						// 最後までいった、またはファイルが異なる
-						short_next = -1;
 						find_next = -1;
+						if ((short_next >= 0) && ((s_blk[short_next].exist & 0x1000) != 0))
+							short_next = -1;
+						if ((short2_next >= 0) && ((s_blk[short2_next].exist & 0x1000) != 0))
+							short2_next = -1;
 					} else if (s_blk[find_next].size < block_size){	// 半端なブロックは別に調べる
-						short_next = find_next;
-						short_off = file_off + off + block_size;
-						//printf("short_off = %I64d, short_next = %d, file = %d\n", short_off, short_next, num);
+						if (file_off + off + block_size + s_blk[find_next].size <= file_size){	// ファイル内に収まってる時だけ
+							tmp_next = find_next;
+							tmp_off = file_off + off + block_size;
+							if (find_flag <= 3){	// 順当な位置で見つけた場合
+								if ((tmp_next == short_next) && (tmp_off == short_off)){
+									// 予測済みのと一致するなら何もしない
+								} else if ((short_next >= 0) && (short2_next < 0)){	// 予測と異なるけど、別のが空いてるなら、そっちに記録する
+									//printf("short2_off = %I64d, short2_next = %d, file = %d\n", tmp_off, tmp_next, num);
+									short2_next = tmp_next;
+									short2_off = tmp_off;
+								} else {
+									if ((short_next >= 0) && (tmp_next == short2_next) && (tmp_off == short2_off)){	// 既に予測済みのと一致するなら入れ替える
+										short2_next = short_next;
+										short2_off = short_off;
+										//printf("exchange short2_off = %I64d, short2_next = %d\n", short2_off, short2_next);
+									}
+									//printf("short_off = %I64d, short_next = %d, file = %d\n", tmp_off, tmp_next, num);
+									short_next = tmp_next;
+									short_off = tmp_off;
+								}
+							} else if ((short_next < 0) &&
+									(((__int64)block_size * (__int64)(tmp_next - files[num].b_off) == tmp_off) ||
+									(tmp_off + s_blk[tmp_next].size == file_size))){
+								// 検出ブロックが順当でなくても、末尾ブロックの開始位置や末端がファイル・サイズに一致すれば
+								//printf("short_off = %I64d, short_next = %d, file = %d\n", tmp_off, tmp_next, num);
+								short_next = tmp_next;
+								short_off = tmp_off;
+							} else {
+								//printf("short2_off = %I64d, short2_next = %d, file = %d\n", tmp_off, tmp_next, num);
+								short2_next = tmp_next;
+								short2_off = tmp_off;
+							}
+						}
 						find_next = -1;
 					} else {
-						short_next = files[num].b_off + files[num].b_num - 1;	// 末尾ブロックの番号
-						if (s_blk[short_next].size < block_size){	// 半端なブロックは別に調べる
-							short_off = file_off + off + (__int64)(short_next - i) * (__int64)block_size;
-							//printf("short_off = %I64d, short_next = %d, file = %d\n", short_off, short_next, num);
-						} else {
-							short_next = -1;
+						tmp_next = files[num].b_off + files[num].b_num - 1;	// 末尾ブロックの番号
+						if (s_blk[tmp_next].size < block_size){	// 半端なブロックは別に調べる
+							tmp_off = file_off + off + (__int64)(tmp_next - i) * (__int64)block_size;
+							if (tmp_off + s_blk[tmp_next].size <= file_size){	// ファイル内に収まってる時だけ
+								if (find_flag <= 3){	// 順当な位置で見つけた場合
+									if ((tmp_next == short_next) && (tmp_off == short_off)){
+										// 予測済みのと一致するなら何もしない
+									} else if ((short_next >= 0) && (short2_next < 0)){	// 予測と異なるけど、別のが空いてるなら、そっちに記録する
+										//printf("far short2_off = %I64d, short2_next = %d, file = %d\n", tmp_off, tmp_next, num);
+										short2_next = tmp_next;
+										short2_off = tmp_off;
+									} else {
+										if ((short_next >= 0) && (tmp_next == short2_next) && (tmp_off == short2_off)){	// 既に予測済みのと一致するなら入れ替える
+											short2_next = short_next;
+											short2_off = short_off;
+											//printf("exchange short2_off = %I64d, short2_next = %d\n", short2_off, short2_next);
+										}
+										//printf("far short_off = %I64d, short_next = %d, file = %d\n", tmp_off, tmp_next, num);
+										short_next = tmp_next;
+										short_off = tmp_off;
+									}
+								} else if ((short_next < 0) &&
+										(((__int64)block_size * (__int64)(tmp_next - files[num].b_off) == tmp_off) ||
+										(tmp_off + s_blk[tmp_next].size == file_size))){
+									// 検出ブロックが順当でなくても、末尾ブロックの開始位置や末端がファイル・サイズに一致すれば
+									//printf("far short_off = %I64d, short_next = %d, file = %d\n", tmp_off, tmp_next, num);
+									short_next = tmp_next;
+									short_off = tmp_off;
+								} else if ((short2_next != tmp_next) || (short2_off != tmp_off)){
+									//printf("far short2_off = %I64d, short2_next = %d, file = %d\n", tmp_off, tmp_next, num);
+									short2_next = tmp_next;
+									short2_off = tmp_off;
+								}
+							}
 						}
 					}
 					tiny_skip = 0;	// 小さなファイルをブロック直後に一回だけ探す
--- a/source/par2j/version.h
+++ b/source/par2j/version.h
@@ -1,2 +1,2 @@
-#define FILE_VERSION "1.3.3.2"	// ファイルのバージョン番号
+#define FILE_VERSION "1.3.3.4"	// ファイルのバージョン番号
 #define PRODUCT_VERSION "1.3.3"	// 製品のバージョン番号
--- a/source/sfv_md5/common.c
+++ b/source/sfv_md5/common.c
@@ -1,5 +1,5 @@
 // common.c
-// Copyright : 2023-03-14 Yutaka Sawada
+// Copyright : 2024-11-30 Yutaka Sawada
 // License : The MIT license

 #ifndef _UNICODE
@@ -9,7 +9,7 @@
 #define UNICODE
 #endif
 #ifndef _WIN32_WINNT
-#define _WIN32_WINNT 0x0600	// Windows Vista or later
+#define _WIN32_WINNT 0x0601	// Windows 7 or later
 #endif

 #include <conio.h>
--- a/source/sfv_md5/create.c
+++ b/source/sfv_md5/create.c
@@ -1,5 +1,5 @@
 // create.c
-// Copyright : 2022-02-16 Yutaka Sawada
+// Copyright : 2024-11-30 Yutaka Sawada
 // License : The MIT license

 #ifndef _UNICODE
@@ -9,7 +9,7 @@
 #define UNICODE
 #endif
 #ifndef _WIN32_WINNT
-#define _WIN32_WINNT 0x0600	// Windows Vista or later
+#define _WIN32_WINNT 0x0601	// Windows 7 or later
 #endif

 #include <stdio.h>
--- a/source/sfv_md5/ini.c
+++ b/source/sfv_md5/ini.c
@@ -1,5 +1,5 @@
 // ini.c
-// Copyright : 2022-02-16 Yutaka Sawada
+// Copyright : 2024-11-30 Yutaka Sawada
 // License : The MIT license

 #ifndef _UNICODE
@@ -9,7 +9,7 @@
 #define UNICODE
 #endif
 #ifndef _WIN32_WINNT
-#define _WIN32_WINNT 0x0600	// Windows Vista or later
+#define _WIN32_WINNT 0x0601	// Windows 7 or later
 #endif

 #include <malloc.h>
--- a/source/sfv_md5/main.c
+++ b/source/sfv_md5/main.c
@@ -1,5 +1,5 @@
 // main.c
-// Copyright : 2023-03-14 Yutaka Sawada
+// Copyright : 2024-11-30 Yutaka Sawada
 // License : The MIT license

 #ifndef _UNICODE
@@ -9,7 +9,7 @@
 #define UNICODE
 #endif
 #ifndef _WIN32_WINNT
-#define _WIN32_WINNT 0x0600	// Windows Vista or later
+#define _WIN32_WINNT 0x0601	// Windows 7 or later
 #endif

 #include <stdio.h>
--- a/source/sfv_md5/res_sfv_md5.rc
+++ b/source/sfv_md5/res_sfv_md5.rc
--- a/source/sfv_md5/verify.c
+++ b/source/sfv_md5/verify.c
@@ -1,5 +1,5 @@
 // verify.c
-// Copyright : 2022-02-25 Yutaka Sawada
+// Copyright : 2024-11-30 Yutaka Sawada
 // License : The MIT license

 #ifndef _UNICODE
@@ -9,7 +9,7 @@
 #define UNICODE
 #endif
 #ifndef _WIN32_WINNT
-#define _WIN32_WINNT 0x0600	// Windows Vista or later
+#define _WIN32_WINNT 0x0601	// Windows 7 or later
 #endif

 #include <stdio.h>
--- a/source/sfv_md5/version.h
+++ b/source/sfv_md5/version.h
@@ -1,2 +1,2 @@
-#define FILE_VERSION "1.3.2.8"	// ファイルのバージョン番号
-#define PRODUCT_VERSION "1.3.2"	// 製品のバージョン番号
+#define FILE_VERSION "1.3.3.4"	// ファイルのバージョン番号
+#define PRODUCT_VERSION "1.3.3"	// 製品のバージョン番号
Author	SHA1	Message	Date
Yutaka Sawada	21142c2193	Windows Vista is removed from supported OS.	2024-11-30 13:13:15 +09:00
Yutaka Sawada	4f0d44fc33	Add files via upload	2024-11-30 13:10:42 +09:00
Yutaka Sawada	bdf34533f6	Add files via upload	2024-11-30 13:10:12 +09:00
Yutaka Sawada	403807899e	Add files via upload	2024-11-30 13:09:46 +09:00
Yutaka Sawada	e01e977a66	Add files via upload	2024-11-30 13:09:19 +09:00
Yutaka Sawada	80969d19f9	Excluded Windows Vista	2024-11-30 13:08:09 +09:00
Yutaka Sawada	9d9b7a0681	Excluded Windows Vista	2024-11-30 13:06:17 +09:00
Yutaka Sawada	7fcedddeeb	Excluded Windows Vista	2024-11-30 12:58:22 +09:00
Yutaka Sawada	4a9419b1ee	Excluded Windows Vista	2024-11-30 12:56:43 +09:00
Yutaka Sawada	4545803963	Comment out a debug output	2024-11-30 11:08:13 +09:00
Yutaka Sawada	a9fa31c99b	Update some help	2024-11-01 19:53:03 +09:00
Yutaka Sawada	de6529aada	Improve GUI	2024-11-01 19:50:21 +09:00
Yutaka Sawada	d733ada21a	Additional options for par2j	2024-08-04 21:47:01 +09:00
Yutaka Sawada	9a7b86f550	Add usage of MultiPar.ini	2024-08-04 21:44:22 +09:00
Yutaka Sawada	3ac6c9336a	Change factors for CPU cache optimization	2024-08-04 21:41:24 +09:00
Yutaka Sawada	ad90e2db8d	My page on vector.co.jp will disapper.	2024-07-17 19:43:38 +09:00
Yutaka Sawada	c87bc4acff	Change URL of author page	2024-07-17 19:41:35 +09:00
Yutaka Sawada	be2d6faa97	Change URL of author page	2024-07-17 19:39:24 +09:00
Yutaka Sawada	df56ab72ea	Add files via upload	2024-07-17 19:37:33 +09:00
Yutaka Sawada	cdf7f28d7a	Change URL of author page	2024-07-17 19:37:02 +09:00
Yutaka Sawada	8ea1d08db8	Change URL of author page	2024-07-17 19:36:40 +09:00
Yutaka Sawada	900622082a	Change URL of author page	2024-07-17 19:36:18 +09:00
Yutaka Sawada	0fabed9766	Change URL of author page	2024-07-17 19:35:58 +09:00
Yutaka Sawada	cd5ab741cb	Change URL of author page	2024-07-17 19:35:37 +09:00
Yutaka Sawada	0cc9ddd815	Change URL of author page	2024-07-17 19:35:15 +09:00
Yutaka Sawada	29068e2496	Change URL of author page	2024-07-17 19:34:52 +09:00
Yutaka Sawada	770bfbf528	Change URL of author page	2024-07-17 19:34:27 +09:00
Yutaka Sawada	65db882952	Change URL of author page	2024-07-17 19:34:01 +09:00
Yutaka Sawada	20f19c80a8	Change URL of author page	2024-07-17 19:33:35 +09:00
Yutaka Sawada	03d5f755b3	Change URL of author page	2024-07-17 19:33:00 +09:00
Yutaka Sawada	dbbb6070e0	remove some URLs	2024-07-17 19:15:55 +09:00
Yutaka Sawada	1672c7fb12	remove some URLs	2024-07-17 19:15:27 +09:00
Yutaka Sawada	9feae04c99	remove some URLs	2024-07-17 19:15:01 +09:00
Yutaka Sawada	3fbec6a217	remove some URLs	2024-07-17 19:14:38 +09:00
Yutaka Sawada	c400c6a430	Add Korean translation	2024-07-02 12:42:33 +09:00
Yutaka Sawada	6039aad298	Add Korean translation	2024-07-02 09:47:29 +09:00
Yutaka Sawada	1cb67e8f68	Add Korean UI	2024-07-01 11:44:52 +09:00
Yutaka Sawada	d624e2e8d4	Add Korean resource script	2024-07-01 11:43:35 +09:00
Yutaka Sawada	cad1b37140	Add folder	2024-07-01 11:42:47 +09:00
Yutaka Sawada	d860bc0904	Add files via upload	2024-07-01 11:41:50 +09:00
Yutaka Sawada	bf5b8d60aa	Release note of version 1.3.3.3	2024-06-15 13:50:52 +09:00
Yutaka Sawada	8d6c1cd0ea	Update release day	2024-06-15 13:42:41 +09:00
Yutaka Sawada	efe921aff5	Fixed bug in verifying external files	2024-06-09 12:48:50 +09:00
Yutaka Sawada	de3a853228	Improve detection of the last slice	2024-06-09 12:45:37 +09:00
Yutaka Sawada	77e20ad55c	Add help files' location	2024-04-13 11:45:37 +09:00
Yutaka Sawada	ffa5c8bf64	Add documents' location	2024-04-13 11:44:29 +09:00
Yutaka Sawada	ba47ccb680	Add usage of batch file	2024-04-13 11:42:44 +09:00
Yutaka Sawada	e97b1bee52	Add files via upload	2024-02-11 13:13:46 +09:00
Yutaka Sawada	24f43183fd	Change RecoveryFileLimit option	2024-02-11 11:54:59 +09:00
Yutaka Sawada	0628cf9249	Add usage of RecoveryFileLimit	2024-02-11 11:53:55 +09:00
Yutaka Sawada	da879a098f	Fixed file splitter	2024-02-09 11:59:08 +09:00
Yutaka Sawada	eb010ec7f5	Improve name checking of splited file	2024-02-09 11:57:39 +09:00
Yutaka Sawada	70fd411418	New sample of v1.3.3.3	2024-01-21 17:04:32 +09:00
Yutaka Sawada	e2f1251c70	Sample of v1.3.3.3	2024-01-21 10:41:57 +09:00
Yutaka Sawada	06ad11340d	Fixed a bug at many OpenCL devices	2024-01-21 10:40:14 +09:00
Yutaka Sawada	5c34457f2d	Increment version number	2024-01-21 10:39:29 +09:00
Yutaka Sawada	7cdcba4a35	Merge pull request #111 from guyi2000/master Fix access violation in some certain conditions	2024-01-20 22:50:04 +09:00
MPCBBishop	b30be14b3e	Fix access violation in some certain conditions	2024-01-20 18:58:16 +08:00