Lines Matching +full:fast +full:- +full:speed

1 /*-
2  * SPDX-License-Identifier: BSD-2-Clause
4  * Copyright (c) 2000-2008 Marc Alexander Lehmann <schmorp@schmorp.de>
6  * Redistribution and use in source and binary forms, with or without modifica-
17  * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER-
19  * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE-
23  * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH-
44 **	lzf -- an extremely fast/free compression/decompression-method
47 **	This algorithm is believed to be patent-free.
61  * makes sense to always use out_len == in_len - 1), to ensure _some_
68  * these strings are architecture-independent and will result in the
95  * This function is very fast, about as fast as a copying loop.
106  * For a low-memory/faster configuration, use HLOG == 13;
114  * Sacrifice very little compression quality in favour of compression speed.
123  * Sacrifice some more compression quality in favour of compression speed.
124  * (roughly 1-2% worse compression for large blocks and
125  * 9-10% for small, redundant, blocks and >>20% better speed in both cases)
126  * In short: when in need for speed, enable this for binary data,
145  * You may choose to pre-set the hash table (might be faster on some
164  * on the stack. For small-stack environments, define this to 1.