remove forEachLazily(BiStream, BiConsumer). Might not have enough use case.

Author: fluentfuture

mug/src/main/java/com/google/mu/util/stream/Iteration.java

@@ -300,18 +300,6 @@ public final <K, V> Iteration<T> forEachLazily(
     return forEachLazily(map.entrySet(), e -> consumer.accept(e.getKey(), e.getValue()));
   }
 
-  /**
-   * Applies {@code consumer} lazily on each pair from {@code stream}.
-   * A pair is only iterated when consumed by the result stream.
-   *
-   * @since 9.6
-   */
-  public final <K, V> Iteration<T> forEachLazily(
-      BiStream<K, V> stream, BiConsumer<? super K, ? super V> consumer) {
-    requireNonNull(consumer);
-    return forEachLazily(stream.mapToEntry(), e -> consumer.accept(e.getKey(), e.getValue()));
-  }
-
   /**
    * Lazily generate into the stream the result of {@code computation}. Upon evaluation, also
    * passes the computation result to {@code consumer}. Useful when the

mug/src/test/java/com/google/mu/util/stream/IterationTest.java

@@ -51,15 +51,6 @@ public class IterationTest {
         .inOrder();
   }
 
-  @Test public void emit_lazyPairs() {
-    Iteration<String> iteration = new Iteration<>();
-    assertThat(iteration.forEachLazily(
-            BiStream.of(1, "one", 2, "two"),
-            (k, v) -> iteration.emit(k + ":" + v)).iterate())
-        .containsExactly("1:one", "2:two")
-        .inOrder();
-  }
-
   @Test public void preOrder_deep() {
     Tree<String> tree = tree("a")
         .setLeft(tree("b")