Class DatasetMap

A shell around a Map, which is indexed by the value of rdf Terms.

(At the moment, the map value is a structure, that also includes the original term; that may become unnecessary on long term.)

Index

Constructors

Methods

item get set has datasets data orderedData

Constructors

constructor

new DatasetMap(): DatasetMap
Returns DatasetMap
- Defined in lib/utils.ts:100

Methods

item

item(graph): Store<Quad, Quad, Quad, Quad>
Create a new dataset, if needed, otherwise returns the dataset already stored.

See the remark above for the graph value's type constraint: it is o.k. to use Quad_Subject, because it should never be a default graph.
Parameters
- graph: Quad_Graph
Returns Store<Quad, Quad, Quad, Quad>
- Defined in lib/utils.ts:114

get

get(graph): ProofStore
Get a proof, or undefined if it has not been stored yet
Parameters
- graph: Quad_Graph
Returns ProofStore
- the proof store data
- Defined in lib/utils.ts:125

set

set(graph): DatasetMap
Set a proof
Parameters
- graph: Quad_Graph
Returns DatasetMap
- the current dataset map
- Defined in lib/utils.ts:139

has

has(graph): boolean
Has a proof been stored with this graph reference/
Parameters
- graph: Term
Returns boolean
- Defined in lib/utils.ts:157

datasets

datasets(): Store<Quad, Quad, Quad, Quad>[]
Get the dataset references (in no particular order)

Returns Store<Quad, Quad, Quad, Quad>[]
- the datasets
- Defined in lib/utils.ts:166

data

data(): ProofStore[]
Get the proof entries (in no particular order)

Returns ProofStore[]
- the proof entries
- Defined in lib/utils.ts:174

orderedData

orderedData(): ProofStore[]
Get the proof entries, following the order imposed by the previousProof statements. First element is the one that has no previous proof defined. If there are no nodes with previous proof, an empty array is returned.

This is equivalent to the way proof chains are passed on as arguments when embedded chains are created.

Returns ProofStore[]
- the proofs entries
- Defined in lib/utils.ts:185