可实现缓存的一个JS类-优快云博客

本文链接：https://blog.youkuaiyun.com/iteye_4939/article/details/81883753

本文介绍了一个简单的缓存机制实现方式，使用JavaScript编写。该机制能够为不同的标识符创建缓存实例，并在达到预设数量时移除最早创建的缓存以保持内存占用稳定。文章通过一个迭代过程展示了如何动态调整缓存的最大容量。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

测试通过

var adder = function(n){
	var t = 10;
	var org = n+"-"+Math.random();
	return{ 
		getinfo:function(){
			document.writeln("\n\t"+org);
			return n+t;
		  }
	   };
 };

var CachedSearchBox = (function(){
	var cache = {},count = [],totalCount = 20;
	
	return {
		attachSearchBox:function(dsid){
		  if(dsid in cache){
			 print("old:::"+cache[dsid].getinfo());
			return cache[dsid];
		}
		var fsb = new adder(dsid);
		print("new::::"+fsb.getinfo());
		cache[dsid] = fsb;
		if(count.length>=totalCount){		    
			var out = count.shift();
			print("del::::::::::::"+out.getinfo())
			delete cache[out];
		}
		count.push(fsb);
		return fsb;
	  },
	   clearSearchBox:function(dsid){
		if(dsid in cache){
			//cache[dsid].clearSelection();
			delete cache[dsid];
			count.shift();
		}
	  },
	  getcount:function(){//获取对象的长度
	    print("array length:"+count.length);
		return count.length;
	  },
	  setTotalCount:function(c){//设置缓存大小
		totalCount = c;
	  }
};
})();

CachedSearchBox.getcount();
print("<br>");

(function(){
   for(var i=0;i<100;i++){
     CachedSearchBox.attachSearchBox(Math.ceil(Math.random()*120))
	  print("~~~~~");
	  CachedSearchBox.getcount();
      print("<br>");
	  if(i==30)
		CachedSearchBox.setTotalCount(40);
   }
})();

function print(a1){
	document.writeln(a1+"\n\t");
}