4 * A match-finder for Lempel-Ziv compression based on bottom-up construction and
5 * traversal of the Longest Common Prefix (LCP) interval tree.
10 * The author dedicates this file to the public domain.
11 * You can do whatever you want with this file.
14 #ifndef _LCPIT_MATCHFINDER_H
15 #define _LCPIT_MATCHFINDER_H
17 #include "wimlib/types.h"
19 struct lcpit_matchfinder {
37 lcpit_matchfinder_get_needed_memory(size_t max_bufsize);
40 lcpit_matchfinder_init(struct lcpit_matchfinder *mf, size_t max_bufsize,
41 u32 min_match_len, u32 nice_match_len);
44 lcpit_matchfinder_load_buffer(struct lcpit_matchfinder *mf, const u8 *T, u32 n);
47 lcpit_matchfinder_get_matches(struct lcpit_matchfinder *mf,
48 struct lz_match *matches);
51 lcpit_matchfinder_skip_bytes(struct lcpit_matchfinder *mf, u32 count);
54 lcpit_matchfinder_destroy(struct lcpit_matchfinder *mf);
56 #endif /* _LCPIT_MATCHFINDER_H */