Inferno - Errors in the previous numbers.

<b>Inferno</b> - Errors in the previous numbers.

             Info Guide # 8:


   In the scheme of "color of a point in the chain 7, below,
missing resistor.

   Here's how it should be:



  eff7bit0>
 c30 in (8/D15)>> c30 out (1/D14 only)



                    GND


   Error found ZET-9, for which he much
Thanks.


              Info Guide # 7:


   Error in the description of how cutting de
 roar up to 15 storeys. It said:

   "We are looking for the longest length, which generally 
speaking slit is. Assume that this length (called

its N +1) corresponds to C symbols. This is not
well, these symbols must be omitted in the Ural
Wen (circle) below (the N-th) due to the liftings
Tia characters long N-1 (also on the raise
N-tier). For every 2 omitted the symbol
length N +1 (and their number is C, the goat is clear
even) have a raised symbol length
N-1. That would be nice if the characters
length N-1 can always be found. However,
they are sometimes not enough (and may never
be), so you have to be satisfied
show characters long N-2 (lift
on N-tier 1): for each such raised
character accounts for 4 omitted the symbol duration
ны N +1. If there is no N-2, take the N-3 - for each
dy a raised accounted for 8 Lowered
N +1. And so dalee.V Finally, after carrying
How many operations, omitting symbols ma
ksimalnoy length, length> 15 are left. "

   However, sometimes they still remain.
To avoid this, you should not do as
written in the IG # 7, as so:

  1. Find N +1 = the deepest layer,
Available in a tree.

  2. Find the first non-empty stage X є N-1.

  3. Remove it a literal instead
add 2 to the literal tier X +1 (ie
instead of doing a literal "fork" in the
layer X).

  4. Adding a literal on the level of N, but
remove the two literal on the level of N +1 (ie
replace the "fork" in the layer N on
literal).

   This process should be carried out until
long as N +1 becomes є 15.

   Fixed in ZXRar and mRIP.


              Info Guide # 7:


   Compression ratio simple Lazy Evaluation
can be improved (somewhat slowing down) the following
follows.

    In IG # 7 says:

   "The essence of strategy is that by finding the link
we do not immediately introduce into the flow, and the first
try to see what would happen if we
encode the current symbol as a symbol, and
reference will be sought from the next byte.
Comparing the two found the best links
(One from the current pointer, the other - from
the next byte), decide what
of them are profitable. "

   So, if it turned out that the second ssy
LCA profitable, should not be directly encoded
current symbol + this link. It should be a symbol
encode, and then move the pointer
current address and switch back to search
link address 1. Etc. This is done by
starting from ZXRar v0.30, and it gave good
results.


              Info Guide # 7:


   Accelerate the compression of repeated bytes can be
but this (and this is also done in
New versions of ZXRar): if the search of
current position addr find a link with length
Noah Є 8 (the number is chosen empirically), then
do not search on the position of addr +1, ie not
perform Lazy Evaluation. In this case, Player
rysh packed file size - total
0.1%.

   I tried another method (to be added
in the procedure of search), based on
verification bias on the equality -1. But while
was unable to debug (see the source
ZXRar).


              Info Guide # 6:


   Errors in the article about the PWM considered in
article "Beeper" ("music" section).

Alone Coder