knownBounded

A strategy to use only if the set of log aggregation keys is known to be a strictly bounded set of instances with singleton semantics.

WARNING: When using this strategy, keys passed to <> are used as-is by the log aggregation code, and held indefinitely by internal static data structures. As such it is vital that key instances used with this strategy have singleton semantics (i.e. if k1.equals(k2) then k1 == k2). Failure to adhere to this requirement is likely to result in hard to detect memory leaks.

If keys do not have singleton semantics then you should use a different strategy, such as byHashCode or byClass.