import static com.google.common.base.Preconditions.checkArgument;
import static com.google.common.base.Preconditions.checkNotNull;
import static com.google.common.base.Preconditions.checkState;
import static com.google.common.collect.Lists.asList;
import static com.google.common.util.concurrent.ClosingFuture.State.CLOSED;
import static com.google.common.util.concurrent.ClosingFuture.State.CLOSING;
import static com.google.common.util.concurrent.ClosingFuture.State.OPEN;

          }
        };
    List<Object> list = Collections.singletonList(object);
    for (int i = 0; i < 10; i++) {
      Object[] array = new Object[500];
      Arrays.fill(array, list);
      list = Arrays.asList(array);
    }
    future2.set(list);

    unused = future.toString();
  }

  public void testToString_notDone() throws Exception {
    AbstractFuture<Object> testFuture =

        if (file.isDirectory()) {
          File[] files = file.listFiles();
          if (files != null) {
            return unmodifiableList(Arrays.asList(files));
          }
        }

        return ImmutableList.of();
      };

  /**
   * Returns a predicate that returns the result of {@link File#isDirectory} on input files.
   *

    return ImmutableGraph.copyOf(graph);
  }

  private static void assertEqualCharNodes(Iterable<Character> result, String expectedCharacters) {
    assertThat(result)
        .containsExactlyElementsIn(Chars.asList(expectedCharacters.toCharArray()))
        .inOrder();
  }

  private static class RequestSavingGraph implements SuccessorsFunction<Character> {
    private final SuccessorsFunction<Character> delegate;

    /* MNG-3877*/
    @Test
    void testReportingInterpolation() throws Exception {
        PomTestWrapper pom = buildPom("reporting-interpolation");
        assertEquals(
                createPath(Arrays.asList(
                        System.getProperty("user.dir"),
                        "src",
                        "test",
                        "resources-project-builder",

   * elements.
   *
   * <p>To cycle over the elements {@code n} times, use the following: {@code
   * Iterables.concat(Collections.nCopies(n, Arrays.asList(elements)))}
   *
   * <p><b>Java 8+ users:</b> If passing a single element {@code e}, the {@code Stream} equivalent
   * of this method is {@code Stream.generate(() -> e)}. Otherwise, put the elements in a collection

        if (file.isDirectory()) {
          File[] files = file.listFiles();
          if (files != null) {
            return unmodifiableList(Arrays.asList(files));
          }
        }

        return ImmutableList.of();
      };

  /**
   * Returns a predicate that returns the result of {@link File#isDirectory} on input files.
   *

   * elements.
   *
   * <p>To cycle over the elements {@code n} times, use the following: {@code
   * Iterables.concat(Collections.nCopies(n, Arrays.asList(elements)))}
   *
   * <p><b>Java 8+ users:</b> If passing a single element {@code e}, the {@code Stream} equivalent
   * of this method is {@code Stream.generate(() -> e)}. Otherwise, put the elements in a collection

          }
        };
    List<Object> list = Collections.singletonList(object);
    for (int i = 0; i < 10; i++) {
      Object[] array = new Object[500];
      Arrays.fill(array, list);
      list = Arrays.asList(array);
    }
    future2.set(list);

    unused = future.toString();
  }

  public void testToString_notDone() throws Exception {
    AbstractFuture<Object> testFuture =

                })
                        .filter(o -> o != null && keySet.add(o.getFirst()))
                        .collect(HashMap<String, List<String>>::new, (m, d) -> m.put(d.getFirst(), Arrays.asList(d.getSecond().split(","))),
                                HashMap::putAll));
            }
            propMap.put(DEFAULT_LABEL_VALUES, map);
        }
        return map.entrySet().stream().flatMap(e -> {