This article describes the method of java using hashMap cache to save data. Share it for your reference, as follows:
private static final HashMap<Long, XXX> sCache = new HashMap<Long, XXX>();private static int sId = -1;public static void initAlbumArtCache() { try { //. . . if (id != sId) { clearCache(); sId = id; } } catch (RemoteException e) { e.printStackTrace(); }}public static void clearCache() { synchronized(sCache) { sCache.clear(); }}public static XXX getCachedXXX(long Index, BitmapDrawable defaultBitmap) { XXX d = null; synchronized(sCache) { d = sCache.get(Index); } if (d == null) { //. . . synchronized(sArtCache) { // the cache may have changed since we checked XXX value = sCache.get(Index); if (value == null) { sCache.put(Index, d); } else { d = value; } } } return d;}For more information about Java algorithms, readers who are interested in this site can view the topics: "Java Data Structure and Algorithm Tutorial", "Summary of Java Operation DOM Node Tips", "Summary of Java File and Directory Operation Tips" and "Summary of Java Cache Operation Tips"
I hope this article will be helpful to everyone's Java programming.