};
      }

      @Override
      public Stream<E> stream() {
        return set1.stream().filter(set2::contains);
      }

      @Override
      public Stream<E> parallelStream() {
        return set1.parallelStream().filter(set2::contains);
      }

      @Override
      public int size() {
        int size = 0;
        for (E e : set1) {
          if (set2.contains(e)) {
            size++;

    @Override
    public Stream<E> stream() {
      synchronized (mutex) {
        return delegate().stream();
      }
    }

    @Override
    public Stream<E> parallelStream() {
      synchronized (mutex) {
        return delegate().parallelStream();
      }
    }

    @Override
    public void forEach(Consumer<? super E> action) {
      synchronized (mutex) {
        delegate().forEach(action);
      }

                data.add(new String[] {k, line.trim()});
            } else {
                k = line;
            }
        }
        Collections.shuffle(data);

        Graph g = new Graph();
        data.parallelStream().forEach(s -> {
            try {
                g.addEdge(s[0], s[1]);
            } catch (Exception e) {
                throw new RuntimeException(e);
            }
        });
    }

                }
            }));

            // Eagerly resolve all plugins in parallel
            toResolve.parallelStream().forEach(Runnable::run);

            // Keep track of phase aliases
            lifecycle.aliases().forEach(alias -> plan.aliases().put(alias.v3Phase(), alias.v4Phase()));

            return plan;
        }