matchparser.h

/*
    This file is part of Cute Chess.
    Copyright (C) 2008-2018 Cute Chess authors
 
    Cute Chess 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 3 of the License, or
    (at your option) any later version.
 
    Cute Chess 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 Cute Chess.  If not, see <http://www.gnu.org/licenses/>.
*/
 
#ifndef MATCHPARSER_H
#define MATCHPARSER_H
 
#include <QMap>
#include <QMultiMap>
#include <QStringList>
#include <QVariant>
 

class MatchParser
{
    public:
        struct Option
        {
            QMap<QString, QString> toMap(const QString& validArgs) const;
 
            QString name;   
            QVariant value; 
        };

        MatchParser(const QStringList& args);

        void addOption(const QString& name,
                   QVariant::Type type,
                   int minArgs = 0,
                   int maxArgs = -1,
                   bool duplicates = false);
        QVariant takeOption(const QString& name);
        QList<Option> options() const;
        bool parse();
 
    private:
        struct PrivateOption
        {
            QVariant::Type type;
            int priority;
            int minArgs;
            int maxArgs;
            bool duplicates;
        };
 
        bool contains(const QString& optionName) const;
 
        QStringList m_args;
        QMultiMap<int, Option> m_options;
        QMap<QString, PrivateOption> m_validOptions;
        int m_priority;
};
 
#endif // MATCHPARSER_H