HomeSort by relevance Sort by last modified time
    Searched refs:prevByte1 (Results 1 - 3 of 3) sorted by null

  /external/brotli/java/org/brotli/dec/
Decode.java 806 int prevByte1 = ringBuffer[(s.pos - 1) & ringBufferMask] & 0xFF;
814 + (Context.LOOKUP[s.contextLookupOffset1 + prevByte1]
817 prevByte2 = prevByte1;
819 prevByte1 = readSymbol(
821 ringBuffer[s.pos] = (byte) prevByte1;
    [all...]
  /external/brotli/csharp/org/brotli/dec/
Decode.cs 759 int prevByte1 = ringBuffer[(state.pos - 1) & ringBufferMask] & unchecked((int)(0xFF));
768 int literalTreeIndex = state.contextMap[state.contextMapSlice + (Org.Brotli.Dec.Context.Lookup[state.contextLookupOffset1 + prevByte1] | Org.Brotli.Dec.Context.Lookup[state.contextLookupOffset2 + prevByte2])] & unchecked((int)(0xFF));
770 prevByte2 = prevByte1;
772 prevByte1 = ReadSymbol(state.hGroup0.codes, state.hGroup0.trees[literalTreeIndex], br);
773 ringBuffer[state.pos] = unchecked((byte)prevByte1);
    [all...]
  /external/brotli/js/
decode.js 849 var /** !number */ prevByte1 = ringBuffer[(s.pos - 1) & ringBufferMask] & 0xFF;
858 var /** !number */ literalTreeIndex = s.contextMap[s.contextMapSlice + (LOOKUP[s.contextLookupOffset1 + prevByte1] | LOOKUP[s.contextLookupOffset2 + prevByte2])] & 0xFF;
860 prevByte2 = prevByte1;
865 prevByte1 = readSymbol(s.hGroup0, s.hGroup0[literalTreeIndex], s);
866 ringBuffer[s.pos] = prevByte1;
    [all...]

Completed in 86 milliseconds