users/html/path_8h_source.html

 #ifndef _LIBSAPLING_PATH_H_

 #define _LIBSAPLING_PATH_H_


 #include "libsapling/dm/graph.h"

 #include "libsapling/dm/typed/typed_path.h"


 void *path__data(const node_t node);

 void path__access(enum qt qt, node_t *ref, void *info, predicate_t predicate,

     apply_t apply);

 void path__insert(node_t *ref, void *info, predicate_t predicate);

 void path__delete(enum qt qt, node_t *ref, void *info, predicate_t predicate);

 void path__print(FILE *stream, node_t *ref, fpfdata_t fpfdata);

 void path__dump_dot(FILE *stream, node_t *ref, fpfdata_t fpfdata);

 int path__length(const node_t *ref);


 node_t *path__position(node_t *ref, int pos);


 #endif

graph.h
Graph implementation.

apply_t
void(* apply_t)(node_t *ref, const struct info_stack *info)
Performs a user-defined operation on the node.
Definition: graph.h:117

fpfdata_t
void(* fpfdata_t)(FILE *stream, const void *data)
File print format data function prototype.
Definition: graph.h:152

predicate_t
int(* predicate_t)(const node_t *ref, const struct info_stack *info)
Decides whether to run the apply function on an item. Behavior is modified by quantifiers.
Definition: graph.h:112

qt
qt
Quantifier definitions.
Definition: logic.h:10

path__position
node_t * path__position(node_t *ref, int pos)
Returns the subpath skipping pos nodes.

typed_path.h
Typed path interface implementation.