All Downloads are FREE. Search and download functionalities are using the official Maven repository.

ix.IxExcept Maven / Gradle / Ivy

There is a newer version: 1.0.0
Show newest version
/*
 * Copyright 2011-2016 David Karnok
 *
 * 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.
 */

package ix;

import java.util.*;
import java.util.Map.Entry;

final class IxExcept extends IxSource {

    final Iterable other;

    IxExcept(Iterable source, Iterable other) {
        super(source);
        this.other = other;
    }

    @Override
    public Iterator iterator() {
        return new ExceptIterator(source.iterator(), other.iterator());
    }

    static final class ExceptIterator extends IxSourceIterator {
        final Iterator other;

        final LinkedHashMap set;

        Iterator> setIterator;

        boolean once;

        boolean second;

        ExceptIterator(Iterator it, Iterator other) {
            super(it);
            this.other = other;
            this.set = new LinkedHashMap();
        }

        @Override
        protected boolean moveNext() {
            LinkedHashMap secondSet = set;
            if (!once) {
                once = true;
                while (other.hasNext()) {
                    secondSet.put(other.next(), true);
                }
            }

            for (;;) {
                if (second) {
                    Iterator> sIt = setIterator;
                    while (sIt.hasNext()) {
                        Entry e = sIt.next();

                        if (e.getValue()) {
                            value = e.getKey();
                            hasValue = true;
                            return true;
                        }
                    }
                    done = true;
                    return false;
                } else {
                    Iterator fIt = it;
                    while (fIt.hasNext()) {
                        T v = fIt.next();

                        Boolean b = secondSet.get(v);
                        if (b == null) {
                            value = v;
                            hasValue = true;
                            return true;
                        }
                        if (b) {
                            secondSet.put(v, false);
                        }
                    }
                    second = true;
                    setIterator = secondSet.entrySet().iterator();
                }
            }
        }
    }
}




© 2015 - 2025 Weber Informatics LLC | Privacy Policy