blocks|key|4838749|text|您可以通过编写一个包装器来实现这一点，例如，为TreeMap编写一个包装器，其中插入时间是关键字。在每次插入时，您可以删除已“超时”的head列表。|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|4838750|但是，使用插入时间来指示是否应该删除in似乎不是一个好主意。例如，使用一些LRU+(最近最少使用的)缓存似乎更好。例如，在诸如EHCache的库中可以很容易地获得这样的高速缓存。：不要重复发明轮子。|4838751|相关问题：|BOLD|4838752|4838753|How+would+you+implement+an+LRU+cache+in+Java?|unordered-list-item|4838754|LRU+LinkedHashMap+that+limits+size+based+on+available+memory|4838755|Easy,+simple+to+use+LRU+cache+in+java|4838756|4838757|entityMap|0|LINK|mutability|MUTABLE|url|http://ehcache.org/|1|https://stackoverflow.com/questions/221525/how-would-you-implement-an-lru-cache-in-java-6|2|https://stackoverflow.com/questions/1646257/lru-linkedhashmap-that-limits-size-based-on-available-memory|3|https://stackoverflow.com/questions/224868/easy-simple-to-use-lru-cache-in-java^0|N|7|0|1R|7|0|0|0|5|0|0|0|19|1|0|0|1O|2|0|0|11|3|0|0^^$0|@$1|2|3|4|5|6|7|17|8|@$9|18|A|19|B|C]]|D|@]|E|$]]|$1|F|3|G|5|6|7|1A|8|@]|D|@$9|1B|A|1C|1|1D]]|E|$]]|$1|H|3|I|5|6|7|1E|8|@$9|1F|A|1G|B|J]]|D|@]|E|$]]|$1|K|3|-4|5|6|7|1H|8|@]|D|@]|E|$]]|$1|L|3|M|5|N|7|1I|8|@]|D|@$9|1J|A|1K|1|1L]]|E|$]]|$1|O|3|P|5|N|7|1M|8|@]|D|@$9|1N|A|1O|1|1P]]|E|$]]|$1|Q|3|R|5|N|7|1Q|8|@]|D|@$9|1R|A|1S|1|1T]]|E|$]]|$1|S|3|-4|5|6|7|1U|8|@]|D|@]|E|$]]|$1|T|3|-4|5|6|7|1V|8|@]|D|@]|E|$]]]|U|$V|$5|W|X|Y|E|$Z|10]]|11|$5|W|X|Y|E|$Z|12]]|13|$5|W|X|Y|E|$Z|14]]|15|$5|W|X|Y|E|$Z|16]]]]

You could implement this by writing a wrapper for, say, a <code>TreeMap</code> where you let the insertion time be the key. On each insert, you could drop the head list which has "timed out".

Using insertion time as an indication on whether or not in should be dropped seems like a bad idea though. It seems better to go with some LRU (least recently used) cache for instance. Such caches are readily available in libraries such as <a href="http://ehcache.org/" rel="nofollow noreferrer">EHCache</a> for instance. Don't reinvent the wheel.

Related questions:

<ul>
<li><a href="https://stackoverflow.com/questions/221525/how-would-you-implement-an-lru-cache-in-java-6">How would you implement an LRU cache in Java?</a></li>
<li><a href="https://stackoverflow.com/questions/1646257/lru-linkedhashmap-that-limits-size-based-on-available-memory">LRU LinkedHashMap that limits size based on available memory</a></li>
<li><a href="https://stackoverflow.com/questions/224868/easy-simple-to-use-lru-cache-in-java">Easy, simple to use LRU cache in java</a></li>
</ul>

blocks|key|1648360|text|是的，Guava支持定时过期的缓存。参见Guava+Explained's+page+on+caches。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|1648361|另一种选择是LRU+(最近最少使用)缓存，它在插入新元素时清除最早访问的元素。|1648362|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/google/guava/wiki/CachesExplained^0|K|W|0|0|0^^$0|@$1|2|3|4|5|6|7|N|8|@]|9|@$A|O|B|P|1|Q]]|C|$]]|$1|D|3|E|5|6|7|R|8|@]|9|@]|C|$]]|$1|F|3|-4|5|6|7|S|8|@]|9|@]|C|$]]]|G|$H|$5|I|J|K|C|$L|M]]]]

Yes, Guava supports a cache with timed expiration. See <a href="https://github.com/google/guava/wiki/CachesExplained" rel="nofollow">Guava Explained's page on caches</a>.

An alternative is an LRU (least-recently used) cache that disposes of the oldest accessed element when a new element is inserted.

blocks|key|802018|text|现在还不清楚你是如何使用这个集合的，但是Guava的CacheBuilder可能会对你有所帮助。|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|802019|entityMap|0|LINK|mutability|MUTABLE|url|http://docs.guava-libraries.googlecode.com/git-history/v11.0.1/javadoc/com/google/common/cache/CacheBuilder.html^0|Q|C|Q|C|0|0^^$0|@$1|2|3|4|5|6|7|N|8|@$9|O|A|P|B|C]]|D|@$9|Q|A|R|1|S]]|E|$]]|$1|F|3|-4|5|6|7|T|8|@]|D|@]|E|$]]]|G|$H|$5|I|J|K|E|$L|M]]]]

It's not really clear how you're trying to use the collection, but Guava's <a href="http://docs.guava-libraries.googlecode.com/git-history/v11.0.1/javadoc/com/google/common/cache/CacheBuilder.html" rel="nofollow"><code>CacheBuilder</code></a> may help you.

blocks|key|802024|text|另一种选择是ExpiringMap|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|802025|Map<String,+User>+users+=+ExpiringMap.builder()
++.expiration(10,+TimeUnit.SECONDS)
++.build();|code-block|syntax|javascript|802026|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/jhalterman/expiringmap^0|6|B|0|0|0^^$0|@$1|2|3|4|5|6|7|Q|8|@]|9|@$A|R|B|S|1|T]]|C|$]]|$1|D|3|E|5|F|7|U|8|@]|9|@]|C|$G|H]]|$1|I|3|-4|5|6|7|V|8|@]|9|@]|C|$]]]|J|$K|$5|L|M|N|C|$O|P]]]]

Another alternative is <a href="https://github.com/jhalterman/expiringmap" rel="nofollow">ExpiringMap</a>:

<pre><code>Map&lt;String, User&gt; users = ExpiringMap.builder()
 .expiration(10, TimeUnit.SECONDS)
 .build();
</code></pre>

Is there some collection implementation supporting expiration of the elements.

For example:

<pre><code>Collection&lt;User&gt; cachedUsers = new ExpirableList&lt;User&gt;(10000);
</code></pre>

where 

<pre><code>public ExpirableList(final long timeout){...}
</code></pre>

And after given time (<code>10000ms</code> in this particular example), added elements will be removed from the collection. By using this, we will prevent overflow of our <code>cachedUsers</code> collection.

Java Collection implementaiton with timeout of the elements

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

是否有一些支持元素过期的集合实现。例如：Collection<User> cachedUsers = new ExpirableList<User>(10000);哪里public ExpirableList(final long timeout){...}在给定的时间之后(本例中为10000ms)，添加的元素将从集合...

问元素超时的Java集合实现
EN

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问元素超时的Java集合实现EN