5.8.3 Nodes

typedef struct SerdNodesImpl SerdNodes

Hashing node container for interning and simplified memory management.

SerdNodes *serd_nodes_new(SerdAllocator *allocator)

Create a new node set.

void serd_nodes_free(SerdNodes *nodes)

Free nodes and all nodes that are stored in it.

Note that this invalidates any node pointers previously returned from nodes.

size_t serd_nodes_size(const SerdNodes *nodes)

Return the number of interned nodes.

const SerdNode *serd_nodes_get(const SerdNodes *nodes, const SerdNode *node)

Return the existing interned copy of a node if it exists.

This either returns an equivalent to the given node, or null if this node has not been interned.

const SerdNode *serd_nodes_intern(SerdNodes *nodes, const SerdNode *node)

Intern node.

Multiple calls with equivalent nodes will return the same pointer.

Returns

A node that is different than, but equivalent to, node.

const SerdNode *serd_nodes_string(SerdNodes *nodes, SerdStringView string)

Make a string node.

A new node will be added if an equivalent node is not already in the set.

const SerdNode *serd_nodes_literal(SerdNodes *nodes, SerdStringView string, SerdNodeFlags flags, SerdStringView meta)

Make a literal node with optional datatype or language.

This can create complex literals with an associated datatype URI or language tag, and control whether a literal should be written as a short or long (triple-quoted) string.

Parameters

• nodes – The node set to get this literal from.

• string – The string value of the literal.

• flags – Flags to describe the literal and its metadata. Note that at most one of SerdNodeFlag.SERD_HAS_DATATYPE and SerdNodeFlag.SERD_HAS_LANGUAGE may be set.

• meta – The string value of the literal’s metadata. If SerdNodeFlag.SERD_HAS_DATATYPE is set, then this must be an absolute datatype URI. If SerdNodeFlag.SERD_HAS_LANGUAGE is set, then this must be an RFC 5646 language tag like “en-ca”. Otherwise, it is ignored.

const SerdNode *serd_nodes_boolean(SerdNodes *nodes, bool value)

Make a canonical xsd:boolean node.

A new node will be constructed with serd_node_construct_boolean() if an equivalent one is not already in the set.

const SerdNode *serd_nodes_decimal(SerdNodes *nodes, double value)

Make a canonical xsd:decimal node.

A new node will be constructed with serd_node_construct_decimal() if an equivalent one is not already in the set.

const SerdNode *serd_nodes_double(SerdNodes *nodes, double value)

Make a canonical xsd:double node.

A new node will be constructed with serd_node_construct_double() if an equivalent one is not already in the set.

const SerdNode *serd_nodes_float(SerdNodes *nodes, float value)

Make a canonical xsd:float node.

A new node will be constructed with serd_node_construct_float() if an equivalent one is not already in the set.

const SerdNode *serd_nodes_integer(SerdNodes *nodes, int64_t value, SerdStringView datatype)

Make a canonical xsd:integer node.

A new node will be constructed with serd_node_construct_integer() if an equivalent one is not already in the set.

const SerdNode *serd_nodes_base64(SerdNodes *nodes, const void *value, size_t value_size, SerdStringView datatype)

Make a canonical xsd:base64Binary node.

A new node will be constructed with serd_node_construct_base64() if an equivalent one is not already in the set.

const SerdNode *serd_nodes_uri(SerdNodes *nodes, SerdStringView string)

Make a URI node from a string.

A new node will be constructed with serd_node_construct_token() if an equivalent one is not already in the set.

const SerdNode *serd_nodes_parsed_uri(SerdNodes *nodes, SerdURIView uri)

Make a URI node from a parsed URI.

A new node will be constructed with serd_node_construct_uri() if an equivalent one is not already in the set.

const SerdNode *serd_nodes_blank(SerdNodes *nodes, SerdStringView string)

Make a blank node.

A new node will be constructed with serd_node_construct_token() if an equivalent one is not already in the set.

void serd_nodes_deref(SerdNodes *nodes, const SerdNode *node)

Dereference node.

Decrements the reference count of node, and frees the internally stored equivalent node if this was the last reference. Does nothing if no node equivalent to node is stored in nodes.