<rss xmlns:atom="http://www.w3.org/2005/Atom" version="2.0">
    <channel>
        <title>LRU-Catch - 标签 - Ting</title>
        <link>https://example.com/tags/lru-catch/</link>
        <description>LRU-Catch - 标签 - Ting</description>
        <generator>Hugo -- gohugo.io</generator><language>zh-CN</language><managingEditor>vlicecream520@gmail.com (Ting)</managingEditor>
            <webMaster>vlicecream520@gmail.com (Ting)</webMaster><copyright>This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.</copyright><lastBuildDate>Tue, 07 Mar 2023 14:21:59 &#43;0800</lastBuildDate><atom:link href="https://example.com/tags/lru-catch/" rel="self" type="application/rss+xml" /><item>
    <title>LRU-Catch</title>
    <link>https://example.com/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84-lru-catch/</link>
    <pubDate>Tue, 07 Mar 2023 14:21:59 &#43;0800</pubDate>
    <author>Ame</author>
    <guid>https://example.com/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84-lru-catch/</guid>
    <description><![CDATA[LRU Catch 什么是LRU Catch LRU是最近最少使用策略的缩写，是根据数据的历史访问记录来进行淘汰数据，其核心思想是“如果数据最近被访问过，那么将来被访问]]></description>
</item>
</channel>
</rss>
