Sony STR-ZA3000ES Guia Del Usuario página 154

provided with the distribution.
3. All advertising materials mentioning features or use of this software must display the
following acknowledgement: This product includes software developed by the
University of California, Berkeley and its contributors.
4. Neither the name of the University nor the names of its contributors may be used to
endorse or promote products derived from this software without specific prior written
permission.
THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE ARE DISCLAIMED.
IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE FOR ANY
DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER
IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
trdeflate.c
Copyright (C) 1995-2010 Jean-loup Gailly and Mark Adler
For conditions of distribution and use, see copyright notice in zlib.h
ALGORITHM
The "deflation" process depends on being able to identify portions of the input text which are
identical to earlier input (within a sliding window trailing behind the input currently being
processed).
The most straightforward technique turns out to be the fastest for most input files: try all
possible matches and select the longest.
The key feature of this algorithm is that insertions into the string dictionary are very simple
and thus fast, and deletions are avoided completely. Insertions are performed at each input
character, whereas string matches are performed only when the previous match ends. So it
is preferable to spend more time in matches to allow very fast string insertions and avoid
deletions. The matching algorithm for small strings is inspired from that of Rabin & Karp. A
brute force approach is used to find longer strings when a small match has been found.
A similar algorithm is used in comic (by Jan-Mark Wams) and freeze (by Leonid Broukhis).
A previous version of this file used a more sophisticated algorithm (by Fiala and Greene)
which is guaranteed to run in linear amortized time, but has a larger average cost, uses more
memory and is patented.
However the F&G algorithm may be faster for some highly redundant files if the parameter
maxChainLength (described below) is too large.
ACKNOWLEDGEMENTS
The idea of lazy evaluation of matches is due to Jan-Mark Wams, and I found it in 'freeze'