Returns a Func〈A〉 that wraps func. The first call to the resulting Func〈A〉 will cache the result. Subsequent calls return the cached item.

Returns a Func〈A, B〉 that wraps func. Each time the resulting Func〈A, B〉 is called with a new value, its result is memoized (cached). Subsequent calls use the memoized value.

Remarks: Thread-safe and memory-leak safe.

Returns a Func〈T, R〉 that wraps func. Each time the resulting Func〈T, R〉 is called with a new value, its result is memoized (cached). Subsequent calls use the memoized value.

Remarks: No mechanism for freeing cached values and therefore can cause a memory leak when holding onto the Func〈T, R〉 reference. Uses a ConcurrentDictionary for the cache and is thread-safe

Enumerable memoization. As an enumerable is enumerated each item is retained in an internal list, so that future evalation of the enumerable isn't done. Only items not seen before are evaluated.

This minimises one of the major problems with the IEnumerable / yield return pattern by causing at-most-once evaluation of each item.

Use the IEnumerable extension method Memo for convenience.

Although this allows efficient lazy evaluation, it does come at a memory cost. Each item is cached internally, so this method doesn't allow for evaluation of infinite sequences.

Returns a Func〈T〉 that wraps func. The first call to the resulting Func〈T〉 will cache the result. Subsequent calls return the cached item.

Returns a Func〈T, R〉 that wraps func. Each time the resulting Func〈T, R〉 is called with a new value, its result is memoized (cached). Subsequent calls use the memoized value.

Remarks: Thread-safe and memory-leak safe.

Returns a Func〈T, R〉 that wraps func. Each time the resulting Func〈T, R〉 is called with a new value, its result is memoized (cached). Subsequent calls use the memoized value.

Remarks: No mechanism for freeing cached values and therefore can cause a memory leak when holding onto the Func〈T, R〉 reference. Uses a ConcurrentDictionary for the cache and is thread-safe

Enumerable memoization. As an enumerable is enumerated each item is retained in an internal list, so that future evaluation of the enumerable isn't done. Only items not seen before are evaluated.

This minimises one of the major problems with the IEnumerable / yield return pattern by causing at-most-once evaluation of each item.

Use the IEnumerable extension method Memo for convenience.

Although this allows efficient lazy evaluation, it does come at a memory cost. Each item is cached internally, so this method doesn't allow for evaluation of infinite sequences.