ltlsynt: more deterministic behavior
Zielonka algorithm used to iterate over an std::unordered_set, thus producing different strategies depending on compiler... * spot/misc/game.cc: replace std::unordered_set with std::set
This commit is contained in:
parent
653deaa934
commit
9489a65bc6
1 changed files with 1 additions and 1 deletions
|
|
@ -92,7 +92,7 @@ parity_game::attractor(const region_t& subgame, region_t& set,
|
|||
unsigned max_parity, int p, bool attr_max) const
|
||||
{
|
||||
strategy_t strategy;
|
||||
std::unordered_set<unsigned> complement = subgame;
|
||||
std::set<unsigned> complement(subgame.begin(), subgame.end());
|
||||
for (unsigned s: set)
|
||||
complement.erase(s);
|
||||
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue