Manual

Resource management

Limited resources shared by many coroutines: pools and bounded caches.

Introduction#

Pool lends a limited number of objects — database connections, say — to coroutines that each borrow one, use it, and give it back. LruCache bounds an in-memory cache by size, evicting the least recently used entry first. Both exist because a coroutine that opens a new connection per unit of work defeats the point of running many of them in one process: share what is expensive to create.

Concepts#

• Caching: memoization – A cache of a pure function can be shared by every request, if it is bounded.

Examples#

• All examples of this topic – 2 with their output.

Reference#

• LruCache – A bounded in-memory cache that forgets the least recently used entries first.
• Pool – A pool of interchangeable resources, of which only so many may exist at once.