vedadux / nanoqbf

A minimal implementation of an expansion-based QBF solver which does not use recursion.
GNU General Public License v3.0
0 stars 1 forks source link

Refactor Formula::getGlobalPosition #1

Open vedadux opened 6 years ago

vedadux commented 6 years ago

This function is horrible for the locality of the data and causes the most cache misses, as it is used in the tight variable replacement loops. A much better way of doing this is first renaming the variables so that their local and global position can be decided directly by the name/index. Something similar was done in Ijtihad.