c0b4aa0116
Use chunk hash based similarity matching rather than content based. Use sorting to order hash buffer rather than min-heap for better accuracy. Use fast CRC64 for similarity hash for speed and lower memory requirements.
39 lines
1.2 KiB
C
39 lines
1.2 KiB
C
/*
|
|
* This file is a part of Pcompress, a chunked parallel multi-
|
|
* algorithm lossless compression and decompression program.
|
|
*
|
|
* Copyright (C) 2012-2013 Moinak Ghosh. All rights reserved.
|
|
* Use is subject to license terms.
|
|
*
|
|
* This program is free software; you can redistribute it and/or
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
* License as published by the Free Software Foundation; either
|
|
* version 3 of the License, or (at your option) any later version.
|
|
*
|
|
* This program is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
* Lesser General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU Lesser General Public
|
|
* License along with this program.
|
|
* If not, see <http://www.gnu.org/licenses/>.
|
|
*
|
|
* moinakg@belenix.org, http://moinakg.wordpress.com/
|
|
*/
|
|
|
|
#ifndef __HEAPQ_H_
|
|
|
|
#define __TYPE int64_t
|
|
|
|
typedef struct {
|
|
__TYPE *ary;
|
|
__TYPE len;
|
|
__TYPE tot;
|
|
} heap_t;
|
|
|
|
int ksmallest(__TYPE *ary, __TYPE len, heap_t *heap);
|
|
void reset_heap(heap_t *h, __TYPE tot);
|
|
void heapify(heap_t *h, __TYPE *ary);
|
|
|
|
#endif
|