gvSIG projects pool

<project xmlns="http://maven.apache.org/POM/4.0.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 http://maven.apache.org/xsd/maven-4.0.0.xsd">

    <modelVersion>4.0.0</modelVersion>

    <parent>

        <groupId>org.gvsig</groupId>

        <artifactId>org.gvsig.topology.lib</artifactId>

        <version>1.0.109</version>

    </parent>

    <artifactId>org.gvsig.topology.lib.impl</artifactId>

    <name>${project.artifactId}</name>

    <dependencies>

        <dependency>

            <groupId>org.gvsig</groupId>

            <artifactId>org.gvsig.topology.lib.api</artifactId>

            <scope>compile</scope>

        </dependency>

        <dependency>

            <groupId>org.gvsig</groupId>

            <artifactId>org.gvsig.tools.lib</artifactId>

            <scope>compile</scope>

        </dependency>

        <dependency>

            <groupId>org.gvsig</groupId>

            <artifactId>org.gvsig.fmap.dal.api</artifactId>

            <scope>compile</scope>

        </dependency>

        <dependency>

            <groupId>org.gvsig</groupId>

            <artifactId>org.gvsig.fmap.dal.swing.api</artifactId>

            <scope>compile</scope>

        </dependency>

        <dependency>

            <groupId>org.json</groupId>

            <artifactId>json</artifactId>

            <scope>compile</scope>

        </dependency>

        <dependency>

            <groupId>org.gvsig</groupId>

            <artifactId>org.gvsig.tools.dynform.spi</artifactId>

            <scope>compile</scope>

        </dependency>

    </dependencies>

</project>

{

    "id": "PointMustBeProperlyInsidePolygon",

    "name": "Debe estar incluida correctamente",

    "description": [ 

        "<img src=\"@@@_d/PointMustBeProperlyInsidePolygon.png\">\n",

        "Requiere que los puntos se encuentren dentro de las entidades de área. Esto resulta útil cuando las entidades de punto están relacionadas con polígonos, tales como pozos y rellenos de pozos o puntos de dirección y parcelas."

    ],

    "actions" : {

        "Delete": {

            "name" : "Eliminar",

            "description": [ 

                "La solución Eliminar quita las entidades de punto que no se encuentran correctamente dentro de las entidades poligonales. Tenga en cuenta que puede usar la herramienta Editar para mover el punto dentro de la entidad poligonal si no desea eliminarla. Esta solución se puede aplicar a uno o más errores del tipo Debe estar incluida correctamente."

            ]

        }

    }

}

{

    "id": "LineMustBeCoveredByBoundaryOfPolygon",

    "name": "Debe estar cubierto por el límite de",

    "description": [ 

        "<img src=\"@@@_d/LineMustBeCoveredByBoundaryOfPolygon.png\">\n",

        "Requiere que las líneas estén cubiertas por los límites de las entidades de área. Esto es útil para modelar líneas, tales como líneas de lote, que deben coincidir con el eje de las entidades poligonales, tales como lotes."

    ],

    "actions" : {

        "Subtract": {

            "name" : "Sustraer",

            "description": [ 

                "La solución Sustraer quita los segmentos de línea que no coinciden con el límite de las entidades poligonales. Si la entidad de línea no comparte ningún segmento en común con el límite de una entidad poligonal, la entidad se borrará. Esta solución puede aplicarse a uno o varios errores del tipo Debe estar cubierto por el límite de."

            ]

        }

    }

}

{

    "id": "LineMustBeLargerThanTolerance",

    "name": "Debe ser mayor que la tolerancia",

    "description": [ 

        "<img src=\"@@@_d/LineMustBeLargerThanTolerance.png\">\n",

        "Es necesario que una entidad no se colapse durante el proceso de validación. Esta regla es obligatoria para una topología y se aplica a todas las clases de entidad de línea y poligonal. En los casos en los que se infringe esta regla, la geometría original permanece sin cambios."

    ],

    "actions" : {

        "delete": {

            "name" : "Eliminar",

            "description": [ 

                "La solución Eliminar quita las entidades de línea que se podrían colapsar durante el proceso de validación en base a la tolerancia cluster de la topología. Esta solución se puede aplicar a uno o más errores del tipo Debe ser mayor que la tolerancia cluster."

            ]

        }

    }

}

{

    "id": "PolygonMustNotOverlapWithPolygon",

    "name": "No debe superponerse con",

    "description": [ 

        "<img src=\"@@@_d/PolygonMustNotOverlapWithPolygon.png\">\n",

        "Requiere que el interior de los pol?gonos en una clase (o subtipo) de entidad no se deba superponer con el interior de los pol?gonos en otra clase (o subtipo) de entidad. Los pol?gonos de las dos clases de entidad pueden compartir ejes o v?rtices o estar completamente inconexos. Esta regla se utiliza cuando un ?rea no puede pertenecer a dos clases de entidad separadas. Resulta ?til para combinar dos sistemas mutuamente exclusivos de clasificaci?n de ?rea, tales como zonificaci?n y tipos de masa de agua, en las que las ?reas definidas en la clase de zonificaci?n tampoco se pueden definir en la clase de masa de agua y viceversa."

    ],

    "actions" : {

        "Subtract": {

            "name" : "Subtract",

            "description": [ 

                "La soluci?n Sustraer quita la parte de superposici?n de cada entidad que causa el error y deja un espacio o vac?o en su lugar. Esta soluci?n se puede aplicar a uno o m?s errores seleccionados del tipo No debe superponerse con."

            ]

        },

        "Merge": {

            "name" : "Merge",

            "description": [ 

                "La soluci?n Fusionar agrega la parte de superposici?n de una entidad y la sustrae del resto que infringen la regla. Es necesario elegir la entidad que recibe la parte de superposici?n utilizando el cuadro de di?logo Fusionar. Esta soluci?n se puede aplicar ?nicamente a un error de tipo No debe superponerse con."

            ]

        }

    }

}

{

    "id": "PolygonMustNotOverlapPolygon",

    "name": "No debe superponerse",

    "description": [ 

        "<img src=\"@@@_d/must_not_overlap.png\">\n",

        "Requiere que el interior de los polígonos no se superponga. Los polígonos pueden compartir ejes o vértices. Esta regla se utiliza cuando un área no puede pertenecer a dos o más polígonos. Resulta útil para modelar límites administrativos, como códigos postales o distritos electorales, y clasificaciones de área mutuamente exclusivas, como cobertura de suelo o tipo de forma de suelo."

    ],

    "actions" : {

        "CreateFeature": {

            "name" : "Crear entidad",

            "description": [ 

                "La solución Crear entidad crea una nueva entidad poligonal fuera de la forma de error y quita la parte de superposición de cada una de las entidades, que provoca el error para crear una representación plana de la geometría de entidad. Esta solución se puede aplicar a uno o más errores seleccionados del tipo No debe superponerse."

            ]

        },

        "Subtract": {

            "name" : "Sustraer",

            "description": [ 

                "La solución Sustraer quita la parte de superposición de la geometría de cada entidad que causa el error y deja un espacio o vacío en su lugar. Esta solución se puede aplicar a uno o más errores seleccionados del tipo No debe superponerse. "

            ]

        },

        "Merge": {

            "name" : "Fusionar",

            "description": [ 

                "La solución Fusionar agrega la parte de superposición de una entidad y la sustrae del resto que infringen la regla. Es necesario elegir la entidad que recibe la parte de superposición utilizando el cuadro de diálogo Fusionar. Esta solución se puede aplicar únicamente a un error de tipo No debe superponerse."

            ]

        }

    }

}

{

    "id": "PolygonMustBeCoveredByPolygon",

    "name": "Debe estar cubierto por",

    "description": [ 

        "<img src=\"@@@_d/PolygonMustBeCoveredByPolygon.png\">\n",

        "Requiere que los polígonos de una clase (o subtipo) de entidad estén contenido en polígonos de otra clase (o subtipo) de entidad. Los polígonos pueden compartir ejes o vértices. Cualquier área definida en la clase de entidad contenida debe estar cubierta por un área en la clase de entidad de cobertura. Esta regla se utiliza cuando las entidades de área de un tipo dado se deben localizar dentro de las entidades de otro tipo. Esta regla es útil al modelar áreas que sean subconjuntos de un área circundante mayor, como unidades de administración en bosques o bloques dentro de grupos de bloques."

    ],

    "actions" : {

        "CreateFeature": {

            "name" : "Crear entidad",

            "description": [ 

                "La solución Crear entidad crea una nueva entidad poligonal a partir de la parte de superposición del polígono existente, de modo que el límite de cada entidad de ambas clases de entidad es el mismo. Esta solución puede aplicarse a uno o varios errores seleccionados del tipo Debe estar cubierto por."

            ]

        }

    }

}

{

    "id": "GeometryMustNotBeNull",

    "name": "La geometría no debe ser nula",

    "description": [ 

        "Requiere que las  geometrías no sean nulas"

    ]

}

{

    "id": "PolygonContainsPolygon",

    "name": "Contiene polígono",

    "description": [ 

        "<img src=\"@@@_d/contains_polygon.png\">\n",

        "El polígono superior es un error porque no contiene ningún polígono.\n\n",

        "Requiere que cada polígono del conjunto de datos contenga al menos un polígono del otro conjunto de datos.\n"

    ]

}

{

    "id": "PolygonContainsPoint",

    "name": "Contiene punto",

    "description": [ 

        "<img src=\"@@@_d/contains_point.png\">\n",

        "El polígono superior es un error porque no contiene ningún punto.\n\n",

        "Requiere que cada polígono del conjunto de datos contenga al menos un punto del otro conjunto de datos.\n",

        "Los puntos deben estar contenidos en el polígono, no en su perímetro,\n"

    ],

    "actions" : {

        "CreateFeature": {

            "name" : "Crear feature",

            "description": [ 

                "<i>Crear feature</i> realiza la correcci&oacute;n creando un nuevo punto en",

                "la feature, en el centroide del polígono que ha causado el error.\n",

                "El punto creado en la feature se garantiza que estará dentro del polígono de la feature."

            ]

        }

    }

}

{

    "id": "PolygonContainsOnePoint",

    "name": "Contiene un punto",

    "description": [ 

        "<img src=\"@@@_d/polygon_contains_one_point.png\">\n",

        "El polígono superior es un error porque contiene más de un punto. Los puntos son errores cuando están fuera de un polígono.\n\nRequiere que cada polígono contenga una entidad de puntos y que cada entidad de puntos se encuentre dentro de un único polígono. Esto se utiliza cuando debe haber una correspondencia uno a uno entre las entidades de una clase de entidad poligonal y las entidades de una clase de entidad de puntos, como los límites administrativos y sus capitales. Cada punto debe estar perfectamente dentro de un polígono y cada polígono debe contener exactamente un punto. Los puntos deben encontrarse en el interior del polígono, no en el límite."

    ]

}

{

    "id": "PolygonContainsOnePoint",

    "name": "Contains One Point",

    "description": [ 

        "<img src=\"@@@_d/polygon_contains_one_point.png\">\n",

        "The top polygon is an error because it contains more than one point. Points are errors when they are outside a polygon.\n\nRequires that each polygon contains one point feature and that each point feature falls within a single polygon. This is used when there must be a one-to-one correspondence between features of a polygon feature class and features of a point feature class, such as administrative boundaries and their capital cities. Each point must be properly inside exactly one polygon and each polygon must properly contain exactly one point. Points must be within the polygon, not on the boundary. Requires that each polygon contains one point feature and that each point feature falls within a single polygon. This is used when there must be a one-to-one correspondence between features of a polygon feature class and features of a point feature class, such as administrative boundaries and their capital cities. Each point must be properly inside exactly one polygon and each polygon must properly contain exactly one point. Points must be within the polygon, not on the boundary."

    ]

}

{

    "id": "PointMustBeProperlyInsidePolygon",

    "name": "Must Be Properly Inside",

    "description": [ 

        "<img src=\"@@@_d/PointMustBeProperlyInsidePolygon.png\">\n",

        "Requires that points fall within area features. This is useful when the point features are related to polygons, such as wells and well pads or address points and parcels."

    ],

    "actions" : {

        "Delete": {

            "name" : "Delete",

            "description": [ 

                "The Delete fix removes point features that are not properly within polygon features. Note that you can use the Edit tool and move the point inside the polygon feature if you do not want to delete it. This fix can be applied to one or more Must Be Properly Inside errors."

            ]

        }

    }

}

{

    "id": "LineMustBeCoveredByBoundaryOfPolygon",

    "name": "Must Be Covered By Boundary Of",

    "description": [ 

        "<img src=\"@@@_d/LineMustBeCoveredByBoundaryOfPolygon.png\">\n",

        "Requires that lines be covered by the boundaries of area features. This is useful for modeling lines, such as lot lines, that must coincide with the edge of polygon features, such as lots."

    ],

    "actions" : {

        "Subtract": {

            "name" : "Subtract",

            "description": [ 

                "The Subtract fix removes line segments that are not coincident with the boundary of polygon features. If the line feature does not share any segments in common with the boundary of a polygon feature, the feature will be deleted. This fix can be applied to one or more Must Be Covered By Boundary Of errors."

            ]

        }

    }

}

{

    "id": "LineMustBeLargerThanTolerance",

    "name": "Must Be Larger Than Tolerance",

    "description": [ 

        "<img src=\"@@@_d/LineMustBeLargerThanTolerance.png\">\n",

        "Requires that a feature does not collapse during a validate process.\n",

        "This rule is mandatory for a topology and applies to all line feature classes.\n",

        "In instances where this rule is violated, the original geometry is left unchanged.\n"

    ],

    "actions" : {

        "delete": {

            "name" : "Delete",

            "description": [ 

                "Removes line features that would collapse during the validate",

                "process based on the topology's tolerance."

            ]

        }

    }

}

{

    "id": "PolygonMustNotOverlapWithPolygon",

    "name": "Must Not Overlap With",

    "description": [ 

        "<img src=\"@@@_d/PolygonMustNotOverlapWithPolygon.png\">\n",

        "Requires that the interior of polygons in one feature class (or subtype) must not overlap with the interior of polygons in another feature class (or subtype). Polygons of the two feature classes can share edges or vertices or be completely disjointed. This rule is used when an area cannot belong to two separate feature classes. It is useful for combining two mutually exclusive systems of area classification, such as zoning and water body type, where areas defined within the zoning class cannot also be defined in the water body class and vice versa."

    ],

    "actions" : {

        "Subtract": {

            "name" : "Subtract",

            "description": [ 

                "The Subtract fix removes the overlapping portion of each feature that is causing the error and leaves a gap or void in its place. This fix can be applied to one or more selected Must Not Overlap With errors."

            ]

        },

        "Merge": {

            "name" : "Merge",

            "description": [ 

                "The Merge fix adds the portion of overlap from one feature and subtracts it from the others that are violating the rule. You need to pick the feature that receives the portion of overlap using the Merge dialog box. This fix can be applied to one Must Not Overlap With error only."

            ]

        }

    }

}

{

    "id": "PolygonMustBeCoveredByPolygon",

    "name": "Must Be Covered By",

    "description": [ 

        "<img src=\"@@@_d/PolygonMustBeCoveredByPolygon.png\">\n",

        "Requires that polygons of one feature class (or subtype) must be contained within polygons of another feature class (or subtype). Polygons may share edges or vertices. Any area defined in the contained feature class must be covered by an area in the covering feature class. This rule is used when area features of a given type must be located within features of another type. This rule is useful when modeling areas that are subsets of a larger surrounding area, such as management units within forests or blocks within block groups."

    ],

    "actions" : {

        "CreateFeature": {

            "name" : "Create feature",

            "description": [ 

                "The Create Feature fix creates a new polygon feature out of the portion of overlap from the existing polygon so the boundary of each feature from both feature classes is the same. This fix can be applied to one or more selected Must Be Covered By errors."

            ]

        }

    }

}

{

    "id": "PolygonMustNotOverlapPolygon",

    "name": "Must Not Overlap",

    "description": [ 

        "<img src=\"@@@_d/must_not_overlap.png\">\n",

        "Requires that the interior of polygons in the dataset not overlap.",

        "The polygons can share edges or vertices.",

        "This rule is used when an area cannot belong to two or more polygons.",

        "The polygons overlaps when the geometries have some points in common;",

        "but not all points in common (so if one geometry is inside the other",

        "overlaps would be false).",

        "The overlapping section must be the same kind of shape as the two geometries;",

        "so two polygons that touch on a point are not considered to be overlapping.",

        "It is useful for modeling administrative boundaries, such as ZIP Codes",

        "or voting districts, and mutually exclusive area classifications,",

        "such as land cover or landform type."

    ],

    "actions" : {

        "CreateFeature": {

            "name" : "Create feature",

            "description": [ 

                "The Create Feature fix creates a new polygon feature out of",

                "the error shape and removes the portion of overlap from each",

                "of the features, causing the error to create a planar",

                "representation of the feature geometry.\n",

                "This fix can be applied to one or more selected Must Not Overlap errors."

            ]

        },

        "Subtract": {

            "name" : "Subtract",

            "description": [ 

                "The Subtract fix removes the overlapping portion of geometry",

                "from each feature that is causing the error and leaves a gap",

                "or void in its place. This fix can be applied to one or more",

                "selected Must Not Overlap errors."

            ]

        },

        "Merge": {

            "name" : "Merge",

            "description": [ 

                "The Merge fix adds the portion of overlap from one feature",

                "and subtracts it from the others that are violating the rule.",

                "You need to pick the feature that receives the portion of",

                "overlap using the Merge dialog box.",

                "This fix can be applied to one Must Not Overlap error only."

            ]

        }

    }

}

{

    "id": "GeometryMustNotBeNull",

    "name": "Geometry must not be null",

    "description": [ 

        "Requires that geometries are not null"

    ]

}

{

    "id": "PolygonContainsPolygon",

    "name": "Contains Polygon",

    "description": [ 

        "<img src=\"@@@_d/contains_polygon.png\">\n",

        "The top polygon is an error because it does not contain a polygon.\n\n",

        "Requires that a polygon in the primary dataset contain at least one",

        "polygon from the secondary dataset.\n"

    ]

}

{

    "id": "PolygonContainsPoint",

    "name": "Contains Point",

    "description": [ 

        "<img src=\"@@@_d/contains_point.png\">\n",

        "The top polygon is an error because it does not contain a point.\n\n",

        "Requires that a polygon in the primary dataset contain at least one",

        "point from the secondary dataset.\n",

        "Points must be within the polygon, not on the boundary.\n",

        "This is useful when every polygon should have at least one associated",

        "point, such as when parcels must have an address point."

    ],

    "actions" : {

        "CreateFeature": {

            "name" : "Create feature",

            "description": [ 

                "The Create Feature fix creates a new point feature at the centroid",

                "of the polygon feature that is causing the error.\n",

                "The point feature that is created is guaranteed to be within the polygon feature."

            ]

        }

    }

}

org.gvsig.topology.lib.impl.TopologyImplLibrary

/**

 * gvSIG. Desktop Geographic Information System.

 *

 * Copyright (C) 2007-2021 gvSIG Association.

 *

 * This program 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.

 *

 * 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 General Public License for more details.

 *

 * You should have received a copy of the GNU General Public License

 * along with this program; if not, write to the Free Software

 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,

 * MA  02110-1301, USA.

 *

 * For any additional information, do not hesitate to contact us

 * at info AT gvsig.com, or visit our website www.gvsig.com.

 */

package org.gvsig.topology.lib.impl.customizablerule;

import org.gvsig.expressionevaluator.DataTypes;

import org.gvsig.json.Json;

import org.gvsig.tools.ToolsLocator;

import org.gvsig.tools.dynobject.DynField_v2;

import org.gvsig.tools.dynobject.DynObject;

import org.gvsig.tools.dynobject.DynObjectManager;

import org.gvsig.tools.dynobject.DynStruct_v2;

import org.gvsig.tools.i18n.I18nManager;

import org.gvsig.topology.lib.api.TopologyDataSet;

import org.gvsig.topology.lib.api.TopologyLocator;

import org.gvsig.topology.lib.api.TopologyManager;

import org.gvsig.topology.lib.api.TopologyRule;

import org.gvsig.topology.lib.spi.AbstractTopologyRuleFactory;

/**

 *

 * @author gvSIG Team

 */

@SuppressWarnings("UseSpecificCatch")

public class CustomizableRule0ActionsFactory extends AbstractTopologyRuleFactory {

    public static final String NAME = "Customizable0";

    public static final String PARAM_NAME_NAME = "name";

    public static final String PARAM_CHECK_NAME = "check";

    public static final String PARAM_ERRMSG_NAME = "errmsg";

    private DynStruct_v2 ruleParametersDefinition;

    public CustomizableRule0ActionsFactory() {

        super(

                NAME, 

                "Customizable0", 

                "",

                null

        );

        DynObjectManager dynObjectManager = ToolsLocator.getDynObjectManager();

        this.ruleParametersDefinition = (DynStruct_v2) dynObjectManager.get("Topology", "CustomizableRule0Parameters");

        if( ruleParametersDefinition==null ) {

            ruleParametersDefinition = (DynStruct_v2) dynObjectManager.createDynClass("Topology", "CustomizableRule0Parameters", null);

            DynField_v2 param;

            param = (DynField_v2) ruleParametersDefinition.addDynFieldString(PARAM_NAME_NAME);

            param.setMandatory(true);

            param.setLabel("_Name");

            param.setDescription("_Name_of_the_rule");

            param = (DynField_v2) ruleParametersDefinition.addDynField(PARAM_CHECK_NAME,DataTypes.EXPRESSION);

            param.setMandatory(true);

            param.setLabel("_Check_expression");

            param.setDescription("_Verification_expression_If_false_the_rule_fails");

            param = (DynField_v2) ruleParametersDefinition.addDynFieldString(PARAM_ERRMSG_NAME);

            param.setMandatory(true);

            param.setLabel("_Error_message");

            param.setDescription("_Message_to_show_if_check_fail");

//            DynField_v2 action = (DynField_v2) ruleParametersDefinition.addDynField("action");

//            action.setType(DataTypes.EXPRESSION);

        }

    }

    @Override

    public String getName() {

        I18nManager i18n = ToolsLocator.getI18nManager();

        return i18n.getTranslation("_Customizable");

    }

    @Override

    public boolean canApplyToDataSet(TopologyDataSet dataSet) {

        return true;

    }

    @Override

    public boolean canApplyToSecondaryDataSet(TopologyDataSet dataSet) {

        return true;

    }

    @Override

    public TopologyRule createRule(String dataSet1, String dataSet2, double tolerance) {

        TopologyRule rule = new CustomizableRule0ActionsImpl(this, tolerance, dataSet1, dataSet2);

        return rule;

    }    

    @Override

    public boolean hasRuleParameters() {

        return true;

    }

    @Override

    public DynObject createRuleParameters() {

        DynObjectManager dynObjectManager = ToolsLocator.getDynObjectManager();

        DynObject param = dynObjectManager.createDynObject(this.ruleParametersDefinition);

        return param;

    }

    public static void selfRegister() {

        try {

            TopologyManager manager = TopologyLocator.getTopologyManager();

            manager.addRuleFactories(new CustomizableRule0ActionsFactory());

            Json.registerSerializer(CustomizableRule0ActionsImpl.class);

        } catch(Exception ex) {

            LOGGER.warn("Can't register topology rule from "+CustomizableRule0ActionsFactory.class.getSimpleName(), ex);

        }

    }

}

package org.gvsig.topology.lib.impl.customizablerule;

import javax.json.JsonObject;

import org.gvsig.expressionevaluator.Expression;

import org.gvsig.expressionevaluator.ExpressionUtils;

import org.gvsig.expressionevaluator.MutableSymbolTable;

import org.gvsig.json.Json;

import org.gvsig.json.JsonObjectBuilder;

import org.gvsig.json.SupportJson;

import org.gvsig.tools.dynobject.DynObject;

import org.gvsig.topology.lib.api.ExecuteTopologyRuleActionException;

import org.gvsig.topology.lib.api.TopologyReportLine;

import org.gvsig.topology.lib.api.TopologyRule;

import org.gvsig.topology.lib.spi.AbstractTopologyRuleAction;

/**

 *

 * @author gvSIG Team

 */

public class CustomizableRuleActionImpl 

        extends AbstractTopologyRuleAction 

        implements SupportJson {

    protected Expression action;

    protected MutableSymbolTable symbolTable;

    public CustomizableRuleActionImpl() {

        super(CustomizableRule0ActionsFactory.NAME);

    }

    public Expression getAction() {

        return this.action;

    }

    public void setAction(Expression action) {

        this.action = action;

    }

    public void setId(String id) {

        this.idAction = id;

    }

    public void setName(String name) {

        this.name = name;

    }

    public void setShortDescription(String description) {

        this.shortDescription = description;

    }

    public MutableSymbolTable getSymbolTable() {

        if (this.symbolTable == null) {

            this.symbolTable = ExpressionUtils.createSymbolTable();

            this.symbolTable.setVar("action", this);

        }

        return this.symbolTable;

    }

    @Override

    public int execute(TopologyRule rule, TopologyReportLine line, DynObject parameters) throws ExecuteTopologyRuleActionException {

        MutableSymbolTable st = this.getSymbolTable();

        st.setVar("rule", rule);

        st.setVar("line", line);

        st.setVar("parameters", parameters);

        this.action.execute(symbolTable);

        return EXECUTE_OK;

    }

    @Override

    public void fromJson(JsonObject json) {

        this.idAction = (String) Json.toObject(json, "idAction");

        this.idRule = (String) Json.toObject(json, "idRule");

        this.name = (String) Json.toObject(json, "name");

        this.shortDescription = (String) Json.toObject(json, "shortDescription");

        this.action = (Expression) Json.toObject(json, "expression");

    }

    @Override

    public JsonObject toJson() {

        return toJsonBuilder().build();

    }

    @Override

    public JsonObjectBuilder toJsonBuilder() {

        JsonObjectBuilder builder = Json.createObjectBuilder();

        builder.add("idAction", idAction);

        builder.add("idRule", idRule);

        builder.add("name", name);

        builder.add("shortDescription", shortDescription);

        builder.add("expression", action);

        return builder;

    }

}

/**

 * gvSIG. Desktop Geographic Information System.

 *

 * Copyright (C) 2007-2021 gvSIG Association.

 *

 * This program 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.

 *

 * 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 General Public License for more details.

 *

 * You should have received a copy of the GNU General Public License

 * along with this program; if not, write to the Free Software

 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,

 * MA  02110-1301, USA.

 *

 * For any additional information, do not hesitate to contact us

 * at info AT gvsig.com, or visit our website www.gvsig.com.

 */

package org.gvsig.topology.lib.impl.customizablerule;

import org.apache.commons.lang3.StringUtils;

import org.gvsig.expressionevaluator.Expression;

import org.gvsig.expressionevaluator.MutableSymbolTable;

import org.gvsig.fmap.dal.DALLocator;

import org.gvsig.fmap.dal.DataTypeUtils;

import org.gvsig.fmap.dal.expressionevaluator.FeatureSymbolTable;

import org.gvsig.fmap.dal.feature.Feature;

import org.gvsig.tools.ToolsLocator;

import org.gvsig.tools.task.SimpleTaskStatus;

import org.gvsig.topology.lib.api.TopologyReport;

import org.gvsig.topology.lib.api.TopologyRuleFactory;

import static org.gvsig.topology.lib.impl.customizablerule.CustomizableRule0ActionsFactory.PARAM_CHECK_NAME;

import static org.gvsig.topology.lib.impl.customizablerule.CustomizableRule0ActionsFactory.PARAM_ERRMSG_NAME;

import static org.gvsig.topology.lib.impl.customizablerule.CustomizableRule0ActionsFactory.PARAM_NAME_NAME;

import org.gvsig.topology.lib.spi.AbstractTopologyRule;

/**

 *

 * @author gvSIG Team

 */

@SuppressWarnings("UseSpecificCatch")

public class CustomizableRule0ActionsImpl

        extends AbstractTopologyRule 

    {

    protected Expression check;

    protected String errmsg;

    protected FeatureSymbolTable featureSymbolTable;

    protected MutableSymbolTable symbolTable;

    public CustomizableRule0ActionsImpl() {

    }

    public CustomizableRule0ActionsImpl(

            TopologyRuleFactory factory,

            double tolerance,

            String dataSet1,

            String dataSet2

    ) {

        super(factory, tolerance, dataSet1, dataSet2);

    }

    @Override

    public String getName() {

        try {

            return super.getName()+ "("+(String) this.getParameters().getDynValue(PARAM_NAME_NAME)+")";

        } catch(Exception ex) {

            return super.getName();

        }

    }

    @Override

    protected void check(SimpleTaskStatus taskStatus, TopologyReport report, Feature feature1) throws Exception {

        if (this.symbolTable == null) {

            this.featureSymbolTable = DALLocator.getDataManager().createFeatureSymbolTable();

            this.symbolTable = this.featureSymbolTable.createParent();

            this.symbolTable.setVar("rule", this);

        }

        if( this.check == null ) {

            this.check = (Expression) this.getParameters().getDynValue(PARAM_CHECK_NAME);

        }

        this.symbolTable.setVar("taskStatus", taskStatus);

        this.symbolTable.setVar("report", report);

        this.symbolTable.setVar("feature1", feature1);

        this.featureSymbolTable.setFeature(feature1);

        Object n = this.check.execute(this.featureSymbolTable);

        if( DataTypeUtils.isTrue(n, false) ) {

            return;

        }

        report.addLine(

                this, 

                this.getDataSet1(), 

                null, // Dataset2

                feature1.getDefaultGeometry(),

                null, // Error

                feature1.getReference(), 

                null, // feature2

                false, // is an exception?

                getErrorMessage()

        );

    }

    private String getErrorMessage() {

        if( this.errmsg == null ) {

            this.errmsg = (String) this.getParameters().getDynValue(PARAM_ERRMSG_NAME);

            if( StringUtils.isBlank(this.errmsg) ) {

                this.errmsg = ToolsLocator.getI18nManager().getTranslation("_The_verification_expression_was_not_met");

            }

        }

        return this.errmsg;

    }

}

/**

 * gvSIG. Desktop Geographic Information System.

 *

 * Copyright (C) 2007-2013 gvSIG Association.

 *

 * This program 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.

 *

 * 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 General Public License for more details.

 *

 * You should have received a copy of the GNU General Public License

 * along with this program; if not, write to the Free Software

 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,

 * MA  02110-1301, USA.

 *

 * For any additional information, do not hesitate to contact us

 * at info AT gvsig.com, or visit our website www.gvsig.com.

 */

package org.gvsig.topology.lib.impl;

import java.util.ArrayList;

import java.util.Collections;

import java.util.HashMap;

import java.util.List;

import java.util.Map;

import org.gvsig.fmap.dal.DataStore;

import org.gvsig.topology.lib.api.TopologyDataSet;

import org.gvsig.topology.lib.api.TopologyManager;

import org.gvsig.topology.lib.api.TopologyPlan;

import org.gvsig.topology.lib.api.TopologyRuleFactory;

import org.gvsig.topology.lib.api.TopologyServices;

/**

 *

 * @author jjdelcerro

 */

public class DefaultTopologyManager implements TopologyManager {

    private final Map<String,TopologyRuleFactory> factories;

    private TopologyServices services;

    public DefaultTopologyManager() {

        this.factories = new HashMap<>();

    }

    @Override

    public TopologyPlan createTopologyPlan() {

        TopologyPlan plan = new DefaultTopologyPlan(this, this.services);

        return plan;

    }

    @Override

    public List<TopologyRuleFactory> getRuleFactories() {

        List<TopologyRuleFactory> l = new ArrayList<>(this.factories.values());

        return Collections.unmodifiableList(l);

    }

    @Override

    public List<TopologyRuleFactory> getRuleFactories(TopologyDataSet dataSet) {

        List<TopologyRuleFactory>  f = new ArrayList<>();

        for (TopologyRuleFactory factory : this.factories.values()) {

            if( factory.canApplyToDataSet(dataSet) ) {

                f.add(factory);

            }

        }

        return f;

    }

    @Override

    public TopologyRuleFactory getRulefactory(String id) {

        if( id==null ) {

            return null;

        }

        TopologyRuleFactory factory = this.factories.get(id.toLowerCase());

        return factory;

    }

    @Override

    public void addRuleFactories(TopologyRuleFactory factory) {

        if( factory==null ) {

            throw new IllegalArgumentException("Invalid null value.");

        }

        this.factories.put(factory.getId().toLowerCase(), factory);

    }

    @Override

    public TopologyDataSet createDataSet(String name, DataStore store) {

        TopologyDataSet dataSet = new DefaultTopologyDataSet(this.services, name, store);

        return dataSet;

    }

    @Override

    public void setDefaultServices(TopologyServices services) {

        this.services = services;

    }

    @Override

    public TopologyServices getDefaultServices() {

        return this.services;

    }

}

/**

 * gvSIG. Desktop Geographic Information System.

 *

 * Copyright (C) 2007-2013 gvSIG Association.

 *

 * This program 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.

 *

 * 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 General Public License for more details.

 *

 * You should have received a copy of the GNU General Public License

 * along with this program; if not, write to the Free Software

 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,

 * MA  02110-1301, USA.

 *

 * For any additional information, do not hesitate to contact us

 * at info AT gvsig.com, or visit our website www.gvsig.com.

 */

package org.gvsig.topology.lib.impl;

import java.util.ArrayList;

import java.util.Collection;

import java.util.Collections;

import java.util.Date;

import java.util.HashMap;

import java.util.List;

import java.util.Map;

import javax.json.JsonArray;

import javax.json.JsonObject;

import javax.json.JsonValue;

import org.gvsig.fmap.dal.DataStore;

import org.gvsig.fmap.dal.feature.FeatureStore;

import org.gvsig.fmap.geom.GeometryLocator;

import org.gvsig.fmap.geom.GeometryManager;

import org.gvsig.fmap.geom.type.GeometryType;

import org.gvsig.json.Json;

import org.gvsig.json.JsonArrayBuilder;

import org.gvsig.json.JsonObjectBuilder;

import org.gvsig.tools.ToolsLocator;

import org.gvsig.tools.task.SimpleTaskStatus;

import org.gvsig.topology.lib.api.TopologyDataSet;

import org.gvsig.topology.lib.api.TopologyManager;

import org.gvsig.topology.lib.api.TopologyPlan;

import org.gvsig.topology.lib.api.TopologyRule;

import org.gvsig.topology.lib.api.TopologyRuleFactory;

import org.gvsig.topology.lib.api.TopologyServices;

import org.gvsig.topology.lib.spi.AbstractTopologyRule;

import org.slf4j.Logger;

import org.slf4j.LoggerFactory;

/**

 *

 * @author jjdelcerro

 */

@SuppressWarnings("UseSpecificCatch")

public class DefaultTopologyPlan implements TopologyPlan {

    private static final Logger LOGGER = LoggerFactory.getLogger(DefaultTopologyPlan.class);

    private final TopologyManager manager;

    private final Map<String,TopologyDataSet> dataSets;

    private final List<TopologyRule> rules;

    private String name;

    private DefaultTopologyReport report;

    private TopologyServices services;

    private double tolerance;

    private SimpleTaskStatus taskStatus;

    private boolean useUI;

    private boolean acceptExceptions;

    public DefaultTopologyPlan(TopologyManager manager, TopologyServices services) {

        this.manager = manager;

        this.services = services;

        this.dataSets = new HashMap<>();

        this.rules = new ArrayList<>();

        this.report = null;

        this.name = "TopologyPlan-" + String.format("%08X", new Date().getTime());

        this.tolerance = 0;

        this.useUI = true;

    }

    @Override

    public void setName(String name) {

        this.name = name;

    }

    @Override

    public String getName() {

        return this.name;

    }

    @Override

    public void clear() {

        this.name = "";

        this.tolerance = 0;

        this.services = null;

        this.report = null;

        this.dataSets.clear();

        this.rules.clear();

    }

    @Override

    public double getTolerance() {

        return tolerance;

    }

    @Override

    public void setTolerance(double tolerance) {

        this.tolerance = tolerance;

    }

    @Override

    public void setTopologyServices(TopologyServices services) {

        this.services = services;

        for (TopologyDataSet dataSet : this.dataSets.values()) {

            if(dataSet instanceof DefaultTopologyDataSet){

                ((DefaultTopologyDataSet)dataSet).setTopologyServices(services);

            }

        }

    }

    @Override

    public TopologyServices getTopologyServices() {

        return this.services;

    }

    @Override

    public SimpleTaskStatus getTaskStatus() {

        if( this.taskStatus == null ) {

            this.taskStatus = ToolsLocator.getTaskStatusManager()

                    .createDefaultSimpleTaskStatus(this.getName());

        }

        return this.taskStatus;

    }

    @Override

    public void execute() {

        SimpleTaskStatus theTaskStatus = this.getTaskStatus();

        try {

            theTaskStatus.restart();

            theTaskStatus.message("Preparing the execution of the plan");

            theTaskStatus.setAutoremove(true);

            theTaskStatus.setIndeterminate();

            for (TopologyDataSet dataSet : this.dataSets.values()) {

                dataSet.restart();

            }

            this.getReport().removeAllLines();

            long steps = 0;

            for (TopologyRule rule : this.rules) {

                steps += rule.getSteps();

                steps++;

            }

            theTaskStatus.setRangeOfValues(0, steps);

            theTaskStatus.setCurValue(0);

            for (TopologyRule rule : this.rules) {

                if( theTaskStatus.isCancellationRequested() ) {

                    theTaskStatus.cancel();

                    break;

                }

                theTaskStatus.message(rule.getName());

                rule.execute(theTaskStatus, this.getReport());

                theTaskStatus.incrementCurrentValue();

            }

        } catch(Exception ex) {

            LOGGER.warn("Problems executing topology plan '"+this.getName()+"'.", ex);

            theTaskStatus.abort();

        } finally {

            if( theTaskStatus.isRunning() ) {

                theTaskStatus.terminate();

            }

            this.getReport().setCompleted(true);

        }

    }

    @Override

    public TopologyDataSet addDataSet(String name, DataStore store) {

        TopologyDataSet dataSet = manager.createDataSet(name, store);

        return this.addDataSet(dataSet);

    }

    @Override

    public TopologyDataSet addDataSet(TopologyDataSet dataSet) {

        if( this.dataSets.containsKey(dataSet.getName()) ) {

            throw new IllegalArgumentException("Already exists a dataSet with this name ("+dataSet.getName()+").");

        }

        this.dataSets.put(dataSet.getName(), dataSet);

        return dataSet;

    }

    @Override

    public TopologyDataSet getDataSet(String name) {

        return this.dataSets.get(name);

    }

    @Override

    public boolean containsDataSet(String name) {

        return this.dataSets.containsKey(name);

    }

    @Override

    public Collection<TopologyDataSet> getDataSets() {

        Collection<TopologyDataSet> x = dataSets.values();

        return Collections.unmodifiableCollection(x);

    }

    @Override

    public Collection<TopologyDataSet> getSecondaryDataSets(TopologyRuleFactory ruleFactory) {

        List<TopologyDataSet> secondaryDataSets = new ArrayList<>();

        for (TopologyDataSet dataSet : dataSets.values()) {

            if( ruleFactory.canApplyToSecondaryDataSet(dataSet) ) {

                secondaryDataSets.add(dataSet);

            }

        }

        return secondaryDataSets;

    }

    @Override

    public TopologyRule addRule(String id, String dataSet1, String dataSet2, double tolerance) {

        TopologyRuleFactory factory = this.manager.getRulefactory(id);

        if( factory == null ) {

            throw new IllegalArgumentException("Can't locate factory for rule '"+id+"'.");

        }

        if( ! this.canApplyRule(factory, dataSet1, dataSet2) ) {

            throw new IllegalArgumentException(

                    "Can't apply rule '"+factory.getName()+"' to the datasets '"+dataSet1+"/"+dataSet2+"'."

            );

        }

        TopologyRule rule = factory.createRule(dataSet1, dataSet2, tolerance);

        return this.addRule(rule);

    }

    @Override

    public TopologyRule addRule(TopologyRule rule) {

        if( rule.getPlan()!=null && rule.getPlan()!=this ) {

            rule = (AbstractTopologyRule) org.gvsig.tools.lang.Cloneable.cloneQuietly(rule);

        }

        ((AbstractTopologyRule)rule).setPlan(this);

        this.rules.add(rule);

        return rule;

    }

    private boolean canApplyRule(TopologyRuleFactory factory, String dataSet1, String dataSet2) {

        try {

            GeometryManager geomManager = GeometryLocator.getGeometryManager();

            TopologyDataSet dataset = this.getDataSet(dataSet1);

            FeatureStore store = (FeatureStore) dataset.getStore();

            GeometryType gt = store.getDefaultFeatureType().getDefaultGeometryAttribute().getGeomType();

            for (Integer geometryType1 : factory.getGeometryTypeDataSet1()) {

                if( gt.isTypeOf(geometryType1) ) {

                    if( factory.getGeometryTypeDataSet2()==null ) {

                        return true;

                    }

                    dataset = this.getDataSet(dataSet2);

                    store = (FeatureStore) dataset.getStore();

                    gt = store.getDefaultFeatureType().getDefaultGeometryAttribute().getGeomType();

                    for (Integer geometryType2 : factory.getGeometryTypeDataSet2()) {

                        if( gt.isTypeOf(geometryType2) ) {

                            return true;

                        }

                    }

                }

            }

            return false;

        } catch(Exception ex) {

            return false;

        }

    }    

    @Override

    public Collection<TopologyRule> getRules() {

        return Collections.unmodifiableList(rules);

    }

    @Override

    public boolean hasRules() {

        return !this.rules.isEmpty();

    }

    @Override

    public DefaultTopologyReport getReport() {

        if( this.report == null ) {

            this.report = new DefaultTopologyReport(this);

        }

        return this.report;

    }

    @Override

    public JsonObject toJson() {

        return this.toJsonBuilder().build();

    }

    @Override

    public JsonObjectBuilder toJsonBuilder() {

        JsonObjectBuilder me = Json.createObjectBuilder();

        me.add_class(this);

        me.add("name", this.name);

        me.add("tolerance", this.tolerance);

        me.add("acceptExceptions", this.acceptExceptions);

        JsonArrayBuilder jsonDataSets = Json.createArrayBuilder();

        for (TopologyDataSet dataSet : this.dataSets.values()) {

            jsonDataSets.add((DefaultTopologyDataSet)dataSet);

        }

        me.add("dataSets", jsonDataSets);

        JsonArrayBuilder jsonRules = Json.createArrayBuilder();

        for (TopologyRule rule : this.rules) {

            jsonRules.add(rule);

        }

        me.add("rules", jsonRules);

        return me;

    }