File indexing completed on 2024-04-28 03:40:43

 /*************************************************************************************
  *  Copyright (C) 2009 by Aleix Pol <aleixpol@kde.org>                               *
  *                                                                                   *
  *  This program is free software; you can redistribute it and/or                    *
  *  modify it under the terms of the GNU General Public License                      *
  *  as published by the Free Software Foundation; either version 2                   *
  *  of the License, or (at your option) any later version.                           *
  *                                                                                   *
  *  This program 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 General Public License for more details.                                     *
  *                                                                                   *
  *  You should have received a copy of the GNU General Public License                *
  *  along with this program; if not, write to the Free Software                      *
  *  Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA   *
  *************************************************************************************/
 
 #include "list.h"
 #include "expression.h"
 #include "abstractexpressionvisitor.h"
 #include "analitzautils.h"
 
 using namespace Analitza;
 
 List::List(const List& v)
     : Object(Object::list)
 {
     foreach(const Object* o, v.m_elements)
     {
         m_elements.append(o->copy());
     }
 }
 
 List::List()
     : Object(Object::list)
 {}
 
 List::~List()
 {
     qDeleteAll(m_elements);
 }
 
 List* List::copy() const
 {
     List *v=new List;
     foreach(const Object* o, m_elements)
         v->m_elements.append(o->copy());
     
     return v;
 }
 
 void List::appendBranch(Object* o)
 {
     Q_ASSERT(o);
     m_elements.append(o);
 }
 
 QVariant List::accept(AbstractExpressionVisitor* e) const
 {
     return e->visit(this);
 }
 
 bool List::isZero() const
 {
     return m_elements.isEmpty();
 }
 
 bool List::matches(const Object* exp, QMap< QString, const Object* >* found) const
 {
     if(Object::vector!=exp->type())
         return false;
     const List* c=(const List*) exp;
     if(m_elements.count()!=c->m_elements.count())
         return false;
     
     bool matching=true;
     List::const_iterator it, it2, itEnd=m_elements.constEnd();
     for(it=m_elements.constBegin(), it2=c->m_elements.constBegin(); matching && it!=itEnd; ++it, ++it2)
     {
         matching &= (*it)->matches(*it2, found);
     }
     return matching;
 }
 
 bool List::operator==(const List& v) const
 {
     bool eq=v.size()==size();
     
     for(int i=0; eq && i<m_elements.count(); ++i) {
         eq = eq && AnalitzaUtils::equalTree(m_elements[i], v.m_elements[i]);
     }
     return eq;
 }