summaryrefslogtreecommitdiffstats
path: root/kregexpeditor/concregexp.cpp
diff options
context:
space:
mode:
authortoma <toma@283d02a7-25f6-0310-bc7c-ecb5cbfe19da>2009-11-25 17:56:58 +0000
committertoma <toma@283d02a7-25f6-0310-bc7c-ecb5cbfe19da>2009-11-25 17:56:58 +0000
commit2bda8f7717adf28da4af0d34fb82f63d2868c31d (patch)
tree8d927b7b47a90c4adb646482a52613f58acd6f8c /kregexpeditor/concregexp.cpp
downloadtdeutils-2bda8f7717adf28da4af0d34fb82f63d2868c31d.tar.gz
tdeutils-2bda8f7717adf28da4af0d34fb82f63d2868c31d.zip
Copy the KDE 3.5 branch to branches/trinity for new KDE 3.5 features.
BUG:215923 git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/kdeutils@1054174 283d02a7-25f6-0310-bc7c-ecb5cbfe19da
Diffstat (limited to 'kregexpeditor/concregexp.cpp')
-rw-r--r--kregexpeditor/concregexp.cpp157
1 files changed, 157 insertions, 0 deletions
diff --git a/kregexpeditor/concregexp.cpp b/kregexpeditor/concregexp.cpp
new file mode 100644
index 0000000..4fac8d0
--- /dev/null
+++ b/kregexpeditor/concregexp.cpp
@@ -0,0 +1,157 @@
+/*
+ * 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 "concregexp.h"
+#include "widgetfactory.h"
+#include "compoundregexp.h"
+
+ConcRegExp::ConcRegExp( bool selected ) :RegExp( selected )
+{
+}
+
+void ConcRegExp::addRegExp( RegExp *regExp )
+{
+ list.append(regExp);
+ addChild( regExp );
+}
+
+RegExpList ConcRegExp::children()
+{
+ return list;
+}
+
+
+bool ConcRegExp::check( ErrorMap& map, bool first, bool last)
+{
+ bool f = first;
+ bool possibleEmpty = true;
+ for ( RegExpListIt it(list); *it; ++it ) {
+ possibleEmpty = (*it)->check( map, f, last && it.atLast() ) && possibleEmpty;
+ if ( ! possibleEmpty )
+ f = false;
+ }
+ return possibleEmpty;
+}
+
+RegExp* ConcRegExp::lastRegExp()
+{
+ if ( list.count() == 0)
+ return 0;
+ else
+ return list.at( list.count()-1);
+}
+
+QDomNode ConcRegExp::toXml( QDomDocument* doc ) const
+{
+ QDomElement top = doc->createElement( QString::fromLocal8Bit("Concatenation") );
+ for ( RegExpListIt it(list); *it; ++it ) {
+ top.appendChild( (*it)->toXml( doc ) );
+ }
+ return top;
+}
+
+bool ConcRegExp::load( QDomElement top, const QString& version )
+{
+ Q_ASSERT( top.tagName() == QString::fromLocal8Bit( "Concatenation" ) );
+
+ for ( QDomNode 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 ConcRegExp::operator==( const RegExp& other ) const
+{
+ // TODO: Merge with AltnRegExp::operator==
+ if ( list.count() == 1 )
+ return ( other == *(const_cast< QPtrList<RegExp>& >(list).at(0)) );
+
+ if ( other.type() != type() )
+ return false;
+
+ const ConcRegExp& theOther = dynamic_cast<const ConcRegExp&>( 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 ConcRegExp::replacePart( CompoundRegExp* replacement )
+{
+ RegExp* otherChild = replacement->child();
+ ConcRegExp* otherConc = dynamic_cast<ConcRegExp*>( otherChild );
+ if ( ! otherConc ) {
+ // Watch out for garbage here!
+ otherConc = new ConcRegExp( false );
+ otherConc->addRegExp( otherChild );
+ }
+
+ RegExpList newList;
+ RegExpListIt it1( list );
+ while ( *it1 ) {
+ (*it1)->replacePart( replacement );
+ RegExpListIt it2 = it1;
+ RegExpListIt it3( otherConc->list );
+ bool match = true;
+ int count = 0;
+
+ // See if replacement is a sublist of list starting from what it1 points at
+ for ( ; *it2 && * it3 && match ; ) {
+ if (! ( **it2 == **it3 ) )
+ match = false;
+ ++it2;
+ ++it3;
+ ++count;
+ }
+
+ if ( match && ! *it3) {
+ // I found a match, delete the element in it1, which is common with it3
+ while ( *it1 != *it2 ) {
+ RegExp* item = *it1;
+ ++it1;
+ delete item;
+ }
+ RegExp* theClone = replacement->clone();
+ newList.append( theClone );
+ addChild( theClone );
+ }
+ else {
+ newList.append( *it1 );
+ ++it1;
+ }
+ }
+ list = newList;
+}
+
+