网站大量收购独家精品文档,联系QQ:2885784924

java的基本知识和操作(Basic knowledge and operation of Java).doc

java的基本知识和操作(Basic knowledge and operation of Java).doc

  1. 1、本文档共4页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
java的基本知识和操作(Basic knowledge and operation of Java)

java的基本知识和操作(Basic knowledge and operation of Java) Java simple LRU cache implementation (development skills) Granville said: The relationship between the cache and the APP application, like Ximen Qing and color, simply cannot do without, and the most important position, so they want to become white Laoniao, treat affection need further cache, the following article introduced you to Java if LRU (Least Recently Used) algorithm, that is the most near the least used this algorithm. The algorithm is used for image development in the Android, the content of the cache, in my Android technology course (below) is explained all the implementation of LRU, interested friends can login button Ding school learning. background LinkedHashMap inherited from HashMap, the internal removeEldestEntry provides a method, the method is the key to the realization of LRU strategy, and HashMap specifically for the LinkedHashMap provides 3 special callback method, afterNodeAccess, afterNodeInsertion, afterNodeRemoval, the 3 methods of the literal meaning is very easy to understand, after the node access node is inserted, after deleting node execution behavior. Based on the above behavior, LinkedHashMap can implement a LRUCache function. About LinkedHashMap eldest:eldest literally means the old, there is a field called accessOrder LinkedHashMap, when accessOrder true said internal node LinkedHashMap according to the number of visits to sort, the oldest is the access node minimum nodes. When accessOrder is false, the LinkedHashMap internal node is sorted in the insert order, and the oldest node is the earliest inserted node, which defaults to false. Realization LRUCache to achieve their own, simply cover removeEldestEntry this method can be, the code follows Private, static, class, LRUCacheK, V, extends, LinkedHashMapK, V { Private, static, final, long, serialVersionUID = -9111855653176630846L; Private static int MAX_ELEMENTS; Public LRUCache (int, initCap, int, maxSize) throws IllegalArgumentE

文档评论(0)

f8r9t5c + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

版权声明书
用户编号:8000054077000003

1亿VIP精品文档

相关文档