1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
|
/**********************************************************************
* Copyright (c) 2003, 2004, froglogic Porten & Stadlbauer GbR
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* * Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following
* disclaimer in the documentation and/or other materials
* provided with the distribution.
*
* * Neither the name of the froglogic nor the names of its
* contributors may be used to endorse or promote products
* derived from this software without specific prior written
* permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
* OF THE POSSIBILITY OF SUCH DAMAGE.
*
**********************************************************************/
/****************************************************************************
Copyright (C) 2005 - 2011 Filipe AZEVEDO & The Monkey Studio Team
http://monkeystudio.org licensing under the GNU GPL.
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 St, Fifth Floor, Boston, MA 02110-1301 USA
****************************************************************************/
#ifndef GETOPT_H
#define GETOPT_H
#include "MonkeyExport.h"
#include <QString>
#include <QStringList>
#include <QMap>
class Q_MONKEY_EXPORT GetOpt {
public:
GetOpt();
GetOpt( int offset );
GetOpt( int argc, char *argv[] );
GetOpt( const QStringList &a );
QString appName() const { return aname; }
// switch (no arguments)
void addSwitch( const QString &lname, bool *b );
// options (with arguments, sometimes optional)
void addOption( char s, const QString &l, QString *v );
void addVarLengthOption( const QString &l, QStringList *v );
void addRepeatableOption( char s, QStringList *v );
void addRepeatableOption( const QString &l, QStringList *v );
void addOptionalOption( const QString &l, QString *v, const QString &def );
void addOptionalOption( char s, const QString &l, QString *v, const QString &def );
// bare arguments
void addArgument( const QString &name, QString *v );
void addOptionalArgument( const QString &name, QString *v );
bool parse( bool untilFirstSwitchOnly );
bool parse() { return parse( false ); }
bool isSet( const QString &name ) const;
int currentArgument() const { return currArg; }
private:
enum OptionType { OUnknown, OEnd, OSwitch, OArg1, OOpt, ORepeat, OVarLen };
struct Option;
friend struct Option;
struct Option {
Option( OptionType t = OUnknown, char s = 0, const QString &l = QString::null )
: type( t ),
sname( s ),
lname( l ),
boolValue( 0 )
{}
OptionType type;
char sname; // short option name (0 if none)
QString lname; // long option name (null if none)
union {
bool *boolValue;
QString *stringValue;
QStringList *listValue;
};
QString def;
};
QList<Option> options;
typedef QList<Option>::const_iterator OptionConstIterator;
QMap<QString, int> setOptions;
void init( int argc, char *argv[], int offset = 1 );
void addOption( Option o );
void setSwitch( const Option &o );
QStringList args;
QString aname;
int numReqArgs;
int numOptArgs;
Option reqArg;
Option optArg;
int currArg;
};
#endif
|
