Go to the source code of this file.
◆ containsSet()
template<class T >
static bool containsSet |
( |
const QSet< T > & |
super, |
|
|
const QSet< T > & |
sub |
|
) |
| |
|
inlinestatic |
Definition at line 163 of file qxsdschemahelper.cpp.
165 QSetIterator<T>
it(sub);
166 while (
it.hasNext()) {
#define it(className, varName)
bool contains(const T &value) const
◆ convertBlockingConstraints()
static SchemaType::DerivationConstraints convertBlockingConstraints |
( |
const NamedSchemaComponent::BlockingConstraints & |
constraints | ) |
|
|
static |
Definition at line 404 of file qxsdschemahelper.cpp.
Referenced by QPatternist::XsdSchemaHelper::isValidlySubstitutable().
406 SchemaType::DerivationConstraints result = 0;
408 if (constraints & NamedSchemaComponent::RestrictionConstraint)
409 result |= SchemaType::RestrictionConstraint;
410 if (constraints & NamedSchemaComponent::ExtensionConstraint)
411 result |= SchemaType::ExtensionConstraint;
◆ effectiveTotalRangeMinimum()
static unsigned int effectiveTotalRangeMinimum |
( |
const XsdParticle::Ptr & |
particle | ) |
|
|
inlinestatic |
Definition at line 59 of file qxsdschemahelper.cpp.
Referenced by QPatternist::XsdSchemaHelper::isParticleEmptiable().
63 if (group->
compositor() == XsdModelGroup::ChoiceCompositor) {
72 for (
int i = 0; i < particles.
count(); ++i) {
97 for (
int i = 0; i < particles.
count(); ++i) {
Q_DECL_CONSTEXPR const T & qMin(const T &a, const T &b)
XsdTerm::Ptr term() const
int count(const T &t) const
Returns the number of occurrences of value in the list.
virtual bool isWildcard() const
bool isEmpty() const
Returns true if the list contains no items; otherwise returns false.
virtual bool isElement() const
unsigned int minimumOccurs() const
XsdParticle::List particles() const
const T & at(int i) const
Returns the item at index position i in the list.
static unsigned int effectiveTotalRangeMinimum(const XsdParticle::Ptr &particle)
virtual bool isModelGroup() const
ModelCompositor compositor() const