/**************************************************************************** ** ** Copyright (C) 2016 The Qt Company Ltd. ** Contact: https://www.qt.io/licensing/ ** ** This file is part of the QtXmlPatterns module of the Qt Toolkit. ** ** $QT_BEGIN_LICENSE:LGPL$ ** Commercial License Usage ** Licensees holding valid commercial Qt licenses may use this file in ** accordance with the commercial license agreement provided with the ** Software or, alternatively, in accordance with the terms contained in ** a written agreement between you and The Qt Company. For licensing terms ** and conditions see https://www.qt.io/terms-conditions. For further ** information use the contact form at https://www.qt.io/contact-us. ** ** GNU Lesser General Public License Usage ** Alternatively, this file may be used under the terms of the GNU Lesser ** General Public License version 3 as published by the Free Software ** Foundation and appearing in the file LICENSE.LGPL3 included in the ** packaging of this file. Please review the following information to ** ensure the GNU Lesser General Public License version 3 requirements ** will be met: https://www.gnu.org/licenses/lgpl-3.0.html. ** ** GNU General Public License Usage ** Alternatively, this file may be used under the terms of the GNU ** General Public License version 2.0 or (at your option) the GNU General ** Public license version 3 or any later version approved by the KDE Free ** Qt Foundation. The licenses are as published by the Free Software ** Foundation and appearing in the file LICENSE.GPL2 and LICENSE.GPL3 ** included in the packaging of this file. Please review the following ** information to ensure the GNU General Public License requirements will ** be met: https://www.gnu.org/licenses/gpl-2.0.html and ** https://www.gnu.org/licenses/gpl-3.0.html. ** ** $QT_END_LICENSE$ ** ****************************************************************************/ // // W A R N I N G // ------------- // // This file is not part of the Qt API. It exists purely as an // implementation detail. This header file may change from version to // version without notice, or even be removed. // // We mean it. // /** * @file * @short This file is included by qcomparisonplatform_p.h. * If you need includes in this file, put them in qcomparisonplatform_p.h, outside of the namespace. */ template bool ComparisonPlatform:: flexibleCompare(const Item &it1, const Item &it2, const DynamicContext::Ptr &context) const { if(m_comparator) /* The comparator was located at compile time. */ return compare(it1, it2, m_comparator, operatorID()); else { const AtomicComparator::Ptr cp(fetchComparator(it1.type(), it2.type(), context)); return cp ? compare(it1, it2, cp, operatorID()) : false; } } template AtomicComparator::ComparisonResult ComparisonPlatform:: detailedFlexibleCompare(const Item &it1, const Item &it2, const DynamicContext::Ptr &context) const { AtomicComparator::Ptr comp; if(m_comparator) comp = m_comparator; else { comp = fetchComparator(it1.type(), it2.type(), context); } Q_ASSERT_X(operatorID() == AtomicComparator::OperatorLessThanNaNLeast || operatorID() == AtomicComparator::OperatorLessThanNaNGreatest, Q_FUNC_INFO, "Only OperatorLessThan is currently supported for this function."); return comp->compare(it1, operatorID(), it2); } template bool ComparisonPlatform:: compare(const Item &oand1, const Item &oand2, const AtomicComparator::Ptr &comp, const AtomicComparator::Operator op) const { Q_ASSERT(oand1); Q_ASSERT(oand2); Q_ASSERT(comp); switch(op) { case AtomicComparator::OperatorEqual: return comp->equals(oand1, oand2); case AtomicComparator::OperatorNotEqual: return !comp->equals(oand1, oand2); case AtomicComparator::OperatorLessThanNaNLeast: case AtomicComparator::OperatorLessThanNaNGreatest: /* Fallthrough. */ case AtomicComparator::OperatorLessThan: return comp->compare(oand1, op, oand2) == AtomicComparator::LessThan; case AtomicComparator::OperatorGreaterThan: return comp->compare(oand1, op, oand2) == AtomicComparator::GreaterThan; case AtomicComparator::OperatorLessOrEqual: { const AtomicComparator::ComparisonResult ret = comp->compare(oand1, op, oand2); return ret == AtomicComparator::LessThan || ret == AtomicComparator::Equal; } case(AtomicComparator::OperatorGreaterOrEqual): { const AtomicComparator::ComparisonResult ret = comp->compare(oand1, op, oand2); return ret == AtomicComparator::GreaterThan || ret == AtomicComparator::Equal; } } /* GCC unbarfer, this line should never be reached. */ Q_ASSERT(false); return false; } template AtomicComparator::Ptr ComparisonPlatform:: fetchComparator(const ItemType::Ptr &t1, const ItemType::Ptr &t2, const ReportContext::Ptr &context) const { Q_ASSERT(t1); Q_ASSERT(t2); if(*BuiltinTypes::xsAnyAtomicType == *t1 || *BuiltinTypes::xsAnyAtomicType == *t2 || *BuiltinTypes::item == *t1 || *BuiltinTypes::item == *t2 || *BuiltinTypes::numeric == *t1 || *BuiltinTypes::numeric == *t2 || *CommonSequenceTypes::Empty == *t1 || *CommonSequenceTypes::Empty == *t2) { /* The static type of(at least) one of the operands could not * be narrowed further, so we do the operator * lookup at runtime. */ return AtomicComparator::Ptr(); } const AtomicComparatorLocator::Ptr locator (static_cast(t1.data())->comparatorLocator()); if(!locator) { if(issueError) { context->error(QtXmlPatterns::tr("No comparisons can be done involving the type %1.") .arg(formatType(context->namePool(), t1)), errorCode, static_cast(this)->actualReflection()); } return AtomicComparator::Ptr(); } const AtomicComparator::Ptr comp(static_cast(t2.data())->accept(locator, operatorID(), static_cast(this)->actualReflection())); if(comp) return comp; else if(issueError) { context->error(QtXmlPatterns::tr("Operator %1 is not available between atomic values of type %2 and %3.") .arg(formatKeyword(AtomicComparator::displayName(operatorID(), comparisonType)), formatType(context->namePool(), t1), formatType(context->namePool(), t2)), errorCode, static_cast(this)->actualReflection()); } return AtomicComparator::Ptr(); } template void ComparisonPlatform:: prepareComparison(const AtomicComparator::Ptr &c) { m_comparator = c; }