users/html/trie_8h_source.html

 #ifndef _LIBSAPLING_TRIE_H_

 #define _LIBSAPLING_TRIE_H_


 #include "libsapling/dm/graph.h"

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


 void *trie__data(const node_t node);

 void trie__access(enum qt qt, node_t *ref, const char *key, void *info,

     predicate_t predicate, apply_t apply);

 void trie__insert(node_t *ref, const char *key, void *info);

 void trie__delete(node_t *ref, const char *key);

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

 int trie__length(const node_t *ref);


 #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

typed_trie.h
Typed trie interface implementation.