Initializes this formula
Optional
statements: Statement<SubjectType, PredicateType, ObjectType, GraphType>[]Initial array of statements
Optional
constraints: readonly any[]initial array of constraints
Optional
initBindings: readonly any[]initial bindings used in Query
Optional
optional: readonly any[]optional
Optional
opts: FormulaOptsThe rdf factory that should be used by the store
The class order for this node
Optional
fetcherThe accompanying fetcher instance.
Is set by the fetcher when initialized.
A namespace for the specified namespace's URI
Gets a namespace for the specified namespace's URI
The URI for the namespace
Optional
factory: RdfJsDataFactoryThe factory for creating named nodes with
The factory used to generate statements and terms
The type of node
The node's value
Static
fromStatic
toAdd a statement from its parts
the first part of the statement
Optional
predicate: Quad_Predicatethe second part of the statement
Optional
object: string | Termthe third part of the statement
Optional
graph: Quad_Graphthe last part of the statement
Adds all the statements to this formula
A collection of statements
Follow link from one node, using one wildcard, looking for one
For example, any(me, knows, null, profile) - a person I know accoring to my profile . any(me, knows, null, null) - a person I know accoring to anything in store . any(null, knows, me, null) - a person who know me accoring to anything in store .
Optional
s: null | Quad_SubjectA node to search for as subject, or if null, a wildcard
Optional
p: null | Quad_PredicateA node to search for as predicate, or if null, a wildcard
Optional
o: null | Quad_ObjectA node to search for as object, or if null, a wildcard
Optional
g: null | Quad_GraphA node to search for as graph, or if null, a wildcard
A node which match the wildcard position, or null
Gets the first JavaScript object equivalent to a node based on the specified pattern
Optional
s: null | Quad_SubjectThe subject
Optional
p: null | Quad_PredicateThe predicate
Optional
o: null | Quad_ObjectThe object
Optional
g: null | Quad_GraphThe graph that contains the statement
Gets the first statement that matches the specified pattern
Optional
s: null | Quad_SubjectOptional
p: null | Quad_PredicateOptional
o: null | Quad_ObjectOptional
g: null | Quad_GraphGets the value of a node that matches the specified pattern
Optional
s: null | Quad_SubjectThe subject
Optional
p: null | Quad_PredicateThe predicate
Optional
o: null | Quad_ObjectThe object
Optional
g: null | Quad_GraphThe graph that contains the statement
Finds the types in the list which have no stored subtypes These are a set of classes which provide by themselves complete information -- the other classes are redundant for those who know the class DAG.
A map of the types
Creates a new collection
Trace statements which connect directly, or through bnodes
The node to start looking for statments
The document to be searched, or null to search all documents
Optional
excludePredicateURIs: readonly string[]an array of statements, duplicate statements are suppresssed.
Follow links from one node, using one wildcard.
For example, each(me, knows, null, profile) - people I know accoring to my profile . each(me, knows, null, null) - people I know accoring to anything in store . each(null, knows, me, null) - people who know me accoring to anything in store .
Optional
s: null | Quad_SubjectA node to search for as subject, or if null, a wildcard
Optional
p: null | Quad_PredicateA node to search for as predicate, or if null, a wildcard
Optional
o: null | Quad_ObjectA node to search for as object, or if null, a wildcard
Optional
g: null | Quad_GraphA node to search for as graph, or if null, a wildcard
Test whether this formula is equals to {other}
The other formula
For thisClass or any subclass, anything which has it is its type or is the object of something which has the type as its range, or subject of something which has the type as its domain We don't bother doing subproperty (yet?)as it doesn't seeem to be used much. Get all the Classes of which we can RDFS-infer the subject is a member
a hash of URIs
For thisClass or any subclass, anything which has it is its type or is the object of something which has the type as its range, or subject of something which has the type as its domain We don't bother doing subproperty (yet?)as it doesn't seeem to be used much. Get all the Classes of which we can RDFS-infer the subject is a member
A named node
Get all the Classes of which we can RDFS-infer the subject is a superclass Returns a hash table where key is NT of type and value is statement why we think so. Does NOT return terms, returns URI strings. We use NT representations in this version because they handle blank nodes.
Get all the Classes of which we can RDFS-infer the subject is a subclass
The thing whose classes are to be found
a hash table where key is NT of type and value is statement why we think so. Does NOT return terms, returns URI strings. We use NT representations in this version because they handle blank nodes.
Get all the Classes of which we can RDFS-infer the subject is a member todo: This will loop is there is a class subclass loop (Sublass loops are not illegal)
The thing whose classes are to be found
a hash table where key is NT of type and value is statement why we think so. Does NOT return terms, returns URI strings. We use NT representations in this version because they handle blank nodes.
Get all the Classes of which we can RDFS-infer the subject is a member todo: This will loop is there is a class subclass loop (Sublass loops are not illegal) Returns a hash table where key is NT of type and value is statement why we think so. Does NOT return terms, returns URI strings. We use NT representations in this version because they handle blank nodes.
A subject node
Creates a new empty formula
Optional
_features: readonly string[]Not applicable, but necessary for typing to pass
Transforms an NTriples string format into a Node. The blank node bit should not be used on program-external values; designed for internal work such as storing a blank node id in an HTML attribute. This will only parse the strings generated by the various toNT() methods.
Returns true if this formula holds the specified statement(s)
Optional
p: anyOptional
o: anyOptional
g: anyReturns true if this formula holds the specified {statement}
Returns a unique index-safe identifier for the given term.
Falls back to the rdflib hashString implementation if the given factory doesn't support id.
Used by the n3parser to generate list elements
The values of the collection
The store
Transform a collection of NTriple URIs into their URI strings
Some iterable collection of NTriple URI strings
A collection of the URIs as strings todo: explain why it is important to go through NT
Compares whether this node is the same as the other one
Another node
Serializes this formula
The base string
The content type of the syntax to use
The provenance URI
Optional
options: anyoptions to pass to the serializer, as defined in serialize method
Search the Store This is really a teaching method as to do this properly you would use IndexedFormula
Optional
s: null | Quad_SubjectA node to search for as subject, or if null, a wildcard
Optional
p: null | Quad_PredicateA node to search for as predicate, or if null, a wildcard
Optional
o: null | Quad_ObjectA node to search for as object, or if null, a wildcard
Optional
g: null | Quad_GraphA node to search for as graph, or if null, a wildcard
Optional
justOne: booleanflag - stop when found one rather than get all of them?
Optional
name: anyGets the node matching the specified pattern. Throws when no match could be made.
Optional
s: null | Quad_SubjectThe subject
Optional
p: null | Quad_PredicateThe predicate
Optional
o: null | Quad_ObjectThe object
Optional
g: null | Quad_GraphThe graph that contains the statement
Creates a canonical string representation of this node
Creates a n-quads string representation of this node
Creates a n-triples string representation of this node
Serializes this formula to a string
RDFS Inference These are hand-written implementations of a backward-chaining reasoner over the RDFS axioms.
A hash of NTs of classes to start with
The property to trace though
Optional
inverse: booleanTrace inverse direction
Gets the number of statements in this formula that matches the specified pattern
Optional
s: null | Quad_SubjectThe subject
Optional
p: null | Quad_PredicateThe predicate
Optional
o: null | Quad_ObjectThe object
Optional
g: null | Quad_GraphThe graph that contains the statement
A formula, or store of RDF statements