Package | Description |
---|---|
org.apache.jena.enhanced |
This package defines the enhanced node and graph classes; an enhanced
node is one embedded in a particular enhanced graph.
|
org.apache.jena.ontology |
Provides a set of abstractions and convenience classes for accessing and manipluating ontologies
represented in RDF.
|
org.apache.jena.ontology.impl |
Provides default implementations for the abstractions defined in the
org.apache.jena.ontology package. |
org.apache.jena.rdf.model.impl |
This package contains implementations of the interfaces defined
in the .model package, eg ModelCom for Model, ResourceImpl
for Resource, and so on.
|
org.apache.jena.util |
Miscellaneous collection of utility classes.
|
Modifier and Type | Method and Description |
---|---|
EnhGraph |
EnhNode.getGraph()
Answer the graph containing this node
|
Modifier and Type | Method and Description |
---|---|
abstract boolean |
Implementation.canWrap(Node node,
EnhGraph eg)
true iff wrapping (node, eg) would succeed.
|
boolean |
EnhGraph.isIsomorphicWith(EnhGraph eg)
Answer true if the given enhanced graph contains the same nodes and
edges as this graph.
|
<X extends T> |
Personality.newInstance(Class<X> interf,
Node n,
EnhGraph that)
make a new instance of a type _interf_ based on the node _n_ and the
polymorphic _that_; use the implementation wrapper for _interf_ in
_types_.
|
abstract EnhNode |
Implementation.wrap(Node node,
EnhGraph eg)
Create a new EnhNode wrapping a Node in the context of an EnhGraph
|
Constructor and Description |
---|
EnhNode(Node n,
EnhGraph g) |
Modifier and Type | Method and Description |
---|---|
<T> boolean |
Profile.isSupported(Node n,
EnhGraph g,
Class<T> type)
Answer true if the given graph supports a view of this node as the given
language element, according to the semantic constraints of the profile.
|
Modifier and Type | Class and Description |
---|---|
class |
OntModelImpl
Implementation of a model that can process general ontologies in OWL
and similar languages.
|
Modifier and Type | Method and Description |
---|---|
static boolean |
AbstractProfile.containsSome(EnhGraph g,
Node n,
Property p)
Utility method: answer true iff the enhanced graph contains some triple which
has n as subject, p.asNode() as predicate, and any object.
|
static boolean |
OWLLiteProfile.containsSome(EnhGraph g,
Node n,
Property p) |
static boolean |
OWLProfile.containsSome(EnhGraph g,
Node n,
Property p) |
static boolean |
OWLDLProfile.containsSome(EnhGraph g,
Node n,
Property p) |
static boolean |
CardinalityQRestrictionImpl.isCardinalityQRestriction(Node node,
EnhGraph eg) |
static boolean |
MaxCardinalityQRestrictionImpl.isMaxCardinalityQRestriction(Node node,
EnhGraph eg) |
static boolean |
MinCardinalityQRestrictionImpl.isMinCardinalityQRestriction(Node node,
EnhGraph eg) |
<T> boolean |
OWLProfile.isSupported(Node n,
EnhGraph g,
Class<T> type)
Answer true if the given graph supports a view of this node as the given
language element, according to the semantic constraints of the profile.
|
<T> boolean |
RDFSProfile.isSupported(Node n,
EnhGraph g,
Class<T> type)
Answer true if the given graph supports a view of this node as the given
language element, according to the semantic constraints of the profile.
|
Constructor and Description |
---|
AllDifferentImpl(Node n,
EnhGraph g)
Construct an all different axiom represented by the given node in the given graph.
|
AllValuesFromRestrictionImpl(Node n,
EnhGraph g)
Construct a hasValue restriction node represented by the given node in the given graph.
|
AnnotationPropertyImpl(Node n,
EnhGraph g)
Construct an ontology resource represented by the given node in the given graph.
|
BooleanClassDescriptionImpl(Node n,
EnhGraph g)
Construct an boolean class description represented by the given node in the given graph.
|
CardinalityQRestrictionImpl(Node n,
EnhGraph g)
Construct a qualified restriction node represented by the given node in the given graph.
|
CardinalityRestrictionImpl(Node n,
EnhGraph g)
Construct a cardinality restriction node represented by the given node in the given graph.
|
ComplementClassImpl(Node n,
EnhGraph g)
Construct a complement class node represented by the given node in the given graph.
|
DataRangeImpl(Node n,
EnhGraph g)
Construct a data range node represented by the given node in the given graph.
|
DatatypePropertyImpl(Node n,
EnhGraph g)
Construct a datatype property node represented by the given node in the given graph.
|
EnumeratedClassImpl(Node n,
EnhGraph g)
Construct an enumerated class node represented by the given node in the given graph.
|
FunctionalPropertyImpl(Node n,
EnhGraph g)
Construct a functional property node represented by the given node in the given graph.
|
HasValueRestrictionImpl(Node n,
EnhGraph g)
Construct a hasValue restriction node represented by the given node in the given graph.
|
IndividualImpl(Node n,
EnhGraph g)
Construct an individual represented by the given node in the given graph.
|
IntersectionClassImpl(Node n,
EnhGraph g)
Construct an intersection class node represented by the given node in the given graph.
|
InverseFunctionalPropertyImpl(Node n,
EnhGraph g)
Construct an inverse functional property node represented by the given node in the given graph.
|
MaxCardinalityQRestrictionImpl(Node n,
EnhGraph g)
Construct a qualified restriction node represented by the given node in the given graph.
|
MaxCardinalityRestrictionImpl(Node n,
EnhGraph g)
Construct a max cardinality restriction node represented by the given node in the given graph.
|
MinCardinalityQRestrictionImpl(Node n,
EnhGraph g)
Construct a qualified restriction node represented by the given node in the given graph.
|
MinCardinalityRestrictionImpl(Node n,
EnhGraph g)
Construct a min cardinality restriction node represented by the given node in the given graph.
|
ObjectPropertyImpl(Node n,
EnhGraph g)
Construct a functional property node represented by the given node in the given graph.
|
OntClassImpl(Node n,
EnhGraph g)
Construct an ontology class node represented by the given node in the given graph.
|
OntologyImpl(Node n,
EnhGraph g)
Construct an ontology metadata node represented by the given node in the given graph.
|
OntPropertyImpl(Node n,
EnhGraph g)
Construct an ontology property represented by the given node in the given graph.
|
OntResourceImpl(Node n,
EnhGraph g)
Construct an ontology resource represented by the given node in the given graph.
|
QualifiedRestrictionImpl(Node n,
EnhGraph g)
Construct a qualified restriction node represented by the given node in the given graph.
|
RestrictionImpl(Node n,
EnhGraph g)
Construct a restriction node represented by the given node in the given graph.
|
SomeValuesFromRestrictionImpl(Node n,
EnhGraph g)
Construct a hasValue restriction node represented by the given node in the given graph.
|
SymmetricPropertyImpl(Node n,
EnhGraph g)
Construct a symmetric property node represented by the given node in the given graph.
|
TransitivePropertyImpl(Node n,
EnhGraph g)
Construct a transitive property node represented by the given node in the given graph.
|
UnionClassImpl(Node n,
EnhGraph g)
Construct a union class node represented by the given node in the given graph.
|
Modifier and Type | Class and Description |
---|---|
class |
InfModelImpl
Default implementation of the InfModel interface which simply wraps up
an InfGraph.
|
class |
ModelCom
Common methods for model implementations.
|
Modifier and Type | Method and Description |
---|---|
static ReifiedStatementImpl |
ReifiedStatementImpl.create(EnhGraph eg,
Node n,
Statement s) |
static RDFNode |
StatementImpl.createObject(Node n,
EnhGraph g)
create an RDF node which might be a literal, or not.
|
Constructor and Description |
---|
AltImpl(Node n,
EnhGraph g) |
BagImpl(Node n,
EnhGraph g) |
ContainerImpl(Node n,
EnhGraph g) |
LiteralImpl(Node n,
EnhGraph m) |
PropertyImpl(Node n,
EnhGraph m) |
RDFListImpl(Node n,
EnhGraph g)
Construct an implementation of RDFList in the given graph, where the
given node is the head of the list.
|
ResourceImpl(Node n,
EnhGraph m) |
SeqImpl(Node n,
EnhGraph g) |
Modifier and Type | Class and Description |
---|---|
class |
MonitorModel
Model wrapper which provides normal access to an underlying model but
also maintains a snapshot of the triples it was last known to contain.
|
Licenced under the Apache License, Version 2.0