Module caching 

The cache of subproblems used by DL8.5.

Trie identifies a subproblem by the sorted itemset of its path. CoverMap identifies it by its depth and instances.

Structs

CacheEntry

What the search knows about one subproblem.

CacheKey

Position of an entry in the cache.

CoverMap

A Caching implementation keyed by the depth and the instances of a subproblem: paths reaching the same instances at the same depth share one entry.

SearchPath

The set of items on the path from the root to the current node, kept sorted.

Trie

A Caching implementation as a trie of items stored in an arena.

Enums

Index

Result of a cache insertion.

Constants

EXACT

The upper_bound of a subproblem solved independently of any bound, such as a leaf at the maximum depth or a depth-2 tree.

Traits

Caching

A cache of subproblems. Lookups take the sorted itemset of the path and cover, positioned on the instances of that path.