Any improvements to the OrderedSet container will have a massive impact on the throughput as the OrderedSet::insert method is the hottest code path in the entire program, likely from the closure calls in state generation. Initially, my ideas to improve this are to remove the redundant hashing of the ordered set, instead replacing the map with a hasher that just takes a value, as the hash is generated on insert.
Any improvements to the
OrderedSetcontainer will have a massive impact on the throughput as theOrderedSet::insertmethod is the hottest code path in the entire program, likely from theclosurecalls in state generation. Initially, my ideas to improve this are to remove the redundant hashing of the ordered set, instead replacing the map with a hasher that just takes a value, as the hash is generated on insert.