Chris@2: /*
Chris@2:   Copyright 2011-2013 David Robillard <http://drobilla.net>
Chris@2: 
Chris@2:   Permission to use, copy, modify, and/or distribute this software for any
Chris@2:   purpose with or without fee is hereby granted, provided that the above
Chris@2:   copyright notice and this permission notice appear in all copies.
Chris@2: 
Chris@2:   THIS SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
Chris@2:   WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
Chris@2:   MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
Chris@2:   ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
Chris@2:   WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
Chris@2:   ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
Chris@2:   OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
Chris@2: */
Chris@2: 
Chris@2: /**
Chris@2:    @file sord.h API for Sord, a lightweight RDF model library.
Chris@2: */
Chris@2: 
Chris@2: #ifndef SORD_SORD_H
Chris@2: #define SORD_SORD_H
Chris@2: 
Chris@2: #include <stddef.h>
Chris@2: #include <stdint.h>
Chris@2: #include <stdio.h>
Chris@2: 
Chris@2: #include "serd/serd.h"
Chris@2: 
Chris@2: #ifdef SORD_SHARED
Chris@2: #    ifdef _WIN32
Chris@2: #        define SORD_LIB_IMPORT __declspec(dllimport)
Chris@2: #        define SORD_LIB_EXPORT __declspec(dllexport)
Chris@2: #    else
Chris@2: #        define SORD_LIB_IMPORT __attribute__((visibility("default")))
Chris@2: #        define SORD_LIB_EXPORT __attribute__((visibility("default")))
Chris@2: #    endif
Chris@2: #    ifdef SORD_INTERNAL
Chris@2: #        define SORD_API SORD_LIB_EXPORT
Chris@2: #    else
Chris@2: #        define SORD_API SORD_LIB_IMPORT
Chris@2: #    endif
Chris@2: #else
Chris@2: #    define SORD_API
Chris@2: #endif
Chris@2: 
Chris@2: #ifdef __cplusplus
Chris@2: extern "C" {
Chris@2: #else
Chris@2: #    include <stdbool.h>
Chris@2: #endif
Chris@2: 
Chris@2: /**
Chris@2:    @defgroup sord Sord
Chris@2:    A lightweight RDF model library.
Chris@2: 
Chris@2:    Sord stores RDF (subject object predicate context) quads, where the context
Chris@2:    may be omitted (to represent triples in the default graph).
Chris@2:    @{
Chris@2: */
Chris@2: 
Chris@2: /**
Chris@2:    Sord World.
Chris@2:    The World represents all library state, including interned strings.
Chris@2: */
Chris@2: typedef struct SordWorldImpl SordWorld;
Chris@2: 
Chris@2: /**
Chris@2:    Sord Model.
Chris@2: 
Chris@2:    A model is an indexed set of Quads (i.e. it can contain several RDF
Chris@2:    graphs).  It may be searched using various patterns depending on which
Chris@2:    indices are enabled.
Chris@2: */
Chris@2: typedef struct SordModelImpl SordModel;
Chris@2: 
Chris@2: /**
Chris@2:    Model Inserter.
Chris@2: 
Chris@2:    An inserter is used for writing statements to a model using the Serd sink
Chris@2:    interface.  This makes it simple to write to a model directly using a
Chris@2:    SerdReader, or any other code that writes statements to a SerdStatementSink.
Chris@2: */
Chris@2: typedef struct SordInserterImpl SordInserter;
Chris@2: 
Chris@2: /**
Chris@2:    Model Iterator.
Chris@2: */
Chris@2: typedef struct SordIterImpl SordIter;
Chris@2: 
Chris@2: /**
Chris@2:    RDF Node.
Chris@2:    A Node is a component of a Quad.  Nodes may be URIs, blank nodes, or
Chris@2:    (in the case of quad objects only) string literals. Literal nodes may
Chris@2:    have an associate language or datatype (but not both).
Chris@2: */
Chris@2: typedef struct SordNodeImpl SordNode;
Chris@2: 
Chris@2: /**
Chris@2:    Quad of nodes (a statement), or a quad pattern.
Chris@2: 
Chris@2:    Nodes are ordered (S P O G).  The ID of the default graph is 0.
Chris@2: */
Chris@2: typedef const SordNode* SordQuad[4];
Chris@2: 
Chris@2: /**
Chris@2:    Index into a SordQuad.
Chris@2: */
Chris@2: typedef enum {
Chris@2: 	SORD_SUBJECT   = 0,  /**< Subject */
Chris@2: 	SORD_PREDICATE = 1,  /**< Predicate (a.k.a. "key") */
Chris@2: 	SORD_OBJECT    = 2,  /**< Object    (a.k.a. "value") */
Chris@2: 	SORD_GRAPH     = 3   /**< Graph     (a.k.a. "context") */
Chris@2: } SordQuadIndex;
Chris@2: 
Chris@2: /**
Chris@2:    Type of a node.
Chris@2: */
Chris@2: typedef enum {
Chris@2: 	SORD_URI     = 1,  /**< URI */
Chris@2: 	SORD_BLANK   = 2,  /**< Blank node identifier */
Chris@2: 	SORD_LITERAL = 3   /**< Literal (string with optional lang or datatype) */
Chris@2: } SordNodeType;
Chris@2: 
Chris@2: /**
Chris@2:    Indexing option.
Chris@2: */
Chris@2: typedef enum {
Chris@2: 	SORD_SPO = 1,       /**< Subject,   Predicate, Object */
Chris@2: 	SORD_SOP = 1 << 1,  /**< Subject,   Object,    Predicate */
Chris@2: 	SORD_OPS = 1 << 2,  /**< Object,    Predicate, Subject */
Chris@2: 	SORD_OSP = 1 << 3,  /**< Object,    Subject,   Predicate */
Chris@2: 	SORD_PSO = 1 << 4,  /**< Predicate, Subject,   Object */
Chris@2: 	SORD_POS = 1 << 5   /**< Predicate, Object,    Subject */
Chris@2: } SordIndexOption;
Chris@2: 
Chris@2: /**
Chris@2:    @name World
Chris@2:    @{
Chris@2: */
Chris@2: 
Chris@2: /**
Chris@2:    Create a new Sord World.
Chris@2:    It is safe to use multiple worlds in one process, though no data
Chris@2:    (e.g. nodes) can be shared between worlds, and this should be avoided if
Chris@2:    possible for performance reasons.
Chris@2: */
Chris@2: SORD_API
Chris@2: SordWorld*
Chris@2: sord_world_new(void);
Chris@2: 
Chris@2: /**
Chris@2:    Free @c world.
Chris@2: */
Chris@2: SORD_API
Chris@2: void
Chris@2: sord_world_free(SordWorld* world);
Chris@2: 
Chris@2: /**
Chris@2:    Set a function to be called when errors occur.
Chris@2: 
Chris@2:    The @p error_sink will be called with @p handle as its first argument.  If
Chris@2:    no error function is set, errors are printed to stderr.
Chris@2: */
Chris@2: SORD_API
Chris@2: void
Chris@2: sord_world_set_error_sink(SordWorld*    world,
Chris@2:                           SerdErrorSink error_sink,
Chris@2:                           void*         handle);
Chris@2: 
Chris@2: /**
Chris@2:    @}
Chris@2:    @name Node
Chris@2:    @{
Chris@2: */
Chris@2: 
Chris@2: /**
Chris@2:    Get a URI node from a string.
Chris@2: 
Chris@2:    Note this function measures @c str, which is a common bottleneck.
Chris@2:    Use sord_node_from_serd_node instead if @c str is already measured.
Chris@2: */
Chris@2: SORD_API
Chris@2: SordNode*
Chris@2: sord_new_uri(SordWorld* world, const uint8_t* uri);
Chris@2: 
Chris@2: /**
Chris@2:    Get a URI node from a relative URI string.
Chris@2: */
Chris@2: SORD_API
Chris@2: SordNode*
Chris@2: sord_new_relative_uri(SordWorld*     world,
Chris@2:                       const uint8_t* str,
Chris@2:                       const uint8_t* base_uri);
Chris@2: 
Chris@2: /**
Chris@2:    Get a blank node from a string.
Chris@2: 
Chris@2:    Note this function measures @c str, which is a common bottleneck.
Chris@2:    Use sord_node_from_serd_node instead if @c str is already measured.
Chris@2: */
Chris@2: SORD_API
Chris@2: SordNode*
Chris@2: sord_new_blank(SordWorld* world, const uint8_t* str);
Chris@2: 
Chris@2: /**
Chris@2:    Get a literal node from a string.
Chris@2: 
Chris@2:    Note this function measures @c str, which is a common bottleneck.
Chris@2:    Use sord_node_from_serd_node instead if @c str is already measured.
Chris@2: */
Chris@2: SORD_API
Chris@2: SordNode*
Chris@2: sord_new_literal(SordWorld*     world,
Chris@2:                  SordNode*      datatype,
Chris@2:                  const uint8_t* str,
Chris@2:                  const char*    lang);
Chris@2: 
Chris@2: /**
Chris@2:    Copy a node (obtain a reference).
Chris@2: 
Chris@2:    Node that since nodes are interned and reference counted, this does not
Chris@2:    actually create a deep copy of @c node.
Chris@2: */
Chris@2: SORD_API
Chris@2: SordNode*
Chris@2: sord_node_copy(const SordNode* node);
Chris@2: 
Chris@2: /**
Chris@2:    Free a node (drop a reference).
Chris@2: */
Chris@2: SORD_API
Chris@2: void
Chris@2: sord_node_free(SordWorld* world, SordNode* node);
Chris@2: 
Chris@2: /**
Chris@2:    Return the type of a node (SORD_URI, SORD_BLANK, or SORD_LITERAL).
Chris@2: */
Chris@2: SORD_API
Chris@2: SordNodeType
Chris@2: sord_node_get_type(const SordNode* node);
Chris@2: 
Chris@2: /**
Chris@2:    Return the string value of a node.
Chris@2: */
Chris@2: SORD_API
Chris@2: const uint8_t*
Chris@2: sord_node_get_string(const SordNode* node);
Chris@2: 
Chris@2: /**
Chris@2:    Return the string value of a node, and set @c len to its length.
Chris@2: */
Chris@2: SORD_API
Chris@2: const uint8_t*
Chris@2: sord_node_get_string_counted(const SordNode* node, size_t* len);
Chris@2: 
Chris@2: /**
Chris@2:    Return the language of a literal node (or NULL).
Chris@2: */
Chris@2: SORD_API
Chris@2: const char*
Chris@2: sord_node_get_language(const SordNode* node);
Chris@2: 
Chris@2: /**
Chris@2:    Return the datatype URI of a literal node (or NULL).
Chris@2: */
Chris@2: SORD_API
Chris@2: SordNode*
Chris@2: sord_node_get_datatype(const SordNode* node);
Chris@2: 
Chris@2: /**
Chris@2:    Return the flags (string attributes) of a node.
Chris@2: */
Chris@2: SORD_API
Chris@2: SerdNodeFlags
Chris@2: sord_node_get_flags(const SordNode* node);
Chris@2: 
Chris@2: /**
Chris@2:    Return true iff node can be serialised as an inline object.
Chris@2: 
Chris@2:    More specifically, this returns true iff the node is the object field
Chris@2:    of exactly one statement, and therefore can be inlined since it needn't
Chris@2:    be referred to by name.
Chris@2: */
Chris@2: SORD_API
Chris@2: bool
Chris@2: sord_node_is_inline_object(const SordNode* node);
Chris@2: 
Chris@2: /**
Chris@2:    Return true iff @c a is equal to @c b.
Chris@2: 
Chris@2:    Note this is much faster than comparing the node's strings.
Chris@2: */
Chris@2: SORD_API
Chris@2: bool
Chris@2: sord_node_equals(const SordNode* a,
Chris@2:                  const SordNode* b);
Chris@2: 
Chris@2: /**
Chris@2:    Return a SordNode as a SerdNode.
Chris@2: 
Chris@2:    The returned node is shared and must not be freed or modified.
Chris@2: */
Chris@2: SORD_API
Chris@2: const SerdNode*
Chris@2: sord_node_to_serd_node(const SordNode* node);
Chris@2: 
Chris@2: /**
Chris@2:    Create a new SordNode from a SerdNode.
Chris@2: 
Chris@2:    The returned node must be freed using sord_node_free.
Chris@2: */
Chris@2: SORD_API
Chris@2: SordNode*
Chris@2: sord_node_from_serd_node(SordWorld*      world,
Chris@2:                          SerdEnv*        env,
Chris@2:                          const SerdNode* node,
Chris@2:                          const SerdNode* datatype,
Chris@2:                          const SerdNode* lang);
Chris@2: 
Chris@2: /**
Chris@2:    @}
Chris@2:    @name Model
Chris@2:    @{
Chris@2: */
Chris@2: 
Chris@2: /**
Chris@2:    Create a new model.
Chris@2: 
Chris@2:    @param world The world in which to make this model.
Chris@2: 
Chris@2:    @param indices SordIndexOption flags (e.g. SORD_SPO|SORD_OPS).  Be sure to
Chris@2:    enable an index where the most significant node(s) are not variables in your
Chris@2:    queries (e.g. to make (? P O) queries, enable either SORD_OPS or SORD_POS).
Chris@2: 
Chris@2:    @param graphs If true, store (and index) graph contexts.
Chris@2: */
Chris@2: SORD_API
Chris@2: SordModel*
Chris@2: sord_new(SordWorld* world,
Chris@2:          unsigned  indices,
Chris@2:          bool      graphs);
Chris@2: 
Chris@2: /**
Chris@2:    Close and free @c model.
Chris@2: */
Chris@2: SORD_API
Chris@2: void
Chris@2: sord_free(SordModel* model);
Chris@2: 
Chris@2: /**
Chris@2:    Get the world associated with @c model.
Chris@2: */
Chris@2: SORD_API
Chris@2: SordWorld*
Chris@2: sord_get_world(SordModel* model);
Chris@2: 
Chris@2: /**
Chris@2:    Return the number of nodes stored in @c world.
Chris@2: 
Chris@2:    Nodes are included in this count iff they are a part of a quad in @c world.
Chris@2: */
Chris@2: SORD_API
Chris@2: size_t
Chris@2: sord_num_nodes(const SordWorld* world);
Chris@2: 
Chris@2: /**
Chris@2:    Return the number of quads stored in @c model.
Chris@2: */
Chris@2: SORD_API
Chris@2: size_t
Chris@2: sord_num_quads(const SordModel* model);
Chris@2: 
Chris@2: /**
Chris@2:    Return an iterator to the start of @c model.
Chris@2: */
Chris@2: SORD_API
Chris@2: SordIter*
Chris@2: sord_begin(const SordModel* model);
Chris@2: 
Chris@2: /**
Chris@2:    Search for statements by a quad pattern.
Chris@2:    @return an iterator to the first match, or NULL if no matches found.
Chris@2: */
Chris@2: SORD_API
Chris@2: SordIter*
Chris@2: sord_find(SordModel* model, const SordQuad pat);
Chris@2: 
Chris@2: /**
Chris@2:    Search for statements by nodes.
Chris@2:    @return an iterator to the first match, or NULL if no matches found.
Chris@2: */
Chris@2: SORD_API
Chris@2: SordIter*
Chris@2: sord_search(SordModel*      model,
Chris@2:             const SordNode* s,
Chris@2:             const SordNode* p,
Chris@2:             const SordNode* o,
Chris@2:             const SordNode* g);
Chris@2: /**
Chris@2:    Search for a single node that matches a pattern.
Chris@2:    Exactly one of @p s, @p p, @p o must be NULL.
Chris@2:    This function is mainly useful for predicates that only have one value.
Chris@2:    The returned node must be freed using sord_node_free.
Chris@2:    @return the first matching node, or NULL if no matches are found.
Chris@2: */
Chris@2: SORD_API
Chris@2: SordNode*
Chris@2: sord_get(SordModel*      model,
Chris@2:          const SordNode* s,
Chris@2:          const SordNode* p,
Chris@2:          const SordNode* o,
Chris@2:          const SordNode* g);
Chris@2: 
Chris@2: /**
Chris@2:    Return true iff a statement exists.
Chris@2: */
Chris@2: SORD_API
Chris@2: bool
Chris@2: sord_ask(SordModel*      model,
Chris@2:          const SordNode* s,
Chris@2:          const SordNode* p,
Chris@2:          const SordNode* o,
Chris@2:          const SordNode* g);
Chris@2: 
Chris@2: /**
Chris@2:    Return the number of matching statements.
Chris@2: */
Chris@2: SORD_API
Chris@2: uint64_t
Chris@2: sord_count(SordModel*      model,
Chris@2:            const SordNode* s,
Chris@2:            const SordNode* p,
Chris@2:            const SordNode* o,
Chris@2:            const SordNode* g);
Chris@2: 
Chris@2: /**
Chris@2:    Check if @a model contains a triple pattern.
Chris@2: */
Chris@2: SORD_API
Chris@2: bool
Chris@2: sord_contains(SordModel* model, const SordQuad pat);
Chris@2: 
Chris@2: /**
Chris@2:    Add a quad to a model.
Chris@2: */
Chris@2: SORD_API
Chris@2: bool
Chris@2: sord_add(SordModel* model, const SordQuad quad);
Chris@2: 
Chris@2: /**
Chris@2:    Remove a quad from a model.
Chris@2: 
Chris@2:    Note that is it illegal to remove while iterating over @c model.
Chris@2: */
Chris@2: SORD_API
Chris@2: void
Chris@2: sord_remove(SordModel* model, const SordQuad quad);
Chris@2: 
Chris@2: /**
Chris@2:    @}
Chris@2:    @name Inserter
Chris@2:    @{
Chris@2: */
Chris@2: 
Chris@2: /**
Chris@2:    Create an inserter for writing statements to a model.
Chris@2: */
Chris@2: SORD_API
Chris@2: SordInserter*
Chris@2: sord_inserter_new(SordModel* model,
Chris@2:                   SerdEnv*   env);
Chris@2: 
Chris@2: /**
Chris@2:    Free an inserter.
Chris@2: */
Chris@2: SORD_API
Chris@2: void
Chris@2: sord_inserter_free(SordInserter* inserter);
Chris@2: 
Chris@2: /**
Chris@2:    Set the current base URI for writing to the model.
Chris@2: 
Chris@2:    Note this function can be safely casted to SerdBaseSink.
Chris@2: */
Chris@2: SORD_API
Chris@2: SerdStatus
Chris@2: sord_inserter_set_base_uri(SordInserter*   inserter,
Chris@2:                            const SerdNode* uri);
Chris@2: 
Chris@2: /**
Chris@2:    Set a namespace prefix for writing to the model.
Chris@2: 
Chris@2:    Note this function can be safely casted to SerdPrefixSink.
Chris@2: */
Chris@2: SORD_API
Chris@2: SerdStatus
Chris@2: sord_inserter_set_prefix(SordInserter*   inserter,
Chris@2:                          const SerdNode* name,
Chris@2:                          const SerdNode* uri);
Chris@2: 
Chris@2: /**
Chris@2:    Write a statement to the model.
Chris@2: 
Chris@2:    Note this function can be safely casted to SerdStatementSink.
Chris@2: */
Chris@2: SORD_API
Chris@2: SerdStatus
Chris@2: sord_inserter_write_statement(SordInserter*      inserter,
Chris@2:                               SerdStatementFlags flags,
Chris@2:                               const SerdNode*    graph,
Chris@2:                               const SerdNode*    subject,
Chris@2:                               const SerdNode*    predicate,
Chris@2:                               const SerdNode*    object,
Chris@2:                               const SerdNode*    object_datatype,
Chris@2:                               const SerdNode*    object_lang);
Chris@2: 
Chris@2: /**
Chris@2:    @}
Chris@2:    @name Iteration
Chris@2:    @{
Chris@2: */
Chris@2: 
Chris@2: /**
Chris@2:    Set @c quad to the quad pointed to by @c iter.
Chris@2: */
Chris@2: SORD_API
Chris@2: void
Chris@2: sord_iter_get(const SordIter* iter, SordQuad quad);
Chris@2: 
Chris@2: /**
Chris@2:    Return a field of the quad pointed to by @c iter.
Chris@2: */
Chris@2: SORD_API
Chris@2: const SordNode*
Chris@2: sord_iter_get_node(const SordIter* iter, SordQuadIndex index);
Chris@2: 
Chris@2: /**
Chris@2:    Return the store pointed to by @c iter.
Chris@2: */
Chris@2: SORD_API
Chris@2: const SordModel*
Chris@2: sord_iter_get_model(SordIter* iter);
Chris@2: 
Chris@2: /**
Chris@2:    Increment @c iter to point to the next statement.
Chris@2: */
Chris@2: SORD_API
Chris@2: bool
Chris@2: sord_iter_next(SordIter* iter);
Chris@2: 
Chris@2: /**
Chris@2:    Return true iff @c iter is at the end of its range.
Chris@2: */
Chris@2: SORD_API
Chris@2: bool
Chris@2: sord_iter_end(const SordIter* iter);
Chris@2: 
Chris@2: /**
Chris@2:    Free @c iter.
Chris@2: */
Chris@2: SORD_API
Chris@2: void
Chris@2: sord_iter_free(SordIter* iter);
Chris@2: 
Chris@2: /**
Chris@2:    @}
Chris@2:    @name Utilities
Chris@2:    @{
Chris@2: */
Chris@2: 
Chris@2: /**
Chris@2:    Match two quads (using ID comparison only).
Chris@2: 
Chris@2:    This function is a straightforward and fast equivalence match with wildcard
Chris@2:    support (ID 0 is a wildcard). It does not actually read node data.
Chris@2:    @return true iff @c x and @c y match.
Chris@2: */
Chris@2: SORD_API
Chris@2: bool
Chris@2: sord_quad_match(const SordQuad x, const SordQuad y);
Chris@2: 
Chris@2: /**
Chris@2:    @}
Chris@2:    @name Serialisation
Chris@2:    @{
Chris@2: */
Chris@2: 
Chris@2: /**
Chris@2:    Return a reader that will read into @c model.
Chris@2: */
Chris@2: SORD_API
Chris@2: SerdReader*
Chris@2: sord_new_reader(SordModel* model,
Chris@2:                 SerdEnv*   env,
Chris@2:                 SerdSyntax syntax,
Chris@2:                 SordNode*  graph);
Chris@2: 
Chris@2: /**
Chris@2:    Write a model to a writer.
Chris@2: */
Chris@2: SORD_API
Chris@2: bool
Chris@2: sord_write(SordModel*  model,
Chris@2:            SerdWriter* writer,
Chris@2:            SordNode*   graph);
Chris@2: 
Chris@2: /**
Chris@2:    Write a range to a writer.
Chris@2: 
Chris@2:    This increments @c iter to its end, then frees it.
Chris@2: */
Chris@2: SORD_API
Chris@2: bool
Chris@2: sord_write_iter(SordIter*   iter,
Chris@2:                 SerdWriter* writer);
Chris@2: 
Chris@2: /**
Chris@2:    @}
Chris@2:    @}
Chris@2: */
Chris@2: 
Chris@2: #ifdef __cplusplus
Chris@2: }  /* extern "C" */
Chris@2: #endif
Chris@2: 
Chris@2: #endif  /* SORD_SORD_H */