\u5728\u73b0\u4ee3\u670d\u52a1\u5668\u67b6\u6784\u4e2d，\u7f13\u5b58\u533a\u626e\u6f14\u7740\u81f3\u5173\u91cd\u8981\u7684\u89d2\u8272\u3002\u5b83\u80fd\u591f\u663e\u8457\u63d0\u5347\u6570\u636e\u8bbf\u95ee\u901f\u5ea6，\u51cf\u8f7b\u540e\u7aef\u6570\u636e\u5e93\u6216\u670d\u52a1\u7684\u538b\u529b\u3002\u7136\u800c，\u7f13\u5b58\u533a\u5e76\u975e\u4e07\u80fd，\u5982\u679c\u7ba1\u7406\u4e0d\u5f53，\u53ef\u80fd\u4f1a\u5bfc\u81f4\u7f13\u5b58\u6570\u636e\u8fc7\u671f\u3001\u5360\u7528\u8fc7\u591a\u5185\u5b58，\u751a\u81f3\u5f15\u53d1\u6027\u80fd\u95ee\u9898\u3002\u672c\u6587\u5c06\u6df1\u5165\u63a2\u8ba8\u7f13\u5b58\u533a\u4e2d\u8fc7\u671f\u5220\u9664\u7f13\u5b58\u7684\u7b56\u7565\u548c\u5b9e\u73b0\u65b9\u6cd5，\u5e2e\u52a9\u8bfb\u8005\u7406\u89e3\u8fd9\u4e00\u5173\u952e\u673a\u5236\u3002<\/p>\n
\u7f13\u5b58\u533a\u662f\u4e00\u79cd\u4e34\u65f6\u5b58\u50a8\u533a\u57df，\u7528\u4e8e\u5b58\u50a8\u9891\u7e41\u8bbf\u95ee\u7684\u6570\u636e\u3002\u901a\u8fc7\u5c06\u6570\u636e\u7f13\u5b58\u5230\u5185\u5b58\u4e2d，\u53ef\u4ee5\u663e\u8457\u51cf\u5c11\u5bf9\u540e\u7aef\u5b58\u50a8\u7cfb\u7edf\u7684\u8bbf\u95ee\u6b21\u6570，\u4ece\u800c\u63d0\u9ad8\u7cfb\u7edf\u7684\u54cd\u5e94\u901f\u5ea6\u548c\u541e\u5410\u91cf\u3002\u4f8b\u5982，\u5728Web\u670d\u52a1\u5668\u4e2d，\u7f13\u5b58\u533a\u53ef\u4ee5\u5b58\u50a8\u9759\u6001\u8d44\u6e90（\u5982\u56fe\u7247\u3001CSS\u6587\u4ef6\u3001JavaScript\u6587\u4ef6\u7b49），\u4ee5\u4fbf\u5feb\u901f\u54cd\u5e94\u7528\u6237\u7684\u8bf7\u6c42\u3002<\/p>\n
\u5c3d\u7ba1\u7f13\u5b58\u533a\u5e26\u6765\u4e86\u8bf8\u591a\u597d\u5904，\u4f46\u4e5f\u5b58\u5728\u4e00\u4e9b\u6311\u6218：<\/p>\n
\u7f13\u5b58\u6570\u636e\u8fc7\u671f：\u7f13\u5b58\u7684\u6570\u636e\u53ef\u80fd\u4f1a\u968f\u7740\u65f6\u95f4\u7684\u63a8\u79fb\u800c\u53d8\u5f97\u8fc7\u65f6\u3002\u4f8b\u5982，\u5546\u54c1\u4ef7\u683c\u3001\u7528\u6237\u4fe1\u606f\u7b49\u6570\u636e\u53ef\u80fd\u4f1a\u53d1\u751f\u53d8\u5316，\u5982\u679c\u7f13\u5b58\u533a\u4e2d\u7684\u6570\u636e\u672a\u53ca\u65f6\u66f4\u65b0，\u53ef\u80fd\u4f1a\u5bfc\u81f4\u7528\u6237\u83b7\u53d6\u5230\u9519\u8bef\u7684\u4fe1\u606f\u3002<\/p>\n<\/li>\n
\u5185\u5b58\u5360\u7528：\u7f13\u5b58\u533a\u4f1a\u5360\u7528\u670d\u52a1\u5668\u7684\u5185\u5b58\u8d44\u6e90\u3002\u5982\u679c\u7f13\u5b58\u7684\u6570\u636e\u8fc7\u591a，\u53ef\u80fd\u4f1a\u5bfc\u81f4\u5185\u5b58\u4e0d\u8db3，\u5f71\u54cd\u670d\u52a1\u5668\u7684\u6027\u80fd\u3002<\/p>\n<\/li>\n
\u7f13\u5b58\u4e00\u81f4\u6027：\u5728\u5206\u5e03\u5f0f\u7cfb\u7edf\u4e2d，\u591a\u4e2a\u670d\u52a1\u5668\u53ef\u80fd\u7f13\u5b58\u76f8\u540c\u7684\u6570\u636e\u3002\u5982\u679c\u6570\u636e\u66f4\u65b0\u540e，\u7f13\u5b58\u533a\u4e2d\u7684\u6570\u636e\u672a\u80fd\u53ca\u65f6\u540c\u6b65，\u53ef\u80fd\u4f1a\u5bfc\u81f4\u6570\u636e\u4e0d\u4e00\u81f4\u7684\u95ee\u9898\u3002<\/p>\n<\/li>\n<\/ul>\n
\u539f\u7406：\u57fa\u4e8e\u65f6\u95f4\u7684\u8fc7\u671f\u7b56\u7565（Time To Live，TTL）\u662f\u6700\u5e38\u89c1\u7684\u7f13\u5b58\u8fc7\u671f\u7b56\u7565\u3002\u6bcf\u4e2a\u7f13\u5b58\u9879\u5728\u521b\u5efa\u65f6\u90fd\u4f1a\u88ab\u5206\u914d\u4e00\u4e2a\u8fc7\u671f\u65f6\u95f4，\u5f53\u7f13\u5b58\u9879\u7684\u751f\u5b58\u65f6\u95f4\u8d85\u8fc7\u8fd9\u4e2a\u503c\u65f6，\u5b83\u5c06\u88ab\u81ea\u52a8\u5220\u9664\u3002<\/p>\n
\u5b9e\u73b0\u65b9\u6cd5：<\/p>\n
\u8bbe\u7f6e\u8fc7\u671f\u65f6\u95f4：\u5728\u7f13\u5b58\u9879\u521b\u5efa\u65f6，\u8bbe\u7f6e\u4e00\u4e2a\u8fc7\u671f\u65f6\u95f4\u6233\u3002<\/p>\n<\/li>\n
\u68c0\u67e5\u8fc7\u671f：\u5728\u6bcf\u6b21\u8bbf\u95ee\u7f13\u5b58\u9879\u65f6，\u68c0\u67e5\u5f53\u524d\u65f6\u95f4\u662f\u5426\u8d85\u8fc7\u8fc7\u671f\u65f6\u95f4\u6233\u3002\u5982\u679c\u8d85\u8fc7，\u5219\u5220\u9664\u8be5\u7f13\u5b58\u9879\u3002<\/p>\n<\/li>\n<\/ul>\n
\u793a\u4f8b\u4ee3\u7801（C++）：<\/p>\n
#include <iostream>
\n#include <unordered_map>
\n#include <chrono><\/p>\n
using namespace std;<\/p>\n
class Cache {
\nprivate:
\n unordered_map<string, pair<string, chrono::steady_clock::time_point>> cache;<\/p>\n
public:
\n void set(const string& key, const string& value, int ttl) {
\n auto now = chrono::steady_clock::now();
\n cache[key] = make_pair(value, now + chrono::seconds(ttl));
\n }<\/p>\n
string get(const string& key) {
\n auto now = chrono::steady_clock::now();
\n if (cache.find(key) != cache.end() && cache[key].second > now) {
\n return cache[key].first;
\n } else {
\n cache.erase(key);
\n return "Cache expired or not found";
\n }
\n }
\n};<\/p>\n
int main() {
\n Cache cache;
\n cache.set("key1", "value1", 5); \/\/ \u8bbe\u7f6e\u7f13\u5b58，TTL\u4e3a5\u79d2
\n cout << cache.get("key1") << endl; \/\/ \u8f93\u51fa：value1
\n this_thread::sleep_for(chrono::seconds(6));
\n cout << cache.get("key1") << endl; \/\/ \u8f93\u51fa：Cache expired or not found
\n return 0;
\n} <\/p>\n
\u539f\u7406：\u57fa\u4e8e\u8bbf\u95ee\u9891\u7387\u7684\u8fc7\u671f\u7b56\u7565（Least Frequently Used，LFU）\u4f1a\u5220\u9664\u8bbf\u95ee\u9891\u7387\u6700\u4f4e\u7684\u7f13\u5b58\u9879\u3002\u8fd9\u79cd\u7b56\u7565\u9002\u7528\u4e8e\u7f13\u5b58\u533a\u4e2d\u5b58\u5728\u5927\u91cf\u4e0d\u5e38\u8bbf\u95ee\u7684\u6570\u636e\u7684\u60c5\u51b5\u3002<\/p>\n
\u5b9e\u73b0\u65b9\u6cd5：<\/p>\n
\u8bb0\u5f55\u8bbf\u95ee\u9891\u7387：\u4e3a\u6bcf\u4e2a\u7f13\u5b58\u9879\u8bb0\u5f55\u5176\u8bbf\u95ee\u6b21\u6570\u3002<\/p>\n<\/li>\n
\u5220\u9664\u7b56\u7565：\u5f53\u7f13\u5b58\u533a\u6ee1\u65f6，\u5220\u9664\u8bbf\u95ee\u9891\u7387\u6700\u4f4e\u7684\u7f13\u5b58\u9879\u3002<\/p>\n<\/li>\n<\/ul>\n
\u793a\u4f8b\u4ee3\u7801（C++）：<\/p>\n
#include <iostream>
\n#include <unordered_map>
\n#include <list>
\n#include <algorithm><\/p>\n
using namespace std;<\/p>\n
class LFUCache {
\nprivate:
\n unordered_map<string, pair<string, int>> cache;
\n unordered_map<string, list<int>::iterator> freq_map;
\n list<int> freq_list;<\/p>\n
public:
\n void set(const string& key, const string& value, int freq) {
\n if (cache.find(key) != cache.end()) {
\n freq_map[key]++;
\n } else {
\n cache[key] = make_pair(value, freq);
\n freq_map[key] = freq_list.begin();
\n }
\n }<\/p>\n
string get(const string& key) {
\n if (cache.find(key) != cache.end()) {
\n freq_map[key]++;
\n return cache[key].first;
\n } else {
\n return "Cache not found";
\n }
\n }
\n};<\/p>\n
int main() {
\n LFUCache cache;
\n cache.set("key1", "value1", 1);
\n cache.set("key2", "value2", 1);
\n cout << cache.get("key1") << endl; \/\/ \u8f93\u51fa：value1
\n cache.set("key3", "value3", 1);
\n cout << cache.get("key2") << endl; \/\/ \u8f93\u51fa：Cache not found
\n return 0;
\n} <\/p>\n
\u539f\u7406：\u57fa\u4e8e\u6700\u8fd1\u6700\u5c11\u4f7f\u7528\u7684\u8fc7\u671f\u7b56\u7565（Least Recently Used，LRU）\u4f1a\u5220\u9664\u6700\u8fd1\u6700\u5c11\u4f7f\u7528\u7684\u7f13\u5b58\u9879\u3002\u8fd9\u79cd\u7b56\u7565\u9002\u7528\u4e8e\u7f13\u5b58\u533a\u4e2d\u5b58\u5728\u5927\u91cf\u957f\u65f6\u95f4\u672a\u88ab\u8bbf\u95ee\u7684\u6570\u636e\u7684\u60c5\u51b5\u3002<\/p>\n
\u5b9e\u73b0\u65b9\u6cd5：<\/p>\n
\u8bb0\u5f55\u8bbf\u95ee\u65f6\u95f4：\u4e3a\u6bcf\u4e2a\u7f13\u5b58\u9879\u8bb0\u5f55\u5176\u6700\u8fd1\u4e00\u6b21\u88ab\u8bbf\u95ee\u7684\u65f6\u95f4\u3002<\/p>\n<\/li>\n
\u5220\u9664\u7b56\u7565：\u5f53\u7f13\u5b58\u533a\u6ee1\u65f6，\u5220\u9664\u6700\u8fd1\u6700\u5c11\u4f7f\u7528\u7684\u7f13\u5b58\u9879\u3002<\/p>\n<\/li>\n<\/ul>\n
\u793a\u4f8b\u4ee3\u7801（C++）：<\/p>\n
#include <iostream>
\n#include <unordered_map>
\n#include <list>
\n#include <algorithm><\/p>\n
using namespace std;<\/p>\n
class LRUCache {
\nprivate:
\n unordered_map<string, pair<string, chrono::steady_clock::time_point>> cache;
\n list<string> lru_list;<\/p>\n
public:
\n void set(const string& key, const string& value) {
\n if (cache.find(key) != cache.end()) {
\n lru_list.erase(find(lru_list.begin(), lru_list.end(), key));
\n } else {
\n if (lru_list.size() >= max_size) {
\n string oldest_key = lru_list.back();
\n lru_list.pop_back();
\n cache.erase(oldest_key);
\n }
\n }
\n lru_list.push_front(key);
\n cache[key] = make_pair(value, chrono::steady_clock::now());
\n }<\/p>\n
string get(const string& key) {
\n if (cache.find(key) != cache.end()) {
\n lru_list.erase(find(lru_list.begin(), lru_list.end(), key));
\n lru_list.push_front(key);
\n return cache[key].first;
\n } else {
\n return "Cache not found";
\n }
\n }
\n};<\/p>\n
int main() {
\n LRUCache cache;
\n cache.set("key1", "value1");
\n cache.set("key2", "value2");
\n cout << cache.get("key1") << endl; \/\/ \u8f93\u51fa：value1
\n cache.set("key3", "value3");
\n cout << cache.get("key2") << endl; \/\/ \u8f93\u51fa：Cache not found
\n return 0;
\n} <\/p>\n
\u7b80\u4ecb：Boost.Interprocess \u662f\u4e00\u4e2a\u7528\u4e8e\u7ba1\u7406\u5171\u4eab\u5185\u5b58\u3001\u6587\u4ef6\u6620\u5c04\u548c\u8fdb\u7a0b\u95f4\u901a\u4fe1\u7684\u5e93\u3002\u5b83\u63d0\u4f9b\u4e86\u9ad8\u6548\u7684\u7f13\u5b58\u7ba1\u7406\u529f\u80fd，\u652f\u6301\u591a\u79cd\u7f13\u5b58\u8fc7\u671f\u7b56\u7565\u3002<\/p>\n
\u7279\u70b9：<\/p>\n
\u652f\u6301\u591a\u79cd\u7f13\u5b58\u8fc7\u671f\u7b56\u7565（TTL\u3001LRU\u3001LFU）\u3002<\/p>\n<\/li>\n
\u63d0\u4f9b\u7ebf\u7a0b\u5b89\u5168\u7684\u7f13\u5b58\u7ba1\u7406\u3002<\/p>\n<\/li>\n
\u652f\u6301\u8de8\u8fdb\u7a0b\u5171\u4eab\u7f13\u5b58\u3002<\/p>\n<\/li>\n<\/ul>\n
\u793a\u4f8b\u4ee3\u7801：<\/p>\n
#include <boost\/interprocess\/shared_memory_object.hpp>
\n#include <boost\/interprocess\/mapped_region.hpp>
\n#include <iostream><\/p>\n
using namespace boost::interprocess;<\/p>\n
int main() {
\n \/\/ \u521b\u5efa\u5171\u4eab\u5185\u5b58\u5bf9\u8c61
\n shared_memory_object shm(create_only, "MySharedMemory", read_write);
\n shm.truncate(1024);<\/p>\n
\/\/ \u6620\u5c04\u5171\u4eab\u5185\u5b58
\n mapped_region region(shm, read_write);<\/p>\n
\/\/ \u4f7f\u7528\u5171\u4eab\u5185\u5b58
\n char* data = static_cast<char*>(region.get_address());
\n strcpy(data, "Hello, World!");<\/p>\n
return 0;
\n} <\/p>\n
\u7b80\u4ecb：Folly \u662f Facebook \u5f00\u6e90\u7684\u4e00\u5957 C++ \u5e93，\u5305\u542b\u4e86\u8bb8\u591a\u9ad8\u6548\u7684\u5de5\u5177\u548c\u7ec4\u4ef6\u3002\u5176\u4e2d\u7684 folly::Cache \u63d0\u4f9b\u4e86\u9ad8\u6027\u80fd\u7684\u7f13\u5b58\u7ba1\u7406\u529f\u80fd\u3002<\/p>\n
\u7279\u70b9：<\/p>\n
\u652f\u6301\u591a\u79cd\u7f13\u5b58\u8fc7\u671f\u7b56\u7565（TTL\u3001LRU\u3001LFU）\u3002<\/p>\n<\/li>\n
\u63d0\u4f9b\u7ebf\u7a0b\u5b89\u5168\u7684\u7f13\u5b58\u7ba1\u7406\u3002<\/p>\n<\/li>\n
\u652f\u6301\u9ad8\u6548\u7684\u5185\u5b58\u7ba1\u7406\u3002<\/p>\n<\/li>\n<\/ul>\n
\u793a\u4f8b\u4ee3\u7801：<\/p>\n
#include <folly\/CachedIO.h>
\n#include <folly\/Singleton.h>
\n#include <folly\/ThreadLocal.h>
\n#include <iostream><\/p>\n
using namespace folly;<\/p>\n
int main() {
\n \/\/ \u521b\u5efa\u7f13\u5b58
\n CachedIO cache;<\/p>\n
\/\/ \u8bbe\u7f6e\u7f13\u5b58
\n cache.set("key1", "value1");<\/p>\n
\/\/ \u83b7\u53d6\u7f13\u5b58
\n string value = cache.get("key1");
\n cout << value << endl; \/\/ \u8f93\u51fa：value1<\/p>\n
return 0;
\n} <\/p>\n
\u7f13\u5b58\u533a\u662f\u670d\u52a1\u5668\u67b6\u6784\u4e2d\u4e0d\u53ef\u6216\u7f3a\u7684\u4e00\u90e8\u5206，\u4f46\u7ba1\u7406\u4e0d\u5f53\u53ef\u80fd\u4f1a\u5bfc\u81f4\u6027\u80fd\u95ee\u9898\u3002\u901a\u8fc7\u8bbe\u7f6e\u5408\u7406\u7684\u8fc7\u671f\u5220\u9664\u89c4\u5219，\u53ef\u4ee5\u786e\u4fdd\u7f13\u5b58\u533a\u4e2d\u7684\u6570\u636e\u59cb\u7ec8\u662f\u6700\u65b0\u7684，\u540c\u65f6\u907f\u514d\u5185\u5b58\u5360\u7528\u8fc7\u591a\u3002\u672c\u6587\u4ecb\u7ecd\u4e86\u51e0\u79cd\u5e38\u89c1\u7684\u7f13\u5b58\u8fc7\u671f\u5220\u9664\u7b56\u7565（TTL\u3001LRU\u3001LFU），\u5e76\u63d0\u4f9b\u4e86\u76f8\u5e94\u7684\u5b9e\u73b0\u65b9\u6cd5\u548c\u793a\u4f8b\u4ee3\u7801\u3002\u5e0c\u671b\u8bfb\u8005\u80fd\u591f\u901a\u8fc7\u672c\u6587\u638c\u63e1\u7f13\u5b58\u533a\u7ba1\u7406\u7684\u5173\u952e\u601d\u8def，\u5e76\u5728\u5b9e\u9645\u5e94\u7528\u4e2d\u52a0\u4ee5\u8fd0\u7528\u3002<\/p>\n","protected":false},"excerpt":{"rendered":"
\u6587\u7ae0\u6d4f\u89c8\u9605\u8bfb1k\u6b21\uff0c\u70b9\u8d5e28\u6b21\uff0c\u6536\u85cf6\u6b21\u3002\u7f13\u5b58\u533a\u662f\u670d\u52a1\u5668\u67b6\u6784\u4e2d\u4e0d\u53ef\u6216\u7f3a\u7684\u4e00\u90e8\u5206\uff0c\u4f46\u7ba1\u7406\u4e0d\u5f53\u53ef\u80fd\u4f1a\u5bfc\u81f4\u6027\u80fd\u95ee\u9898\u3002\u901a\u8fc7\u8bbe\u7f6e\u5408\u7406\u7684\u8fc7\u671f\u5220\u9664\u89c4\u5219\uff0c\u53ef\u4ee5\u786e\u4fdd\u7f13\u5b58\u533a\u4e2d\u7684\u6570\u636e\u59cb\u7ec8\u662f\u6700\u65b0\u7684\uff0c\u540c\u65f6\u907f\u514d\u5185\u5b58\u5360\u7528\u8fc7\u591a\u3002\u672c\u6587\u4ecb\u7ecd\u4e86\u51e0\u79cd\u5e38\u89c1\u7684\u7f13\u5b58\u8fc7\u671f\u5220\u9664\u7b56\u7565\uff08TTL\u3001LRU\u3001LFU\uff09\uff0c\u5e76\u63d0\u4f9b\u4e86\u76f8\u5e94\u7684\u5b9e\u73b0\u65b9\u6cd5\u548c\u793a\u4f8b\u4ee3\u7801\u3002\u5e0c\u671b\u8bfb\u8005\u80fd\u591f\u901a\u8fc7\u672c\u6587\u638c\u63e1\u7f13\u5b58\u533a\u7ba1\u7406\u7684\u5173\u952e\u601d\u8def\uff0c\u5e76\u5728\u5b9e\u9645\u5e94\u7528\u4e2d\u52a0\u4ee5\u8fd0\u7528\u3002_\u7f13\u5b58\u8fc7\u671f\u65f6\u95f4\u5220\u9664\u539f\u7406<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[55,397,43,398,396],"topic":[],"class_list":{"0":"post-9966","1":"post","2":"type-post","3":"status-publish","4":"format-standard","5":"hentry","6":"category-server","7":"tag-c","9":"tag-43","10":"tag-398","11":"tag-396"},"yoast_head":"\n