• 大漠插件（二、Qt使用插件时注意事项）

    本章目的

            在上篇已经注册完毕大漠，那么怎么使用大漠来制作脚本，我选择了我最熟悉的Qt来开发，毕竟只是小软件，用脚本或者c++都差不了多少。本章就是开发途中的一些坑。

            本人开发环境是 win11 64、Qt 5.15.2安装了5.10.0的msvc2015 32开发套件、vs2022安装了v143开发套件。

    开发的坑

    一 、使用32位开发套件

    64位是不行的，必须使用32位开发套件 。否则会报错失败。我的32位环境就是上面的那些。

    二、Qt使用ActiveX时的设置

    在工程的pro文件中的 QT+=  后面加上 axcontainer，否则会报错“找不到 qaxobject.h” 

    三、生成dm的头文件和cpp文件 

    在Qt路径下，根据你的开发套件版本找 dumpcpp.exe。我装的是 5.10.0 的 msvc2015 32。所以我的路径是“C:\all\Qt\5.10.0\msvc2015\bin”。

    在 dumpcpp.exe 目录下运行 cmd 。

    dumpcpp.exe C:\all\freeDM3.1233\dm.dll

    将路径换成你的dm.dll 路径。运行此命令后，在 dumpcpp.exe 目录下会生成 dm.h、dm.cpp 两个文件。我们开发时就需要使用这两个文件。

    四、C3615 constexpr 函数“qCountLeadingZeroBits”不能生成常量表达式

    我们需要修改 qalgorithms.h 。 此处参考了别人的文章。

    因为我用的是 Qt 的msvc2015 开发套件，所以我的路径是 “C:\all\Qt\5.10.0\msvc2015\include\QtCore ”。在这里找到 qalgorithms.h。

    加入两行代码，修改四处即可。

    1. Q_DECL_CONSTEXPR Q_ALWAYS_INLINE uint qt_builtin_popcount(quint16 v) Q_DECL_NOTHROW
    2. {
    3.     return __builtin_popcount(v);
    4. }
    5. #define QALGORITHMS_USE_BUILTIN_POPCOUNTLL
    6. Q_DECL_CONSTEXPR Q_ALWAYS_INLINE uint qt_builtin_popcountll(quint64 v) Q_DECL_NOTHROW
    7. {
    8.     return __builtin_popcountll(v);
    9. }
    10. #elif defined(Q_CC_MSVC) && !defined(Q_OS_WINCE) && !defined(Q_PROCESSOR_ARM)
    11. #define QT_POPCOUNT_CONSTEXPR
    12. #define QT_POPCOUNT_RELAXED_CONSTEXPR   //增加的
    13. #define QT_HAS_BUILTIN_CTZ
    14. Q_ALWAYS_INLINE unsigned long qt_builtin_ctz(quint32 val)
    15. {
    16.     unsigned long result;
    17.     _BitScanForward(&result, val);
    18.     return result;
    19. }
    20. #define QT_HAS_BUILTIN_CLZ
    21. Q_ALWAYS_INLINE unsigned long qt_builtin_clz(quint32 val)
    22. {
    23.     unsigned long result;
    24.     _BitScanReverse(&result, val);
    1. #if Q_PROCESSOR_WORDSIZE == 8
    2. #define QALGORITHMS_USE_BUILTIN_POPCOUNTLL
    3. Q_ALWAYS_INLINE uint qt_builtin_popcountll(quint64 v) Q_DECL_NOTHROW
    4. {
    5.     return __popcnt64(v);
    6. }
    7. #endif // MSVC 64bit
    8. #endif // __AVX__ || __SSE4_2__ || __POPCNT__
    9.  
    10. #endif // MSVC
    11. #endif // QT_HAS_CONSTEXPR_BUILTINS
    12.  
    13. #ifndef QT_POPCOUNT_CONSTEXPR
    14. #define QT_POPCOUNT_CONSTEXPR Q_DECL_CONSTEXPR
    15. #define QT_POPCOUNT_RELAXED_CONSTEXPR Q_DECL_RELAXED_CONSTEXPR    //增加的
    16. #endif
    17.  
    18. } //namespace QAlgorithmsPrivate
    19.  
    20. Q_DECL_CONST_FUNCTION QT_POPCOUNT_CONSTEXPR inline uint qPopulationCount(quint32 v) Q_DECL_NOTHROW
    21. {
    22. #ifdef QALGORITHMS_USE_BUILTIN_POPCOUNT
    23.     return QAlgorithmsPrivate::qt_builtin_popcount(v);
    24. #else
    25.     // See http://graphics.stanford.edu/~seander/bithacks.html#CountBitsSetParallel
    26.     return
    27.         (((v      ) & 0xfff)    * Q_UINT64_C(0x1001001001001) & Q_UINT64_C(0x84210842108421)) % 0x1f +
    1. Q_DECL_RELAXED_CONSTEXPR inline uint qCountTrailingZeroBits(quint64 v) Q_DECL_NOTHROW
    2. {
    3. #if defined(QT_HAS_BUILTIN_CTZLL)
    4.     return v ? QAlgorithmsPrivate::qt_builtin_ctzll(v) : 64;
    5. #else
    6.     quint32 x = static_cast(v);
    7.     return x ? qCountTrailingZeroBits(x)
    8.              : 32 + qCountTrailingZeroBits(static_cast(v >> 32));
    9. #endif
    10. }
    11.  
    12. Q_DECL_RELAXED_CONSTEXPR inline uint qCountTrailingZeroBits(unsigned long v) Q_DECL_NOTHROW
    13. {
    14.     return qCountTrailingZeroBits(QIntegerForSizeof<long>::Unsigned(v));
    15. }
    16.  
    17. Q_DECL_RELAXED_CONSTEXPR inline uint qCountLeadingZeroBits(quint32 v) Q_DECL_NOTHROW
    18. {
    19. #if defined(QT_HAS_BUILTIN_CLZ)
    20.     return v ? QAlgorithmsPrivate::qt_builtin_clz(v) : 32U;
    21. #else
    22.     // Hacker's Delight, 2nd ed. Fig 5-16, p. 102
    23.     v = v | (v >> 1);
    24.     v = v | (v >> 2);
    25.     v = v | (v >> 4);
    26.     v = v | (v >> 8);
    27.     v = v | (v >> 16);
    28.     return qPopulationCount(~v);
    29. #endif
    30. }
    31.  
    32. //改为 QT_POPCOUNT_RELAXED_CONSTEXPR 
    33. QT_POPCOUNT_RELAXED_CONSTEXPR inline uint qCountLeadingZeroBits(quint8 v) Q_DECL_NOTHROW
    34. {
    35. #if defined(QT_HAS_BUILTIN_CLZ)
    36.     return v ? QAlgorithmsPrivate::qt_builtin_clz(v)-24U : 8U;
    37. #else
    38.     v = v | (v >> 1);
    39.     v = v | (v >> 2);
    40.     v = v | (v >> 4);
    41.     return qPopulationCount(static_cast(~v));
    42. #endif
    43. }
    44.  
    45. //改为 QT_POPCOUNT_RELAXED_CONSTEXPR 
    46. QT_POPCOUNT_RELAXED_CONSTEXPR inline uint qCountLeadingZeroBits(quint16 v) Q_DECL_NOTHROW
    47. {
    48. #if defined(QT_HAS_BUILTIN_CLZS)
    49.     return v ? QAlgorithmsPrivate::qt_builtin_clzs(v) : 16U;
    50. #else
    51.     v = v | (v >> 1);
    52.     v = v | (v >> 2);
    53.     v = v | (v >> 4);
    54.     v = v | (v >> 8);
    55.     return qPopulationCount(static_cast(~v));
    56. #endif
    57. }
    58.  
    59. //改为 QT_POPCOUNT_RELAXED_CONSTEXPR 
    60. QT_POPCOUNT_RELAXED_CONSTEXPR inline uint qCountLeadingZeroBits(quint64 v) Q_DECL_NOTHROW
    61. {
    62. #if defined(QT_HAS_BUILTIN_CLZLL)
    63.     return v ? QAlgorithmsPrivate::qt_builtin_clzll(v) : 64U;
    64. #else
    65.     v = v | (v >> 1);
    66.     v = v | (v >> 2);
    67.     v = v | (v >> 4);
    68.     v = v | (v >> 8);
    69.     v = v | (v >> 16);
    70.     v = v | (v >> 32);
    71.     return qPopulationCount(~v);
    72. #endif
    73. }
    74.  
    75. //改为 QT_POPCOUNT_RELAXED_CONSTEXPR 
    76. QT_POPCOUNT_RELAXED_CONSTEXPR inline uint qCountLeadingZeroBits(unsigned long v) Q_DECL_NOTHROW
    77. {
    78.     return qCountLeadingZeroBits(QIntegerForSizeof<long>::Unsigned(v));
    79. }
    80.  
    81. QT_WARNING_POP
    82. QT_END_NAMESPACE
    83.  
    84. #endif // QALGORITHMS_H

    修改完后的文件

    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 QtCore 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. #ifndef QALGORITHMS_H
    41. #define QALGORITHMS_H
    42.  
    43. #include 
    44.  
    45. #if defined(Q_CC_MSVC) && _MSC_VER > 1500
    46. #include 
    47. #endif
    48.  
    49. QT_BEGIN_NAMESPACE
    50. QT_WARNING_PUSH
    51. QT_WARNING_DISABLE_DEPRECATED
    52.  
    53. /*
    54.     Warning: The contents of QAlgorithmsPrivate is not a part of the public Qt API
    55.     and may be changed from version to version or even be completely removed.
    56. */
    57. namespace QAlgorithmsPrivate {
    58.  
    59. #if QT_DEPRECATED_SINCE(5, 2)
    60. template <typename RandomAccessIterator, typename T, typename LessThan>
    61. QT_DEPRECATED_X("Use std::sort") Q_OUTOFLINE_TEMPLATE void qSortHelper(RandomAccessIterator start, RandomAccessIterator end, const T &t, LessThan lessThan);
    62. template <typename RandomAccessIterator, typename T>
    63. QT_DEPRECATED_X("Use std::sort") inline void qSortHelper(RandomAccessIterator begin, RandomAccessIterator end, const T &dummy);
    64.  
    65. template <typename RandomAccessIterator, typename T, typename LessThan>
    66. QT_DEPRECATED_X("Use std::stable_sort") Q_OUTOFLINE_TEMPLATE void qStableSortHelper(RandomAccessIterator start, RandomAccessIterator end, const T &t, LessThan lessThan);
    67. template <typename RandomAccessIterator, typename T>
    68. QT_DEPRECATED_X("Use std::stable_sort") inline void qStableSortHelper(RandomAccessIterator, RandomAccessIterator, const T &);
    69.  
    70. template <typename RandomAccessIterator, typename T, typename LessThan>
    71. QT_DEPRECATED_X("Use std::lower_bound") Q_OUTOFLINE_TEMPLATE RandomAccessIterator qLowerBoundHelper(RandomAccessIterator begin, RandomAccessIterator end, const T &value, LessThan lessThan);
    72. template <typename RandomAccessIterator, typename T, typename LessThan>
    73. QT_DEPRECATED_X("Use std::upper_bound") Q_OUTOFLINE_TEMPLATE RandomAccessIterator qUpperBoundHelper(RandomAccessIterator begin, RandomAccessIterator end, const T &value, LessThan lessThan);
    74. template <typename RandomAccessIterator, typename T, typename LessThan>
    75. QT_DEPRECATED_X("Use std::binary_search") Q_OUTOFLINE_TEMPLATE RandomAccessIterator qBinaryFindHelper(RandomAccessIterator begin, RandomAccessIterator end, const T &value, LessThan lessThan);
    76. #endif // QT_DEPRECATED_SINCE(5, 2)
    77.  
    78. }
    79.  
    80. #if QT_DEPRECATED_SINCE(5, 2)
    81. template <typename InputIterator, typename OutputIterator>
    82. QT_DEPRECATED_X("Use std::copy") inline OutputIterator qCopy(InputIterator begin, InputIterator end, OutputIterator dest)
    83. {
    84.     while (begin != end)
    85.         *dest++ = *begin++;
    86.     return dest;
    87. }
    88.  
    89. template <typename BiIterator1, typename BiIterator2>
    90. QT_DEPRECATED_X("Use std::copy_backward") inline BiIterator2 qCopyBackward(BiIterator1 begin, BiIterator1 end, BiIterator2 dest)
    91. {
    92.     while (begin != end)
    93.         *--dest = *--end;
    94.     return dest;
    95. }
    96.  
    97. template <typename InputIterator1, typename InputIterator2>
    98. QT_DEPRECATED_X("Use std::equal") inline bool qEqual(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2)
    99. {
    100.     for (; first1 != last1; ++first1, ++first2)
    101.         if (!(*first1 == *first2))
    102.             return false;
    103.     return true;
    104. }
    105.  
    106. template <typename ForwardIterator, typename T>
    107. QT_DEPRECATED_X("Use std::fill") inline void qFill(ForwardIterator first, ForwardIterator last, const T &val)
    108. {
    109.     for (; first != last; ++first)
    110.         *first = val;
    111. }
    112.  
    113. template <typename Container, typename T>
    114. QT_DEPRECATED_X("Use std::fill") inline void qFill(Container &container, const T &val)
    115. {
    116.     qFill(container.begin(), container.end(), val);
    117. }
    118.  
    119. template <typename InputIterator, typename T>
    120. QT_DEPRECATED_X("Use std::find") inline InputIterator qFind(InputIterator first, InputIterator last, const T &val)
    121. {
    122.     while (first != last && !(*first == val))
    123.         ++first;
    124.     return first;
    125. }
    126.  
    127. template <typename Container, typename T>
    128. QT_DEPRECATED_X("Use std::find") inline typename Container::const_iterator qFind(const Container &container, const T &val)
    129. {
    130.     return qFind(container.constBegin(), container.constEnd(), val);
    131. }
    132.  
    133. template <typename InputIterator, typename T, typename Size>
    134. QT_DEPRECATED_X("Use std::count") inline void qCount(InputIterator first, InputIterator last, const T &value, Size &n)
    135. {
    136.     for (; first != last; ++first)
    137.         if (*first == value)
    138.             ++n;
    139. }
    140.  
    141. template <typename Container, typename T, typename Size>
    142. QT_DEPRECATED_X("Use std::count") inline void qCount(const Container &container, const T &value, Size &n)
    143. {
    144.     qCount(container.constBegin(), container.constEnd(), value, n);
    145. }
    146.  
    147. #ifdef Q_QDOC
    148. typedef void* LessThan;
    149. template <typename T> LessThan qLess();
    150. template <typename T> LessThan qGreater();
    151. #else
    152. template <typename T>
    153. class QT_DEPRECATED_X("Use std::less") qLess
    154. {
    155. public:
    156.     inline bool operator()(const T &t1, const T &t2) const
    157.     {
    158.         return (t1 < t2);
    159.     }
    160. };
    161.  
    162. template <typename T>
    163. class QT_DEPRECATED_X("Use std::greater") qGreater
    164. {
    165. public:
    166.     inline bool operator()(const T &t1, const T &t2) const
    167.     {
    168.         return (t2 < t1);
    169.     }
    170. };
    171. #endif
    172.  
    173. template <typename RandomAccessIterator>
    174. QT_DEPRECATED_X("Use std::sort") inline void qSort(RandomAccessIterator start, RandomAccessIterator end)
    175. {
    176.     if (start != end)
    177.         QAlgorithmsPrivate::qSortHelper(start, end, *start);
    178. }
    179.  
    180. template <typename RandomAccessIterator, typename LessThan>
    181. QT_DEPRECATED_X("Use std::sort") inline void qSort(RandomAccessIterator start, RandomAccessIterator end, LessThan lessThan)
    182. {
    183.     if (start != end)
    184.         QAlgorithmsPrivate::qSortHelper(start, end, *start, lessThan);
    185. }
    186.  
    187. template<typename Container>
    188. QT_DEPRECATED_X("Use std::sort") inline void qSort(Container &c)
    189. {
    190. #ifdef Q_CC_BOR
    191.     // Work around Borland 5.5 optimizer bug
    192.     c.detach();
    193. #endif
    194.     if (!c.empty())
    195.         QAlgorithmsPrivate::qSortHelper(c.begin(), c.end(), *c.begin());
    196. }
    197.  
    198. template <typename RandomAccessIterator>
    199. QT_DEPRECATED_X("Use std::stable_sort") inline void qStableSort(RandomAccessIterator start, RandomAccessIterator end)
    200. {
    201.     if (start != end)
    202.         QAlgorithmsPrivate::qStableSortHelper(start, end, *start);
    203. }
    204.  
    205. template <typename RandomAccessIterator, typename LessThan>
    206. QT_DEPRECATED_X("Use std::stable_sort") inline void qStableSort(RandomAccessIterator start, RandomAccessIterator end, LessThan lessThan)
    207. {
    208.     if (start != end)
    209.         QAlgorithmsPrivate::qStableSortHelper(start, end, *start, lessThan);
    210. }
    211.  
    212. template<typename Container>
    213. QT_DEPRECATED_X("Use std::stable_sort") inline void qStableSort(Container &c)
    214. {
    215. #ifdef Q_CC_BOR
    216.     // Work around Borland 5.5 optimizer bug
    217.     c.detach();
    218. #endif
    219.     if (!c.empty())
    220.         QAlgorithmsPrivate::qStableSortHelper(c.begin(), c.end(), *c.begin());
    221. }
    222.  
    223. template <typename RandomAccessIterator, typename T>
    224. QT_DEPRECATED_X("Use std::lower_bound") Q_OUTOFLINE_TEMPLATE RandomAccessIterator qLowerBound(RandomAccessIterator begin, RandomAccessIterator end, const T &value)
    225. {
    226.     // Implementation is duplicated from QAlgorithmsPrivate to keep existing code
    227.     // compiling. We have to allow using *begin and value with different types,
    228.     // and then implementing operator< for those types.
    229.     RandomAccessIterator middle;
    230.     int n = end - begin;
    231.     int half;
    232.  
    233.     while (n > 0) {
    234.         half = n >> 1;
    235.         middle = begin + half;
    236.         if (*middle < value) {
    237.             begin = middle + 1;
    238.             n -= half + 1;
    239.         } else {
    240.             n = half;
    241.         }
    242.     }
    243.     return begin;
    244. }
    245.  
    246. template <typename RandomAccessIterator, typename T, typename LessThan>
    247. QT_DEPRECATED_X("Use std::lower_bound") Q_OUTOFLINE_TEMPLATE RandomAccessIterator qLowerBound(RandomAccessIterator begin, RandomAccessIterator end, const T &value, LessThan lessThan)
    248. {
    249.     return QAlgorithmsPrivate::qLowerBoundHelper(begin, end, value, lessThan);
    250. }
    251.  
    252. template <typename Container, typename T>
    253. QT_DEPRECATED_X("Use std::lower_bound") Q_OUTOFLINE_TEMPLATE typename Container::const_iterator qLowerBound(const Container &container, const T &value)
    254. {
    255.     return QAlgorithmsPrivate::qLowerBoundHelper(container.constBegin(), container.constEnd(), value, qLess());
    256. }
    257.  
    258. template <typename RandomAccessIterator, typename T>
    259. QT_DEPRECATED_X("Use std::upper_bound") Q_OUTOFLINE_TEMPLATE RandomAccessIterator qUpperBound(RandomAccessIterator begin, RandomAccessIterator end, const T &value)
    260. {
    261.     // Implementation is duplicated from QAlgorithmsPrivate.
    262.     RandomAccessIterator middle;
    263.     int n = end - begin;
    264.     int half;
    265.  
    266.     while (n > 0) {
    267.         half = n >> 1;
    268.         middle = begin + half;
    269.         if (value < *middle) {
    270.             n = half;
    271.         } else {
    272.             begin = middle + 1;
    273.             n -= half + 1;
    274.         }
    275.     }
    276.     return begin;
    277. }
    278.  
    279. template <typename RandomAccessIterator, typename T, typename LessThan>
    280. QT_DEPRECATED_X("Use std::upper_bound") Q_OUTOFLINE_TEMPLATE RandomAccessIterator qUpperBound(RandomAccessIterator begin, RandomAccessIterator end, const T &value, LessThan lessThan)
    281. {
    282.     return QAlgorithmsPrivate::qUpperBoundHelper(begin, end, value, lessThan);
    283. }
    284.  
    285. template <typename Container, typename T>
    286. QT_DEPRECATED_X("Use std::upper_bound") Q_OUTOFLINE_TEMPLATE typename Container::const_iterator qUpperBound(const Container &container, const T &value)
    287. {
    288.     return QAlgorithmsPrivate::qUpperBoundHelper(container.constBegin(), container.constEnd(), value, qLess());
    289. }
    290.  
    291. template <typename RandomAccessIterator, typename T>
    292. QT_DEPRECATED_X("Use std::binary_search") Q_OUTOFLINE_TEMPLATE RandomAccessIterator qBinaryFind(RandomAccessIterator begin, RandomAccessIterator end, const T &value)
    293. {
    294.     // Implementation is duplicated from QAlgorithmsPrivate.
    295.     RandomAccessIterator it = qLowerBound(begin, end, value);
    296.  
    297.     if (it == end || value < *it)
    298.         return end;
    299.  
    300.     return it;
    301. }
    302.  
    303. template <typename RandomAccessIterator, typename T, typename LessThan>
    304. QT_DEPRECATED_X("Use std::binary_search") Q_OUTOFLINE_TEMPLATE RandomAccessIterator qBinaryFind(RandomAccessIterator begin, RandomAccessIterator end, const T &value, LessThan lessThan)
    305. {
    306.     return QAlgorithmsPrivate::qBinaryFindHelper(begin, end, value, lessThan);
    307. }
    308.  
    309. template <typename Container, typename T>
    310. QT_DEPRECATED_X("Use std::binary_search") Q_OUTOFLINE_TEMPLATE typename Container::const_iterator qBinaryFind(const Container &container, const T &value)
    311. {
    312.     return QAlgorithmsPrivate::qBinaryFindHelper(container.constBegin(), container.constEnd(), value, qLess());
    313. }
    314. #endif // QT_DEPRECATED_SINCE(5, 2)
    315.  
    316. template <typename ForwardIterator>
    317. Q_OUTOFLINE_TEMPLATE void qDeleteAll(ForwardIterator begin, ForwardIterator end)
    318. {
    319.     while (begin != end) {
    320.         delete *begin;
    321.         ++begin;
    322.     }
    323. }
    324.  
    325. template <typename Container>
    326. inline void qDeleteAll(const Container &c)
    327. {
    328.     qDeleteAll(c.begin(), c.end());
    329. }
    330.  
    331. /*
    332.     Warning: The contents of QAlgorithmsPrivate is not a part of the public Qt API
    333.     and may be changed from version to version or even be completely removed.
    334. */
    335. namespace QAlgorithmsPrivate {
    336.  
    337. #if QT_DEPRECATED_SINCE(5, 2)
    338.  
    339. template <typename RandomAccessIterator, typename T, typename LessThan>
    340. QT_DEPRECATED_X("Use std::sort") Q_OUTOFLINE_TEMPLATE void qSortHelper(RandomAccessIterator start, RandomAccessIterator end, const T &t, LessThan lessThan)
    341. {
    342. top:
    343.     int span = int(end - start);
    344.     if (span < 2)
    345.         return;
    346.  
    347.     --end;
    348.     RandomAccessIterator low = start, high = end - 1;
    349.     RandomAccessIterator pivot = start + span / 2;
    350.  
    351.     if (lessThan(*end, *start))
    352.         qSwap(*end, *start);
    353.     if (span == 2)
    354.         return;
    355.  
    356.     if (lessThan(*pivot, *start))
    357.         qSwap(*pivot, *start);
    358.     if (lessThan(*end, *pivot))
    359.         qSwap(*end, *pivot);
    360.     if (span == 3)
    361.         return;
    362.  
    363.     qSwap(*pivot, *end);
    364.  
    365.     while (low < high) {
    366.         while (low < high && lessThan(*low, *end))
    367.             ++low;
    368.  
    369.         while (high > low && lessThan(*end, *high))
    370.             --high;
    371.  
    372.         if (low < high) {
    373.             qSwap(*low, *high);
    374.             ++low;
    375.             --high;
    376.         } else {
    377.             break;
    378.         }
    379.     }
    380.  
    381.     if (lessThan(*low, *end))
    382.         ++low;
    383.  
    384.     qSwap(*end, *low);
    385.     qSortHelper(start, low, t, lessThan);
    386.  
    387.     start = low + 1;
    388.     ++end;
    389.     goto top;
    390. }
    391.  
    392. template <typename RandomAccessIterator, typename T>
    393. QT_DEPRECATED_X("Use std::sort") inline void qSortHelper(RandomAccessIterator begin, RandomAccessIterator end, const T &dummy)
    394. {
    395.     qSortHelper(begin, end, dummy, qLess());
    396. }
    397.  
    398. template <typename RandomAccessIterator>
    399. QT_DEPRECATED_X("Use std::reverse") Q_OUTOFLINE_TEMPLATE void qReverse(RandomAccessIterator begin, RandomAccessIterator end)
    400. {
    401.     --end;
    402.     while (begin < end)
    403.         qSwap(*begin++, *end--);
    404. }
    405.  
    406. template <typename RandomAccessIterator>
    407. QT_DEPRECATED_X("Use std::rotate") Q_OUTOFLINE_TEMPLATE void qRotate(RandomAccessIterator begin, RandomAccessIterator middle, RandomAccessIterator end)
    408. {
    409.     qReverse(begin, middle);
    410.     qReverse(middle, end);
    411.     qReverse(begin, end);
    412. }
    413.  
    414. template <typename RandomAccessIterator, typename T, typename LessThan>
    415. QT_DEPRECATED_X("Use std::merge") Q_OUTOFLINE_TEMPLATE void qMerge(RandomAccessIterator begin, RandomAccessIterator pivot, RandomAccessIterator end, T &t, LessThan lessThan)
    416. {
    417.     const int len1 = pivot - begin;
    418.     const int len2 = end - pivot;
    419.  
    420.     if (len1 == 0 || len2 == 0)
    421.         return;
    422.  
    423.     if (len1 + len2 == 2) {
    424.         if (lessThan(*(begin + 1), *(begin)))
    425.             qSwap(*begin, *(begin + 1));
    426.         return;
    427.     }
    428.  
    429.     RandomAccessIterator firstCut;
    430.     RandomAccessIterator secondCut;
    431.     int len2Half;
    432.     if (len1 > len2) {
    433.         const int len1Half = len1 / 2;
    434.         firstCut = begin + len1Half;
    435.         secondCut = qLowerBound(pivot, end, *firstCut, lessThan);
    436.         len2Half = secondCut - pivot;
    437.     } else {
    438.         len2Half = len2 / 2;
    439.         secondCut = pivot + len2Half;
    440.         firstCut = qUpperBound(begin, pivot, *secondCut, lessThan);
    441.     }
    442.  
    443.     qRotate(firstCut, pivot, secondCut);
    444.     const RandomAccessIterator newPivot = firstCut + len2Half;
    445.     qMerge(begin, firstCut, newPivot, t, lessThan);
    446.     qMerge(newPivot, secondCut, end, t, lessThan);
    447. }
    448.  
    449. template <typename RandomAccessIterator, typename T, typename LessThan>
    450. QT_DEPRECATED_X("Use std::stable_sort") Q_OUTOFLINE_TEMPLATE void qStableSortHelper(RandomAccessIterator begin, RandomAccessIterator end, const T &t, LessThan lessThan)
    451. {
    452.     const int span = end - begin;
    453.     if (span < 2)
    454.        return;
    455.  
    456.     const RandomAccessIterator middle = begin + span / 2;
    457.     qStableSortHelper(begin, middle, t, lessThan);
    458.     qStableSortHelper(middle, end, t, lessThan);
    459.     qMerge(begin, middle, end, t, lessThan);
    460. }
    461.  
    462. template <typename RandomAccessIterator, typename T>
    463. QT_DEPRECATED_X("Use std::stable_sort") inline void qStableSortHelper(RandomAccessIterator begin, RandomAccessIterator end, const T &dummy)
    464. {
    465.     qStableSortHelper(begin, end, dummy, qLess());
    466. }
    467.  
    468. template <typename RandomAccessIterator, typename T, typename LessThan>
    469. QT_DEPRECATED_X("Use std::lower_bound") Q_OUTOFLINE_TEMPLATE RandomAccessIterator qLowerBoundHelper(RandomAccessIterator begin, RandomAccessIterator end, const T &value, LessThan lessThan)
    470. {
    471.     RandomAccessIterator middle;
    472.     int n = int(end - begin);
    473.     int half;
    474.  
    475.     while (n > 0) {
    476.         half = n >> 1;
    477.         middle = begin + half;
    478.         if (lessThan(*middle, value)) {
    479.             begin = middle + 1;
    480.             n -= half + 1;
    481.         } else {
    482.             n = half;
    483.         }
    484.     }
    485.     return begin;
    486. }
    487.  
    488.  
    489. template <typename RandomAccessIterator, typename T, typename LessThan>
    490. QT_DEPRECATED_X("Use std::upper_bound") Q_OUTOFLINE_TEMPLATE RandomAccessIterator qUpperBoundHelper(RandomAccessIterator begin, RandomAccessIterator end, const T &value, LessThan lessThan)
    491. {
    492.     RandomAccessIterator middle;
    493.     int n = end - begin;
    494.     int half;
    495.  
    496.     while (n > 0) {
    497.         half = n >> 1;
    498.         middle = begin + half;
    499.         if (lessThan(value, *middle)) {
    500.             n = half;
    501.         } else {
    502.             begin = middle + 1;
    503.             n -= half + 1;
    504.         }
    505.     }
    506.     return begin;
    507. }
    508.  
    509. template <typename RandomAccessIterator, typename T, typename LessThan>
    510. QT_DEPRECATED_X("Use std::binary_search") Q_OUTOFLINE_TEMPLATE RandomAccessIterator qBinaryFindHelper(RandomAccessIterator begin, RandomAccessIterator end, const T &value, LessThan lessThan)
    511. {
    512.     RandomAccessIterator it = qLowerBoundHelper(begin, end, value, lessThan);
    513.  
    514.     if (it == end || lessThan(value, *it))
    515.         return end;
    516.  
    517.     return it;
    518. }
    519.  
    520. #endif // QT_DEPRECATED_SINCE(5, 2)
    521.  
    522. #ifdef Q_CC_CLANG
    523. // Clang had a bug where __builtin_ctz/clz/popcount were not marked as constexpr.
    524. #  if (defined __apple_build_version__ &&  __clang_major__ >= 7) || (Q_CC_CLANG >= 307)
    525. #    define QT_HAS_CONSTEXPR_BUILTINS
    526. #  endif
    527. #elif defined(Q_CC_MSVC) && !defined(Q_CC_INTEL) && !defined(Q_OS_WINCE) && !defined(Q_PROCESSOR_ARM)
    528. #  define QT_HAS_CONSTEXPR_BUILTINS
    529. #elif defined(Q_CC_GNU)
    530. #  define QT_HAS_CONSTEXPR_BUILTINS
    531. #endif
    532.  
    533. #if defined QT_HAS_CONSTEXPR_BUILTINS
    534. #if defined(Q_CC_GNU) || defined(Q_CC_CLANG)
    535. #  define QT_HAS_BUILTIN_CTZS
    536. Q_DECL_CONSTEXPR Q_ALWAYS_INLINE uint qt_builtin_ctzs(quint16 v) Q_DECL_NOTHROW
    537. {
    538. #  if QT_HAS_BUILTIN(__builtin_ctzs)
    539.     return __builtin_ctzs(v);
    540. #  else
    541.     return __builtin_ctz(v);
    542. #  endif
    543. }
    544. #define QT_HAS_BUILTIN_CLZS
    545. Q_DECL_CONSTEXPR Q_ALWAYS_INLINE uint qt_builtin_clzs(quint16 v) Q_DECL_NOTHROW
    546. {
    547. #  if QT_HAS_BUILTIN(__builtin_clzs)
    548.     return __builtin_clzs(v);
    549. #  else
    550.     return __builtin_clz(v) - 16U;
    551. #  endif
    552. }
    553. #define QT_HAS_BUILTIN_CTZ
    554. Q_DECL_CONSTEXPR Q_ALWAYS_INLINE uint qt_builtin_ctz(quint32 v) Q_DECL_NOTHROW
    555. {
    556.     return __builtin_ctz(v);
    557. }
    558. #define QT_HAS_BUILTIN_CLZ
    559. Q_DECL_CONSTEXPR Q_ALWAYS_INLINE uint qt_builtin_clz(quint32 v) Q_DECL_NOTHROW
    560. {
    561.     return __builtin_clz(v);
    562. }
    563. #define QT_HAS_BUILTIN_CTZLL
    564. Q_DECL_CONSTEXPR Q_ALWAYS_INLINE uint qt_builtin_ctzll(quint64 v) Q_DECL_NOTHROW
    565. {
    566.     return __builtin_ctzll(v);
    567. }
    568. #define QT_HAS_BUILTIN_CLZLL
    569. Q_DECL_CONSTEXPR Q_ALWAYS_INLINE uint qt_builtin_clzll(quint64 v) Q_DECL_NOTHROW
    570. {
    571.     return __builtin_clzll(v);
    572. }
    573. #define QALGORITHMS_USE_BUILTIN_POPCOUNT
    574. Q_DECL_CONSTEXPR Q_ALWAYS_INLINE uint qt_builtin_popcount(quint32 v) Q_DECL_NOTHROW
    575. {
    576.     return __builtin_popcount(v);
    577. }
    578. Q_DECL_CONSTEXPR Q_ALWAYS_INLINE uint qt_builtin_popcount(quint8 v) Q_DECL_NOTHROW
    579. {
    580.     return __builtin_popcount(v);
    581. }
    582. Q_DECL_CONSTEXPR Q_ALWAYS_INLINE uint qt_builtin_popcount(quint16 v) Q_DECL_NOTHROW
    583. {
    584.     return __builtin_popcount(v);
    585. }
    586. #define QALGORITHMS_USE_BUILTIN_POPCOUNTLL
    587. Q_DECL_CONSTEXPR Q_ALWAYS_INLINE uint qt_builtin_popcountll(quint64 v) Q_DECL_NOTHROW
    588. {
    589.     return __builtin_popcountll(v);
    590. }
    591. #elif defined(Q_CC_MSVC) && !defined(Q_OS_WINCE) && !defined(Q_PROCESSOR_ARM)
    592. #define QT_POPCOUNT_CONSTEXPR
    593. #define QT_POPCOUNT_RELAXED_CONSTEXPR
    594. #define QT_HAS_BUILTIN_CTZ
    595. Q_ALWAYS_INLINE unsigned long qt_builtin_ctz(quint32 val)
    596. {
    597.     unsigned long result;
    598.     _BitScanForward(&result, val);
    599.     return result;
    600. }
    601. #define QT_HAS_BUILTIN_CLZ
    602. Q_ALWAYS_INLINE unsigned long qt_builtin_clz(quint32 val)
    603. {
    604.     unsigned long result;
    605.     _BitScanReverse(&result, val);
    606.     // Now Invert the result: clz will count *down* from the msb to the lsb, so the msb index is 31
    607.     // and the lsb index is 0. The result for the index when counting up: msb index is 0 (because it
    608.     // starts there), and the lsb index is 31.
    609.     result ^= sizeof(quint32) * 8 - 1;
    610.     return result;
    611. }
    612. #if Q_PROCESSOR_WORDSIZE == 8
    613. // These are only defined for 64bit builds.
    614. #define QT_HAS_BUILTIN_CTZLL
    615. Q_ALWAYS_INLINE unsigned long qt_builtin_ctzll(quint64 val)
    616. {
    617.     unsigned long result;
    618.     _BitScanForward64(&result, val);
    619.     return result;
    620. }
    621. // MSVC calls it _BitScanReverse and returns the carry flag, which we don't need
    622. #define QT_HAS_BUILTIN_CLZLL
    623. Q_ALWAYS_INLINE unsigned long qt_builtin_clzll(quint64 val)
    624. {
    625.     unsigned long result;
    626.     _BitScanReverse64(&result, val);
    627.     // see qt_builtin_clz
    628.     result ^= sizeof(quint64) * 8 - 1;
    629.     return result;
    630. }
    631. #endif // MSVC 64bit
    632. #  define QT_HAS_BUILTIN_CTZS
    633. Q_ALWAYS_INLINE uint qt_builtin_ctzs(quint16 v) Q_DECL_NOTHROW
    634. {
    635.     return qt_builtin_ctz(v);
    636. }
    637. #define QT_HAS_BUILTIN_CLZS
    638. Q_ALWAYS_INLINE uint qt_builtin_clzs(quint16 v) Q_DECL_NOTHROW
    639. {
    640.     return qt_builtin_clz(v) - 16U;
    641. }
    642.  
    643. // Neither MSVC nor the Intel compiler define a macro for the POPCNT processor
    644. // feature, so we're using either the SSE4.2 or the AVX macro as a proxy (Clang
    645. // does define the macro). It's incorrect for two reasons:
    646. // 1. It's a separate bit in CPUID, so a processor could implement SSE4.2 and
    647. //    not POPCNT, but that's unlikely to happen.
    648. // 2. There are processors that support POPCNT but not AVX (Intel Nehalem
    649. //    architecture), but unlike the other compilers, MSVC has no option
    650. //    to generate code for those processors.
    651. // So it's an acceptable compromise.
    652. #if defined(__AVX__) || defined(__SSE4_2__) || defined(__POPCNT__)
    653. #define QALGORITHMS_USE_BUILTIN_POPCOUNT
    654. Q_ALWAYS_INLINE uint qt_builtin_popcount(quint32 v) Q_DECL_NOTHROW
    655. {
    656.     return __popcnt(v);
    657. }
    658. Q_ALWAYS_INLINE uint qt_builtin_popcount(quint8 v) Q_DECL_NOTHROW
    659. {
    660.     return __popcnt16(v);
    661. }
    662. Q_ALWAYS_INLINE uint qt_builtin_popcount(quint16 v) Q_DECL_NOTHROW
    663. {
    664.     return __popcnt16(v);
    665. }
    666. #if Q_PROCESSOR_WORDSIZE == 8
    667. #define QALGORITHMS_USE_BUILTIN_POPCOUNTLL
    668. Q_ALWAYS_INLINE uint qt_builtin_popcountll(quint64 v) Q_DECL_NOTHROW
    669. {
    670.     return __popcnt64(v);
    671. }
    672. #endif // MSVC 64bit
    673. #endif // __AVX__ || __SSE4_2__ || __POPCNT__
    674.  
    675. #endif // MSVC
    676. #endif // QT_HAS_CONSTEXPR_BUILTINS
    677.  
    678. #ifndef QT_POPCOUNT_CONSTEXPR
    679. #define QT_POPCOUNT_CONSTEXPR Q_DECL_CONSTEXPR
    680. #define QT_POPCOUNT_RELAXED_CONSTEXPR Q_DECL_RELAXED_CONSTEXPR
    681. #endif
    682.  
    683. } //namespace QAlgorithmsPrivate
    684.  
    685. Q_DECL_CONST_FUNCTION QT_POPCOUNT_CONSTEXPR inline uint qPopulationCount(quint32 v) Q_DECL_NOTHROW
    686. {
    687. #ifdef QALGORITHMS_USE_BUILTIN_POPCOUNT
    688.     return QAlgorithmsPrivate::qt_builtin_popcount(v);
    689. #else
    690.     // See http://graphics.stanford.edu/~seander/bithacks.html#CountBitsSetParallel
    691.     return
    692.         (((v      ) & 0xfff)    * Q_UINT64_C(0x1001001001001) & Q_UINT64_C(0x84210842108421)) % 0x1f +
    693.         (((v >> 12) & 0xfff)    * Q_UINT64_C(0x1001001001001) & Q_UINT64_C(0x84210842108421)) % 0x1f +
    694.         (((v >> 24) & 0xfff)    * Q_UINT64_C(0x1001001001001) & Q_UINT64_C(0x84210842108421)) % 0x1f;
    695. #endif
    696. }
    697.  
    698. Q_DECL_CONST_FUNCTION QT_POPCOUNT_CONSTEXPR inline uint qPopulationCount(quint8 v) Q_DECL_NOTHROW
    699. {
    700. #ifdef QALGORITHMS_USE_BUILTIN_POPCOUNT
    701.     return QAlgorithmsPrivate::qt_builtin_popcount(v);
    702. #else
    703.     return
    704.         (((v      ) & 0xfff)    * Q_UINT64_C(0x1001001001001) & Q_UINT64_C(0x84210842108421)) % 0x1f;
    705. #endif
    706. }
    707.  
    708. Q_DECL_CONST_FUNCTION QT_POPCOUNT_CONSTEXPR inline uint qPopulationCount(quint16 v) Q_DECL_NOTHROW
    709. {
    710. #ifdef QALGORITHMS_USE_BUILTIN_POPCOUNT
    711.     return QAlgorithmsPrivate::qt_builtin_popcount(v);
    712. #else
    713.     return
    714.         (((v      ) & 0xfff)    * Q_UINT64_C(0x1001001001001) & Q_UINT64_C(0x84210842108421)) % 0x1f +
    715.         (((v >> 12) & 0xfff)    * Q_UINT64_C(0x1001001001001) & Q_UINT64_C(0x84210842108421)) % 0x1f;
    716. #endif
    717. }
    718.  
    719. Q_DECL_CONST_FUNCTION QT_POPCOUNT_CONSTEXPR inline uint qPopulationCount(quint64 v) Q_DECL_NOTHROW
    720. {
    721. #ifdef QALGORITHMS_USE_BUILTIN_POPCOUNTLL
    722.     return QAlgorithmsPrivate::qt_builtin_popcountll(v);
    723. #else
    724.     return
    725.         (((v      ) & 0xfff)    * Q_UINT64_C(0x1001001001001) & Q_UINT64_C(0x84210842108421)) % 0x1f +
    726.         (((v >> 12) & 0xfff)    * Q_UINT64_C(0x1001001001001) & Q_UINT64_C(0x84210842108421)) % 0x1f +
    727.         (((v >> 24) & 0xfff)    * Q_UINT64_C(0x1001001001001) & Q_UINT64_C(0x84210842108421)) % 0x1f +
    728.         (((v >> 36) & 0xfff)    * Q_UINT64_C(0x1001001001001) & Q_UINT64_C(0x84210842108421)) % 0x1f +
    729.         (((v >> 48) & 0xfff)    * Q_UINT64_C(0x1001001001001) & Q_UINT64_C(0x84210842108421)) % 0x1f +
    730.         (((v >> 60) & 0xfff)    * Q_UINT64_C(0x1001001001001) & Q_UINT64_C(0x84210842108421)) % 0x1f;
    731. #endif
    732. }
    733.  
    734. Q_DECL_CONST_FUNCTION QT_POPCOUNT_CONSTEXPR inline uint qPopulationCount(long unsigned int v) Q_DECL_NOTHROW
    735. {
    736.     return qPopulationCount(static_cast(v));
    737. }
    738.  
    739. #if defined(Q_CC_GNU) && !defined(Q_CC_CLANG)
    740. #undef QALGORITHMS_USE_BUILTIN_POPCOUNT
    741. #endif
    742. #undef QT_POPCOUNT_CONSTEXPR
    743.  
    744. Q_DECL_RELAXED_CONSTEXPR inline uint qCountTrailingZeroBits(quint32 v) Q_DECL_NOTHROW
    745. {
    746. #if defined(QT_HAS_BUILTIN_CTZ)
    747.     return v ? QAlgorithmsPrivate::qt_builtin_ctz(v) : 32U;
    748. #else
    749.     // see http://graphics.stanford.edu/~seander/bithacks.html#ZerosOnRightParallel
    750.     unsigned int c = 32; // c will be the number of zero bits on the right
    751.     v &= -signed(v);
    752.     if (v) c--;
    753.     if (v & 0x0000FFFF) c -= 16;
    754.     if (v & 0x00FF00FF) c -= 8;
    755.     if (v & 0x0F0F0F0F) c -= 4;
    756.     if (v & 0x33333333) c -= 2;
    757.     if (v & 0x55555555) c -= 1;
    758.     return c;
    759. #endif
    760. }
    761.  
    762. Q_DECL_RELAXED_CONSTEXPR inline uint qCountTrailingZeroBits(quint8 v) Q_DECL_NOTHROW
    763. {
    764. #if defined(QT_HAS_BUILTIN_CTZ)
    765.     return v ? QAlgorithmsPrivate::qt_builtin_ctz(v) : 8U;
    766. #else
    767.     unsigned int c = 8; // c will be the number of zero bits on the right
    768.     v &= -signed(v);
    769.     if (v) c--;
    770.     if (v & 0x0000000F) c -= 4;
    771.     if (v & 0x00000033) c -= 2;
    772.     if (v & 0x00000055) c -= 1;
    773.     return c;
    774. #endif
    775. }
    776.  
    777. Q_DECL_RELAXED_CONSTEXPR inline uint qCountTrailingZeroBits(quint16 v) Q_DECL_NOTHROW
    778. {
    779. #if defined(QT_HAS_BUILTIN_CTZS)
    780.     return v ? QAlgorithmsPrivate::qt_builtin_ctzs(v) : 16U;
    781. #else
    782.     unsigned int c = 16; // c will be the number of zero bits on the right
    783.     v &= -signed(v);
    784.     if (v) c--;
    785.     if (v & 0x000000FF) c -= 8;
    786.     if (v & 0x00000F0F) c -= 4;
    787.     if (v & 0x00003333) c -= 2;
    788.     if (v & 0x00005555) c -= 1;
    789.     return c;
    790. #endif
    791. }
    792.  
    793. Q_DECL_RELAXED_CONSTEXPR inline uint qCountTrailingZeroBits(quint64 v) Q_DECL_NOTHROW
    794. {
    795. #if defined(QT_HAS_BUILTIN_CTZLL)
    796.     return v ? QAlgorithmsPrivate::qt_builtin_ctzll(v) : 64;
    797. #else
    798.     quint32 x = static_cast(v);
    799.     return x ? qCountTrailingZeroBits(x)
    800.              : 32 + qCountTrailingZeroBits(static_cast(v >> 32));
    801. #endif
    802. }
    803.  
    804. Q_DECL_RELAXED_CONSTEXPR inline uint qCountTrailingZeroBits(unsigned long v) Q_DECL_NOTHROW
    805. {
    806.     return qCountTrailingZeroBits(QIntegerForSizeof<long>::Unsigned(v));
    807. }
    808.  
    809. Q_DECL_RELAXED_CONSTEXPR inline uint qCountLeadingZeroBits(quint32 v) Q_DECL_NOTHROW
    810. {
    811. #if defined(QT_HAS_BUILTIN_CLZ)
    812.     return v ? QAlgorithmsPrivate::qt_builtin_clz(v) : 32U;
    813. #else
    814.     // Hacker's Delight, 2nd ed. Fig 5-16, p. 102
    815.     v = v | (v >> 1);
    816.     v = v | (v >> 2);
    817.     v = v | (v >> 4);
    818.     v = v | (v >> 8);
    819.     v = v | (v >> 16);
    820.     return qPopulationCount(~v);
    821. #endif
    822. }
    823.  
    824. QT_POPCOUNT_RELAXED_CONSTEXPR inline uint qCountLeadingZeroBits(quint8 v) Q_DECL_NOTHROW
    825. {
    826. #if defined(QT_HAS_BUILTIN_CLZ)
    827.     return v ? QAlgorithmsPrivate::qt_builtin_clz(v)-24U : 8U;
    828. #else
    829.     v = v | (v >> 1);
    830.     v = v | (v >> 2);
    831.     v = v | (v >> 4);
    832.     return qPopulationCount(static_cast(~v));
    833. #endif
    834. }
    835.  
    836. QT_POPCOUNT_RELAXED_CONSTEXPR inline uint qCountLeadingZeroBits(quint16 v) Q_DECL_NOTHROW
    837. {
    838. #if defined(QT_HAS_BUILTIN_CLZS)
    839.     return v ? QAlgorithmsPrivate::qt_builtin_clzs(v) : 16U;
    840. #else
    841.     v = v | (v >> 1);
    842.     v = v | (v >> 2);
    843.     v = v | (v >> 4);
    844.     v = v | (v >> 8);
    845.     return qPopulationCount(static_cast(~v));
    846. #endif
    847. }
    848.  
    849. QT_POPCOUNT_RELAXED_CONSTEXPR inline uint qCountLeadingZeroBits(quint64 v) Q_DECL_NOTHROW
    850. {
    851. #if defined(QT_HAS_BUILTIN_CLZLL)
    852.     return v ? QAlgorithmsPrivate::qt_builtin_clzll(v) : 64U;
    853. #else
    854.     v = v | (v >> 1);
    855.     v = v | (v >> 2);
    856.     v = v | (v >> 4);
    857.     v = v | (v >> 8);
    858.     v = v | (v >> 16);
    859.     v = v | (v >> 32);
    860.     return qPopulationCount(~v);
    861. #endif
    862. }
    863.  
    864. QT_POPCOUNT_RELAXED_CONSTEXPR inline uint qCountLeadingZeroBits(unsigned long v) Q_DECL_NOTHROW
    865. {
    866.     return qCountLeadingZeroBits(QIntegerForSizeof<long>::Unsigned(v));
    867. }
    868.  
    869. QT_WARNING_POP
    870. QT_END_NAMESPACE
    871.  
    872. #endif // QALGORITHMS_H

    dm使用

    1. //MainWindow.h
    2.  
    3. #ifndef MAINWINDOW_H
    4. #define MAINWINDOW_H
    5.  
    6. #include 
    7. #include 
    8.  
    9. QT_BEGIN_NAMESPACE
    10. namespace Ui { class MainWindow; }
    11. QT_END_NAMESPACE
    12.  
    13. class MainWindow : public QMainWindow
    14. {
    15.     Q_OBJECT
    16.  
    17. public:
    18.     MainWindow(QWidget *parent = nullptr);
    19.     ~MainWindow();
    20.  
    21. private:
    22.     Ui::MainWindow *ui;
    23.     Dm::Idmsoft dm;
    24. };
    25. #endif // MAINWINDOW_H

     

    1. //mainwindow.cpp
    2.  
    3. #include "mainwindow.h"
    4. #include "ui_mainwindow.h"
    5. #include 
    6.  
    7. MainWindow::MainWindow(QWidget *parent)
    8.     : QMainWindow(parent)
    9.     , ui(new Ui::MainWindow)
    10. {
    11.     ui->setupUi(this);
    12.     if(dm.setControl("dm.dmsoft"))//初始化COM对象
    13.     {
    14.         qDebug() << QStringLiteral("大漠测试，大漠版本：")<< dm.Ver();
    15.     }
    16. }
    17.  
    18. MainWindow::~MainWindow()
    19. {
    20.     delete ui;
    21. }
    22.

    不管是debug 还是 release 。都能成功运行。运行后打印

    这就代表大漠已经成功调通，接下来就可以正常开发了 

  • 相关阅读:
    【Node入门系列】前后端的身份认证 — JWT（10）
    阿里二面：SpringBoot如何优雅地进行响应数据封装、异常处理？
    第三章：Qt Creator 之 3.5 构建与运行程序
    系统架构图
    从事电力行业施工需要什么资质，电力工程资质有什么作用
    【netty从入门到放弃】netty转发tcp数据到多客户端
    VMware Network Adapter VMnet8图标没显示怎么办？
    matlab 遗传算法GA优化汽车四分之一车体主动悬架PID
    没有预热，不叫高并发「限流算法第三把法器：令牌桶算法」
    【无标题】
  • 原文地址：https://blog.csdn.net/hu626626/article/details/134261301