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
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786 | /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
#include <memory>
#include <sal/config.h>
#include <com/sun/star/drawing/XShapes.hpp>
#include <com/sun/star/drawing/XDrawPage.hpp>
#include <com/sun/star/lang/IndexOutOfBoundsException.hpp>
#include <vcl/svapp.hxx>
#include <svx/svdobj.hxx>
#include <svx/svdpool.hxx>
#include <editeng/unoipset.hxx>
#include <editeng/unotext.hxx>
#include <tools/debug.hxx>
#include <unoprnms.hxx>
#include <unosrch.hxx>
using namespace ::com::sun::star;
#define WID_SEARCH_BACKWARDS 0
#define WID_SEARCH_CASE 1
#define WID_SEARCH_WORDS 2
static const SfxItemPropertyMapEntry* ImplGetSearchPropertyMap()
{
static const SfxItemPropertyMapEntry aSearchPropertyMap_Impl[] =
{
{ OUString(UNO_NAME_SEARCH_BACKWARDS), WID_SEARCH_BACKWARDS, cppu::UnoType<bool>::get(), 0, 0 },
{ OUString(UNO_NAME_SEARCH_CASE), WID_SEARCH_CASE, cppu::UnoType<bool>::get(), 0, 0 },
{ OUString(UNO_NAME_SEARCH_WORDS), WID_SEARCH_WORDS, cppu::UnoType<bool>::get(), 0, 0 },
{ OUString(), 0, css::uno::Type(), 0, 0 }
};
return aSearchPropertyMap_Impl;
}
namespace {
class SearchContext_impl
{
uno::Reference< drawing::XShapes > mxShapes;
sal_Int32 mnIndex;
public:
SearchContext_impl(uno::Reference<drawing::XShapes> const& xShapes)<--- Class 'SearchContext_impl' has a constructor with 1 argument that is not explicit. [+]Class 'SearchContext_impl' has a constructor with 1 argument that is not explicit. Such constructors should in general be explicit for type safety reasons. Using the explicit keyword in the constructor means some mistakes when using the class can be avoided.
: mxShapes( xShapes ), mnIndex( -1 ) {}
uno::Reference< drawing::XShape > firstShape()
{
mnIndex = -1;
return nextShape();
}
uno::Reference< drawing::XShape > nextShape()
{
uno::Reference< drawing::XShape > xShape;
mnIndex++;
if( mxShapes.is() && mxShapes->getCount() > mnIndex )
{
mxShapes->getByIndex( mnIndex ) >>= xShape;
}
return xShape;
}
};
}
/* ================================================================= */
/** this class implements a search or replace operation on a given
page or a given sdrobj
*/
SdUnoSearchReplaceShape::SdUnoSearchReplaceShape( drawing::XDrawPage* pPage ) throw()
: mpPage(pPage)
{
}
SdUnoSearchReplaceShape::~SdUnoSearchReplaceShape() throw()
{
}
// util::XReplaceable
uno::Reference< util::XReplaceDescriptor > SAL_CALL SdUnoSearchReplaceShape::createReplaceDescriptor()
{
return new SdUnoSearchReplaceDescriptor;
}
sal_Int32 SAL_CALL SdUnoSearchReplaceShape::replaceAll( const uno::Reference< util::XSearchDescriptor >& xDesc )
{
SdUnoSearchReplaceDescriptor* pDescr = comphelper::getUnoTunnelImplementation<SdUnoSearchReplaceDescriptor>( xDesc );
if( pDescr == nullptr )
return 0;
sal_Int32 nFound = 0;
uno::Reference< drawing::XShapes > xShapes;
uno::Reference< drawing::XShape > xShape;
std::vector<SearchContext_impl> aContexts;
if(mpPage)
{
xShapes = mpPage;
if( xShapes->getCount() )
{
aContexts.push_back(SearchContext_impl(xShapes));
xShape = aContexts.back().firstShape();
}
else
{
xShapes = nullptr;
}
}
while( xShape.is() )
{
// replace in xShape
uno::Reference< text::XText > xText(xShape, uno::UNO_QUERY);
uno::Reference< text::XTextRange > xRange = xText;
uno::Reference< text::XTextRange > xFound;
while( xRange.is() )
{
xFound = Search( xRange, pDescr );
if( !xFound.is() )
break;
xFound->setString( pDescr->getReplaceString() );
xRange = xFound->getEnd();
nFound++;
}
// done with xShape -> get next shape
// test if it's a group
uno::Reference< drawing::XShapes > xGroupShape( xShape, uno::UNO_QUERY );
if( xGroupShape.is() && ( xGroupShape->getCount() > 0 ) )
{
aContexts.push_back(SearchContext_impl(xGroupShape));
xShape = aContexts.back().firstShape();
}
else
{
if (!aContexts.empty())
xShape = aContexts.back().nextShape();
else
xShape = nullptr;
}
// test parent contexts for next shape if none
// is found in the current context
while (!aContexts.empty() && !xShape.is())
{
aContexts.pop_back();
if (!aContexts.empty())
xShape = aContexts.back().nextShape();
}
}
return nFound;
}
// XSearchable
uno::Reference< css::util::XSearchDescriptor > SAL_CALL SdUnoSearchReplaceShape::createSearchDescriptor( )
{
return new SdUnoSearchReplaceDescriptor;
}
uno::Reference< css::container::XIndexAccess > SAL_CALL SdUnoSearchReplaceShape::findAll( const css::uno::Reference< css::util::XSearchDescriptor >& xDesc )
{
SdUnoSearchReplaceDescriptor* pDescr = comphelper::getUnoTunnelImplementation<SdUnoSearchReplaceDescriptor>( xDesc );
if( pDescr == nullptr )
return uno::Reference< container::XIndexAccess > ();
sal_Int32 nSequence = 32;
sal_Int32 nFound = 0;
uno::Sequence < uno::Reference< uno::XInterface > > aSeq( nSequence );
uno::Reference< uno::XInterface > * pArray = aSeq.getArray();
uno::Reference< drawing::XShapes > xShapes;
uno::Reference< drawing::XShape > xShape;
std::vector<SearchContext_impl> aContexts;
if(mpPage)
{
xShapes = mpPage;
if( xShapes->getCount() > 0 )
{
aContexts.push_back(SearchContext_impl(xShapes));
xShape = aContexts.back().firstShape();
}
else
{
xShapes = nullptr;
}
}
while( xShape.is() )
{
// find in xShape
uno::Reference< text::XText > xText(xShape, uno::UNO_QUERY);
uno::Reference< text::XTextRange > xRange = xText;
uno::Reference< text::XTextRange > xFound;
while( xRange.is() )
{
xFound = Search( xRange, pDescr );
if( !xFound.is() )
break;
if( nFound >= nSequence )
{
nSequence += 32;
aSeq.realloc( nSequence );
pArray = aSeq.getArray();
}
pArray[nFound++] = xFound;
xRange = xFound->getEnd();
}
// done with shape -> get next shape
// test if it's a group
uno::Reference< drawing::XShapes > xGroupShape;
xGroupShape.set( xShape, uno::UNO_QUERY );
if( xGroupShape.is() && xGroupShape->getCount() > 0 )
{
aContexts.push_back(SearchContext_impl(xGroupShape));
xShape = aContexts.back().firstShape();
}
else
{
if (!aContexts.empty())
xShape = aContexts.back().nextShape();
else
xShape = nullptr;
}
// test parent contexts for next shape if none
// is found in the current context
while (!aContexts.empty() && !xShape.is())
{
aContexts.pop_back();
if (!aContexts.empty())
xShape = aContexts.back().nextShape();
}
}
if( nFound != nSequence )
aSeq.realloc( nFound );
uno::Reference<css::container::XIndexAccess> xRet(new SdUnoFindAllAccess(aSeq));
return xRet;
}
uno::Reference< css::uno::XInterface > SAL_CALL SdUnoSearchReplaceShape::findFirst( const css::uno::Reference< css::util::XSearchDescriptor >& xDesc )
{
uno::Reference< text::XTextRange > xRange( GetCurrentShape(), uno::UNO_QUERY );
if( xRange.is() )
return findNext( xRange, xDesc );
return uno::Reference< uno::XInterface > ();
}
uno::Reference< drawing::XShape > SdUnoSearchReplaceShape::GetCurrentShape() const throw()
{
uno::Reference< drawing::XShape > xShape;
if( mpPage && mpPage->getCount() > 0)
mpPage->getByIndex(0) >>= xShape;
return xShape;
}
uno::Reference< css::uno::XInterface > SAL_CALL SdUnoSearchReplaceShape::findNext( const css::uno::Reference< css::uno::XInterface >& xStartAt, const css::uno::Reference< css::util::XSearchDescriptor >& xDesc )
{
SdUnoSearchReplaceDescriptor* pDescr = comphelper::getUnoTunnelImplementation<SdUnoSearchReplaceDescriptor>( xDesc );
uno::Reference< uno::XInterface > xFound;
uno::Reference< text::XTextRange > xRange( xStartAt, uno::UNO_QUERY );
if(pDescr && xRange.is() )
{
uno::Reference< text::XTextRange > xCurrentRange( xStartAt, uno::UNO_QUERY );
uno::Reference< drawing::XShape > xCurrentShape( GetShape( xCurrentRange ) );
while(!xFound.is() && xRange.is())
{
xFound = Search( xRange, pDescr );
if(!xFound.is())
{
// we need a new starting range now
xRange = nullptr;
if(mpPage)
{
// we do a page wide search, so skip to the next shape here
// get next shape on our page
uno::Reference< drawing::XShape > xFound2( GetNextShape( mpPage, xCurrentShape ) );
if( xFound2.is() && (xFound2.get() != xCurrentShape.get()) )
xCurrentShape = xFound2;
else
xCurrentShape = nullptr;
xRange.set( xCurrentShape, uno::UNO_QUERY );
if(!(xCurrentShape.is() && (xRange.is())))
xRange = nullptr;
}
else
{
// we search only in this shape, so end search if we have
// not found anything
}
}
}
}
return xFound;
}
/** this method returns the shape that follows xCurrentShape in the shape collection xShapes.
It steps recursive into groupshapes and returns the xCurrentShape if it is the last
shape in this collection */
uno::Reference< drawing::XShape > SdUnoSearchReplaceShape::GetNextShape( const uno::Reference< container::XIndexAccess >& xShapes, const uno::Reference< drawing::XShape >& xCurrentShape ) throw()
{
uno::Reference< drawing::XShape > xFound;
if(xShapes.is() && xCurrentShape.is())
{
const sal_Int32 nCount = xShapes->getCount();
for( sal_Int32 i = 0; i < nCount; i++ )
{
uno::Reference< drawing::XShape > xSearchShape;
xShapes->getByIndex(i) >>= xSearchShape;
if( xSearchShape.is() )
{
uno::Reference< container::XIndexAccess > xGroup( xSearchShape, uno::UNO_QUERY );
if( xCurrentShape.get() == xSearchShape.get() )
{
if( xGroup.is() && xGroup->getCount() > 0 )
{
xGroup->getByIndex( 0 ) >>= xFound;
}
else
{
i++;
if( i < nCount )
xShapes->getByIndex( i ) >>= xFound;
else
xFound = xCurrentShape;
}
break;
}
else if( xGroup.is() )
{
xFound = GetNextShape( xGroup, xCurrentShape );
if( xFound.is() )
{
if( xFound.get() == xCurrentShape.get() )
{
// the current shape was found at the end of the group
i++;
if( i < nCount )
{
xShapes->getByIndex(i) >>= xFound;
}
}
break;
}
}
}
}
}
return xFound;
}
uno::Reference< text::XTextRange > SdUnoSearchReplaceShape::Search( const uno::Reference< text::XTextRange >& xText, SdUnoSearchReplaceDescriptor* pDescr )
{
if(!xText.is())
return uno::Reference< text::XTextRange > ();
uno::Reference< text::XText > xParent( xText->getText() );
if( !xParent.is() )
{
xParent.set( xText, uno::UNO_QUERY );
}
const OUString aText( xParent->getString() );
const sal_Int32 nTextLen = aText.getLength();
std::unique_ptr<sal_Int32[]> pConvertPos( new sal_Int32[nTextLen+2] );
std::unique_ptr<sal_Int32[]> pConvertPara( new sal_Int32[nTextLen+2] );
const sal_Unicode* pText = aText.getStr();
sal_Int32* pPos = pConvertPos.get();
sal_Int32* pPara = pConvertPara.get();
sal_Int32 nLastPos = 0, nLastPara = 0;
uno::Reference< container::XEnumerationAccess > xEnumAccess( xParent, uno::UNO_QUERY );
// first we fill the arrays with the position and paragraph for every character
// inside the text
if( xEnumAccess.is() )
{
uno::Reference< container::XEnumeration > xParaEnum( xEnumAccess->createEnumeration() );
while(xParaEnum->hasMoreElements())
{
int ndbg = 0;
uno::Reference< text::XTextContent > xParagraph( xParaEnum->nextElement(), uno::UNO_QUERY );
if( xParagraph.is() )
xEnumAccess.set(xParagraph, css::uno::UNO_QUERY);
else
xEnumAccess.clear();
if( xEnumAccess.is() )
{
uno::Reference< container::XEnumeration > xPortionEnum( xEnumAccess->createEnumeration() );
if( xPortionEnum.is() )
{
while(xPortionEnum->hasMoreElements())
{
uno::Reference< text::XTextRange > xPortion( xPortionEnum->nextElement(), uno::UNO_QUERY );
if( xPortion.is() )
{
const OUString aPortion( xPortion->getString() );
const sal_Int32 nLen = aPortion.getLength();
ESelection aStartSel( GetSelection( xPortion->getStart() ) );
ESelection aEndSel( GetSelection( xPortion->getEnd() ) );
// special case for empty portions with content or length one portions with content (fields)
if( (aStartSel.nStartPos == aEndSel.nStartPos) || ( (aStartSel.nStartPos == (aEndSel.nStartPos - 1)) && (nLen > 1) ) )
{
for( sal_Int32 i = 0; i < nLen; i++ )
{
if( ndbg < (nTextLen+2) )
{
*pPos++ = aStartSel.nStartPos;
*pPara++ = aStartSel.nStartPara;
ndbg += 1;
pText++;
}
else
{
OSL_FAIL( "array overflow while searching" );
}
}
nLastPos = aStartSel.nStartPos;
}
// normal case
else
{
for( sal_Int32 i = 0; i < nLen; i++ )
{
if( ndbg < (nTextLen+2) )
{
*pPos++ = aStartSel.nStartPos++;
*pPara++ = aStartSel.nStartPara;
ndbg += 1;
pText++;
}
else
{
OSL_FAIL( "array overflow while searching" );
}
}
nLastPos = aStartSel.nStartPos - 1;
DBG_ASSERT( aEndSel.nStartPos == aStartSel.nStartPos, "Search is not working" );
}
nLastPara = aStartSel.nStartPara;
}
}
}
}
if( ndbg < (nTextLen+2) )
{
*pPos++ = nLastPos + 1;
*pPara++ = nLastPara;
pText++;
}
else
{
OSL_FAIL( "array overflow while searching" );
}
}
}
uno::Reference< text::XTextRange > xFound;
ESelection aSel;
if( xText.is() )
aSel = GetSelection( xText );
sal_Int32 nStartPos;
sal_Int32 nEndPos = 0;
for( nStartPos = 0; nStartPos < nTextLen; nStartPos++ )
{
if( pConvertPara[nStartPos] == aSel.nStartPara && pConvertPos[nStartPos] == aSel.nStartPos )
break;
}
if( Search( aText, nStartPos, nEndPos, pDescr ) )
{
if( nStartPos <= nTextLen && nEndPos <= nTextLen )
{
ESelection aSelection( pConvertPara[nStartPos], pConvertPos[nStartPos],
pConvertPara[nEndPos], pConvertPos[nEndPos] );
SvxUnoTextRange *pRange;
SvxUnoTextBase* pParent = comphelper::getUnoTunnelImplementation<SvxUnoTextBase>( xParent );
if(pParent)
{
pRange = new SvxUnoTextRange( *pParent );
xFound = pRange;
pRange->SetSelection(aSelection);
}
}
else
{
OSL_FAIL("Array overflow while searching!");
}
}
return xFound;
}
bool SdUnoSearchReplaceShape::Search( const OUString& rText, sal_Int32& nStartPos, sal_Int32& nEndPos, SdUnoSearchReplaceDescriptor* pDescr ) throw()
{
OUString aSearchStr( pDescr->getSearchString() );
OUString aText( rText );
if( !pDescr->IsCaseSensitive() )
{
aText = aText.toAsciiLowerCase();
aSearchStr = aSearchStr.toAsciiLowerCase();
}
sal_Int32 nFound = aText.indexOf( aSearchStr, nStartPos );
if( nFound != -1 )
{
nStartPos = nFound;
nEndPos = nFound + aSearchStr.getLength();
if(pDescr->IsWords())
{
if( (nStartPos > 0 && aText[nStartPos-1] > ' ') ||
(nEndPos < aText.getLength() && aText[nEndPos] > ' ') )
{
nStartPos++;
return Search( aText, nStartPos, nEndPos, pDescr );
}
}
return true;
}
else
return false;
}
ESelection SdUnoSearchReplaceShape::GetSelection( const uno::Reference< text::XTextRange >& xTextRange ) throw()
{
ESelection aSel;
SvxUnoTextRangeBase* pRange = comphelper::getUnoTunnelImplementation<SvxUnoTextRangeBase>( xTextRange );
if(pRange)
aSel = pRange->GetSelection();
return aSel;
}
uno::Reference< drawing::XShape > SdUnoSearchReplaceShape::GetShape( const uno::Reference< text::XTextRange >& xTextRange ) throw()
{
uno::Reference< drawing::XShape > xShape;
if(xTextRange.is())
{
uno::Reference< text::XText > xText( xTextRange->getText() );
if(xText.is())
{
do
{
xShape.set( xText, uno::UNO_QUERY );
if(!xShape.is())
{
uno::Reference< text::XText > xParent( xText->getText() );
if(!xParent.is() || xText.get() == xParent.get())
return xShape;
xText = xParent;
}
} while( !xShape.is() );
}
}
return xShape;
}
/* ================================================================= */
/** this class holds the parameters and status of a search or replace
operation performed by class SdUnoSearchReplaceShape
*/
UNO3_GETIMPLEMENTATION_IMPL( SdUnoSearchReplaceDescriptor );
SdUnoSearchReplaceDescriptor::SdUnoSearchReplaceDescriptor()
{
mpPropSet.reset( new SvxItemPropertySet(ImplGetSearchPropertyMap(), SdrObject::GetGlobalDrawObjectItemPool()) );
mbBackwards = false;
mbCaseSensitive = false;
mbWords = false;
}
SdUnoSearchReplaceDescriptor::~SdUnoSearchReplaceDescriptor() throw()
{
}
// XSearchDescriptor
OUString SAL_CALL SdUnoSearchReplaceDescriptor::getSearchString()
{
return maSearchStr;
}
void SAL_CALL SdUnoSearchReplaceDescriptor::setSearchString( const OUString& aString )
{
maSearchStr = aString;
}
// XReplaceDescriptor
OUString SAL_CALL SdUnoSearchReplaceDescriptor::getReplaceString()
{
return maReplaceStr;
}
void SAL_CALL SdUnoSearchReplaceDescriptor::setReplaceString( const OUString& aReplaceString )
{
maReplaceStr = aReplaceString;
}
// XPropertySet
uno::Reference< css::beans::XPropertySetInfo > SAL_CALL SdUnoSearchReplaceDescriptor::getPropertySetInfo()
{
SolarMutexGuard aGuard;
return mpPropSet->getPropertySetInfo();
}
void SAL_CALL SdUnoSearchReplaceDescriptor::setPropertyValue( const OUString& aPropertyName, const css::uno::Any& aValue )
{
SolarMutexGuard aGuard;
const SfxItemPropertySimpleEntry* pEntry = mpPropSet->getPropertyMapEntry(aPropertyName);
bool bOk = false;
switch( pEntry ? pEntry->nWID : -1 )
{
case WID_SEARCH_BACKWARDS:
bOk = (aValue >>= mbBackwards);
break;
case WID_SEARCH_CASE:
bOk = (aValue >>= mbCaseSensitive);
break;
case WID_SEARCH_WORDS:
bOk = (aValue >>= mbWords);
break;
default:
throw beans::UnknownPropertyException( aPropertyName, static_cast<cppu::OWeakObject*>(this));
}
if( !bOk )
throw lang::IllegalArgumentException();
}
uno::Any SAL_CALL SdUnoSearchReplaceDescriptor::getPropertyValue( const OUString& PropertyName )
{
SolarMutexGuard aGuard;
uno::Any aAny;
const SfxItemPropertySimpleEntry* pEntry = mpPropSet->getPropertyMapEntry(PropertyName);
switch( pEntry ? pEntry->nWID : -1 )
{
case WID_SEARCH_BACKWARDS:
aAny <<= mbBackwards;
break;
case WID_SEARCH_CASE:
aAny <<= mbCaseSensitive;
break;
case WID_SEARCH_WORDS:
aAny <<= mbWords;
break;
default:
throw beans::UnknownPropertyException( PropertyName, static_cast<cppu::OWeakObject*>(this));
}
return aAny;
}
void SAL_CALL SdUnoSearchReplaceDescriptor::addPropertyChangeListener( const OUString& , const css::uno::Reference< css::beans::XPropertyChangeListener >& ) {}
void SAL_CALL SdUnoSearchReplaceDescriptor::removePropertyChangeListener( const OUString& , const css::uno::Reference< css::beans::XPropertyChangeListener >& ) {}
void SAL_CALL SdUnoSearchReplaceDescriptor::addVetoableChangeListener( const OUString& , const css::uno::Reference< css::beans::XVetoableChangeListener >& ) {}
void SAL_CALL SdUnoSearchReplaceDescriptor::removeVetoableChangeListener( const OUString& , const css::uno::Reference< css::beans::XVetoableChangeListener >& ) {}
/* ================================================================= */
SdUnoFindAllAccess::SdUnoFindAllAccess( uno::Sequence< uno::Reference< uno::XInterface > > const & rSequence ) throw()
:maSequence( rSequence )
{
}
SdUnoFindAllAccess::~SdUnoFindAllAccess() throw()
{
}
// XElementAccess
uno::Type SAL_CALL SdUnoFindAllAccess::getElementType()
{
return cppu::UnoType<text::XTextRange>::get();
}
sal_Bool SAL_CALL SdUnoFindAllAccess::hasElements()
{
return maSequence.hasElements();
}
// XIndexAccess
sal_Int32 SAL_CALL SdUnoFindAllAccess::getCount()
{
return maSequence.getLength();
}
uno::Any SAL_CALL SdUnoFindAllAccess::getByIndex( sal_Int32 Index )
{
if( Index < 0 || Index >= getCount() )
throw lang::IndexOutOfBoundsException();
uno::Any aAny;
aAny <<= maSequence[Index];
return aAny;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|