All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.smallmind.persistence.cache.praxis.intrinsic.ByReferenceIntrinsicCacheDao Maven / Gradle / Ivy

/*
 * Copyright (c) 2007, 2008, 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016 David Berkman
 * 
 * This file is part of the SmallMind Code Project.
 * 
 * The SmallMind Code Project is free software, you can redistribute
 * it and/or modify it under either, at your discretion...
 * 
 * 1) The terms of GNU Affero General Public License as published by the
 * Free Software Foundation, either version 3 of the License, or (at
 * your option) any later version.
 * 
 * ...or...
 * 
 * 2) The terms of the Apache License, Version 2.0.
 * 
 * The SmallMind Code Project 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 or Apache License for more details.
 * 
 * You should have received a copy of the GNU Affero General Public License
 * and the Apache License along with the SmallMind Code Project. If not, see
 *  or .
 * 
 * Additional permission under the GNU Affero GPL version 3 section 7
 * ------------------------------------------------------------------
 * If you modify this Program, or any covered work, by linking or
 * combining it with other code, such other code is not for that reason
 * alone subject to any of the requirements of the GNU Affero GPL
 * version 3.
 */
package org.smallmind.persistence.cache.praxis.intrinsic;

import java.io.Serializable;
import java.util.Comparator;
import org.smallmind.persistence.Durable;
import org.smallmind.persistence.UpdateMode;
import org.smallmind.persistence.cache.AbstractCacheDao;
import org.smallmind.persistence.cache.CacheDomain;
import org.smallmind.persistence.cache.DurableKey;
import org.smallmind.persistence.cache.DurableVector;
import org.smallmind.persistence.cache.VectorKey;
import org.smallmind.persistence.cache.praxis.ByReferenceSingularVector;

public class ByReferenceIntrinsicCacheDao, D extends Durable> extends AbstractCacheDao {

  public ByReferenceIntrinsicCacheDao (CacheDomain cacheDomain) {

    super(cacheDomain);
  }

  public D persist (Class durableClass, D durable, UpdateMode mode) {

    if (durable != null) {

      D cachedDurable;
      DurableKey durableKey = new DurableKey(durableClass, durable.getId());

      return ((cachedDurable = getInstanceCache(durableClass).putIfAbsent(durableKey.getKey(), durable, 0)) != null) ? cachedDurable : durable;
    }

    return null;
  }

  public void updateInVector (VectorKey vectorKey, D durable) {

    if (durable != null) {

      DurableVector vector;

      if ((vector = getVectorCache(vectorKey.getElementClass()).get(vectorKey.getKey())) != null) {
        vector.add(durable);
      }
    }
  }

  public void removeFromVector (VectorKey vectorKey, D durable) {

    if (durable != null) {

      DurableVector vector;

      if ((vector = getVectorCache(vectorKey.getElementClass()).get(vectorKey.getKey())) != null) {
        if (vector.isSingular()) {
          deleteVector(vectorKey);
        }
        else {
          vector.remove(durable);
        }
      }
    }
  }

  public DurableVector migrateVector (Class managedClass, DurableVector vector) {

    if (vector.isSingular()) {
      if (!(vector instanceof ByReferenceSingularVector)) {

        return new ByReferenceSingularVector(vector.head(), vector.getTimeToLiveSeconds());
      }

      return vector;
    }
    else {
      if (!(vector instanceof ByReferenceIntrinsicVector)) {

        return new ByReferenceIntrinsicVector(new IntrinsicRoster(vector.asBestEffortPreFetchedList()), vector.getComparator(), vector.getMaxSize(), vector.getTimeToLiveSeconds(), vector.isOrdered());
      }

      return vector;
    }
  }

  public DurableVector createSingularVector (VectorKey vectorKey, D durable, int timeToLiveSeconds) {

    DurableKey durableKey;
    D inCacheDurable;

    durableKey = new DurableKey(vectorKey.getElementClass(), durable.getId());
    if ((inCacheDurable = getInstanceCache(vectorKey.getElementClass()).putIfAbsent(durableKey.getKey(), durable, 0)) != null) {

      return new ByReferenceSingularVector(inCacheDurable, timeToLiveSeconds);
    }

    return new ByReferenceSingularVector(durable, timeToLiveSeconds);
  }

  public DurableVector createVector (VectorKey vectorKey, Iterable elementIter, Comparator comparator, int maxSize, int timeToLiveSeconds, boolean ordered) {

    IntrinsicRoster cacheConsistentElements;
    DurableKey durableKey;
    D inCacheDurable;

    cacheConsistentElements = new IntrinsicRoster();
    for (D element : elementIter) {
      if (element != null) {

        durableKey = new DurableKey(vectorKey.getElementClass(), element.getId());
        if ((inCacheDurable = getInstanceCache(vectorKey.getElementClass()).putIfAbsent(durableKey.getKey(), element, timeToLiveSeconds)) != null) {
          cacheConsistentElements.add(inCacheDurable);
        }
        else {
          cacheConsistentElements.add(element);
        }
      }
    }

    return new ByReferenceIntrinsicVector(cacheConsistentElements, comparator, maxSize, timeToLiveSeconds, ordered);
  }
}