@rdfjs/traverser
Version:
Generic traverser for RDF/JS datasets
114 lines (90 loc) • 2.14 kB
JavaScript
import toNT from '@rdfjs/to-ntriples'
class Visisted {
constructor () {
this.quadLevel = new Map()
}
add (quad, level) {
this.quadLevel.set(toNT(quad), level)
}
has (quad, level) {
const seenAt = this.quadLevel.get(toNT(quad))
if (seenAt === undefined) {
return false
}
return seenAt <= level
}
}
function forEach ({ backward, callback, dataset, filter, forward, term, visited = new Visisted() }) {
const next = (term, level) => {
const checkMatches = matches => {
for (const quad of matches) {
if (visited.has(quad, level)) {
continue
}
visited.add(quad, level)
const args = { dataset, level, quad }
if (filter(args)) {
callback(args)
if (forward) {
next(quad.object, level + 1)
}
if (backward) {
next(quad.subject, level + 1)
}
}
}
}
if (forward) {
checkMatches(dataset.match(term))
}
if (backward) {
checkMatches(dataset.match(null, null, term))
}
}
next(term, 0)
}
class Traverser {
constructor (filter, { backward = false, factory, forward = true }) {
this.backward = backward
this.factory = factory
this.filter = filter
this.forward = forward
}
forEach ({ term, dataset }, callback) {
forEach({
backward: this.backward,
callback,
dataset,
filter: this.filter,
forward: this.forward,
term
})
}
match ({ term, dataset }) {
const result = this.factory.dataset()
forEach({
backward: this.backward,
callback: ({ quad }) => result.add(quad),
dataset,
filter: this.filter,
forward: this.forward,
term
})
return result
}
reduce ({ term, dataset }, callback, initialValue) {
let result = initialValue
forEach({
backward: this.backward,
callback: args => {
result = callback(args, result)
},
dataset,
filter: this.filter,
forward: this.forward,
term
})
return result
}
}
export default Traverser