check_individualizations(ir::limited_save &root_save) | dejavu::search_strategy::inprocessor | inline |
h_splits_hint | dejavu::search_strategy::inprocessor | |
hash | dejavu::search_strategy::inprocessor | |
inproc_can_individualize | dejavu::search_strategy::inprocessor | |
inproc_fixed_points | dejavu::search_strategy::inprocessor | |
inproc_maybe_individualize | dejavu::search_strategy::inprocessor | |
inprocess(sgraph *g, ir::shared_tree &tree, groups::compressed_schreier &group, ir::controller &local_state, ir::limited_save &root_save, int, bool use_bfs_inprocess, bool use_shallow_inprocess, bool use_shallow_quadratic_inprocess, groups::orbit &orbit_partition) | dejavu::search_strategy::inprocessor | inline |
nodes | dejavu::search_strategy::inprocessor | |
s_grp_sz | dejavu::search_strategy::inprocessor | |
set_splits_hint(int splits_hint) | dejavu::search_strategy::inprocessor | inline |
shallow_bfs_invariant(sgraph *g, ir::controller &local_state, worklist_t< unsigned long > &inv, groups::orbit &orbit_partition, int depth=8, bool lower_depth=true) | dejavu::search_strategy::inprocessor | inlinestatic |
shallow_bfs_invariant2(sgraph *g, ir::controller &local_state, worklist_t< unsigned long > &inv) | dejavu::search_strategy::inprocessor | inlinestatic |
sort_nodes_map(std::vector< unsigned long > *map, int *colmap) | dejavu::search_strategy::inprocessor | inline |
sort_nodes_map(unsigned long *map, int *colmap) | dejavu::search_strategy::inprocessor | inline |
split_with_invariant(sgraph *g, ir::controller &local_state, worklist_t< unsigned long > &inv) | dejavu::search_strategy::inprocessor | inline |