From ce5c50d78ce020d316fbc88ea57e738c9474612a Mon Sep 17 00:00:00 2001 From: Yevhen Kozirovskyi Date: Sun, 26 Jan 2025 19:54:39 +0000 Subject: [PATCH] =?UTF-8?q?=D0=9E=D0=B1=D0=BD=D0=BE=D0=B2=D0=B8=D1=82?= =?UTF-8?q?=D1=8C=20sk1/compressor.c?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- sk1/compressor.c | 8 +++----- 1 file changed, 3 insertions(+), 5 deletions(-) diff --git a/sk1/compressor.c b/sk1/compressor.c index c8a1af5..fb25a49 100644 --- a/sk1/compressor.c +++ b/sk1/compressor.c @@ -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); \ No newline at end of file