Replace the fibonacci heap with a d-ary heap. The former is an in-place data structure that's backed by a vector, and thus has great CPU caching behavior. This makes it perform better than a fibonacci heap despite worse algorithmic complexity.
…ApplicationPool2 for post lock actions The Boost version does not allocate memory in its default constructor.
…nordered_map implementation. Fixes issue #970
… being detected properly