blob: 9255db54904ffa40e0bb7ff0f945229bde0bc37c (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
|
/****************************************************************************
**
** Copyright (C) 2015 The Qt Company Ltd.
** Contact: http://www.qt.io/licensing/
**
** This file is part of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL21$
** 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 http://www.qt.io/terms-conditions. For further
** information use the contact form at http://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 2.1 or version 3 as published by the Free
** Software Foundation and appearing in the file LICENSE.LGPLv21 and
** LICENSE.LGPLv3 included in the packaging of this file. Please review the
** following information to ensure the GNU Lesser General Public License
** requirements will be met: https://www.gnu.org/licenses/lgpl.html and
** http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** As a special exception, The Qt Company gives you certain additional
** rights. These rights are described in The Qt Company LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
** $QT_END_LICENSE$
**
****************************************************************************/
#include "qandroidmultimediautils.h"
#include <qlist.h>
QT_BEGIN_NAMESPACE
int qt_findClosestValue(const QList<int> &list, int value)
{
if (list.size() < 2)
return 0;
int begin = 0;
int end = list.size() - 1;
int pivot = begin + (end - begin) / 2;
int v = list.at(pivot);
while (end - begin > 1) {
if (value == v)
return pivot;
if (value > v)
begin = pivot;
else
end = pivot;
pivot = begin + (end - begin) / 2;
v = list.at(pivot);
}
return value - v >= list.at(pivot + 1) - value ? pivot + 1 : pivot;
}
bool qt_sizeLessThan(const QSize &s1, const QSize &s2)
{
return s1.width() * s1.height() < s2.width() * s2.height();
}
QT_END_NAMESPACE
|