Optional
_Optional
_Reverse mapping to redirection: aliases for this
Map of iri predicates to functions to call when adding { s type X }
The class order for this node
The accompanying fetcher instance.
Is set by the fetcher when initialized.
Redirections we got from HTTP
Dictionary of namespace prefixes
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
Array of statements with this X as object
Array of statements with this X as predicate
Map of iri predicates to functions to call when getting statement with {s X o}
The factory used to generate statements and terms
Redirect to lexically smaller equivalent symbol
Array of statements with this X as subject
The type of node
An UpdateManager initialised to this store
The node's value
Array of statements with X as provenance
Static
fromStatic
handleStatic
toReturns the number of statements contained in this IndexedFormula. (Getter proxy to this.statements). Usage:
var kb = rdf.graph()
kb.length // -> 0
Static
defaultGets the URI of the default graph
Adds a triple (quad) to the store.
The thing about which the fact a relationship is asserted. Also accepts a statement or an array of Statements.
Optional
pred: Quad_PredicateThe relationship which is asserted
Optional
obj: string | TermThe object of the relationship, e.g. another thing or a value. If passed a string, this will become a literal.
Optional
why: Quad_GraphThe document in which the triple (S,P,O) was or will be stored on the web
The statement added to the store, or the store
Adds all the statements to this formula
A collection of statements
Add a callback which will be triggered after a statement has been added to the store.
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
Apply a set of statements to be deleted and to be inserted
The set of statements to be deleted and to be inserted
The name of the document to patch
Callback to be called when patching is complete
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
Returns the symbol with canonical URI as smushed
Optional
term: TermAn RDF node
Checks this formula for consistency
Checks a list of statements for consistency
The list of statements to check
Optional
from: numberAn index with the array ['subject', 'predicate', 'object', 'why']
Closes this formula (and return it)
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.
replaces
node to copy
node to copy to
Optional
flags: ("two-direction" | "delete")[]Whether or not to do a two-directional copy and/or delete triples
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
Simplify graph in store when we realize two identifiers are equivalent We replace the bigger with the smaller.
The first node
The second node
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 indexed formula Only applicable for IndexedFormula, but TypeScript won't allow a subclass to override a property
The list of features
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
Returns any quads matching the given arguments.
Standard RDFJS spec method for Source objects, implemented as an
alias to statementsMatching()
Optional
subject: null | Quad_SubjectThe subject
Optional
predicate: null | Quad_PredicateThe predicate
Optional
object: null | Quad_ObjectThe object
Optional
graph: null | Quad_GraphThe graph that contains the statement
Find out whether a given URI is used as symbol in the formula
The URI to look for
Existentials are BNodes - something exists without naming
An URI
Adds a new property action
the predicate that the function should be triggered on
the function that should trigger
Creates a new universal node Universals are Variables
An URI
Find an unused id for a file being edited: return a symbol (Note: Slow iff a lot of them -- could be O(log(k)) )
A document named node
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
Query this store synchronously and return bindings
The query to be run
Removes one or multiple statement(s) from this formula
A Statement or array of Statements to remove
Removes all statements in a doc, along with the related metadata including request/response/status
The document / graph
Remove all statements matching args (within limit) *
Optional
subj: null | Quad_SubjectThe subject
Optional
pred: null | Quad_PredicateThe predicate
Optional
obj: null | Quad_ObjectThe object
Optional
why: null | Quad_GraphThe graph that contains the statement
Optional
limit: numberThe number of statements to remove
Remove all matching statements
Optional
subject: null | Quad_SubjectThe subject
Optional
predicate: null | Quad_PredicateThe predicate
Optional
object: null | Quad_ObjectThe object
Optional
graph: null | Quad_GraphThe graph that contains the statement
Remove a particular statement object from the store
a statement which is already in the store and indexed. Make sure you only use this for these. Otherwise, you should use remove() above.
Replace big with small, obsoleted with obsoleting.
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
ALL CONVENIENCE LOOKUP FUNCTIONS RELY ON THIS!
Optional
subj: null | Quad_SubjectA node to search for as subject, or if null, a wildcard
Optional
pred: null | Quad_PredicateA node to search for as predicate, or if null, a wildcard
Optional
obj: null | Quad_ObjectA node to search for as object, or if null, a wildcard
Optional
why: 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?
An array of nodes which match the wildcard position
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
A list of all the URIs by which this thing is known
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
Indexed Formula aka Store