*/
    private static class TestBufferCacheImpl implements BufferCache {
        private final List<byte[]> cache;
        private final int bufferSize;
        private final int maxBuffers;

        public TestBufferCacheImpl(int maxBuffers, int bufferSize) {
            this.maxBuffers = maxBuffers;
            this.bufferSize = bufferSize;
            this.cache = new ArrayList<>(maxBuffers);
        }

        pos += 8;
        final int userOff = writeSecurityBuffer(type3, 36, userBytes);
        pos += 8;
        final int wsOff = writeSecurityBuffer(type3, 44, workstationBytes);
        pos += 8;
        final int skOff = writeSecurityBuffer(type3, 52, sessionKeyBytes);
        pos += 8;

        writeULong(type3, pos, getFlags());
        pos += 4;

        final String content = msg.getContent();
        if (content == null) {
            return null;
        }
        final String omitMarker = "\n...[omitted]...\n";
        final int maxSuffixLen = Math.max(0, maxChars / 4);
        final String suffix = buildSourceTitlesSuffix(msg.getSources(), maxSuffixLen);

import configurations.FunctionalTest
import configurations.ParallelizationMethod
import java.util.SortedSet

class TestClassTime(
    val sourceSet: String,
    val buildTimeMs: Int,
)

data class TestCoverageAndBucketSplits(
    val testCoverageUuid: Int,
    val buckets: List<FunctionalTestBucket>,
)

data class FunctionalTestBucket(
    val subprojects: SortedSet<String>,
    val parallelizationMethod: ParallelizationMethod,

    NODE_AVAILABLE(7);

    private final int value;

    /**
     * Creates a new WitnessEventType with the specified value.
     *
     * @param value the numeric event type value
     */
    WitnessEventType(int value) {
        this.value = value;
    }

    /**
     * Gets the numeric event type value.
     *
     * @return the event type value
     */
    public int getValue() {
        return value;
    }

  }

  private enum LexicographicalComparator implements Comparator<byte[]> {
    INSTANCE;

    @Override
    public int compare(byte[] left, byte[] right) {
      int minLength = Math.min(left.length, right.length);
      for (int i = 0; i < minLength; i++) {
        int result = Byte.compare(left[i], right[i]);
        if (result != 0) {
          return result;
        }
      }

   * @see #finish
   */
  protected void add(char[] cbuf, int off, int len) throws IOException {
    int pos = off;
    if (sawReturn && len > 0) {
      // Last call to add ended with a CR; we can handle the line now.
      if (finishLine(cbuf[pos] == '\n')) {
        pos++;
      }
    }

    int start = pos;
    for (int end = off + len; pos < end; pos++) {
      switch (cbuf[pos]) {
        case '\r':

        }

        @Override
        public void write(int b) throws IOException {
            int[] arr = {b};
            write(arr, 0, 1);
        }

        public void write(int[] bytes, int offset, int length) throws IOException {
            for (int i = 0; i < bytes.length; i++) {
                delegate.write(bytes[i]);
                if (bytes[i] == '\n') {

	if cardinality <= 0 {
		return -1
	}
	keyCrc := crc32.Checksum([]byte(key), crc32.IEEETable)
	return int(keyCrc % uint32(cardinality))
}

func hashKey(algo string, key string, cardinality int, id [16]byte) int {
	switch algo {
	case formatErasureVersionV2DistributionAlgoV1:
		return crcHashMod(key, cardinality)
	case formatErasureVersionV3DistributionAlgoV2, formatErasureVersionV3DistributionAlgoV3:

      case LAST_BEFORE:
        if (list.contains(key)) {
          assertEquals(list.indexOf(key) - 1, answer);
          return;
        }
        break;
    }
    // key is not present
    int nextHigherIndex = list.size();
    for (int i = list.size() - 1; i >= 0 && list.get(i) > key; i--) {
      nextHigherIndex = i;
    }
    switch (absentBehavior) {
      case NEXT_LOWER:
        assertEquals(nextHigherIndex - 1, answer);