Create an element in the cache. This is O(num_items_in_cache), sacrificing some speed in the name of better cache efficiency. However there aren't any really good algorithms for priority queues where most priorities change every iteration this that I'm aware of.
source not stored for this graph (policy: none)
nothing calls this directly
no test coverage detected