container.h

Go to the documentation of this file.

/*************************************************************************************
 *  Copyright (C) 2007 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   *
 *************************************************************************************/

#ifndef CONTAINER_H
#define CONTAINER_H

#include <QDomNode>

#include "object.h"
#include "operator.h"
#include "analitzaexport.h"

namespace Analitza
{

class Ci;

class ANALITZA_EXPORT Container : public Object
{
public:
    
    enum ContainerType {
        none=0,     
        math,       
        declare,    
        lambda,     
        bvar,       
        uplimit,    
        downlimit,  
        piece,      
        piecewise,  
        otherwise,  
        domainofapplication     
    };
    
    typedef QList<Object*>::const_iterator const_iterator;
    typedef QList<Object*>::iterator iterator;
    
    Container(enum ContainerType c) : Object(container), m_cont_type(c) { }
    
    Container(const Container& c);
    
    virtual Container* copy() const;
    
    virtual ~Container() { qDeleteAll(m_params); }
    
    void setContainerType(enum ContainerType c) { m_cont_type = c; }
    
    ContainerType containerType() const { Q_ASSERT(m_type==Object::container && m_cont_type!=none); return m_cont_type; }
    
    bool operator==(const Container& c) const;
    
    static ContainerType toContainerType(const QString& tag);
    
    void appendBranch(Object* o);
    
    void insertBranch(Container::iterator before, Object* o) { m_params.insert(before, o); }
    
    QStringList bvarStrings() const;
    
    QList<Ci*> bvarCi() const;
    
    Container::iterator begin() { return m_params.begin(); }
    
    Container::const_iterator constBegin() const { return m_params.constBegin(); }
    
    Container::const_iterator constEnd() const { return m_params.constEnd(); }
    
    Container::iterator end() { return m_params.end(); }
    
    bool isEmpty() const { return m_params.isEmpty(); }
    
    bool isNumber() const;
    
    QString tagName() const;
    
    virtual QVariant accept(AbstractExpressionVisitor*) const;
    
    virtual bool isZero() const;
    
    virtual bool matches(const Object* pattern, QMap< QString, const Object* >* found) const;
    
    const Container* extractType(Container::ContainerType t) const;
    
    int bvarCount() const;

// protected:
    QList<Object*> m_params;
private:
    ContainerType m_cont_type;
    static char m_typeStr[][20];
    static QMap<QString, ContainerType> m_nameToType;
};

}

#endif