7.1 Blank Nodes
A blank node is used as either a subject or object in a graph that is able to link statements where no resource represents the concept.
predicate
(blank-node-string? val) → boolean?
val : any/c
TBD
predicate
(blank-node-label-string? val) → boolean?
val : any/c
TBD
struct
(struct blank-node ())
This struct wraps a single label value of type local-name?. This label value is not directly
accessible, however it is returned by blank-node->string.
The structure also implements the gen:equal+hash generic methods allowing equal? and equal-hash-code to be used on instances.
constructor
(make-blank-node [label]) → blank-node?
label : (or/c blank-node-label-string? #f) = #f
Returns a new blank node with either the provided label, or a uniquely assigned label. The current
implementation guarantees that it will generate new unique identifiers within the same process, two processes
running separately may generate overlapping identifiers.
procedure
(blank-node->string val) → string?
val : blank-node?
Returns the label of this blank node as a string.
procedure
(blank-node<? v1 v2) → string?
v1 : blank-node? v2 : blank-node?
Returns #t if v1 and v2 are blank-node? values, and v1 is less
than v2 using the labels for comparison. This is equivalent to the following:
(string<? (blank-node->string val1) (blank-node->string val2))
7.1.1 Blank Node Labeler
TBD
parameter
(blank-node-label-maker label-maker) → void? label-maker : blank-node-label-maker/c
TBD