docs: static void lowLevelUncompressBytes(
        final byte[] byteArray,          // output
        final int numBytesToDecode,      // input (but refers to the output)
        final short[] decodingTable,     // input
        final int[] compressedWords,     // input
        final long numCompressedWords) { // input
  
      int byteIndex = 0;
      int nextWordIndex = 0;
      long bitBuf = 0;
      int bufBits = 0;
  
      assert (byteArray != null);
      assert (decodingTable != null);
      assert (compressedWords != null);
  
      for (byteIndex = 0; byteIndex < numBytesToDecode; byteIndex++) {
        //MAYBE_FILL_BITBUF(compressedWords,wordIndex,12); // ensure 12 bits in bit buffer
        if (bufBits < 12) { // Prepare for a 12-bit peek into the bitstream.
          bitBuf |= ((compressedWords[nextWordIndex++] & 0XFFFF_FFFFL) << bufBits);
          bufBits += 32;
        }
  
        // These 12 bits will include an entire Huffman codeword.
        final int peek12 = (int) (bitBuf & 0XFFFL);
        final int lookup = decodingTable[peek12] & 0XFFFF;
        final int codeWordLength = lookup >>> 8;
        final byte decodedByte = (byte) (lookup & 0XFF);
        byteArray[byteIndex] = decodedByte;
        bitBuf >>>= codeWordLength;
        bufBits -= codeWordLength;
      }
  
      // Buffer over-run should be impossible unless there is a bug.
      // However, we might as well check here.
      assert (nextWordIndex <= numCompressedWords);
    }