memcacheinterface.java

一宗队列算法

//Source file: E:/工作和学习/工作/硕士论文工作/程序/数据库缓存管理/20040304/src/MemCachePak/MemCacheInterface.java

package MemCachePak;


public interface MemCacheInterface 
{
   
   /**
   @roseuid 417CAC98024A
   */
   public WebObj SearchObj(String InputObjURL);
   
   /**
   @roseuid 417CB07C02C7
   */
   public boolean InsertNewObj(WebObj NewWebObj);
   
   /**
   @roseuid 417CB0EB0269
   */
   public boolean DeleteObj(WebObj CachedObj);
   
   /**
   @roseuid 417DC9BE02FC
   */
   public boolean IsEmpty();
   
   /**
   @roseuid 417EF92F006D
   */
   public WebObj SearchlastObj(String InputObjURL);
   
   /**
   @roseuid 417F4CE0003E
   */
   public void Print();
   
   /**
   @roseuid 418EC22701D4
   */
   public boolean InsertNewVector(int data, String head, String tail, String sourcename);
   
   /**
   @roseuid 418ECA0F038A
   */
   public boolean InsertNewVex(ChartFirstVex aVex, String sourcename);
   
   /**
   @roseuid 419869A40196
   */
   public int GetCacheSize();
   
   /**
   @roseuid 41997E7F03A9
   */
   public WebObj GetMinGPFObj();
   
   /**
   @roseuid 4199C434030D
   */
   public WebObj GetTheFirstObj();
   
   /**
   @roseuid 4199C48B0290
   */
   public ObjChart SearchChartByName(String sourcefilename);
   
   /**
   @roseuid 41A5903C0167
   */
   public WebObj GetCachedObj(String SourceFileName, String CachedFileName);
}