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);

   * @param size the desired size of each partition (the last may be smaller)
   * @return an iterator of immutable lists containing the elements of {@code iterator} divided into
   *     partitions
   * @throws IllegalArgumentException if {@code size} is nonpositive
   */
  public static <T extends @Nullable Object> UnmodifiableIterator<List<T>> partition(
      Iterator<T> iterator, int size) {

   * 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
   * accommodate as many threads as will ever concurrently modify the table. Using a significantly

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

   * 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
   * accommodate as many threads as will ever concurrently modify the table. Using a significantly