You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
103 lines
2.8 KiB
103 lines
2.8 KiB
/*
|
|
* 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 "altnregexp.h"
|
|
#include "widgetfactory.h"
|
|
|
|
AltnRegExp::AltnRegExp( bool selected ) :RegExp( selected )
|
|
{
|
|
// Nothing to do
|
|
}
|
|
|
|
void AltnRegExp::addRegExp( RegExp *elm )
|
|
{
|
|
list.append( elm );
|
|
addChild( elm );
|
|
}
|
|
|
|
RegExpList AltnRegExp::children() const
|
|
{
|
|
return list;
|
|
}
|
|
|
|
bool AltnRegExp::check( ErrorMap& map, bool first, bool last )
|
|
{
|
|
bool possibleEmpty = false;
|
|
for ( RegExpListIt it(list); *it; ++it ) {
|
|
possibleEmpty = (*it)->check( map, first, last ) || possibleEmpty;
|
|
}
|
|
return possibleEmpty;
|
|
}
|
|
|
|
TQDomNode AltnRegExp::toXml( TQDomDocument* doc ) const
|
|
{
|
|
TQDomElement top = doc->createElement( TQString::fromLocal8Bit( "Alternatives" ) );
|
|
for ( RegExpListIt it(list); *it; ++it ) {
|
|
top.appendChild( (*it)->toXml( doc ) );
|
|
}
|
|
return top;
|
|
}
|
|
|
|
bool AltnRegExp::load( TQDomElement top, const TQString& version )
|
|
{
|
|
Q_ASSERT( top.tagName() == TQString::fromLocal8Bit( "Alternatives" ) );
|
|
|
|
for ( TQDomNode child = top.firstChild(); !child.isNull(); child = child.nextSibling() ) {
|
|
if ( ! child.isElement() )
|
|
continue; // User might have added a comment.
|
|
|
|
RegExp* regexp = WidgetFactory::createRegExp( child.toElement(), version );
|
|
if ( regexp == 0 )
|
|
return false;
|
|
addRegExp( regexp );
|
|
}
|
|
return true;
|
|
|
|
}
|
|
|
|
bool AltnRegExp::operator==( const RegExp& other ) const
|
|
{
|
|
// TODO: merge with ConcRegExp::operator==
|
|
|
|
if ( other.type() != type() )
|
|
return false;
|
|
|
|
const AltnRegExp& theOther = dynamic_cast<const AltnRegExp&>( other );
|
|
|
|
if ( list.count() != theOther.list.count() )
|
|
return false;
|
|
|
|
RegExpListIt it1( list );
|
|
RegExpListIt it2( theOther.list );
|
|
|
|
for ( ; *it1 && *it2 ; ) {
|
|
if ( ! (**it1 == **it2) )
|
|
return false;
|
|
++it1;
|
|
++it2;
|
|
}
|
|
return true;
|
|
}
|
|
|
|
void AltnRegExp::replacePart( CompoundRegExp* replacement )
|
|
{
|
|
for ( RegExpListIt it( list ); *it; ++it ) {
|
|
(*it)->replacePart( replacement );
|
|
}
|
|
}
|
|
|