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

cc.redberry.concurrent.TotalProvidersPort Maven / Gradle / Ivy

/*
 * Redberry: symbolic tensor computations.
 *
 * Copyright (c) 2010-2012:
 *   Stanislav Poslavsky   
 *   Bolotin Dmitriy       
 *
 * This file is part of Redberry.
 *
 * Redberry is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * Redberry is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with Redberry. If not, see .
 */
package cc.redberry.concurrent;

/**
 *
 * @author Dmitry Bolotin
 * @author Stanislav Poslavsky
 */
public class TotalProvidersPort implements OutputPortUnsafe {
    protected final PortProviderUnsafe[] providers;
    private boolean inited = false;

    public TotalProvidersPort(PortProviderUnsafe[] providers) {
        this.providers = providers;
    }

    @Override
    public T take() {
        if (!inited) {
            for (PortProviderUnsafe provider : providers)
                provider.tick();
            inited = true;
        }
        int i = providers.length - 1;
        T element = providers[i].take();
        if (element != null)
            return element;
        OUTER:
        while (true) {
            boolean r;
            while ((r = !(providers[i--].tick())) && i >= 0);
            if (i == -1 && r)
                return null;
            i += 2;
            for (; i < providers.length; ++i)
                if (!providers[i].tick()) {
                    i--;
                    continue OUTER;
                }
            assert i == providers.length;
            i--;
            element = providers[i].take();
            if (element != null)
                return element;
        }
    }
}




© 2015 - 2025 Weber Informatics LLC | Privacy Policy