|
|
using | shared_map = brick::hashset::FastConcurrent< my_pair, inner_pair_hasher > |
| |
|
|
| swarmed_gp (kripkecube< State, SuccIterator > &sys, std::function< std::vector< State > *(std::vector< State > &)> interpolate_fun, shared_map &map, unsigned tid, bool &stop) |
| |
|
void | setup () |
| |
|
bool | push (State s, unsigned int dfsnum) |
| |
|
bool | pop (State s) |
| |
|
void | edge (unsigned int, unsigned int) |
| |
|
void | finalize () |
| |
|
unsigned | walltime () |
| |
|
unsigned | inserted () |
| |
|
unsigned | states () |
| |
|
unsigned | edges () |
| |
|
unsigned | how_many_generations () |
| |
|
swarmed_gp< State, SuccIterator, StateHash, StateEqual > & | self () |
| |
|
void | run () |
| |
|
unsigned int | trans () |
| |
|
|
typedef std::unordered_map< const State, int, StateHash, StateEqual > | visited_map |
| |
|
|
kripkecube< State, SuccIterator > & | sys_ |
| |
|
std::vector< todo_element > | todo |
| |
|
visited_map | visited |
| |
|
unsigned int | dfs_number |
| |
|
unsigned int | transitions |
| |
|
unsigned int | tid_ |
| |
|
bool & | stop_ |
| |
The documentation for this class was generated from the following file: