/* * Copyright (C) 2009-2010 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 received 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.transfer; import java.util.ArrayList; import java.util.Arrays; import java.util.Collection; import java.util.HashSet; import java.util.List; import java.util.Set; import org.alfresco.service.ServiceRegistry; import org.alfresco.service.cmr.dictionary.AssociationDefinition; import org.alfresco.service.cmr.dictionary.DictionaryService; import org.alfresco.service.cmr.repository.ChildAssociationRef; import org.alfresco.service.cmr.repository.NodeRef; import org.alfresco.service.cmr.repository.NodeService; import org.alfresco.service.cmr.transfer.NodeFinder; import org.alfresco.service.namespace.QName; import org.alfresco.service.namespace.RegexQNamePattern; import org.alfresco.util.ParameterCheck; /** * @author brian * */ public class ChildAssociatedNodeFinder implements NodeFinder { private Set suppliedAssociationTypes = new HashSet(); private boolean exclude = false; private boolean initialised = false; private List childAssociationTypes = new ArrayList(); private ServiceRegistry serviceRegistry; public ChildAssociatedNodeFinder() { } public ChildAssociatedNodeFinder(Set associationTypeNames) { setAssociationTypes(associationTypeNames); } public ChildAssociatedNodeFinder(QName... associationTypeNames) { setAssociationTypes(associationTypeNames); } public ChildAssociatedNodeFinder(Set associationTypeNames, boolean exclude) { setAssociationTypes(associationTypeNames); this.exclude = exclude; } public ChildAssociatedNodeFinder(ServiceRegistry serviceRegistry) { this.serviceRegistry = serviceRegistry; } public ChildAssociatedNodeFinder(ServiceRegistry serviceRegistry, Set associationTypeNames) { this(serviceRegistry); setAssociationTypes(associationTypeNames); } public ChildAssociatedNodeFinder(ServiceRegistry serviceRegistry, QName... associationTypeNames) { this(serviceRegistry); setAssociationTypes(associationTypeNames); } public ChildAssociatedNodeFinder(ServiceRegistry serviceRegistry, Set associationTypeNames, boolean exclude) { setAssociationTypes(associationTypeNames); this.exclude = exclude; } public void setAssociationTypes(QName... associationTypes) { setAssociationTypes(Arrays.asList(associationTypes)); } public void setAssociationTypes(Collection associationTypes) { this.suppliedAssociationTypes = new HashSet(associationTypes); initialised = false; } /** * @param exclude * the exclude to set */ public void setExclude(boolean exclude) { this.exclude = exclude; } /* * (non-Javadoc) * * @see org.alfresco.service.cmr.transfer.NodeFinder#findFrom(org.alfresco.service.cmr.repository.NodeRef, * org.alfresco.service.ServiceRegistry) */ public Set findFrom(NodeRef thisNode) { if (!initialised) { init(); } if (exclude) { return processExcludedSet(thisNode); } else { return processIncludedSet(thisNode); } } /** * @param thisNode * @param serviceRegistry * @return */ private Set processExcludedSet(NodeRef thisNode) { Set results = new HashSet(89); NodeService nodeService = serviceRegistry.getNodeService(); // Find all the child nodes (filtering as necessary). List children = nodeService.getChildAssocs(thisNode); boolean filterChildren = !childAssociationTypes.isEmpty(); for (ChildAssociationRef child : children) { if (!filterChildren || !childAssociationTypes.contains(child.getTypeQName())) { results.add(child.getChildRef()); } } return results; } private Set processIncludedSet(NodeRef startingNode) { NodeService nodeService = serviceRegistry.getNodeService(); Set foundNodes = new HashSet(89); for (QName assocType : childAssociationTypes) { List children = nodeService.getChildAssocs(startingNode, assocType, RegexQNamePattern.MATCH_ALL); for (ChildAssociationRef child : children) { foundNodes.add(child.getChildRef()); } } return foundNodes; } /** * @param serviceRegistry * the serviceRegistry to set */ public void setServiceRegistry(ServiceRegistry serviceRegistry) { this.serviceRegistry = serviceRegistry; } public void init() { ParameterCheck.mandatory("serviceRegistry", serviceRegistry); // Quickly scan the supplied association types and remove any that either // do not exist or are not child association types. DictionaryService dictionaryService = serviceRegistry.getDictionaryService(); childAssociationTypes.clear(); for (QName associationType : suppliedAssociationTypes) { AssociationDefinition assocDef = dictionaryService.getAssociation(associationType); if (assocDef != null && assocDef.isChild()) { childAssociationTypes.add(associationType); } } initialised = true; } }