/* * Copyright (C) 2005-2009 Alfresco Software Limited. * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * as published by the Free Software Foundation; either version 2 * of the License, or (at your option) any later version. * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. * As a special exception to the terms and conditions of version 2.0 of * the GPL, you may redistribute this Program in connection with Free/Libre * and Open Source Software ("FLOSS") applications as described in Alfresco's * FLOSS exception. You should have recieved a copy of the text describing * the FLOSS exception, and it is also available here: * http://www.alfresco.com/legal/licensing" */ package org.alfresco.repo.cache.lookup; import java.io.Serializable; import org.alfresco.repo.cache.SimpleCache; import org.alfresco.util.Pair; /** * A cache for two-way lookups of database entities. These are characterized by having a unique * key (perhaps a database ID) and a separate unique key that identifies the object. *

* The keys must have good equals and hashCode implementations and * must respect the case-sensitivity of the use-case. * * @author Derek Hulley * @since 3.3 */ public class EntityLookupCache { private static final String NULL_VALUE = "@@NULL_VALUE@@"; private final SimpleCache cache; private final EntityLookup entityLookup; @SuppressWarnings("unchecked") public EntityLookupCache(SimpleCache cache, EntityLookup entityLookup) { this.cache = cache; this.entityLookup = entityLookup; } /** * Interface to support lookups of the entities using keys and values. */ public static interface EntityLookup { /** * Resolve the given value into a unique value key that can be used to find the entity's ID. *

* Implementations will often return the value itself, provided that the value is both * serializable and has a good equals and hashCode. * * @param value the full value being keyed * @return Returns the business key representing the entity */ VK1 getValueKey(V1 value); /** * Find an entity for a given key. * * @param key the key (ID) used to identify the entity * @return Return the entity or null if no entity is exists for the ID */ Pair findByKey(K1 key); /** * Find and entity using the given value key. The equals and hashCode * methods of the value object should respect case-sensitivity in the same way that this * lookup treats case-sensitivity i.e. if the equals method is case-sensitive * then this method should look the entity up using a case-sensitive search. Where the * behaviour is configurable, * * @param value the value (business object) used to identify the entity * @return Return the entity or null if no entity matches the given value */ Pair findByValue(V1 value); Pair createValue(V1 value); } @SuppressWarnings("unchecked") Pair getByKey(K key) { // Look in the cache V value = (V) cache.get(key); if (value != null && value.equals(NULL_VALUE)) { // We checked before return null; } else if (value != null) { return new Pair(key, value); } // Resolve it Pair entityPair = entityLookup.findByKey(key); if (entityPair == null) { // Cache nulls cache.put(key, NULL_VALUE); } else { // Cache the value cache.put(key, entityPair.getSecond()); } // Done return entityPair; } @SuppressWarnings("unchecked") Pair getByValue(V value) { // Get the value key VK valueKey = entityLookup.getValueKey(value); // Look in the cache K key = (K) cache.get(valueKey); // Check if we have looked this up already if (key != null && key.equals(NULL_VALUE)) { // We checked before return null; } else if (key != null) { return new Pair(key, value); } // Resolve it Pair entityPair = entityLookup.findByValue(value); if (entityPair == null) { // Cache a null cache.put(valueKey, NULL_VALUE); } else { // Cache the key cache.put(valueKey, key); } // Done return entityPair; } @SuppressWarnings("unchecked") Pair getOrCreateByValue(V value) { // Get the value key VK valueKey = entityLookup.getValueKey(value); // Look in the cache K key = (K) cache.get(valueKey); // Check if the value is already mapped to a key if (key != null && !key.equals(NULL_VALUE)) { return new Pair(key, value); } // Resolve it Pair entityPair = entityLookup.findByValue(value); if (entityPair == null) { // Create it entityPair = entityLookup.createValue(value); } key = entityPair.getFirst(); // Cache the key and value cache.put(valueKey, key); cache.put(key, value); // Done return entityPair; } }