yk327iv/usaa24
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Обновить sk1/compressor.c

Browse Source
This commit is contained in:
Yevhen Kozirovskyi 2025-01-26 19:54:39 +00:00
parent ad02c2e294
commit ce5c50d78c
1 changed files with 3 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
sk1/compressor.c
View File

@ -63,10 +63,10 @@ void minHeapify(MinHeap* minHeap, int idx) {
int left = 2 * idx + 1;
int right = 2 * idx + 2;
if (left < minHeap->size && minHeap->array[left]->frequency < minHeap->array[smallest]->frequency)
if (left < (int)minHeap->size && minHeap->array[left]->frequency < minHeap->array[smallest]->frequency)
smallest = left;
if (right < minHeap->size && minHeap->array[right]->frequency < minHeap->array[smallest]->frequency)
if (right < (int)minHeap->size && minHeap->array[right]->frequency < minHeap->array[smallest]->frequency)
smallest = right;
if (smallest != idx) {
@ -256,7 +256,7 @@ int decompress_1(const char* input_file_name, const char* output_file_name) {
HuffmanNode* root = buildHuffmanTree(unique_data, freq, unique_count);
size_t total_bits;
fseek(input, -sizeof(size_t), SEEK_END);
fseek(input, -(long long)sizeof(size_t), SEEK_END);
fread(&total_bits, sizeof(size_t), 1, input);
fseek(input, sizeof(int) + unique_count * (sizeof(unsigned char) + sizeof(unsigned)), SEEK_SET);
@ -285,5 +285,3 @@ int decompress_1(const char* input_file_name, const char* output_file_name) {
return 0;
}
int compress_2(const char* input_file_name, const char* output_file_name);
int decompress_2(const char* input_file_name, const char* output_file_name);