package no.ssb.vtl.script.operations.foreach;

/*-
 * ========================LICENSE_START=================================
 * Java VTL
 * %%
 * Copyright (C) 2016 - 2017 Hadrien Kohl
 * %%
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 * =========================LICENSE_END==================================
 */

import com.google.common.base.MoreObjects;
import com.google.common.collect.PeekingIterator;

import java.util.Collection;
import java.util.Comparator;
import java.util.Optional;
import java.util.function.Supplier;

import static com.google.common.base.Preconditions.checkNotNull;

/**
 * Returns the maximum value out of PeekingIterators
 */
public class MaxSelector<T> implements Supplier<Optional<T>> {

    private final Comparator<T> comparator;
    private final Collection<PeekingIterator<T>> iterators;
    private T lastMax;

    MaxSelector(Collection<PeekingIterator<T>> iterators, Comparator<T> comparator) {
        this.iterators = checkNotNull(iterators);
        this.comparator = checkNotNull(comparator);
    }

    @Override
    public String toString() {
        return MoreObjects.toStringHelper(this)
                .add("lastMax", lastMax)
                .add("comparator", comparator)
                .toString();
    }

    @Override
    public Optional<T> get() {
        this.lastMax = null;
        for (PeekingIterator<T> iterator : iterators) {
            if (!iterator.hasNext()) {
                continue;
            }
            if (lastMax == null) {
                lastMax = iterator.peek();
            } else if (comparator.compare(iterator.peek(), lastMax) > 0) {
                lastMax = iterator.peek();
            }
        }
        return Optional.ofNullable(lastMax);
    }
}

@@ -1916,9 +1916,8 @@
 if (
-!
 iter
@@ -1954,36 +1954,168 @@
     
-continue
+T peek = iterator.peek();%0A                max(peek);%0A            %7D%0A        %7D%0A        return Optional.ofNullable(lastMax)
 ;%0A    
+%7D%0A%0A
     
-    %7D%0A    
+private void max(T peek) %7B%0A
     
@@ -2145,36 +2145,32 @@
 ) %7B%0A            
-    
 lastMax = iterat
@@ -2163,37 +2163,22 @@
 stMax = 
-iterator.peek();%0A    
+peek;%0A
         
@@ -2207,31 +2207,20 @@
 compare(
-iterator.
 peek
-()
 , lastMa
@@ -2233,36 +2233,32 @@
 ) %7B%0A            
-    
 lastMax = iterat
@@ -2251,31 +2251,20 @@
 stMax = 
-iterator.
 peek
-()
 ;%0A      
@@ -2269,68 +2269,9 @@
     
- 
-   %7D%0A        %7D%0A        return Optional.ofNullable(lastMax);
+%7D
 %0A   

Decrease complexity