Run-time Algorithm Specialisation - Data-and-algorithm Specialization

Data-and-algorithm Specialization

There are situations when many instances of are intended for long-term storage and the calls of occur with different in an unpredictable order. For example, we may have to check first, then, then, and so on. In such circumstances, full-scale specialization with compilation may not be suitable due to excessive memory usage. However, we can sometimes find a compact specialized representation for every, that can be stored with, or instead of, . We also define a variant that works on this representation and any call to is replaced by, intended to do the same job faster.