users/html/equivalence__class_8h_source.html

 #ifndef _LIBSAPLING_EQUIVALENCE_CLASS_H_

 #define _LIBSAPLING_EQUIVALENCE_CLASS_H_


 #include "libsapling/dm/graph.h"

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


 void *equivalence_class__data(node_t ref);

 void equivalence_class__insert(node_t *ref, void *info);

 void *equivalence_class__access_representative(node_t *ref);

 void equivalence_class__access_non_representatives(enum qt qt, node_t *ref,

     void *info, predicate_t predicate, apply_t apply);


 #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

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_equivalence_class.h
Typed equivalence class interface implementation.