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 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337
|
/* -*- 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 <stdexcept>
#include <osl/diagnose.h>
#include "FilterContainer.hxx"
#include <utility>
#if defined _MSC_VER
#pragma warning(push, 1)
#endif
#include <windows.h>
#if defined _MSC_VER
#pragma warning(pop)
#endif
//-------------------------------------------------------------------
// namespace directives
//-------------------------------------------------------------------
using ::rtl::OUString;
//-------------------------------------------------------------------------------------
// ctor
//-------------------------------------------------------------------------------------
CFilterContainer::CFilterContainer( sal_Int32 initSize ) :
m_vFilters( initSize ),
m_bIterInitialized( sal_False )
{
}
//-----------------------------------------------------------------------------------------
// add a name/filter pair
//-----------------------------------------------------------------------------------------
sal_Bool SAL_CALL CFilterContainer::addFilter(
const OUString& aName, const OUString& aFilter, sal_Bool bAllowDuplicates )
{
// check if the filter is already in the container
sal_Int32 pos = -1;
if ( !bAllowDuplicates )
{
pos = getFilterTagPos( aName );
if ( pos < 0 ) // if not there, append
{
m_vFilters.push_back( std::make_pair( aName, aFilter ) );
m_bIterInitialized = sal_False;
}
}
else
{
m_vFilters.push_back( std::make_pair( aName, aFilter ) );
m_bIterInitialized = sal_False;
}
return ( pos < 0 ) ? sal_True : sal_False;
}
//-----------------------------------------------------------------------------------------
// delete a filter
// Precondition: the container is not empty
// there is a filter identified by the given name
//-----------------------------------------------------------------------------------------
sal_Bool SAL_CALL CFilterContainer::delFilter( const OUString& aName )
{
OSL_ASSERT( !m_vFilters.empty() );
sal_Int32 pos = getFilterTagPos( aName );
if ( pos > -1 )
{
m_vFilters.erase( ( m_vFilters.begin() + pos ) );
m_bIterInitialized = sal_False;
}
return ( pos > -1 ) ? sal_True : sal_False;
}
//-----------------------------------------------------------------------------------------
// return the number of filters currently in the container
//-----------------------------------------------------------------------------------------
sal_Int32 SAL_CALL CFilterContainer::numFilter( )
{
return m_vFilters.size( );
}
//-----------------------------------------------------------------------------------------
// clear all entries
//-----------------------------------------------------------------------------------------
void SAL_CALL CFilterContainer::empty()
{
m_vFilters.clear( );
}
//-----------------------------------------------------------------------------------------
// get a filter by name
// Precondition: the container is not empty
// there is a filter identified by the name
//-----------------------------------------------------------------------------------------
sal_Bool SAL_CALL CFilterContainer::getFilter( const OUString& aName, OUString& theFilter ) const
{
OSL_PRECOND( !m_vFilters.empty() , "Empty filter container" );
sal_Int32 pos = getFilterTagPos( aName );
try
{
if ( pos > -1 )
theFilter = m_vFilters.at( pos ).second;
}
catch( std::out_of_range& )
{
OSL_FAIL( "Filter not in filter container" );
pos = -1;
}
return (pos > -1 ) ? sal_True : sal_False;
}
//-----------------------------------------------------------------------------------------
//
//-----------------------------------------------------------------------------------------
sal_Bool SAL_CALL CFilterContainer::getFilter( sal_Int32 aIndex, OUString& theFilter ) const
{
sal_Bool bRet = sal_True;
try
{
theFilter = m_vFilters.at( aIndex ).first;
}
catch( std::out_of_range& )
{
OSL_FAIL( "Filter index out of range" );
bRet = sal_False;
}
return bRet;
}
//-----------------------------------------------------------------------------------------
//
//-----------------------------------------------------------------------------------------
sal_Int32 SAL_CALL CFilterContainer::getFilterPos( const OUString& aName ) const
{
return getFilterTagPos( aName );
}
//-----------------------------------------------------------------------------------------
// returns the index of the filter identified by name
//-----------------------------------------------------------------------------------------
sal_Int32 SAL_CALL CFilterContainer::getFilterTagPos( const OUString& aName ) const
{
if ( !m_vFilters.empty() )
{
sal_Int32 i = 0;
FILTER_VECTOR_T::const_iterator iter;
FILTER_VECTOR_T::const_iterator iter_end = m_vFilters.end( );
for ( iter = m_vFilters.begin( ); iter != iter_end; ++iter, ++i )
if ( ( *iter ).first.equalsIgnoreAsciiCase( aName ) )
return i;
}
return -1;
}
//-----------------------------------------------------------------------------------------
// starts enumerating the filter in the container
//-----------------------------------------------------------------------------------------
void SAL_CALL CFilterContainer::beginEnumFilter( )
{
m_iter = m_vFilters.begin( );
m_bIterInitialized = sal_True;
}
//-----------------------------------------------------------------------------------------
// returns true if another filter has been retrieved
//-----------------------------------------------------------------------------------------
sal_Bool SAL_CALL CFilterContainer::getNextFilter( FILTER_ENTRY_T& nextFilterEntry )
{
OSL_ASSERT( m_bIterInitialized );
sal_Bool bRet = ( m_iter != m_vFilters.end( ) );
if ( bRet )
nextFilterEntry = *m_iter++;
else
m_bIterInitialized = sal_False;
return bRet;
}
//-----------------------------------------------------------------------------------------
void SAL_CALL CFilterContainer::setCurrentFilter( const ::rtl::OUString& aName )
{
m_sCurrentFilter = aName;
}
//-----------------------------------------------------------------------------------------
::rtl::OUString SAL_CALL CFilterContainer::getCurrentFilter() const
{
return m_sCurrentFilter;
}
//###################################################################
//-------------------------------------------------------------------
// calculates the length of a '\0' separated filter, that means
// length of the name + '\0' + length of the filter string +
// a trailing '\0'
//-------------------------------------------------------------------
static sal_uInt32 _getLengthFilter( CFilterContainer::FILTER_ENTRY_T aFilterEntry )
{
return (
aFilterEntry.first.getLength( ) + 1 +
aFilterEntry.second.getLength( ) + 1 );
}
//-------------------------------------------------------------------
// calculates the length of all filters currently in the container
//-------------------------------------------------------------------
static sal_uInt32 _getTotalFilterLength( CFilterContainer& aFilterContainer )
{
CFilterContainer::FILTER_ENTRY_T nextFilter;
aFilterContainer.beginEnumFilter( );
sal_uInt32 totalLength = 0;
while( aFilterContainer.getNextFilter( nextFilter ) )
totalLength += _getLengthFilter( nextFilter );
return ( totalLength > 0 ) ? totalLength + 1 : totalLength;
}
//-------------------------------------------------------------------
//
//-------------------------------------------------------------------
inline
void _wcsmemcpy( sal_Unicode* pDest, const sal_Unicode* pSrc, sal_uInt32 nLength )
{
memcpy( pDest, pSrc, nLength * sizeof( sal_Unicode ) );
}
//-------------------------------------------------------------------
// a helper trivial helper function to create a filter buffer in the
// format the Win32 API requires,
// e.g. "Text\0*.txt\0Doc\0*.doc;*xls\0\0"
//-------------------------------------------------------------------
rtl::OUString SAL_CALL makeWinFilterBuffer( CFilterContainer& aFilterContainer )
{
// calculate the required buffer size
sal_uInt32 reqBuffSize = _getTotalFilterLength( aFilterContainer );
// return if there are no filters
if ( !reqBuffSize )
return OUString( );
sal_Unicode* pBuff = new sal_Unicode[reqBuffSize];
// initialize the buffer with 0
ZeroMemory( pBuff, sizeof( sal_Unicode ) * reqBuffSize );
OUString winFilterBuff;
CFilterContainer::FILTER_ENTRY_T nextFilter;
sal_uInt32 memPos = 0;
aFilterContainer.beginEnumFilter( );
while( aFilterContainer.getNextFilter( nextFilter ) )
{
_wcsmemcpy(
pBuff + memPos,
nextFilter.first.getStr( ),
nextFilter.first.getLength( ) );
memPos += nextFilter.first.getLength( ) + 1;
_wcsmemcpy(
pBuff + memPos,
nextFilter.second.getStr( ),
nextFilter.second.getLength( ) );
memPos += nextFilter.second.getLength( ) + 1 ;
}
winFilterBuff = OUString( pBuff, reqBuffSize );
// remove the allocated buffer
delete [] pBuff;
return winFilterBuff;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|