2013-03-05 15:23:20 +00:00
|
|
|
/****************************************************************************
|
|
|
|
**
|
|
|
|
** Copyright (C) 2012 Thorbjørn Lund Martsum - tmartsum[at]gmail.com
|
2015-01-28 08:44:43 +00:00
|
|
|
** Contact: http://www.qt.io/licensing/
|
2013-03-05 15:23:20 +00:00
|
|
|
**
|
|
|
|
** This file is part of the test suite of the Qt Toolkit.
|
|
|
|
**
|
2014-08-21 13:51:22 +00:00
|
|
|
** $QT_BEGIN_LICENSE:LGPL21$
|
2013-03-05 15:23:20 +00:00
|
|
|
** 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
|
2015-01-28 08:44:43 +00:00
|
|
|
** 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.
|
2013-03-05 15:23:20 +00:00
|
|
|
**
|
|
|
|
** GNU Lesser General Public License Usage
|
|
|
|
** Alternatively, this file may be used under the terms of the GNU Lesser
|
2014-08-21 13:51:22 +00:00
|
|
|
** 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.
|
2013-03-05 15:23:20 +00:00
|
|
|
**
|
2015-01-28 08:44:43 +00:00
|
|
|
** As a special exception, The Qt Company gives you certain additional
|
|
|
|
** rights. These rights are described in The Qt Company LGPL Exception
|
2013-03-05 15:23:20 +00:00
|
|
|
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
|
|
|
|
**
|
|
|
|
** $QT_END_LICENSE$
|
|
|
|
**
|
|
|
|
****************************************************************************/
|
|
|
|
|
|
|
|
//#define Q_NO_DEBUGMAP_PARENT_TEST
|
|
|
|
// Comment in line above to skip the parent test.
|
|
|
|
#include <QtCore/QMap>
|
|
|
|
#include <QDebug>
|
|
|
|
|
|
|
|
void noBugErase()
|
|
|
|
{
|
|
|
|
QMap<int, int> a, b;
|
|
|
|
a[10] = 11;
|
|
|
|
a[11] = 12;
|
|
|
|
b = a;
|
|
|
|
b.erase(b.begin());
|
|
|
|
}
|
|
|
|
|
|
|
|
void noBugInsertWithHints()
|
|
|
|
{
|
|
|
|
QMap<int, int> a;
|
|
|
|
QMap<int, int> b;
|
|
|
|
for (int u = 100; u < 10000; u += 20)
|
|
|
|
a.insert(u, u);
|
|
|
|
b = a;
|
|
|
|
QMap<int, int>::const_iterator b_ite(b.begin()); // b.begin() ensures correct detach()
|
|
|
|
++b_ite;
|
|
|
|
b.insert(b_ite, 501, 501);
|
|
|
|
b.insert(b_ite, 115, 115);
|
|
|
|
QMap<int, int> c;
|
|
|
|
c = b;
|
|
|
|
c.setSharable(false);
|
|
|
|
}
|
|
|
|
|
|
|
|
void testInsertWithHintCorruption()
|
|
|
|
{
|
|
|
|
qDebug() << "Starting testInsertWithHintCorruption";
|
|
|
|
|
|
|
|
QMap<int, int> a;
|
|
|
|
QMap<int, int> b;
|
|
|
|
for (int u = 100; u < 10000; u += 20)
|
|
|
|
a.insert(u, u);
|
|
|
|
b = a;
|
|
|
|
QMap<int, int>::const_iterator b_ite = b.constBegin();
|
|
|
|
++b_ite;
|
|
|
|
b.insert(b_ite, 501, 501);
|
|
|
|
b.insert(b_ite, 115, 115); // insert with wrong hint.
|
|
|
|
QMap<int, int> c;
|
|
|
|
c = b;
|
|
|
|
c.setSharable(false);
|
|
|
|
qDebug() << "End of testInsertWithHintCorruption - failed silently";
|
|
|
|
}
|
|
|
|
|
|
|
|
void testEraseCorruption()
|
|
|
|
{
|
|
|
|
qDebug() << "Starting testEraseCorruption";
|
|
|
|
|
|
|
|
QMap<int, int> a, b;
|
|
|
|
a[10] = 11;
|
|
|
|
a[11] = 12;
|
|
|
|
b = a;
|
|
|
|
b.erase(a.begin());
|
|
|
|
qDebug() << "End of testEraseCorruption - failed silently";
|
|
|
|
}
|
|
|
|
|
|
|
|
int main()
|
|
|
|
{
|
|
|
|
noBugErase();
|
|
|
|
noBugInsertWithHints();
|
|
|
|
|
|
|
|
// testEraseCorruption();
|
|
|
|
testInsertWithHintCorruption();
|
|
|
|
return 0;
|
|
|
|
}
|