summaryrefslogtreecommitdiff
path: root/sw/source/core/crsr/findtxt.cxx
blob: 1688086f9c8db14915362e9ccfee81a4536f4e16 (plain)
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
/*************************************************************************
 *
 *  $RCSfile: findtxt.cxx,v $
 *
 *  $Revision: 1.4 $
 *
 *  last change: $Author: jp $ $Date: 2000-12-02 18:09:28 $
 *
 *  The Contents of this file are made available subject to the terms of
 *  either of the following licenses
 *
 *         - GNU Lesser General Public License Version 2.1
 *         - Sun Industry Standards Source License Version 1.1
 *
 *  Sun Microsystems Inc., October, 2000
 *
 *  GNU Lesser General Public License Version 2.1
 *  =============================================
 *  Copyright 2000 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
 *
 *
 *  Sun Industry Standards Source License Version 1.1
 *  =================================================
 *  The contents of this file are subject to the Sun Industry Standards
 *  Source License Version 1.1 (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.openoffice.org/license.html.
 *
 *  Software provided under this License is provided on an "AS IS" basis,
 *  WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,
 *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,
 *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.
 *  See the License for the specific provisions governing your rights and
 *  obligations concerning the Software.
 *
 *  The Initial Developer of the Original Code is: Sun Microsystems, Inc.
 *
 *  Copyright: 2000 by Sun Microsystems, Inc.
 *
 *  All Rights Reserved.
 *
 *  Contributor(s): _______________________________________
 *
 *
 ************************************************************************/

#ifdef PRECOMPILED
#include "core_pch.hxx"
#endif

#pragma hdrstop

#define _SVSTDARR_ULONGS
#include <svtools/svstdarr.hxx>

#ifndef _SV_SVAPP_HXX //autogen wg. Application
#include <vcl/svapp.hxx>
#endif

#ifndef _FLDBAS_HXX //autogen
#include <fldbas.hxx>
#endif
#ifndef _FMTFLD_HXX //autogen
#include <fmtfld.hxx>
#endif
#ifndef _TXTATR_HXX //autogen
#include <txtatr.hxx>
#endif
#ifndef _TXTFLD_HXX //autogen
#include <txtfld.hxx>
#endif
#ifndef _SWCRSR_HXX
#include <swcrsr.hxx>
#endif
#ifndef _DOC_HXX
#include <doc.hxx>
#endif
#ifndef _PAMTYP_HXX
#include <pamtyp.hxx>
#endif
#ifndef _NDTXT_HXX
#include <ndtxt.hxx>
#endif
#ifndef _SWUNDO_HXX
#include <swundo.hxx>
#endif

String& lcl_CleanStr( const SwTxtNode& rNd, xub_StrLen nStart,
                        xub_StrLen& rEnde, SvULongs& rArr, String& rRet )
{
    rRet = rNd.GetTxt();
    if( rArr.Count() )
        rArr.Remove( 0, rArr.Count() );

    const SwpHints *pHts = rNd.GetpSwpHints();
    if( pHts )
    {
        SvULongs aReplaced;

        for( USHORT n = 0; n < pHts->Count(); ++n )
        {
            const SwTxtAttr *pHt = (*pHts)[n];

            if( pHt->GetEnd() )         // nur Attribute ohne Ende
                continue;

            register xub_StrLen nStt = *pHt->GetStart();
            if(  nStt < nStart )
                continue;

            const xub_StrLen nAkt = nStt - rArr.Count();

            //JP 17.05.00: Task 75806 ask for ">=" and not for ">"
            if( nAkt >= rEnde )         // uebers Ende hinaus =
                break;                  // das wars

            switch( pHt->Which() )
            {
            case RES_TXTATR_FLYCNT:
            case RES_TXTATR_FTN:
            case RES_TXTATR_FIELD:
            case RES_TXTATR_REFMARK:
            case RES_TXTATR_TOXMARK:
                {
// JP 06.05.98: mit Bug 50100 werden sie als Trenner erwuenscht und nicht
//              mehr zum Wort dazu gehoerend.
// MA 23.06.98: mit Bug 51215 sollen sie konsequenterweise auch am
//              Satzanfang und -ende ignoriert werden wenn sie Leer sind.
//              Dazu werden sie schlicht entfernt. Fuer den Anfang entfernen
//              wir sie einfach.
//              Fuer das Ende merken wir uns die Ersetzungen und entferenen
//              hinterher alle am Stringende (koenten ja 'normale' 0x7f drinstehen
                    BOOL bEmpty = RES_TXTATR_FIELD != pHt->Which() ||
                        !((SwTxtFld*)pHt)->GetFld().GetFld()->Expand().Len();
                    if ( bEmpty && nStart == nAkt )
                    {
                        rArr.Insert( nAkt, rArr.Count() );
                        --rEnde;
                        rRet.Erase( nAkt, 1 );
                    }
                    else
                    {
                        if ( bEmpty )
                            aReplaced.Insert( nAkt, aReplaced.Count() );
                        rRet.SetChar( nAkt, '\x7f' );
                    }
                }
                break;

                case RES_TXTATR_HARDBLANK:
                    rRet.SetChar( nAkt, ((SwTxtHardBlank*)pHt)->GetChar() );
                    break;
                default:
                    {
                        rArr.Insert( nAkt, rArr.Count() );
                        --rEnde;
                        rRet.Erase( nAkt, 1 );
                    }
                    break;
            }
        }
        for( USHORT i = aReplaced.Count(); i; )
        {
            const xub_StrLen nTmp = aReplaced[ --i ];
            if( nTmp == rRet.Len()-1 )
            {
                rRet.Erase( nTmp );
                rArr.Insert( nTmp, rArr.Count() );
                --rEnde;
            }
        }
    }

    return rRet;
}



BYTE SwPaM::Find( const utl::SearchParam& rParam, utl::TextSearch& rSTxt,
                    SwMoveFn fnMove, const SwPaM * pRegion,
                    FASTBOOL bInReadOnly )
{
    if( !rParam.GetSrchStr().Len() )
        return FALSE;

    SwPaM* pPam = MakeRegion( fnMove, pRegion );
    FASTBOOL bSrchForward = fnMove == fnMoveForward;
    SwNodeIndex& rNdIdx = pPam->GetPoint()->nNode;
    SwIndex& rCntntIdx = pPam->GetPoint()->nContent;

    // Wenn am Anfang/Ende, aus dem Node moven
    // beim leeren Node nicht weiter
    if( bSrchForward
        ? ( rCntntIdx.GetIndex() == pPam->GetCntntNode()->Len() &&
            rCntntIdx.GetIndex() )
        : !rCntntIdx.GetIndex() && pPam->GetCntntNode()->Len() )
    {
        if( !(*fnMove->fnNds)( &rNdIdx, FALSE ))
        {
            delete pPam;
            return FALSE;
        }
        SwCntntNode *pNd = rNdIdx.GetNode().GetCntntNode();
        xub_StrLen nTmpPos = bSrchForward ? 0 : pNd->Len();
        rCntntIdx.Assign( pNd, nTmpPos );
    }

    /*
     * Ist bFound == TRUE, dann wurde der String gefunden und in
     * nStart und nEnde steht der gefundenen String
     */
    BOOL bFound = FALSE;
    /*
     * StartPostion im Text oder Anfangsposition
     */
    FASTBOOL bFirst = TRUE;
    SwCntntNode * pNode;
    String sCleanStr;
    SvULongs aFltArr;

    xub_StrLen nStart, nEnde, nTxtLen;
    const SwNode* pSttNd = &rNdIdx.GetNode();
    xub_StrLen nSttCnt = rCntntIdx.GetIndex();

    while( 0 != ( pNode = ::GetNode( *pPam, bFirst, fnMove, bInReadOnly ) ))
    {
        if( pNode->IsTxtNode() )
        {
            nTxtLen = ((SwTxtNode*)pNode)->GetTxt().Len();
            if( rNdIdx == pPam->GetMark()->nNode )
                nEnde = pPam->GetMark()->nContent.GetIndex();
            else
                nEnde = bSrchForward ? nTxtLen : 0;
            nStart = rCntntIdx.GetIndex();

            if( bSrchForward )
                lcl_CleanStr( *(SwTxtNode*)pNode, nStart, nEnde,
                                aFltArr, sCleanStr );
            else
                lcl_CleanStr( *(SwTxtNode*)pNode, nEnde, nStart,
                                aFltArr, sCleanStr );

            if( (rSTxt.*fnMove->fnSearch)( sCleanStr, &nStart, &nEnde, 0 ))
            {
                // setze den Bereich richtig
                *GetPoint() = *pPam->GetPoint();
                SetMark();

                if( !bSrchForward )     // move the "correct" positions, because
                    ++nStart, ++nEnde;  // start is inclusiv, end is exclusiv

                // Start und Ende wieder korrigieren !!
                if( aFltArr.Count() )
                {
                    xub_StrLen n, nNew;
                    // bei Rueckwaertssuche die Positionen temp. vertauschen
                    if( !bSrchForward ) { n = nStart; nStart = nEnde; nEnde = n; }

                    for( n = 0, nNew = nStart;
                        n < aFltArr.Count() && aFltArr[ n ] <= nStart;
                        ++n, ++nNew )
                        ;
                    nStart = nNew;
                    for( n = 0, nNew = nEnde;
                        n < aFltArr.Count() && aFltArr[ n ] < nEnde;
                        ++n, ++nNew )
                        ;
                    nEnde = nNew;

                    // bei Rueckwaertssuche die Positionen temp. vertauschen
                    if( !bSrchForward ) { n = nStart; nStart = nEnde; nEnde = n; }
                }
                GetMark()->nContent = nStart;       // Startposition setzen

                // kein Bereich selektiert und am Anfng/Ende ? ueber den
                // Absatz selektieren
/*              if( (!nStart && !((USHORT)(nEnde+1))) ||    // fuer 0 und -1 !
                    ( nStart > nEnde ))
                {
                    // nicht von der Start Position entfernt
                    if( pSttNd == &rNdIdx.GetNode() && nSttCnt == nStart
                        && ( !bSrchForward || nStart || nTxtLen ))
                        continue;

                    GetPoint()->nContent = nStart;
                    if( ( !nStart || nStart == nTxtLen ) &&
                         !Move( fnMoveForward, fnGoCntnt ) )
                        continue;
                }
                else
*/                  GetPoint()->nContent = nEnde;

                if( utl::SearchParam::SRCH_REGEXP == rParam.GetSrchType() &&
                    1 < Abs( (int)(GetPoint()->nNode.GetIndex() - GetMark()->nNode.GetIndex())))
                    // Fehler: es koennen maximal 2 Nodes selektiert werden !!
                    continue;

                if( !bSrchForward )         // rueckwaerts Suche?
                    Exchange();             // Point und Mark tauschen
                bFound = TRUE;
                break;
            }
        }
    }
    delete pPam;
    return bFound;
}


// Parameter fuers Suchen und Ersetzen von Text
struct SwFindParaText : public SwFindParas
{
    const utl::SearchParam& rParam;
    SwCursor& rCursor;
    utl::TextSearch aSTxt;
    BOOL bReplace;

    SwFindParaText( const utl::SearchParam& rPara, int bRepl, SwCursor& rCrsr )
        : rCursor( rCrsr ), bReplace( bRepl ), rParam( rPara ),
        aSTxt( rPara, LANGUAGE_SYSTEM )
    {}
    virtual int Find( SwPaM* , SwMoveFn , const SwPaM*, FASTBOOL bInReadOnly );
    virtual int IsReplaceMode() const;
};


int SwFindParaText::Find( SwPaM* pCrsr, SwMoveFn fnMove,
                            const SwPaM* pRegion, FASTBOOL bInReadOnly )
{
    if( bInReadOnly && bReplace )
        bInReadOnly = FALSE;

    BOOL bFnd = (BOOL)pCrsr->Find( rParam, aSTxt, fnMove, pRegion, bInReadOnly );
    // kein Bereich ??
    if( bFnd && *pCrsr->GetMark() == *pCrsr->GetPoint() )
        return FIND_NOT_FOUND;

    if( bFnd && bReplace )          // String ersetzen ??
    {
        // Replace-Methode vom SwDoc benutzen
        int bRegExp = utl::SearchParam::SRCH_REGEXP == rParam.GetSrchType();
        SwIndex& rSttCntIdx = pCrsr->Start()->nContent;
        xub_StrLen nSttCnt = rSttCntIdx.GetIndex();
        // damit die Region auch verschoben wird, in den Shell-Cursr-Ring
        // mit aufnehmen !!
        Ring *pPrev;
        if( bRegExp )
        {
            pPrev = pRegion->GetPrev();
            ((Ring*)pRegion)->MoveRingTo( &rCursor );
        }

        rCursor.GetDoc()->Replace( *pCrsr, rParam.GetReplaceStr(), bRegExp );
        rCursor.SaveTblBoxCntnt( pCrsr->GetPoint() );

        if( bRegExp )
        {
            // und die Region wieder herausnehmen:
            Ring *p, *pNext = (Ring*)pRegion;
            do {
                p = pNext;
                pNext = p->GetNext();
                p->MoveTo( (Ring*)pRegion );
            } while( p != pPrev );
        }
        rSttCntIdx = nSttCnt;
        return FIND_NO_RING;
    }
    return bFnd ? FIND_FOUND : FIND_NOT_FOUND;
}


int SwFindParaText::IsReplaceMode() const
{
    return bReplace;
}


ULONG SwCursor::Find( const utl::SearchParam& rParam,
                        SwDocPositions nStart, SwDocPositions nEnde,
                        FindRanges eFndRngs, int bReplace )
{
    // OLE-Benachrichtigung abschalten !!
    SwDoc* pDoc = GetDoc();
    Link aLnk( pDoc->GetOle2Link() );
    pDoc->SetOle2Link( Link() );

    BOOL bSttUndo = pDoc->DoesUndo() && bReplace;
    if( bSttUndo )
        pDoc->StartUndo( UNDO_REPLACE );

    if( rParam.IsSrchInSelection() )
        eFndRngs = (FindRanges)(eFndRngs | FND_IN_SEL);
    SwFindParaText aSwFindParaText( rParam, bReplace, *this );
    ULONG nRet = FindAll( aSwFindParaText, nStart, nEnde, eFndRngs );
    pDoc->SetOle2Link( aLnk );
    if( nRet && bReplace )
        pDoc->SetModified();

    if( bSttUndo )
        pDoc->EndUndo( UNDO_REPLACE );

    return nRet;
}