You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@clerezza.apache.org by re...@apache.org on 2010/05/11 10:11:07 UTC

svn commit: r943034 - /incubator/clerezza/trunk/org.apache.clerezza.parent/org.apache.clerezza.rdf.utils/src/main/java/org/apache/clerezza/rdf/utils/GraphNode.java

Author: reto
Date: Tue May 11 08:11:06 2010
New Revision: 943034

URL: http://svn.apache.org/viewvc?rev=943034&view=rev
Log:
CLEREZZA-212: added addPropertyValue method

Modified:
    incubator/clerezza/trunk/org.apache.clerezza.parent/org.apache.clerezza.rdf.utils/src/main/java/org/apache/clerezza/rdf/utils/GraphNode.java

Modified: incubator/clerezza/trunk/org.apache.clerezza.parent/org.apache.clerezza.rdf.utils/src/main/java/org/apache/clerezza/rdf/utils/GraphNode.java
URL: http://svn.apache.org/viewvc/incubator/clerezza/trunk/org.apache.clerezza.parent/org.apache.clerezza.rdf.utils/src/main/java/org/apache/clerezza/rdf/utils/GraphNode.java?rev=943034&r1=943033&r2=943034&view=diff
==============================================================================
--- incubator/clerezza/trunk/org.apache.clerezza.parent/org.apache.clerezza.rdf.utils/src/main/java/org/apache/clerezza/rdf/utils/GraphNode.java (original)
+++ incubator/clerezza/trunk/org.apache.clerezza.parent/org.apache.clerezza.rdf.utils/src/main/java/org/apache/clerezza/rdf/utils/GraphNode.java Tue May 11 08:11:06 2010
@@ -28,6 +28,7 @@ import java.util.Set;
 import org.apache.clerezza.rdf.core.BNode;
 import org.apache.clerezza.rdf.core.Graph;
 import org.apache.clerezza.rdf.core.Literal;
+import org.apache.clerezza.rdf.core.LiteralFactory;
 import org.apache.clerezza.rdf.core.MGraph;
 import org.apache.clerezza.rdf.core.NonLiteral;
 import org.apache.clerezza.rdf.core.Resource;
@@ -37,7 +38,6 @@ import org.apache.clerezza.rdf.core.UriR
 import org.apache.clerezza.rdf.core.impl.SimpleMGraph;
 import org.apache.clerezza.rdf.core.impl.TripleImpl;
 
-
 /**
  * This class represents a node in the context of a graph. It provides
  * utility methods to explore and modify its neighbourhood. The method
@@ -425,6 +425,18 @@ public class GraphNode {
 	}
 
 	/**
+	 * Coverts the value into a typed literals and sets it as object of the
+	 * specified property
+	 *
+	 * @param property the predicate of the triple to be created
+	 * @param value the value of the typed literal object
+	 */
+	public void addPropertyValue(UriRef property, Object value) {
+		addProperty(property,
+				LiteralFactory.getInstance().createTypedLiteral(value));
+	}
+
+	/**
 	 * creates and returns an <code>RdfList</code> for the node and
 	 * TripleCollection represented by this object.
 	 *
@@ -432,7 +444,7 @@ public class GraphNode {
 	 */
 	public List<Resource> asList() {
 		if (resource instanceof NonLiteral) {
-			return new RdfList((NonLiteral)resource, graph);
+			return new RdfList((NonLiteral) resource, graph);
 		} else {
 			throw new RuntimeException("Literals cannot be the subject of a List");
 		}
@@ -466,7 +478,7 @@ public class GraphNode {
 	 */
 	public void deleteProperty(UriRef predicate, Resource object) {
 		if (resource instanceof NonLiteral) {
-			graph.remove(new TripleImpl((NonLiteral)resource, predicate, object));
+			graph.remove(new TripleImpl((NonLiteral) resource, predicate, object));
 		}
 	}
 
@@ -475,7 +487,6 @@ public class GraphNode {
 		return resource.toString();
 	}
 
-
 	/**
 	 * Replaces the graph node resouce with the specified <code>NonLiteral</code>.
 	 * The resource is only replaced where it is either subject or object.
@@ -497,7 +508,7 @@ public class GraphNode {
 	public GraphNode replaceWith(NonLiteral replacement, boolean checkPredicates) {
 		MGraph newTriples = new SimpleMGraph();
 		if (!(resource instanceof Literal)) {
-			Iterator<Triple> subjectTriples = graph.filter((NonLiteral)resource, null,
+			Iterator<Triple> subjectTriples = graph.filter((NonLiteral) resource, null,
 					null);
 			while (subjectTriples.hasNext()) {
 				Triple triple = subjectTriples.next();
@@ -521,8 +532,8 @@ public class GraphNode {
 		graph.addAll(newTriples);
 		newTriples.clear();
 
-		if (checkPredicates && replacement instanceof UriRef &&
-				resource instanceof UriRef) {
+		if (checkPredicates && replacement instanceof UriRef
+				&& resource instanceof UriRef) {
 			Iterator<Triple> predicateTriples = graph.filter(null,
 					(UriRef) resource, null);
 			while (predicateTriples.hasNext()) {
@@ -610,9 +621,9 @@ public class GraphNode {
 		if (obj == null || !(obj.getClass().equals(getClass()))) {
 			return false;
 		}
-		GraphNode other = (GraphNode)obj;
-		return getNode().equals(other.getNode()) &&
-				getGraph().equals(other.getGraph());
+		GraphNode other = (GraphNode) obj;
+		return getNode().equals(other.getNode())
+				&& getGraph().equals(other.getGraph());
 	}
 
 	@Override