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

org.apache.jena.shacl.engine.constraint.EqualsConstraint Maven / Gradle / Ivy

There is a newer version: 5.2.0
Show newest version
/*
 * Licensed to the Apache Software Foundation (ASF) under one
 * or more contributor license agreements.  See the NOTICE file
 * distributed with this work for additional information
 * regarding copyright ownership.  The ASF licenses this file
 * to you under the Apache License, Version 2.0 (the
 * "License"); you may not use this file except in compliance
 * with the License.  You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package org.apache.jena.shacl.engine.constraint;

import org.apache.jena.atlas.io.IndentedWriter;
import org.apache.jena.graph.Node;
import org.apache.jena.riot.out.NodeFormatter;
import org.apache.jena.shacl.engine.ValidationContext;
import org.apache.jena.shacl.parser.ConstraintVisitor;
import org.apache.jena.shacl.parser.Shape;
import org.apache.jena.shacl.vocabulary.SHACL;
import org.apache.jena.sparql.path.Path;

import java.util.Objects;
import java.util.Set;

import static org.apache.jena.shacl.compact.writer.CompactOut.compact;
import static org.apache.jena.shacl.lib.ShLib.displayStr;

/** sh:equals */
public class EqualsConstraint extends ConstraintPairwise {

    public EqualsConstraint(Node value) {
        super(value, SHACL.EqualsConstraintComponent);
    }

    @Override
    public void validate(ValidationContext vCxt, Shape shape, Node focusNode, Path path,
                         Set pathNodes, Set compareNodes) {
        for ( Node vn : pathNodes ) {
            boolean passed = true;
            if ( ! compareNodes.contains(vn) ) {
                String msg = toString()+": not equal: value node "+displayStr(vn)+" is not in "+compareNodes;
                passed = false;
                vCxt.reportEntry(msg, shape, focusNode, path, vn, this);
            }
            final boolean finalPassed = passed;
            vCxt.notifyValidationListener(() ->  makeEventSinglePathNode(vCxt, shape,  focusNode, path,
                                vn, compareNodes, finalPassed));

        }
        for ( Node v : compareNodes ) {
            boolean passed = true;
            if ( ! pathNodes.contains(v) ) {
                String msg = toString()+": not equal: value "+displayStr(v)+" is not in "+pathNodes;
                passed = false;
                vCxt.reportEntry(msg, shape, focusNode, path, v, this);
            }
            final boolean finalPassed = passed;
            vCxt.notifyValidationListener(() -> makeEventSinglePathNode(vCxt, shape, focusNode, path,
                            v, pathNodes, finalPassed));
        }
    }

    @Override
    public void visit(ConstraintVisitor visitor){
        visitor.visit(this);
    }

    @Override
    public void printCompact(IndentedWriter out, NodeFormatter nodeFmt) {
        compact(out, nodeFmt, "equals", value);
    }

    @Override
    public String toString() {
        return "Equals["+displayStr(value)+"]";
    }

    @Override
    public int hashCode() {
        return Objects.hash(value, 2);
    }
}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy