| 1 | /**************************************************************************** |
| 2 | ** |
| 3 | ** Copyright (C) 2016 The Qt Company Ltd. |
| 4 | ** Contact: https://www.qt.io/licensing/ |
| 5 | ** |
| 6 | ** This file is part of the QtXmlPatterns module of the Qt Toolkit. |
| 7 | ** |
| 8 | ** $QT_BEGIN_LICENSE:LGPL$ |
| 9 | ** Commercial License Usage |
| 10 | ** Licensees holding valid commercial Qt licenses may use this file in |
| 11 | ** accordance with the commercial license agreement provided with the |
| 12 | ** Software or, alternatively, in accordance with the terms contained in |
| 13 | ** a written agreement between you and The Qt Company. For licensing terms |
| 14 | ** and conditions see https://www.qt.io/terms-conditions. For further |
| 15 | ** information use the contact form at https://www.qt.io/contact-us. |
| 16 | ** |
| 17 | ** GNU Lesser General Public License Usage |
| 18 | ** Alternatively, this file may be used under the terms of the GNU Lesser |
| 19 | ** General Public License version 3 as published by the Free Software |
| 20 | ** Foundation and appearing in the file LICENSE.LGPL3 included in the |
| 21 | ** packaging of this file. Please review the following information to |
| 22 | ** ensure the GNU Lesser General Public License version 3 requirements |
| 23 | ** will be met: https://www.gnu.org/licenses/lgpl-3.0.html. |
| 24 | ** |
| 25 | ** GNU General Public License Usage |
| 26 | ** Alternatively, this file may be used under the terms of the GNU |
| 27 | ** General Public License version 2.0 or (at your option) the GNU General |
| 28 | ** Public license version 3 or any later version approved by the KDE Free |
| 29 | ** Qt Foundation. The licenses are as published by the Free Software |
| 30 | ** Foundation and appearing in the file LICENSE.GPL2 and LICENSE.GPL3 |
| 31 | ** included in the packaging of this file. Please review the following |
| 32 | ** information to ensure the GNU General Public License requirements will |
| 33 | ** be met: https://www.gnu.org/licenses/gpl-2.0.html and |
| 34 | ** https://www.gnu.org/licenses/gpl-3.0.html. |
| 35 | ** |
| 36 | ** $QT_END_LICENSE$ |
| 37 | ** |
| 38 | ****************************************************************************/ |
| 39 | |
| 40 | #include "qatomictype_p.h" |
| 41 | |
| 42 | #include "qmultiitemtype_p.h" |
| 43 | |
| 44 | QT_BEGIN_NAMESPACE |
| 45 | |
| 46 | using namespace QPatternist; |
| 47 | |
| 48 | MultiItemType::MultiItemType(const ItemType::List &list) : m_types(list), |
| 49 | m_end(list.constEnd()) |
| 50 | { |
| 51 | Q_ASSERT_X(list.count() >= 2, Q_FUNC_INFO, |
| 52 | "It makes no sense to use MultiItemType for types less than two." ); |
| 53 | Q_ASSERT_X(list.count(ItemType::Ptr()) == 0, Q_FUNC_INFO, |
| 54 | "No member in the list can be null." ); |
| 55 | } |
| 56 | |
| 57 | QString MultiItemType::displayName(const NamePool::Ptr &np) const |
| 58 | { |
| 59 | QString result; |
| 60 | ItemType::List::const_iterator it(m_types.constBegin()); |
| 61 | |
| 62 | while(true) |
| 63 | { |
| 64 | result += (*it)->displayName(np); |
| 65 | ++it; |
| 66 | |
| 67 | if(it != m_end) |
| 68 | result += QLatin1String(" | " ); |
| 69 | else |
| 70 | break; |
| 71 | } |
| 72 | |
| 73 | return result; |
| 74 | } |
| 75 | |
| 76 | bool MultiItemType::itemMatches(const Item &item) const |
| 77 | { |
| 78 | for(ItemType::List::const_iterator it(m_types.constBegin()); it != m_end; ++it) |
| 79 | if((*it)->itemMatches(item)) |
| 80 | return true; |
| 81 | |
| 82 | return false; |
| 83 | } |
| 84 | |
| 85 | bool MultiItemType::xdtTypeMatches(const ItemType::Ptr &type) const |
| 86 | { |
| 87 | for(ItemType::List::const_iterator it(m_types.constBegin()); it != m_end; ++it) |
| 88 | if((*it)->xdtTypeMatches(other: type)) |
| 89 | return true; |
| 90 | |
| 91 | return false; |
| 92 | } |
| 93 | |
| 94 | bool MultiItemType::isNodeType() const |
| 95 | { |
| 96 | for(ItemType::List::const_iterator it(m_types.constBegin()); it != m_end; ++it) |
| 97 | if((*it)->isNodeType()) |
| 98 | return true; |
| 99 | |
| 100 | return false; |
| 101 | } |
| 102 | |
| 103 | bool MultiItemType::isAtomicType() const |
| 104 | { |
| 105 | for(ItemType::List::const_iterator it(m_types.constBegin()); it != m_end; ++it) |
| 106 | if((*it)->isAtomicType()) |
| 107 | return true; |
| 108 | |
| 109 | return false; |
| 110 | } |
| 111 | |
| 112 | ItemType::Ptr MultiItemType::xdtSuperType() const |
| 113 | { |
| 114 | ItemType::List::const_iterator it(m_types.constBegin()); |
| 115 | /* Load the first one, and jump over it in the loop. */ |
| 116 | ItemType::Ptr result((*it)->xdtSuperType()); |
| 117 | ++it; |
| 118 | |
| 119 | for(; it != m_end; ++it) |
| 120 | result |= (*it)->xdtSuperType(); |
| 121 | |
| 122 | return result; |
| 123 | } |
| 124 | |
| 125 | ItemType::Ptr MultiItemType::atomizedType() const |
| 126 | { |
| 127 | ItemType::List::const_iterator it(m_types.constBegin()); |
| 128 | /* Load the first one, and jump over it in the loop. */ |
| 129 | ItemType::Ptr result((*it)->atomizedType()); |
| 130 | ++it; |
| 131 | |
| 132 | for(; it != m_end; ++it) |
| 133 | result |= (*it)->atomizedType(); |
| 134 | |
| 135 | return result; |
| 136 | } |
| 137 | |
| 138 | QT_END_NAMESPACE |
| 139 | |