Method decodeHuffmanTreeGroup

java/org/brotli/dec/Decode.java:1094–1106

(int alphabetSizeMax, int alphabetSizeLimit,
      int n, State s, int[] group)

  }

  private static int decodeHuffmanTreeGroup(int alphabetSizeMax, int alphabetSizeLimit,
      int n, State s, int[] group) {
    int next = n;
    for (int i = 0; i < n; ++i) {
      group[i] = next;
      final int result = readHuffmanCode(alphabetSizeMax, alphabetSizeLimit, group, i, s);
      if (result < BROTLI_OK) {
        return result;
      }
      next += result;
    }
    return BROTLI_OK;
  }

  // Returns offset in ringBuffer that should trigger WRITE when filled.
  private static int calculateFence(State s) {