vt?w!.&66duolc,gro?moc?s&ndnyd,tepym,?ten?ude?vog??a!.&no.&1-&ht&ron-ue.&lru-adbmal,ppabew-refsnart,?uos-&em.&lru-adbmal,ppabew-refsnart,?fa.&lru-adbmal,ppabew-refsnart,?pa.&lru-adbmal,ppabew-refsnart,?ue.&lru-adbmal,ppabew-refsnart,???lartnec-&ac.&lru-adbmal,ppabew-refsnart,?em.ppabew-refsnart,li.ppabew-refsnart,ue.&lru-adbmal,ppabew-refsnart,??ts&ae&-&as.&lru-adbmal,ppabew-refsnart,?pa.&lru-adbmal,ppabew-refsnart,?su.&lru-adbmal,ppabew-refsnart,?vog-su.&ppabew-refsnart,spif-ppabew-refsnart,??h...

github.com/hashicorp/go-uuid v1.0.3/go.mod h1:6SBZvOh/SIDV7/2o3Jml5SYk/TvGqwFJ/bN7x4byOro=
github.com/hashicorp/golang-lru v0.5.0/go.mod h1:/m3WP610KZHVQ1SGc6re/UDhFvYD7pJ4Ao+sR/qLZy8=
github.com/hashicorp/golang-lru v1.0.2 h1:dV3g9Z/unq5DpblPpw+Oqcv4dU/1omnb4Ok8iPY6p1c=
github.com/hashicorp/golang-lru v1.0.2/go.mod h1:iADmTwqILo4mZ8BN3D2Q6+9jd8WM5uGBxy+E8yxSoD4=

   * rate, and ability to be implemented with O(1) time complexity. The initial LRU implementation
   * operates per-segment rather than globally for increased implementation simplicity. We expect
   * the cache hit rate to be similar to that of a global LRU algorithm.
   */

  // Constants

  /**

 *
 * <ul>
 *   <li>automatic loading of entries into the cache
 *   <li>least-recently-used eviction when a maximum size is exceeded (note that the cache is
 *       divided into segments, each of which does LRU internally)
 *   <li>time-based expiration of entries, measured since last access or last write
 *   <li>keys automatically wrapped in {@linkplain WeakReference weak} references

 *
 * <ul>
 *   <li>automatic loading of entries into the cache
 *   <li>least-recently-used eviction when a maximum size is exceeded (note that the cache is
 *       divided into segments, each of which does LRU internally)
 *   <li>time-based expiration of entries, measured since last access or last write
 *   <li>keys automatically wrapped in {@linkplain WeakReference weak} references