mirror of
https://github.com/Alfresco/alfresco-community-repo.git
synced 2025-06-30 18:15:39 +00:00
Fallout: 1. Policy handling for 'onCopy' has been changed to 'getCopyCallback' 2. All existing policy usage was refactored to control behaviour more closely 3. The default child association behaviour has changed: 3.1 Types and aspects control their own child association behaviour 3.2 cm:folder recurses into primary children, but merely copies the secondary association 3.3 cm:rule recurses into primary children 3.4 unless behaviour is defined for a child association, there is no recursion or copying 4. Node association behavior has changed 4.1 There is no copying of node associations. Each type and aspect must handle this by recording nodes and fixing up the required associations in the onCopyComplete. 4.2 If there is a requirement, this can be added to the callback later See 'org.alfresco.repo.copy.AbstractCopyBehaviourCallback' and derived classes for examples. Areas to test with particular attention: 1. Normal copy behaviour 2. Copy of documents with discussions 3. Check-in check-out 4. Check-in, check-out of documents where a discussion was added to working copy 5. Copies of documents with thumbnails 6. Copies of documents with rules 7. Copying of hierarchies that contain rules to copy to another location within the hierarchy 8. Copying into folders where named children already exist git-svn-id: https://svn.alfresco.com/repos/alfresco-enterprise/alfresco/HEAD/root@13915 c4b6b30b-aa2e-2d43-bbcb-ca4b014f7261
186 lines
7.4 KiB
Java
186 lines
7.4 KiB
Java
/*
|
|
* 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.copy;
|
|
|
|
import java.io.Serializable;
|
|
import java.util.ArrayList;
|
|
import java.util.Collection;
|
|
import java.util.List;
|
|
import java.util.Map;
|
|
|
|
import org.alfresco.repo.transaction.TransactionalResourceHelper;
|
|
import org.alfresco.service.cmr.repository.NodeRef;
|
|
import org.alfresco.service.cmr.repository.NodeService;
|
|
import org.alfresco.service.namespace.QName;
|
|
|
|
/**
|
|
* Abstract implementation to allow for easier migration if the interface changes.
|
|
*
|
|
* @author Derek Hulley
|
|
* @since 3.2
|
|
*/
|
|
public abstract class AbstractCopyBehaviourCallback implements CopyBehaviourCallback
|
|
{
|
|
private static final String KEY_NODEREF_REPOINTING_PREFIX = "recordNodeRefPropertiesForRepointing-";
|
|
|
|
/**
|
|
* @return Returns {@link ChildAssocRecurseAction#RESPECT_RECURSE_FLAG}
|
|
*/
|
|
public ChildAssocRecurseAction getChildAssociationRecurseAction(
|
|
QName classQName,
|
|
CopyDetails copyDetails,
|
|
CopyChildAssociationDetails childAssocCopyDetails)
|
|
{
|
|
return ChildAssocRecurseAction.RESPECT_RECURSE_FLAG;
|
|
}
|
|
|
|
/**
|
|
* @throws IllegalStateException always
|
|
*/
|
|
protected void throwExceptionForUnexpectedBehaviour(CopyDetails copyDetails, String ... otherDetails)
|
|
{
|
|
StringBuilder sb = new StringBuilder(512);
|
|
sb.append("Behaviour should have been invoked: \n" +
|
|
" Aspect: " + this.getClass().getName() + "\n" +
|
|
" " + copyDetails + "\n");
|
|
for (String otherDetail : otherDetails)
|
|
{
|
|
sb.append(" ").append(otherDetail).append("\n");
|
|
}
|
|
throw new IllegalStateException(sb.toString());
|
|
}
|
|
|
|
/**
|
|
* Helper method to transactionally record <code>NodeRef</code> properties so that they
|
|
* can later be fixed up to point to the relative, after-copy locations.
|
|
* <p>
|
|
* When the copy has been completed, the second stage of the process can be applied.
|
|
*
|
|
* @param sourceNodeRef the node that is being copied
|
|
* @param properties the node properties being copied
|
|
* @param propertyQName the qualified name of the property to check
|
|
*
|
|
* @see #repointNodeRefs(NodeRef, QName, Map, NodeService)
|
|
*/
|
|
public void recordNodeRefsForRepointing(
|
|
NodeRef sourceNodeRef,
|
|
Map<QName, Serializable> properties,
|
|
QName propertyQName)
|
|
{
|
|
Serializable parameterValue = properties.get(propertyQName);
|
|
if (parameterValue != null &&
|
|
(parameterValue instanceof Collection || parameterValue instanceof NodeRef))
|
|
{
|
|
String key = KEY_NODEREF_REPOINTING_PREFIX + propertyQName.toString();
|
|
// Store it for later
|
|
Map<NodeRef, Serializable> map = TransactionalResourceHelper.getMap(key);
|
|
map.put(sourceNodeRef, parameterValue);
|
|
}
|
|
}
|
|
|
|
/**
|
|
* The second stage of the <code>NodeRef</code> repointing. Call this method to have
|
|
* any <code>NodeRef</code> properties readjusted to reflect the copied node hierarchy.
|
|
* Only use this method if it a requirement for the particular type or aspect that you
|
|
* are coding for.
|
|
*
|
|
* @param sourceNodeRef the source node
|
|
* @param propertyQName the target node i.e. the copy of the source node
|
|
* @param copyMap the full hierarchy copy map of source to copies
|
|
*
|
|
* @see #recordNodeRefsForRepointing(NodeRef, Map, QName)
|
|
*/
|
|
@SuppressWarnings("unchecked")
|
|
public void repointNodeRefs(
|
|
NodeRef sourceNodeRef,
|
|
NodeRef targetNodeRef,
|
|
QName propertyQName,
|
|
Map<NodeRef, NodeRef> copyMap,
|
|
NodeService nodeService)
|
|
{
|
|
String key = KEY_NODEREF_REPOINTING_PREFIX + propertyQName.toString();
|
|
Map<NodeRef, Serializable> map = TransactionalResourceHelper.getMap(key);
|
|
Serializable value = map.get(sourceNodeRef);
|
|
if (value == null)
|
|
{
|
|
// Don't bother. The source node did not have a NodeRef property
|
|
return;
|
|
}
|
|
Serializable newValue = null;
|
|
if (value instanceof Collection)
|
|
{
|
|
Collection<Serializable> oldList = (Collection<Serializable>) value;
|
|
List<Serializable> newList = new ArrayList<Serializable>(oldList.size());
|
|
for (Serializable oldListValue : oldList)
|
|
{
|
|
Serializable newListValue = oldListValue;
|
|
if (oldListValue instanceof NodeRef)
|
|
{
|
|
newListValue = repointNodeRef(copyMap, (NodeRef) value);
|
|
}
|
|
// Put the value in the new list even though the new list might be discarded
|
|
newList.add(newListValue);
|
|
// Check if the value changed
|
|
if (!newListValue.equals(oldListValue))
|
|
{
|
|
// The value changed, so the new list will have to be set onto the target node
|
|
newValue = newListValue;
|
|
}
|
|
}
|
|
}
|
|
else if (value instanceof NodeRef)
|
|
{
|
|
NodeRef newNodeRef = repointNodeRef(copyMap, (NodeRef) value);
|
|
if (!newNodeRef.equals(value))
|
|
{
|
|
// The value changed, so the new list will have to be set onto the target node
|
|
newValue = newNodeRef;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
throw new IllegalStateException("Should only have Collections and NodeRef values");
|
|
}
|
|
// Fix the node property on the target, if necessary
|
|
if (newValue != null)
|
|
{
|
|
nodeService.setProperty(targetNodeRef, propertyQName, newValue);
|
|
}
|
|
}
|
|
|
|
private NodeRef repointNodeRef(Map<NodeRef, NodeRef> copyMap, NodeRef pointerNodeRef)
|
|
{
|
|
NodeRef copiedPointerNodeRef = copyMap.get(pointerNodeRef);
|
|
if (copiedPointerNodeRef == null)
|
|
{
|
|
return pointerNodeRef;
|
|
}
|
|
else
|
|
{
|
|
return copiedPointerNodeRef;
|
|
}
|
|
}
|
|
}
|