functionalTestsPass.filter { it.testCoverage.isCrossVersionTest }
        if (stage.stageName !in listOf(StageName.QUICK_FEEDBACK_LINUX_ONLY, StageName.QUICK_FEEDBACK)) {
            if (topLevelFunctionalTests.size + functionalTestProjects.size > 1) {
                buildType(
                    PartialTrigger(
                        "All Functional Tests for ${stage.stageName.stageName}",

	if ok && len(b.buf) >= size {
		return b
	}
	r := new(Reader)
	r.reset(make([]byte, max(size, minReadBufferSize)), rd)
	return r
}

// NewReader returns a new [Reader] whose buffer has the default size.
func NewReader(rd io.Reader) *Reader {
	return NewReaderSize(rd, defaultBufSize)
}

// Size returns the size of the underlying buffer in bytes.
func (b *Reader) Size() int { return len(b.buf) }

        final Map<String, String> headerMap = new HashMap<>();
        provider.adjustActionResponseHeaders("text/plain", (k, v) -> headerMap.put(k, v));

        assertEquals(0, headerMap.size());
    }

    @Test
    public void test_write_defaultHeadersOnly() throws Exception {
        final FessConfig fessConfig = createFessConfigWithResponseHeaders("*=X-Def:def\n*=X-Def2:def2");

        assertEquals(2, response.getErrors().size());
    }

    @Test
    public void test_constructorWithEmptyErrors() throws Exception {
        List<Throwable> errors = new ArrayList<>();

        SuggestDeleteResponse response = new SuggestDeleteResponse(errors, 100);

        assertNotNull(response);
        assertFalse(response.hasError());
        assertEquals(0, response.getErrors().size());
    }

    @Test

        ensureProjectNotSeen(projectPath)

        projectsToEnableNullaway.add(projectPath)
    }

    private val seenProjectsCount: Int
        get() = projectsWithNullAwayEnabled.size + projectsWithUncheckedDeps.size + projectsToEnableNullaway.size

    override fun close() {
        require(seenProjectsCount > 0) {
            "NullawayStatusService was created but no status tasks have run"
        }

        printResult {

    // no equals and hashCode; it would break the contract!
  }

  /** Returns the number of elements in {@code iterable}. */
  public static int size(Iterable<?> iterable) {
    return (iterable instanceof Collection)
        ? ((Collection<?>) iterable).size()
        : Iterators.size(iterable.iterator());
  }

  /**
   * Returns {@code true} if {@code iterable} contains any element {@code o} for which {@code

      return node.value;
    }
  }

  @Override
  public void clear() {
    size = 0;
    Arrays.fill(hashTableKToV, null);
    Arrays.fill(hashTableVToK, null);
    firstInKeyInsertionOrder = null;
    lastInKeyInsertionOrder = null;
    modCount++;
  }

  @Override
  public int size() {
    return size;
  }

  private abstract static class BiIterator<

		switch maker := v.maker.(type) {
		case makeReg:
			fw = &regFileWriter{w, maker.size}
			wantStr = maker.wantStr
		case makeSparse:
			if !validateSparseEntries(maker.sph, maker.size) {
				t.Fatalf("invalid sparse map: %v", maker.sph)
			}
			spd := invertSparseEntries(maker.sph, maker.size)
			fw = &regFileWriter{w, maker.makeReg.size}
			fw = &sparseFileWriter{fw, spd, 0}
			wantStr = maker.makeReg.wantStr

      ImmutableSet<C> columnSpace) {
    // use a dense table if more than half of the cells have values
    // TODO(gak): tune this condition based on empirical evidence
    return (cellList.size() > (((long) rowSpace.size() * columnSpace.size()) / 2))
        ? new DenseImmutableTable<R, C, V>(cellList, rowSpace, columnSpace)
        : new SparseImmutableTable<R, C, V>(cellList, rowSpace, columnSpace);
  }

  /**

        assertEquals(100, response.getTookMs());
        assertEquals(2, response.getNum());
        assertEquals(10, response.getTotal());
        assertEquals(2, response.getWords().size());
        assertEquals(1, response.getItems().size());
    }

    @Test
    public void test_getIndex() throws Exception {
        List<String> words = new ArrayList<>();