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

io.konig.core.path.HasStep Maven / Gradle / Ivy

There is a newer version: 2.11.0
Show newest version
package io.konig.core.path;

/*
 * #%L
 * Konig Core
 * %%
 * Copyright (C) 2015 - 2016 Gregory McFall
 * %%
 * Licensed 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.
 * #L%
 */


import java.util.Set;

import org.openrdf.model.Literal;
import org.openrdf.model.Resource;
import org.openrdf.model.URI;
import org.openrdf.model.Value;

import io.konig.core.Edge;
import io.konig.core.Graph;
import io.konig.core.SPARQLBuilder;
import io.konig.core.TraversalException;
import io.konig.core.Traverser;
import io.konig.core.Vertex;
import io.konig.core.impl.RdfUtil;

public class HasStep implements Step {

	private URI predicate;
	private Value value;
	private Object javaValue;
	
	public HasStep(URI predicate, Value value) {
		this.predicate = predicate;
		this.value = value;
		if (value instanceof Literal) {
			javaValue = RdfUtil.javaValue((Literal)value);
		}
	}

	@Override
	public void traverse(Traverser traverser) throws TraversalException {

		Graph graph = traverser.getGraph();
		Set source = traverser.getSource();
		
		for (Value s : source) {
			if (s instanceof Resource) {
				Resource subject = (Resource) s;
				if (javaValue != null) {
					
					Vertex vertex = graph.getVertex(subject);
					if (hasValue(vertex)) {
						traverser.addResult(s);
					}
					
				} else if (graph.contains(subject, predicate, value)) {
					traverser.addResult(s);
				}
			}
		}

	}

	private boolean hasValue(Vertex vertex) {
		Set set = vertex.outProperty(predicate);
		for (Edge e : set) {
			Value value = e.getObject();
			if (value instanceof Literal) {
				Object object = RdfUtil.javaValue((Literal)value);
				if (RdfUtil.nearEqual(javaValue, object)) {
					return true;
				}
			}
		}
		return false;
	}

	@Override
	public void visit(SPARQLBuilder builder) {
		builder.append('[');
		builder.append(predicate);
		builder.append(' ');
		builder.append(value);
		builder.append(']');
		
	}
	
	public String toString() {
		StringBuilder builder = new StringBuilder();
		builder.append('[');
		builder.append(predicate.getLocalName());
		builder.append(' ');
		builder.append(value);
		builder.append(']');
		return builder.toString();
	}

}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy