/*
* Redberry: symbolic tensor computations.
*
* Copyright (c) 2010-2012:
* Stanislav Poslavsky <stvlpos@mail.ru>
* Bolotin Dmitriy <bolotin.dmitriy@gmail.com>
*
* 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 <http://www.gnu.org/licenses/>.
*/
package cc.redberry.transformation.substitutions;
import cc.redberry.core.tensor.Tensor;
import cc.redberry.core.tensor.iterators.TensorLastTreeIterator;
import cc.redberry.core.tensor.iterators.TensorTreeIterator;
import cc.redberry.core.utils.Indicator;
/**
*
* @author Dmitry Bolotin
* @author Stanislav Poslavsky
*/
public abstract class TensorTreeIndicator implements Indicator<Tensor> {
//FIXME add iteration guide
@Override
public boolean is(Tensor tensor) {
//TODO add iteration guide
TensorTreeIterator iterator = new TensorLastTreeIterator(tensor);
while (iterator.hasNext())
if (_is(iterator.next()))
return true;
return false;
}
public abstract boolean _is(Tensor tensor);
}