VertexQuery.java

Go to the documentation of this file.

/*
 *   DENOPTIM
 *   Copyright (C) 2019 Marco Foscato <marco.foscato@uib.no>
 * 
 *   This program is free software: you can redistribute it and/or modify
 *   it under the terms of the GNU Affero General Public License as published
 *   by the Free Software Foundation, either version 3 of the License, or
 *   (at your option) any later version.
 *
 *   This program 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 Affero General Public License for more details.
 *
 *   You should have received a copy of the GNU Affero General Public License
 *   along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 
package denoptim.graph;
 
import java.util.List;
 
import denoptim.graph.Vertex.BBType;
import denoptim.graph.Vertex.VertexType;
 
public class VertexQuery
{ 
    private Long vertexId = null;
    
    private Integer buildingBlockId = null;
    
    private BBType buildingBlockType = null;
    
    private VertexType vertexType = null;
   
    private Integer level = null;
 
    private List<AttachmentPointQuery> apQueries = null;
 
    private EdgeQuery incomingEdgeQuery;
 
    private EdgeQuery outgoingEdgeQuery;
 
//------------------------------------------------------------------------------
 
    public VertexQuery()
    {
    }
 
//------------------------------------------------------------------------------
 
    public VertexQuery(Long vID, VertexType vType, BBType bbType, 
            Integer bbID, Integer level, 
            List<AttachmentPointQuery> apQueries,
            EdgeQuery eIn, EdgeQuery eOut)
    {
        this.vertexId = vID;
        this.vertexType = vType;
        this.buildingBlockType = bbType;
        this.buildingBlockId = bbID;
        this.level = level;
        this.apQueries = apQueries;
        this.incomingEdgeQuery = eIn;
        this.outgoingEdgeQuery = eOut;
    }
 
//------------------------------------------------------------------------------
 
    public boolean matches(Vertex v)
    {
        if (vertexId != null && v.getVertexId() != vertexId)
        {
            return false;
        }
 
        if (vertexType != null && v.getVertexType() != vertexType)
        {
            return false;
        }
 
        if (buildingBlockType != null && v.getBuildingBlockType() != buildingBlockType)
        {
            return false;
        }
 
        if (buildingBlockId != null && v.getBuildingBlockId() != buildingBlockId)
        {
            return false;
        }
 
        if (level != null)
        {
            if (v.getGraphOwner() == null)
            {
                return false;
            }
            int vertexLevel = v.getGraphOwner().getLevel(v);
            if (vertexLevel != level)
            {
                return false;
            }
        }
        if (apQueries != null)
        {
            for (AttachmentPointQuery apQuery : apQueries)
            {
                boolean matches = false;
                for (AttachmentPoint ap : v.getAttachmentPoints())
                {
                    if (apQuery.matches(ap))
                    {
                        matches = true;
                        break;
                    }
                }
                if (!matches)
                {
                    return false;
                }
            }
        }
 
        if (incomingEdgeQuery != null
                && !matchesAnyEdge(v, incomingEdgeQuery, true))
        {
            return false;
        }
 
        if (outgoingEdgeQuery != null
                && !matchesAnyEdge(v, outgoingEdgeQuery, false))
        {
            return false;
        }
 
        return true;
    }
 
//------------------------------------------------------------------------------
 
    private static boolean matchesAnyEdge(Vertex v, EdgeQuery edgeQuery,
            boolean incoming)
    {
        DGraph graph = v.getGraphOwner();
        if (graph == null)
        {
            return false;
        }
        if (incoming)
        {
            for (Edge e : graph.getEdgesWithTrg(v))
            {
                if (edgeQuery.matches(e))
                {
                    return true;
                }
            }
        } else {
            for (Edge e : graph.getEdgesWithSrc(v))
            {
                if (edgeQuery.matches(e))
                {
                    return true;
                }
            }
        }
        return false;
    }
 
//------------------------------------------------------------------------------
 
}