File: simpletype.h

package info (click to toggle)
libkode 0.0~git20241211.68f9908-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 636 kB
  • sloc: cpp: 6,612; makefile: 5
file content (129 lines) | stat: -rw-r--r-- 3,564 bytes parent folder | download | duplicates (3)
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
/*
    This file is part of KDE Schema Parser

    Copyright (c) 2005 Tobias Koenig <tokoe@kde.org>
                       based on wsdlpull parser by Vivek Krishna

    This library is free software; you can redistribute it and/or
    modify it under the terms of the GNU Library General Public
    License as published by the Free Software Foundation; either
    version 2 of the License, or (at your option) any later version.

    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.
 */

#ifndef SCHEMA_SIMPLETYPE_H
#define SCHEMA_SIMPLETYPE_H

#include <QStringList>

#include <common/qname.h>
#include "xsdtype.h"
#include <kode_export.h>

namespace XSD {

class SimpleTypeList;

class SCHEMA_EXPORT SimpleType : public XSDType
{
public:
    typedef SimpleTypeList List;

    enum FacetType {
        NONE = 0,
        LENGTH = 1,
        MINLEN = 2,
        MAXLEN = 4,
        ENUM = 8,
        WSP = 16,
        MAXINC = 32,
        MININC = 64,
        MAXEX = 128,
        MINEX = 256,
        TOT = 512,
        FRAC = 1024,
        PATTERN = 2048
    };

    enum WhiteSpaceType { PRESERVE, REPLACE, COLLAPSE };

    enum SubType { TypeRestriction, TypeList, TypeUnion };

    SimpleType();
    explicit SimpleType(const QString &nameSpace);
    SimpleType(const SimpleType &other);
    SimpleType(SimpleType &&other);

    ~SimpleType();

    SimpleType &operator=(const SimpleType &other);
    SimpleType &operator=(SimpleType &&other) noexcept;

    void setDocumentation(const QString &documentation);
    QString documentation() const;

    void setBaseTypeName(const QName &baseTypeName);
    QName baseTypeName() const;

    void setSubType(SubType subType);
    SubType subType() const;

    void setListTypeName(const QName &name);
    QName listTypeName() const;

    void setAnonymous(bool anonymous);
    bool isAnonymous() const;

    FacetType parseFacetId(const QString &facet) const;
    void setFacetValue(FacetType ft, const QString &value);

    int facetType() const;

    int facetLength() const;
    int facetMinimumLength() const;
    int facetMaximumLength() const;
    QStringList facetEnums() const;
    WhiteSpaceType facetWhiteSpace() const;
    int facetMinimumInclusive() const;
    int facetMaximumInclusive() const;
    int facetMinimumExclusive() const;
    int facetMaximumExclusive() const;
    int facetTotalDigits() const;
    int facetFractionDigits() const;
    QString facetPattern() const;

    /**
     * Return true if this type is just a restriction of another type.
     * False for enums, and false if the base type is any.
     */
    bool isRestriction() const;

    QString elementName() const;
    void setElementName(const QString &elementName);

private:
    class Private;
    std::unique_ptr<Private> d;
};

class SCHEMA_EXPORT SimpleTypeList : public QList<SimpleType>
{
public:
    // Readonly lookup, returns null type if not found
    SimpleType simpleType(const QName &qualifiedName) const;

    // Mutable lookup (for making changes), returns end() if not found
    iterator findSimpleType(const QName &qualifiedName);
};
}

#endif