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(4, testClient.createdIndices.size());
        // Should have called addMapping for each created index
        assertEquals(4, testClient.addMappingCalls.size());
        // Should have called createAlias for each created index
        assertEquals(4, testClient.createAliasCalls.size());
        // No reindex calls since indices are new
        assertEquals(0, testClient.reindexPairs.size());
    }

    @Test

      assertThat(expected.message).isEqualTo(
        "Payload size must be less than or equal to 125",
      )
    }
  }

  private fun assertData(hex: String) {
    assertData(hex.decodeHex())
  }

  private fun assertData(expected: ByteString) {
    val actual = data.readByteString(Math.min(expected.size.toLong(), data.size))
    assertThat(actual).isEqualTo(expected)
  }

  companion object {

  public void testSlice_constrainedRange() throws IOException {
    long size = source.read().length;
    if (size >= 2) {
      ByteSource sliced = source.slice(1, size - 2);
      assertEquals(size - 2, sliced.read().length);
      ByteSource resliced = sliced.slice(0, size - 1);
      assertTrue(sliced.contentEquals(resliced));
    }
  }

            val paths = projectPaths.get()
            val detailsFiles = targetRuntimeDetailsFiles.get()
            val buildFiles = projectBuildFiles.get()
            require(paths.size == detailsFiles.size)
            require(paths.size == buildFiles.size)

            for (i in paths.indices) {
                val path = paths[i]
                val detailsFile = detailsFiles[i]
                val buildFile = buildFiles[i]

            parent = list;
            this.allRecordCount = allRecordCount;
            pageSize = size;
            currentPageNumber = offset / size + 1;
            allPageCount = allRecordCount == 0 ? 0 : (allRecordCount - 1) / size + 1;
        }

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

    // 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

          if (hashTable != null && chooseTableSize(size) == hashTable.length) {
            @Nullable Object[] uniqueElements =
                shouldTrim(size, contents.length) ? Arrays.copyOf(contents, size) : contents;
            result =
                new RegularImmutableSet<E>(
                    uniqueElements, hashCode, hashTable, hashTable.length - 1, size);
          } else {

    // targets.size() < size() / log(size())
    // TODO(kevinb): see if we can share code with OrderedIterator after it
    // graduates from labs.
    if (targets instanceof Multiset) {
      targets = ((Multiset<?>) targets).elementSet();
    }
    if (!SortedIterables.hasSameComparator(comparator(), targets) || (targets.size() <= 1)) {
      return super.containsAll(targets);
    }

indexer.webfs.update.interval=10000
# Maximum document cache size for webfs in the indexer.
indexer.webfs.max.document.cache.size=10
# Maximum document request size (bytes) for webfs in the indexer.
indexer.webfs.max.document.request.size=1048576
# Maximum document cache size for data in the indexer.
indexer.data.max.document.cache.size=10000
# Maximum document request size (bytes) for data in the indexer.