Lines Matching refs:decoder

207    The decoder can therefore find the end of the literal portion (if
215    meaning of the deltas is best understood in terms of the decoder.
217    The decoder builds the extended string incrementally.  Initially, the
219    (excluding the last delimiter).  The decoder inserts non-basic code
243    for the decoder to return to an earlier state).  At each state, an
249    Hence, for each delta, the decoder performs delta state changes, then
258    cause the decoder to construct the desired string.  It can do this by
260    the decoder would need to insert, and counting the number of state
261    changes the decoder would need to perform, mindful of the fact that
262    the decoder's extended string will include only those code points
473    A decoder MUST recognize the letters in both uppercase and lowercase
607    Because the decoder state can only advance monotonically, and there
612    of appearing literally.  If the decoder fails on these errors as
720    In theory, the decoder could use an analogous approach, limiting the
735    Yet another approach for the decoder is to allow overflow to occur,
737    to the decoder input.  If and only if they do not match (using a
743    In fact, if the decoder is used only inside the IDNA ToUnicode
746    mismatch has the same consequence as if the Punycode decoder had
905    In the following traces, the evolving state of the decoder is shown
1193    Basic code points can use mixed case directly, because the decoder
1335     /* decoder will never need to write an output_length greater than */
1493     /* Increase delta enough to advance the decoder's    */