Long live Qt for S60!

3 files changed, 229 insertions, 0 deletions

diff --git a/tests/auto/qvector/.gitignore b/tests/auto/qvector/.gitignore
new file mode 100644
index 0000000..5520039
--- /dev/null
+++ b/tests/auto/qvector/.gitignore
@@ -0,0 +1 @@
+tst_qvector
diff --git a/tests/auto/qvector/qvector.pro b/tests/auto/qvector/qvector.pro
new file mode 100644
index 0000000..4ff389c
--- /dev/null
+++ b/tests/auto/qvector/qvector.pro
@@ -0,0 +1,4 @@
+load(qttest_p4)
+QT = core
+SOURCES  += tst_qvector.cpp
+QT = core
diff --git a/tests/auto/qvector/tst_qvector.cpp b/tests/auto/qvector/tst_qvector.cpp
new file mode 100644
index 0000000..db2fd09
--- /dev/null
+++ b/tests/auto/qvector/tst_qvector.cpp
@@ -0,0 +1,224 @@
+/****************************************************************************
+**
+** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies).
+** Contact: Qt Software Information (qt-info@nokia.com)
+**
+** This file is part of the test suite of the Qt Toolkit.
+**
+** $QT_BEGIN_LICENSE:LGPL$
+** No Commercial Usage
+** This file contains pre-release code and may not be distributed.
+** You may use this file in accordance with the terms and conditions
+** contained in the either Technology Preview License Agreement or the
+** Beta Release License Agreement.
+**
+** 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 as published by the Free Software
+** Foundation and appearing in the file LICENSE.LGPL included in the
+** packaging of this file.  Please review the following information to
+** ensure the GNU Lesser General Public License version 2.1 requirements
+** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
+**
+** In addition, as a special exception, Nokia gives you certain
+** additional rights. These rights are described in the Nokia Qt LGPL
+** Exception version 1.0, included in the file LGPL_EXCEPTION.txt in this
+** package.
+**
+** GNU General Public License Usage
+** Alternatively, this file may be used under the terms of the GNU
+** General Public License version 3.0 as published by the Free Software
+** Foundation and appearing in the file LICENSE.GPL included in the
+** packaging of this file.  Please review the following information to
+** ensure the GNU General Public License version 3.0 requirements will be
+** met: http://www.gnu.org/copyleft/gpl.html.
+**
+** If you are unsure which license is appropriate for your use, please
+** contact the sales department at qt-sales@nokia.com.
+** $QT_END_LICENSE$
+**
+****************************************************************************/
+
+
+#include <QtTest/QtTest>
+#include <qvector.h>
+
+//TESTED_CLASS=
+//TESTED_FILES=corelib/tools/qregexp.h corelib/tools/qregexp.cpp
+
+class tst_QVector : public QObject
+{
+    Q_OBJECT
+
+public:
+    tst_QVector() {}
+    virtual ~tst_QVector() {}
+
+private slots:
+    void outOfMemory();
+};
+
+int fooCtor;
+int fooDtor;
+
+struct Foo
+{
+    int *p;
+
+    Foo() { p = new int; ++fooCtor; }
+    Foo(const Foo &other) { Q_UNUSED(other); p = new int; ++fooCtor; }
+
+    void operator=(const Foo & /* other */) { }
+
+    ~Foo() { delete p; ++fooDtor; }
+};
+
+void tst_QVector::outOfMemory()
+{
+    fooCtor = 0;
+    fooDtor = 0;
+
+    const int N = 0x7fffffff / sizeof(Foo);
+
+    {
+        QVector<Foo> a;
+
+        QSKIP("This test crashes on many of our machines.", SkipSingle);
+        a.resize(N);
+        if (a.size() == N) {
+            QVERIFY(a.capacity() >= N);
+            QCOMPARE(fooCtor, N);
+            QCOMPARE(fooDtor, 0);
+
+            for (int i = 0; i < N; i += 35000)
+                a[i] = Foo();
+        } else {
+            // this is the case we're actually testing
+            QCOMPARE(a.size(), 0);
+            QCOMPARE(a.capacity(), 0);
+            QCOMPARE(fooCtor, 0);
+            QCOMPARE(fooDtor, 0);
+
+            a.resize(5);
+            QCOMPARE(a.size(), 5);
+            QVERIFY(a.capacity() >= 5);
+            QCOMPARE(fooCtor, 5);
+            QCOMPARE(fooDtor, 0);
+
+            const int Prealloc = a.capacity();
+            a.resize(Prealloc + 1);
+            QCOMPARE(a.size(), Prealloc + 1);
+            QVERIFY(a.capacity() >= Prealloc + 1);
+            QCOMPARE(fooCtor, Prealloc + 6);
+            QCOMPARE(fooDtor, 5);
+
+            a.resize(0x10000000);
+            QCOMPARE(a.size(), 0);
+            QCOMPARE(a.capacity(), 0);
+            QCOMPARE(fooCtor, Prealloc + 6);
+            QCOMPARE(fooDtor, Prealloc + 6);
+        }
+    }
+
+    fooCtor = 0;
+    fooDtor = 0;
+
+    {
+        QVector<Foo> a(N);
+        if (a.size() == N) {
+            QVERIFY(a.capacity() >= N);
+            QCOMPARE(fooCtor, N);
+            QCOMPARE(fooDtor, 0);
+
+            for (int i = 0; i < N; i += 35000)
+                a[i] = Foo();
+        } else {
+            // this is the case we're actually testing
+            QCOMPARE(a.size(), 0);
+            QCOMPARE(a.capacity(), 0);
+            QCOMPARE(fooCtor, 0);
+            QCOMPARE(fooDtor, 0);
+        }
+    }
+
+    Foo foo;
+
+    fooCtor = 0;
+    fooDtor = 0;
+
+    {
+        QVector<Foo> a(N, foo);
+        if (a.size() == N) {
+            QVERIFY(a.capacity() >= N);
+            QCOMPARE(fooCtor, N);
+            QCOMPARE(fooDtor, 0);
+
+            for (int i = 0; i < N; i += 35000)
+                a[i] = Foo();
+        } else {
+            // this is the case we're actually testing
+            QCOMPARE(a.size(), 0);
+            QCOMPARE(a.capacity(), 0);
+            QCOMPARE(fooCtor, 0);
+            QCOMPARE(fooDtor, 0);
+        }
+    }
+
+    fooCtor = 0;
+    fooDtor = 0;
+
+    {
+        QVector<Foo> a;
+        a.resize(10);
+        QCOMPARE(fooCtor, 10);
+        QCOMPARE(fooDtor, 0);
+
+        QVector<Foo> b(a);
+        QCOMPARE(fooCtor, 10);
+        QCOMPARE(fooDtor, 0);
+
+        a.resize(N);
+        if (a.size() == N) {
+            QCOMPARE(fooCtor, N + 10);
+        } else {
+            QCOMPARE(a.size(), 0);
+            QCOMPARE(a.capacity(), 0);
+            QCOMPARE(fooCtor, 10);
+            QCOMPARE(fooDtor, 0);
+
+            QCOMPARE(b.size(), 10);
+            QVERIFY(b.capacity() >= 10);
+        }
+    }
+
+    {
+        QVector<int> a;
+        a.resize(10);
+
+        QVector<int> b(a);
+
+        a.resize(N);
+        if (a.size() == N) {
+            for (int i = 0; i < N; i += 60000)
+                a[i] = i;
+        } else {
+            QCOMPARE(a.size(), 0);
+            QCOMPARE(a.capacity(), 0);
+
+            QCOMPARE(b.size(), 10);
+            QVERIFY(b.capacity() >= 10);
+        }
+
+        b.resize(N - 1);
+        if (b.size() == N - 1) {
+            for (int i = 0; i < N - 1; i += 60000)
+                b[i] = i;
+        } else {
+            QCOMPARE(b.size(), 0);
+            QCOMPARE(b.capacity(), 0);
+        }
+    }
+}
+
+QTEST_APPLESS_MAIN(tst_QVector)
+#include "tst_qvector.moc"