public interface Vertex
| Modifier and Type | Method and Description |
|---|---|
void |
addProperty(org.openrdf.model.URI property,
org.openrdf.model.Value value) |
List<org.openrdf.model.Value> |
asList() |
Graph |
asNamedGraph()
Get a representation of this Vertex as a named graph.
|
Graph |
assertNamedGraph()
Assert that this Vertex is a named graph and get that graph.
|
Traversal |
asTraversal() |
Double |
doubleValue(org.openrdf.model.URI predicate) |
Graph |
getGraph()
Get the graph that contains this vertex.
|
org.openrdf.model.Resource |
getId()
The identifier for this Vertex
|
org.openrdf.model.Resource |
getResource(org.openrdf.model.URI predicate)
Get the value of a specified property as a Resource
|
org.openrdf.model.URI |
getURI(org.openrdf.model.URI predicate)
Get the value of a specified property as a URI.
|
org.openrdf.model.Value |
getValue(org.openrdf.model.URI predicate)
Get the value of a specified property.
|
Set<org.openrdf.model.Value> |
getValueSet(org.openrdf.model.URI predicate)
Get the set of values of a specified property
|
Vertex |
getVertex(org.openrdf.model.URI predicate)
Get the value of a property as a Vertex
|
Set<Vertex> |
getVertexSet(org.openrdf.model.URI predicate)
Get the set of values of a specified property as a set of vertices.
|
boolean |
hasEdge(Edge edge) |
boolean |
hasProperty(org.openrdf.model.URI predicate,
org.openrdf.model.Value value)
Test whether the Vertex has a given value for a specified property.
|
Set<Map.Entry<org.openrdf.model.URI,Set<Edge>>> |
inEdges() |
Set<Edge> |
inEdgeSet()
Returns a set containing all of the incoming edges
|
Set<Edge> |
inProperty(org.openrdf.model.URI predicate)
Get the Set of incoming edges with the specified predicate.
|
Integer |
integerValue(org.openrdf.model.URI predicate) |
boolean |
isList() |
boolean |
isOrphan()
Test whether the Vertex has any incoming edges.
|
Set<Map.Entry<org.openrdf.model.URI,Set<Edge>>> |
outEdges()
Returns a set of entries for the outgoing edges
|
Set<Edge> |
outEdgeSet()
Returns a set containing all of the outgoing edges
|
Set<Edge> |
outProperty(org.openrdf.model.URI predicate)
Get the Set of outgoing edges with the specified predicate.
|
void |
remove(Edge edge) |
String |
stringValue(org.openrdf.model.URI predicate) |
Vertex |
vertexValue(org.openrdf.model.URI predicate) |
Graph asNamedGraph()
Graph assertNamedGraph()
Graph getGraph()
org.openrdf.model.Resource getId()
Set<Map.Entry<org.openrdf.model.URI,Set<Edge>>> outEdges()
boolean hasEdge(Edge edge)
void addProperty(org.openrdf.model.URI property,
org.openrdf.model.Value value)
Set<Edge> outProperty(org.openrdf.model.URI predicate)
predicate - The predicate for the outgoing edgesorg.openrdf.model.Value getValue(org.openrdf.model.URI predicate)
predicate - The predicate that identifies the property whose value is to be returned.Set<org.openrdf.model.Value> getValueSet(org.openrdf.model.URI predicate)
Set<Vertex> getVertexSet(org.openrdf.model.URI predicate)
org.openrdf.model.URI getURI(org.openrdf.model.URI predicate)
predicate - The predicate that identifies the properties whose value is to be returned.org.openrdf.model.Resource getResource(org.openrdf.model.URI predicate)
predicate - The predicate that identifies the property whose value is to be returned.Vertex getVertex(org.openrdf.model.URI predicate) throws KonigException
predicate - The predicate that identifies the propertyKonigException - If there is more than one value for the specified propertyInteger integerValue(org.openrdf.model.URI predicate)
String stringValue(org.openrdf.model.URI predicate)
Double doubleValue(org.openrdf.model.URI predicate)
Vertex vertexValue(org.openrdf.model.URI predicate)
boolean hasProperty(org.openrdf.model.URI predicate,
org.openrdf.model.Value value)
predicate - The property to be testedvalue - The value to be testedSet<Edge> inProperty(org.openrdf.model.URI predicate)
predicate - The predicate for the incoming edgesTraversal asTraversal()
void remove(Edge edge)
boolean isList()
List<org.openrdf.model.Value> asList()
boolean isOrphan()
Copyright © 2019. All rights reserved.