java 使用ConcurrentHashMap和计数器实现锁

import java.util.ArrayList;import java.util.HashMap;import java.util.List;import java.util.Map;import java.util.concurrent.ConcurrentHashMap;import java.util.concurrent.atomic.AtomicInteger;public class TestServiceImpl {  private static ConcurrentHashMap<Long, LockObj> lockMap = new ConcurrentHashMap<Long, LockObj>(40);  public void test(Long userId){    LockObj lock = tryLock(userId);    synchronized (lock) {      try{        //处理业务      }      finally{        unLock(lock);      }    }  }  private LockObj tryLock(Long key) {    LockObj curVal = new LockObj(key);    LockObj preVal = lockMap.putIfAbsent(key, curVal);    if (null == preVal) {      curVal.inc();      return curVal;    }    else{      preVal.inc();    }    return preVal;  }  private void unLock(LockObj lock){    if (lock.dec() <= 0){      lockMap.remove(lock.getKey());    }  }  public class LockObj {    private long key = 0;    private AtomicInteger count = new AtomicInteger(0);    public LockObj(long key){      this.key = key;    }    public int inc(){      return count.incrementAndGet();    }    public int dec(){      return count.decrementAndGet();    }    public long getKey(){      return key;    }    @Override    public String toString() {      return "LockObj [key=" + key + ", count=" + count + "]";    }  }}

import com.google.common.collect.Interner;import com.google.common.collect.Interners;public class TestServiceImpl {  Interner<String> pool = Interners.newWeakInterner();  public void test(Long userId) throws OspException {    synchronized ( pool.intern(String.valueOf(userId))){      //处理业务操作    }  }}