/************************************************************************ ** ** @file compatibility.h ** @author Roman Telezhynskyi ** @date 16 1, 2020 ** ** @brief ** @copyright ** This source code is part of the Valentina project, a pattern making ** program, whose allow create and modeling patterns of clothing. ** Copyright (C) 2020 Valentina project ** All Rights Reserved. ** ** Valentina 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 3 of the License, or ** (at your option) any later version. ** ** Valentina 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 Valentina. If not, see . ** *************************************************************************/ #ifndef COMPATIBILITY_H #define COMPATIBILITY_H #include #include #include class QPointF; // Contains helpful methods to hide version dependent code. It can be deprecation of method or change in API //--------------------------------------------------------------------------------------------------------------------- template class Cont> inline const T& ConstFirst (const Cont &container) { #if QT_VERSION >= QT_VERSION_CHECK(5, 6, 0) return container.constFirst(); #else return container.first(); // clazy:exclude=detaching-temporary #endif } //--------------------------------------------------------------------------------------------------------------------- template inline const T& ConstFirst (const C &container) { #if QT_VERSION >= QT_VERSION_CHECK(5, 6, 0) return container.constFirst(); #else return container.first(); // clazy:exclude=detaching-temporary #endif } //--------------------------------------------------------------------------------------------------------------------- template class Cont> inline const T& ConstLast (const Cont &container) { #if QT_VERSION >= QT_VERSION_CHECK(5, 6, 0) return container.constLast(); #else return container.last(); // clazy:exclude=detaching-temporary #endif } //--------------------------------------------------------------------------------------------------------------------- template inline const T& ConstLast (const C &container) { #if QT_VERSION >= QT_VERSION_CHECK(5, 6, 0) return container.constLast(); #else return container.last(); // clazy:exclude=detaching-temporary #endif } //--------------------------------------------------------------------------------------------------------------------- template inline typename T::IntersectType Intersects(const T &l1, const T &l2, QPointF *intersectionPoint) { #if QT_VERSION >= QT_VERSION_CHECK(5, 14, 0) return l1.intersects(l2, intersectionPoint); #else return l1.intersect(l2, intersectionPoint); #endif } //--------------------------------------------------------------------------------------------------------------------- template class C> inline QList ConvertToList(const C &container) { #if QT_VERSION >= QT_VERSION_CHECK(5, 14, 0) return QList(container.begin(), container.end()); #else return container.toList(); #endif } //--------------------------------------------------------------------------------------------------------------------- template class C> inline QSet ConvertToSet(const C &container) { #if QT_VERSION >= QT_VERSION_CHECK(5, 14, 0) return QSet(container.begin(), container.end()); #else return container.toSet(); #endif } //--------------------------------------------------------------------------------------------------------------------- template inline QSet ConvertToSet(const C &container) { #if QT_VERSION >= QT_VERSION_CHECK(5, 14, 0) return QSet(container.begin(), container.end()); #else return container.toSet(); #endif } //--------------------------------------------------------------------------------------------------------------------- template class C> inline QVector ConvertToVector(const C &container) { #if QT_VERSION >= QT_VERSION_CHECK(5, 14, 0) return QVector(container.begin(), container.end()); #else return container.toVector(); #endif } //--------------------------------------------------------------------------------------------------------------------- template inline QVector ConvertToVector(const QSet &container) { #if QT_VERSION >= QT_VERSION_CHECK(5, 14, 0) return QVector(container.begin(), container.end()); #else return container.toList().toVector(); #endif } //--------------------------------------------------------------------------------------------------------------------- template inline void SwapItemsAt(T &container, int i, int j) { #if QT_VERSION >= QT_VERSION_CHECK(5, 13, 0) container.swapItemsAt(i, j); #else container.swap(i, j); #endif } //--------------------------------------------------------------------------------------------------------------------- template inline void Move(T &vector, int from, int to) { #if QT_VERSION < QT_VERSION_CHECK(5, 6, 0) Q_ASSERT_X(from >= 0 && from < vector.size(), "QVector::move(int,int)", "'from' is out-of-range"); Q_ASSERT_X(to >= 0 && to < vector.size(), "QVector::move(int,int)", "'to' is out-of-range"); if (from == to) // don't detach when no-op { return; } T::iterator b = vector.begin(); from < to ? std::rotate(b + from, b + from + 1, b + to + 1): std::rotate(b + to, b + from, b + from + 1); #else vector.move(from, to); #endif // QT_VERSION < QT_VERSION_CHECK(5, 6, 0) } //--------------------------------------------------------------------------------------------------------------------- template inline void AppendTo(Cont &container, const Input &input) { #if QT_VERSION >= QT_VERSION_CHECK(5, 5, 0) container.append(input); #else for (auto &item : input) { container.append(item); } #endif // QT_VERSION >= QT_VERSION_CHECK(5, 5, 0) } #endif // COMPATIBILITY_H