A straightforward implementation of numbered_state_heap with a hash map.
More...
#include <tgbaalgos/gtec/nsheap.hh>
Protected Attributes |
hash_type | h |
| Map of visited states.
|
Detailed Description
A straightforward implementation of numbered_state_heap with a hash map.
Member Typedef Documentation
Constructor & Destructor Documentation
virtual spot::numbered_state_heap_hash_map::~numbered_state_heap_hash_map |
( |
| ) |
|
|
virtual |
Member Function Documentation
virtual state_index spot::numbered_state_heap_hash_map::find |
( |
const state * |
s | ) |
const |
|
virtual |
Is state in the heap?
Returns a pair (0,0) if s is not in the heap. or a pair (p, i) if there is a clone p of s i in the heap with index. If s is in the heap and is different from p it will be freed.
These functions are called by the algorithm to check whether a successor is a new state to explore or an already visited state.
These functions can be redefined to search for more than an equal match. For example we could redefine it to check state inclusion.
Implements spot::numbered_state_heap.
virtual state_index spot::numbered_state_heap_hash_map::index |
( |
const state * |
s | ) |
const |
|
virtual |
Return the index of an existing state.
This is mostly similar to find(), except it will be called for state which we know are already in the heap, or for state which may not be in the heap but for which it is always OK to do equality checks.
Implements spot::numbered_state_heap.
virtual void spot::numbered_state_heap_hash_map::insert |
( |
const state * |
s, |
|
|
int |
index |
|
) |
| |
|
virtual |
virtual int spot::numbered_state_heap_hash_map::size |
( |
| ) |
const |
|
virtual |
Member Data Documentation
hash_type spot::numbered_state_heap_hash_map::h |
|
protected |
The documentation for this class was generated from the following file: