/************************************************************************* * * OpenOffice.org - a multi-platform office productivity suite * * $RCSfile: ConfigurationClassifier.cxx,v $ * * $Revision: 1.2 $ * * last change: $Author: rt $ $Date: 2007-04-03 15:44:53 $ * * The Contents of this file are made available subject to * the terms of GNU Lesser General Public License Version 2.1. * * * GNU Lesser General Public License Version 2.1 * ============================================= * Copyright 2005 by Sun Microsystems, Inc. * 901 San Antonio Road, Palo Alto, CA 94303, USA * * This library is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public * License version 2.1, as published by the Free Software Foundation. * * This library 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., 59 Temple Place, Suite 330, Boston, * MA 02111-1307 USA * ************************************************************************/ #include "precompiled_sd.hxx" #include "ConfigurationClassifier.hxx" #include "framework/FrameworkHelper.hxx" using namespace ::com::sun::star; using namespace ::com::sun::star::uno; using namespace ::com::sun::star::drawing::framework; using ::rtl::OUString; #undef VERBOSE //#define VERBOSE 2 namespace sd { namespace framework { ConfigurationClassifier::ConfigurationClassifier ( const Reference& rxConfiguration1, const Reference& rxConfiguration2) : mxConfiguration1(rxConfiguration1), mxConfiguration2(rxConfiguration2), maC1minusC2(), maC2minusC1(), maC1andC2() { } bool ConfigurationClassifier::Partition (void) { maC1minusC2.clear(); maC2minusC1.clear(); maC1andC2.clear(); PartitionResources( mxConfiguration1->getResources(NULL, OUString(), AnchorBindingMode_DIRECT), mxConfiguration2->getResources(NULL, OUString(), AnchorBindingMode_DIRECT)); return !maC1minusC2.empty() || !maC2minusC1.empty(); } const ConfigurationClassifier::ResourceIdVector& ConfigurationClassifier::GetC1minusC2 (void) const { return maC1minusC2; } const ConfigurationClassifier::ResourceIdVector& ConfigurationClassifier::GetC2minusC1 (void) const { return maC2minusC1; } const ConfigurationClassifier::ResourceIdVector& ConfigurationClassifier::GetC1andC2 (void) const { return maC1andC2; } void ConfigurationClassifier::PartitionResources ( const ::com::sun::star::uno::Sequence >& rS1, const ::com::sun::star::uno::Sequence >& rS2) { ResourceIdVector aC1minusC2; ResourceIdVector aC2minusC1; ResourceIdVector aC1andC2; // Classify the resources in the configurations that are not bound to // other resources. ClassifyResources( rS1, rS2, aC1minusC2, aC2minusC1, aC1andC2); #if defined VERBOSE && VERBOSE >= 2 OSL_TRACE("copying resource ids to C1-C2"); #endif CopyResources(aC1minusC2, mxConfiguration1, maC1minusC2); #if defined VERBOSE && VERBOSE >= 2 OSL_TRACE("copying resource ids to C2-C1"); #endif CopyResources(aC2minusC1, mxConfiguration2, maC2minusC1); // Process the unique resources that belong to both configurations. ResourceIdVector::const_iterator iResource; for (iResource=aC1andC2.begin(); iResource!=aC1andC2.end(); ++iResource) { maC1andC2.push_back(*iResource); PartitionResources( mxConfiguration1->getResources(*iResource, OUString(), AnchorBindingMode_DIRECT), mxConfiguration2->getResources(*iResource, OUString(), AnchorBindingMode_DIRECT)); } } void ConfigurationClassifier::ClassifyResources ( const ::com::sun::star::uno::Sequence >& rS1, const ::com::sun::star::uno::Sequence >& rS2, ResourceIdVector& rS1minusS2, ResourceIdVector& rS2minusS1, ResourceIdVector& rS1andS2) { // Get arrays from the sequences for faster iteration. const Reference* aA1 = rS1.getConstArray(); const Reference* aA2 = rS2.getConstArray(); sal_Int32 nL1 (rS1.getLength()); sal_Int32 nL2 (rS2.getLength()); // Find all elements in rS1 and place them in rS1minusS2 or rS1andS2 // depending on whether they are in rS2 or not. for (sal_Int32 i=0; igetResourceURL().equals(aA2[j]->getResourceURL())) bFound = true; if (bFound) rS1andS2.push_back(aA1[i]); else rS1minusS2.push_back(aA1[i]); } // Find all elements in rS2 that are not in rS1. The elements that are // in both rS1 and rS2 have been handled above and are therefore ignored // here. for (sal_Int32 j=0; jgetResourceURL().equals(aA1[i]->getResourceURL())) bFound = true; if ( ! bFound) rS2minusS1.push_back(aA2[j]); } } void ConfigurationClassifier::CopyResources ( const ResourceIdVector& rSource, const Reference& rxConfiguration, ResourceIdVector& rTarget) { // Copy all resources bound to the ones in aC1minusC2Unique to rC1minusC2. ResourceIdVector::const_iterator iResource (rSource.begin()); ResourceIdVector::const_iterator iEnd(rSource.end()); for ( ; iResource!=iEnd; ++iResource) { const Sequence > aBoundResources ( rxConfiguration->getResources( *iResource, OUString(), AnchorBindingMode_INDIRECT)); const sal_Int32 nL (aBoundResources.getLength()); rTarget.reserve(rTarget.size() + 1 + nL); rTarget.push_back(*iResource); #if defined VERBOSE && VERBOSE >= 2 OSL_TRACE(" copying %s", OUStringToOString(FrameworkHelper::ResourceIdToString(*iResource), RTL_TEXTENCODING_UTF8).getStr()); #endif const Reference* aA = aBoundResources.getConstArray(); for (sal_Int32 i=0; i= 2 OSL_TRACE(" copying %s", OUStringToOString(FrameworkHelper::ResourceIdToString(aA[i]), RTL_TEXTENCODING_UTF8).getStr()); #endif } } } void ConfigurationClassifier::TraceResourceIdVector ( const sal_Char* pMessage, const ResourceIdVector& rResources) const { OSL_TRACE(pMessage); ResourceIdVector::const_iterator iResource; for (iResource=rResources.begin(); iResource!=rResources.end(); ++iResource) { OUString sResource (FrameworkHelper::ResourceIdToString(*iResource)); OSL_TRACE(" %s", OUStringToOString(sResource, RTL_TEXTENCODING_UTF8).getStr()); } } } } // end of namespace sd::framework