xevion/easy7zip
1
0
Fork 0
mirror of https://github.com/Xevion/easy7zip.git synced 2025-12-14 22:11:38 -06:00
Code Issues Packages Projects Releases Wiki Activity

4.43 beta

Browse Source
This commit is contained in:
Igor Pavlov
2006-09-15 00:00:00 +00:00
committed by Kornel Lesiński
parent 0ec42ff829
commit 804edc5756
391 changed files with 9725 additions and 3168 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
7zip/Compress/BWT/BlockSort.cpp
View File

@@ -140,7 +140,7 @@ UInt32 CBlockSorter::SortGroup(UInt32 groupOffset, UInt32 groupSize, UInt32 mask
for (j = 0; j < groupSize; j++)
{
UInt32 group = groupOffset + j;
while (true)
for (;;)
{
Groups[ind2[j]] = group;
if ((Flags[(groupOffset + j) >> kNumFlagsBits] & (1 << ((groupOffset + j) & kFlagsMask))) == 0)
@@ -154,7 +154,7 @@ UInt32 CBlockSorter::SortGroup(UInt32 groupOffset, UInt32 groupSize, UInt32 mask
// Radix-Range Sort
UInt32 i;
do
for (;;)
{
if (maskSize == 0)
return 1;
@@ -193,7 +193,6 @@ UInt32 CBlockSorter::SortGroup(UInt32 groupOffset, UInt32 groupSize, UInt32 mask
else
break;
}
while(true);
UInt32 t = (groupOffset + i - 1);
Flags[t >> kNumFlagsBits] &= ~(1 << (t & kFlagsMask));
@@ -251,7 +250,7 @@ UInt32 CBlockSorter::Sort(const Byte *data, UInt32 blockSize)
UInt32 mask;
for (mask = 2; mask < blockSize; mask <<= 1);
mask >>= 1;
for (NumSortedBytes = kNumHashBytes; true; NumSortedBytes <<= 1)
for (NumSortedBytes = kNumHashBytes; ; NumSortedBytes <<= 1)
{
UInt32 newLimit = 0;
for (i = 0; i < blockSize;)

2
7zip/Compress/BWT/Mtf8.h
View File

@@ -38,7 +38,7 @@ class CMtf8Decoder
{
public:
Byte Buffer[256];
void Init(int size) {};
void Init(int /* size */) {};
Byte GetHead() const { return Buffer[0]; }
Byte GetAndMove(int pos)
{