Iterator<List<Integer>> partitions = Iterators.partition(source, 1);
    assertTrue(partitions.hasNext());
    assertTrue(partitions.hasNext());
    assertEquals(ImmutableList.of(1), partitions.next());
    assertFalse(partitions.hasNext());
  }

  public void testPartition_singleton2() {
    Iterator<Integer> source = singletonIterator(1);
    Iterator<List<Integer>> partitions = Iterators.partition(source, 2);

    assertEquals(1, Iterables.size(partitions));
    assertEquals(singletonList(1), partitions.iterator().next());
  }

  public void testPartition_view() {
    List<Integer> list = asList(1, 2);
    Iterable<List<Integer>> partitions = Iterables.partition(list, 2);

    // Changes before the partition is retrieved are reflected
    list.set(0, 3);

    Iterator<List<Integer>> partitions = Iterators.partition(source, 1);
    assertTrue(partitions.hasNext());
    assertTrue(partitions.hasNext());
    assertEquals(ImmutableList.of(1), partitions.next());
    assertFalse(partitions.hasNext());
  }

  public void testPartition_singleton2() {
    Iterator<Integer> source = singletonIterator(1);
    Iterator<List<Integer>> partitions = Iterators.partition(source, 2);

   * <p><b>Note:</b> if {@code iterable} is a {@link List}, use {@link Lists#partition(List, int)}
   * instead.
   *
   * @param iterable the iterable to return a partitioned view of
   * @param size the desired size of each partition (the last may be smaller)
   * @return an iterable of unmodifiable lists containing the elements of {@code iterable} divided
   *     into partitions
   * @throws IllegalArgumentException if {@code size} is nonpositive

        }
      }
    ```

### Timeouts ([.kt][ConfigureTimeoutsKotlin], [.java][ConfigureTimeoutsJava])

Use timeouts to fail a call when its peer is unreachable. Network partitions can be due to client connectivity problems, server availability problems, or anything between. OkHttp supports connect, write, read, and full call timeouts.

=== ":material-language-kotlin: Kotlin"
    ```kotlin

  }

  /**
   * Guides the allowed concurrency among update operations. Used as a hint for internal sizing. The
   * table is internally partitioned to try to permit the indicated number of concurrent updates
   * without contention. Because assignment of entries to these partitions is not necessarily
   * uniform, the actual concurrency observed may vary. Ideally, you should choose a value to

  }

  /**
   * Guides the allowed concurrency among update operations. Used as a hint for internal sizing. The
   * table is internally partitioned to try to permit the indicated number of concurrent updates
   * without contention. Because assignment of entries to these partitions is not necessarily
   * uniform, the actual concurrency observed may vary. Ideally, you should choose a value to

labels.searchlog_usersessionid=ID utilisateur
labels.searchlog_requestedtime=Heure
labels.searchlog_accesstype=Type d'accès
labels.maintenance_title_configuration=Maintenance
labels.number_of_shards_for_doc=Nombre de partitions
labels.auto_expand_replicas_for_doc=Développer automatiquement les répliques
labels.clear_crawler_index=Index du robot d'exploration
labels.clear_crawler_index_button=Supprimer l'index du robot d'exploration

*   Bug Fixes:
    *   Fix bug where partitioned integer variables got their wrong shapes.
        Before
    *   Fix correctness bug in CPU and GPU implementations of Adadelta.
    *   Fix a bug in `import_meta_graph`'s handling of partitioned variables
        when importing into a scope. WARNING: This may break loading checkpoints
        of graphs with partitioned variables saved after using

    PairedStatsAccumulator accumulator = new PairedStatsAccumulator();
    List<List<Double>> xPartitions = Lists.partition(xValues, partitionSize);
    List<List<Double>> yPartitions = Lists.partition(yValues, partitionSize);
    for (int index = 0; index < xPartitions.size(); index++) {
      accumulator.addAll(createPairedStatsOf(xPartitions.get(index), yPartitions.get(index)));
    }
    return accumulator;
  }