/* * EDG, a library to generate and slice Expression Dependence Graphs. * Copyright (c) 2021. David Insa, Sergio PĂ©rez, Josep Silva, Salvador Tamarit. * * 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 . */ package edg.constraint; import java.util.List; import edg.graph.Edge; import edg.slicing.Phase; public class AsteriskConstraint extends EdgeConstraint { private static AsteriskConstraint constraint = new AsteriskConstraint(); public static AsteriskConstraint getConstraint() { return AsteriskConstraint.constraint; } private AsteriskConstraint() { } public boolean equals(Object object) { return object instanceof AsteriskConstraint; } public String toString() { return "*"; } protected List resolve(Phase phase, Edge edge, Constraints constraints, int productionDepth) { return super.wrap(constraints); } protected List resolve(Phase phase, Edge edge, Constraints constraints, AccessConstraint topConstraint, int productionDepth) { if (phase.isInstanceof(Phase.Slicing)) return super.wrap(new Constraints()); super.check(phase, Phase.SummaryGeneration); if (topConstraint.operation == AccessConstraint.Operation.Remove) return super.wrap(super.push(phase, constraints)); super.check(topConstraint.operation, AccessConstraint.Operation.Add); final Constraints newConstraints = super.pop(constraints); if (newConstraints.isEdgeConstraintsEmpty()) return super.wrap(newConstraints); final EdgeConstraint peekConstraint = newConstraints.peekEdgeConstraint(); return super.resolve(phase, edge, newConstraints, peekConstraint, productionDepth); } protected List resolve(Phase phase, Edge edge, Constraints constraints, GrammarConstraint topConstraint, int productionDepth) { super.check(phase, Phase.SummaryGeneration); return super.wrap(super.push(phase, constraints)); } protected List resolve(Phase phase, Edge edge, Constraints constraints, SeekingConstraint topConstraint, int productionDepth) { if (phase.isInstanceof(Phase.Slicing)) return super.wrap(new Constraints()); super.check(phase, Phase.SummaryGeneration); if (topConstraint.operation == SeekingConstraint.Operation.LetThrough || topConstraint.operation == SeekingConstraint.Operation.Remove) return super.wrap(super.push(phase, constraints)); super.check(topConstraint.operation, SeekingConstraint.Operation.Add); final Constraints newConstraints = super.pop(constraints); if (newConstraints.isEdgeConstraintsEmpty()) return super.wrap(newConstraints); final EdgeConstraint peekConstraint = newConstraints.peekEdgeConstraint(); return super.resolve(phase, edge, newConstraints, peekConstraint, productionDepth); } protected List resolve(Phase phase, Edge edge, Constraints constraints, AsteriskConstraint topConstraint, int productionDepth) { super.check(phase, Phase.SummaryGeneration); return super.wrap(constraints); } }