1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2000, 2010 Oracle and/or its affiliates.
*
* OpenOffice.org - a multi-platform office productivity suite
*
* This file is part of OpenOffice.org.
*
* OpenOffice.org is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License version 3
* only, as published by the Free Software Foundation.
*
* OpenOffice.org 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 version 3 for more details
* (a copy is included in the LICENSE file that accompanied this code).
*
* You should have received a copy of the GNU Lesser General Public License
* version 3 along with OpenOffice.org. If not, see
* <http://www.openoffice.org/license.html>
* for a copy of the LGPLv3 License.
*
************************************************************************/
// INCLUDE ---------------------------------------------------------------
#include <xmloff/families.hxx>
#include <xmloff/xmlaustp.hxx>
#include <xmloff/nmspmap.hxx>
#include <tools/string.hxx>
#include "sheetdata.hxx"
// -----------------------------------------------------------------------
ScSheetSaveData::ScSheetSaveData() :
mnStartTab( -1 ),
mnStartOffset( -1 ),
maPreviousNote( rtl::OUString(), rtl::OUString(), ScAddress(ScAddress::INITIALIZE_INVALID) ),
mbInSupportedSave( false )
{
}
ScSheetSaveData::~ScSheetSaveData()
{
}
void ScSheetSaveData::AddCellStyle( const rtl::OUString& rName, const ScAddress& rCellPos )
{
maCellStyles.push_back( ScCellStyleEntry( rName, rCellPos ) );
}
void ScSheetSaveData::AddColumnStyle( const rtl::OUString& rName, const ScAddress& rCellPos )
{
maColumnStyles.push_back( ScCellStyleEntry( rName, rCellPos ) );
}
void ScSheetSaveData::AddRowStyle( const rtl::OUString& rName, const ScAddress& rCellPos )
{
maRowStyles.push_back( ScCellStyleEntry( rName, rCellPos ) );
}
void ScSheetSaveData::AddTableStyle( const rtl::OUString& rName, const ScAddress& rCellPos )
{
maTableStyles.push_back( ScCellStyleEntry( rName, rCellPos ) );
}
void ScSheetSaveData::HandleNoteStyles( const rtl::OUString& rStyleName, const rtl::OUString& rTextName, const ScAddress& rCellPos )
{
// only consecutive duplicates (most common case) are filtered out here,
// the others are found when the styles are created
if ( rStyleName == maPreviousNote.maStyleName &&
rTextName == maPreviousNote.maTextStyle &&
rCellPos.Tab() == maPreviousNote.maCellPos.Tab() )
{
// already stored for the same sheet - ignore
return;
}
ScNoteStyleEntry aNewEntry( rStyleName, rTextName, rCellPos );
maPreviousNote = aNewEntry;
maNoteStyles.push_back( aNewEntry );
}
void ScSheetSaveData::AddNoteContentStyle( sal_uInt16 nFamily, const rtl::OUString& rName, const ScAddress& rCellPos, const ESelection& rSelection )
{
if ( nFamily == XML_STYLE_FAMILY_TEXT_PARAGRAPH )
maNoteParaStyles.push_back( ScTextStyleEntry( rName, rCellPos, rSelection ) );
else
maNoteTextStyles.push_back( ScTextStyleEntry( rName, rCellPos, rSelection ) );
}
void ScSheetSaveData::AddTextStyle( const rtl::OUString& rName, const ScAddress& rCellPos, const ESelection& rSelection )
{
maTextStyles.push_back( ScTextStyleEntry( rName, rCellPos, rSelection ) );
}
void ScSheetSaveData::BlockSheet( SCTAB nTab )
{
if ( nTab >= static_cast<SCTAB>(maBlocked.size()) )
maBlocked.resize( nTab + 1, false ); // fill vector with "false" entries
maBlocked[nTab] = true;
}
bool ScSheetSaveData::IsSheetBlocked( SCTAB nTab ) const
{
if ( nTab < static_cast<SCTAB>(maBlocked.size()) )
return maBlocked[nTab];
else
return false;
}
void ScSheetSaveData::AddStreamPos( SCTAB nTab, sal_Int32 nStartOffset, sal_Int32 nEndOffset )
{
if ( nTab >= static_cast<SCTAB>(maStreamEntries.size()) )
maStreamEntries.resize( nTab + 1 );
maStreamEntries[nTab] = ScStreamEntry( nStartOffset, nEndOffset );
}
void ScSheetSaveData::StartStreamPos( SCTAB nTab, sal_Int32 nStartOffset )
{
OSL_ENSURE( mnStartTab < 0, "StartStreamPos without EndStreamPos" );
mnStartTab = nTab;
mnStartOffset = nStartOffset;
}
void ScSheetSaveData::EndStreamPos( sal_Int32 nEndOffset )
{
if ( mnStartTab >= 0 )
{
AddStreamPos( mnStartTab, mnStartOffset, nEndOffset );
mnStartTab = -1;
mnStartOffset = -1;
}
}
void ScSheetSaveData::GetStreamPos( SCTAB nTab, sal_Int32& rStartOffset, sal_Int32& rEndOffset ) const
{
if ( nTab < static_cast<SCTAB>(maStreamEntries.size()) )
{
const ScStreamEntry& rEntry = maStreamEntries[nTab];
rStartOffset = rEntry.mnStartOffset;
rEndOffset = rEntry.mnEndOffset;
}
else
rStartOffset = rEndOffset = -1;
}
bool ScSheetSaveData::HasStreamPos( SCTAB nTab ) const
{
sal_Int32 nStartOffset = -1;
sal_Int32 nEndOffset = -1;
GetStreamPos( nTab, nStartOffset, nEndOffset );
return ( nStartOffset >= 0 && nEndOffset >= 0 );
}
void ScSheetSaveData::ResetSaveEntries()
{
maSaveEntries.clear();
}
void ScSheetSaveData::AddSavePos( SCTAB nTab, sal_Int32 nStartOffset, sal_Int32 nEndOffset )
{
if ( nTab >= static_cast<SCTAB>(maSaveEntries.size()) )
maSaveEntries.resize( nTab + 1 );
maSaveEntries[nTab] = ScStreamEntry( nStartOffset, nEndOffset );
}
void ScSheetSaveData::UseSaveEntries()
{
maStreamEntries = maSaveEntries;
}
void ScSheetSaveData::StoreInitialNamespaces( const SvXMLNamespaceMap& rNamespaces )
{
// the initial namespaces are just removed from the list of loaded namespaces,
// so only a boost::unordered_map of the prefixes is needed.
const NameSpaceHash& rNameHash = rNamespaces.GetAllEntries();
NameSpaceHash::const_iterator aIter = rNameHash.begin(), aEnd = rNameHash.end();
while (aIter != aEnd)
{
maInitialPrefixes.insert( aIter->first );
++aIter;
}
}
void ScSheetSaveData::StoreLoadedNamespaces( const SvXMLNamespaceMap& rNamespaces )
{
// store the loaded namespaces, so the prefixes in copied stream fragments remain valid
const NameSpaceHash& rNameHash = rNamespaces.GetAllEntries();
NameSpaceHash::const_iterator aIter = rNameHash.begin(), aEnd = rNameHash.end();
while (aIter != aEnd)
{
// ignore the initial namespaces
if ( maInitialPrefixes.find( aIter->first ) == maInitialPrefixes.end() )
{
const NameSpaceEntry& rEntry = *(aIter->second);
maLoadedNamespaces.push_back( ScLoadedNamespaceEntry( rEntry.sPrefix, rEntry.sName, rEntry.nKey ) );
}
++aIter;
}
}
bool lcl_NameInHash( const NameSpaceHash& rNameHash, const rtl::OUString& rName )
{
NameSpaceHash::const_iterator aIter = rNameHash.begin(), aEnd = rNameHash.end();
while (aIter != aEnd)
{
if ( aIter->second->sName == rName )
return true;
++aIter;
}
return false; // not found
}
bool ScSheetSaveData::AddLoadedNamespaces( SvXMLNamespaceMap& rNamespaces ) const
{
// Add the loaded namespaces to the name space map.
// first loop: only look for conflicts
// (if the loaded namespaces were added first, this might not be necessary)
const NameSpaceHash& rNameHash = rNamespaces.GetAllEntries();
std::vector<ScLoadedNamespaceEntry>::const_iterator aIter = maLoadedNamespaces.begin();
std::vector<ScLoadedNamespaceEntry>::const_iterator aEnd = maLoadedNamespaces.end();
while (aIter != aEnd)
{
NameSpaceHash::const_iterator aHashIter = rNameHash.find( aIter->maPrefix );
if ( aHashIter == rNameHash.end() )
{
if ( lcl_NameInHash( rNameHash, aIter->maName ) )
{
// a second prefix for the same name would confuse SvXMLNamespaceMap lookup,
// so this is also considered a conflict
return false;
}
}
else if ( aHashIter->second->sName != aIter->maName )
{
// same prefix, but different name: loaded namespaces can't be used
return false;
}
++aIter;
}
// only if there were no conflicts, add the entries that aren't in the map already
// (the key is needed if the same namespace is added later within an element)
aIter = maLoadedNamespaces.begin();
while (aIter != aEnd)
{
NameSpaceHash::const_iterator aHashIter = rNameHash.find( aIter->maPrefix );
if ( aHashIter == rNameHash.end() )
rNamespaces.Add( aIter->maPrefix, aIter->maName, aIter->mnKey );
++aIter;
}
return true; // success
}
bool ScSheetSaveData::IsInSupportedSave() const
{
return mbInSupportedSave;
}
void ScSheetSaveData::SetInSupportedSave( bool bSet )
{
mbInSupportedSave = bSet;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|