/*
* Copyright 2011 Red Hat, Inc. and/or its affiliates.
*
* This is free software; you can redistribute it and/or modify it
* under the terms of the GNU Lesser General Public License as
* published by the Free Software Foundation; either version 2.1 of
* the License, or (at your option) any later version.
*
* This software 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
* 02110-1301 USA
*/
package org.infinispan.container;
import org.infinispan.container.entries.ClusteredRepeatableReadEntry;
import org.infinispan.container.entries.MVCCEntry;
import org.infinispan.container.entries.NullMarkerEntry;
import org.infinispan.container.entries.NullMarkerEntryForRemoval;
import org.infinispan.container.versioning.EntryVersion;
import org.infinispan.factories.annotations.Start;
/**
* An entry factory that is capable of dealing with SimpleClusteredVersions. This should <i>only</i> be used with
* optimistically transactional, repeatable read, write skew check enabled caches in replicated or distributed mode.
*
* @author Manik Surtani
* @since 5.1
*/
public class IncrementalVersionableEntryFactoryImpl extends EntryFactoryImpl {
@Start (priority = 9)
public void setWriteSkewCheckFlag() {
localModeWriteSkewCheck = false;
useRepeatableRead = true;
}
@Override
protected MVCCEntry createWrappedEntry(Object key, Object value, EntryVersion version, boolean isForInsert, boolean forRemoval, long lifespan) {
if (value == null && !isForInsert) return forRemoval ? new NullMarkerEntryForRemoval(key, version) : NullMarkerEntry.getInstance();
return new ClusteredRepeatableReadEntry(key, value, version, lifespan);
}
}