dejavu
Fast probabilistic symmetry detection.
Loading...
Searching...
No Matches
dejavu::ir::shared_tree Member List

This is the complete list of members for dejavu::ir::shared_tree, including all inherited members.

add_node(int level, limited_save *data, tree_node *parent, bool is_base=false)dejavu::ir::shared_treeinline
clear_leaves()dejavu::ir::shared_treeinline
finish_level(int level)dejavu::ir::shared_treeinline
get_current_level_size()dejavu::ir::shared_treeinline
get_current_level_tracepos()dejavu::ir::shared_treeinline
get_finished_up_to() constdejavu::ir::shared_treeinline
get_level(int level)dejavu::ir::shared_treeinline
get_level_size(int level)dejavu::ir::shared_treeinline
get_node_invariant()dejavu::ir::shared_treeinline
h_bfs_automorphism_pwdejavu::ir::shared_tree
h_bfs_top_level_orbitdejavu::ir::shared_tree
initialize(std::vector< int > &base, ir::limited_save *root)dejavu::ir::shared_treeinline
introspection()dejavu::ir::shared_treeinline
make_node_invariant()dejavu::ir::shared_treeinline
mark_first_level(markset &marks)dejavu::ir::shared_treeinline
pick_node_from_level(const int level, int num)dejavu::ir::shared_treeinline
queue_missing_node(missing_node node)dejavu::ir::shared_treeinline
queue_missing_node_empty()dejavu::ir::shared_treeinline
queue_missing_node_pop()dejavu::ir::shared_treeinline
queue_reserve(const int n)dejavu::ir::shared_treeinline
record_add_invariant(int v, unsigned long inv)dejavu::ir::shared_treeinline
record_invariant(int v, unsigned long inv)dejavu::ir::shared_treeinline
reset(std::vector< int > &new_base, ir::limited_save *root, bool keep_old)dejavu::ir::shared_treeinline
set_finished_up_to(const int new_finished_up_to)dejavu::ir::shared_treeinline
shared_tree(int domain_size)dejavu::ir::shared_treeinlineexplicit
stat_leaves() constdejavu::ir::shared_treeinline
stored_deviationdejavu::ir::shared_tree
stored_leavesdejavu::ir::shared_tree
~shared_tree()dejavu::ir::shared_treeinline