summaryrefslogtreecommitdiffstats
path: root/kregexpeditor/lookaheadregexp.cpp
blob: 899dcfc8381bfa1974c2c8287c8eef1ddf5bb230 (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
/*
 *  Copyright (c) 2002-2003 Jesper K. Pedersen <blackie@kde.org>
 *
 *  This library is free software; you can redistribute it and/or
 *  modify it under the terms of the GNU Library General Public
 *  License version 2 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
 *  Library General Public License for more details.
 *
 *  You should have received a copy of the GNU Library General Public License
 *  along with this library; see the file COPYING.LIB.  If not, write to
 *  the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
 *  Boston, MA 02110-1301, USA.
 **/
#include "lookaheadregexp.h"
#include "errormap.h"

LookAheadRegExp::LookAheadRegExp( bool selected, TYPE tp, RegExp* child )
    : RegExp( selected ), _child( child ), _tp( tp )
{
    if ( child )
        addChild( child );
}

bool LookAheadRegExp::check( ErrorMap& map, bool , bool last )
{
    if ( !last ) {
        map.lookAheadError();
    }
    return true;
}


TQDomNode LookAheadRegExp::toXml( TQDomDocument* doc ) const
{
    TQDomElement top;
    if ( _tp == POSITIVE )
        top = doc->createElement( TQString::fromLocal8Bit("PositiveLookAhead") );
    else
        top = doc->createElement( TQString::fromLocal8Bit("NegativeLookAhead") );

    top.appendChild( _child->toXml( doc ) );
    return top;
}

bool LookAheadRegExp::load( TQDomElement top, const TQString& version )
{
    _child = readRegExp( top, version );
    if ( _child ) {
        addChild( _child );
        return true;
    }
    else
        return false;
}


bool LookAheadRegExp::operator==( const RegExp& other ) const
{
    if ( type() != other.type() )
        return false;

    const LookAheadRegExp& theOther = dynamic_cast<const LookAheadRegExp&>( other );

    if ( lookAheadType() != theOther.lookAheadType() )
        return false;

    return ( *_child == *(theOther._child) );
}