/*
 * The MIT License (MIT)
 *
 * Copyright (c) 2017-2020 Yegor Bugayenko
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included
 * in all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 * SOFTWARE.
 */
package org.cactoos.proc;

import java.util.Collection;
import java.util.LinkedList;
import java.util.List;
import org.cactoos.Proc;
import org.cactoos.list.ListOf;
import org.hamcrest.core.IsEqual;
import org.junit.jupiter.api.Test;
import org.llorllale.cactoos.matchers.Assertion;

/**
 * Test case for {@link ForEach}.
 *
 * @since 1.0
 * @checkstyle MagicNumberCheck (500 lines)
 */
@SuppressWarnings("unchecked")
final class ForEachTest {

    @Test
    void worksWithGenerics() throws Exception {
        final Collection<? super Iterable<?>> list = new LinkedList<>();
        final Proc<? super Collection<? extends Number>> proc = list::add;
        final List<List<Integer>> input = new ListOf<>(
            new ListOf<>(1), new ListOf<>(2), new ListOf<>(3)
        );
        new ForEach<>(proc).exec(input);
        new Assertion<>(
            "Must contain elements",
            list,
            new IsEqual<>(new ListOf<>(input))
        ).affirm();
    }

}

@@ -1207,60 +1207,8 @@
 on;%0A
-import java.util.LinkedList;%0Aimport java.util.List;%0A
 impo
@@ -1264,42 +1264,8 @@
 Of;%0A
-import org.hamcrest.core.IsEqual;%0A
 impo
@@ -1343,16 +1343,65 @@
 sertion;
+%0Aimport org.llorllale.cactoos.matchers.HasValues;
 %0A%0A/**%0A *
@@ -1638,24 +1638,16 @@
 lection%3C
-? super 
 Iterable
@@ -1647,17 +1647,22 @@
 terable%3C
-?
+Number
 %3E%3E list 
@@ -1673,16 +1673,12 @@
 w Li
-nkedLi
 st
+Of
 %3C%3E()
@@ -1710,29 +1710,17 @@
 per 
-Collection%3C? extends 
+Iterable%3C
 Numb
@@ -1754,68 +1754,51 @@
     
-final List%3CList%3CInteger%3E%3E input = new ListOf%3C%3E(%0A            
+new ForEach%3CCollection%3CNumber%3E%3E(proc).exec(
 new 
@@ -1810,12 +1810,8 @@
 f%3C%3E(
-1), 
 new 
@@ -1819,17 +1819,17 @@
 istOf%3C%3E(
-2
+1
 ), new L
@@ -1840,60 +1840,11 @@
 f%3C%3E(
-3)%0A        );%0A        new ForEach%3C%3E(proc).exec(input
+2))
 );%0A 
@@ -1942,37 +1942,98 @@
 new 
-IsEqual%3C%3E(new ListOf%3C%3E(input)
+HasValues%3C%3E(%0A                new ListOf%3C%3E(1),%0A                new ListOf%3C%3E(2)%0A            
 )%0A  

Fix test