(Bounded) Knapsack problem
Check if an input is numeric, and within a given bound
Lightweight, efficient extension of the interval API
A fast synchronous memory cache forgetting the least recently used entry when the maximal number of entries is reached
An observable where the value is checked against a function and changed only if it's passed
Determine whether a semver range is bounded
normalizes a 2D path to its bounding box
A lightweight abstraction for functions that should only be invoked a limited number of times.