将ReadWriteLock应用到缓存设计中

最新推荐文章于 2025-01-14 08:15:00 发布

最新推荐文章于 2025-01-14 08:15:00 发布 · 90 阅读

文章标签：

#Cache #Java

java 学习笔记专栏收录该内容

56 篇文章

订阅专栏

本文介绍了一个名为PerpetualCache的缓存实现类。该类使用HashMap存储对象，并通过ReentrantReadWriteLock提供读写锁机制，确保并发访问的安全。文章详细展示了如何创建PerpetualCache实例、获取其ID、测量大小、存放与检索对象、清除内容等操作。

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

基础类：

package org.zzuli.xmsb.util.cache;


import java.util.HashMap;
import java.util.Map;
import java.util.concurrent.locks.ReadWriteLock;
import java.util.concurrent.locks.ReentrantReadWriteLock;

public class PerpetualCache implements Cache {

  private String id;

  private Map<Object, Object> cache = new HashMap<Object, Object>();

  private ReadWriteLock readWriteLock = new ReentrantReadWriteLock();

  public PerpetualCache(String id) {
    this.id = id;
  }

  public String getId() {
    return id;
  }

  public int getSize() {
    return cache.size();
  }

  public void putObject(Object key, Object value) {
    cache.put(key, value);
  }

  public Object getObject(Object key) {
    return cache.get(key);
  }

  public Object removeObject(Object key) {
    return cache.remove(key);
  }

  public void clear() {
    cache.clear();
  }

  public ReadWriteLock getReadWriteLock() {
    return readWriteLock;
  }

  public boolean equals(Object o) {
    if (getId() == null) throw new CacheException("Cache instances require an ID.");
    if (this == o) return true;
    if (!(o instanceof Cache)) return false;

    Cache otherCache = (Cache) o;
    return getId().equals(otherCache.getId());
  }

  public int hashCode() {
    if (getId() == null) throw new CacheException("Cache instances require an ID.");
    return getId().hashCode();
  }

}