[2] | 1 | /****************************************************************************
|
---|
| 2 | **
|
---|
[651] | 3 | ** Copyright (C) 2010 Nokia Corporation and/or its subsidiary(-ies).
|
---|
[561] | 4 | ** All rights reserved.
|
---|
| 5 | ** Contact: Nokia Corporation ([email protected])
|
---|
[2] | 6 | **
|
---|
| 7 | ** This file is part of the Qt3Support module of the Qt Toolkit.
|
---|
| 8 | **
|
---|
| 9 | ** $QT_BEGIN_LICENSE:LGPL$
|
---|
| 10 | ** Commercial Usage
|
---|
| 11 | ** Licensees holding valid Qt Commercial licenses may use this file in
|
---|
| 12 | ** accordance with the Qt Commercial License Agreement provided with the
|
---|
| 13 | ** Software or, alternatively, in accordance with the terms contained in
|
---|
| 14 | ** a written agreement between you and Nokia.
|
---|
| 15 | **
|
---|
| 16 | ** GNU Lesser General Public License Usage
|
---|
| 17 | ** Alternatively, this file may be used under the terms of the GNU Lesser
|
---|
| 18 | ** General Public License version 2.1 as published by the Free Software
|
---|
| 19 | ** Foundation and appearing in the file LICENSE.LGPL included in the
|
---|
| 20 | ** packaging of this file. Please review the following information to
|
---|
| 21 | ** ensure the GNU Lesser General Public License version 2.1 requirements
|
---|
| 22 | ** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
|
---|
| 23 | **
|
---|
[561] | 24 | ** In addition, as a special exception, Nokia gives you certain additional
|
---|
| 25 | ** rights. These rights are described in the Nokia Qt LGPL Exception
|
---|
| 26 | ** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
|
---|
[2] | 27 | **
|
---|
| 28 | ** GNU General Public License Usage
|
---|
| 29 | ** Alternatively, this file may be used under the terms of the GNU
|
---|
| 30 | ** General Public License version 3.0 as published by the Free Software
|
---|
| 31 | ** Foundation and appearing in the file LICENSE.GPL included in the
|
---|
| 32 | ** packaging of this file. Please review the following information to
|
---|
| 33 | ** ensure the GNU General Public License version 3.0 requirements will be
|
---|
| 34 | ** met: http://www.gnu.org/copyleft/gpl.html.
|
---|
| 35 | **
|
---|
[561] | 36 | ** If you have questions regarding the use of this file, please contact
|
---|
| 37 | ** Nokia at [email protected].
|
---|
[2] | 38 | ** $QT_END_LICENSE$
|
---|
| 39 | **
|
---|
| 40 | ****************************************************************************/
|
---|
| 41 |
|
---|
| 42 | #ifndef Q3GARRAY_H
|
---|
| 43 | #define Q3GARRAY_H
|
---|
| 44 |
|
---|
| 45 | #include <Qt3Support/q3shared.h>
|
---|
| 46 |
|
---|
| 47 | QT_BEGIN_HEADER
|
---|
| 48 |
|
---|
| 49 | QT_BEGIN_NAMESPACE
|
---|
| 50 |
|
---|
| 51 | QT_MODULE(Qt3SupportLight)
|
---|
| 52 |
|
---|
| 53 | class Q_COMPAT_EXPORT Q3GArray // generic array
|
---|
| 54 | {
|
---|
| 55 | friend class QBuffer;
|
---|
| 56 | public:
|
---|
| 57 | // do not use this, even though this is public
|
---|
| 58 | struct array_data : public Q3Shared { // shared array
|
---|
| 59 | array_data():data(0),len(0)
|
---|
| 60 | #ifdef QT_QGARRAY_SPEED_OPTIM
|
---|
| 61 | ,maxl(0)
|
---|
| 62 | #endif
|
---|
| 63 | {}
|
---|
| 64 | char *data; // actual array data
|
---|
| 65 | uint len;
|
---|
| 66 | #ifdef QT_QGARRAY_SPEED_OPTIM
|
---|
| 67 | uint maxl;
|
---|
| 68 | #endif
|
---|
| 69 | };
|
---|
| 70 | Q3GArray();
|
---|
| 71 | enum Optimization { MemOptim, SpeedOptim };
|
---|
| 72 | protected:
|
---|
| 73 | Q3GArray(int, int); // dummy; does not alloc
|
---|
| 74 | Q3GArray(int size); // allocate 'size' bytes
|
---|
| 75 | Q3GArray(const Q3GArray &a); // shallow copy
|
---|
| 76 | virtual ~Q3GArray();
|
---|
| 77 |
|
---|
| 78 | Q3GArray &operator=(const Q3GArray &a) { return assign(a); }
|
---|
| 79 |
|
---|
| 80 | virtual void detach() { duplicate(*this); }
|
---|
| 81 |
|
---|
| 82 | // ### Qt 4.0: maybe provide two versions of data(), at(), etc.
|
---|
| 83 | char *data() const { return shd->data; }
|
---|
| 84 | uint nrefs() const { return shd->count; }
|
---|
| 85 | uint size() const { return shd->len; }
|
---|
| 86 | bool isEqual(const Q3GArray &a) const;
|
---|
| 87 |
|
---|
| 88 | bool resize(uint newsize, Optimization optim);
|
---|
| 89 | bool resize(uint newsize);
|
---|
| 90 |
|
---|
| 91 | bool fill(const char *d, int len, uint sz);
|
---|
| 92 |
|
---|
| 93 | Q3GArray &assign(const Q3GArray &a);
|
---|
| 94 | Q3GArray &assign(const char *d, uint len);
|
---|
| 95 | Q3GArray &duplicate(const Q3GArray &a);
|
---|
| 96 | Q3GArray &duplicate(const char *d, uint len);
|
---|
| 97 | void store(const char *d, uint len);
|
---|
| 98 |
|
---|
| 99 | array_data *sharedBlock() const { return shd; }
|
---|
| 100 | void setSharedBlock(array_data *p) { shd=(array_data*)p; }
|
---|
| 101 |
|
---|
| 102 | Q3GArray &setRawData(const char *d, uint len);
|
---|
| 103 | void resetRawData(const char *d, uint len);
|
---|
| 104 |
|
---|
| 105 | int find(const char *d, uint index, uint sz) const;
|
---|
| 106 | int contains(const char *d, uint sz) const;
|
---|
| 107 |
|
---|
| 108 | void sort(uint sz);
|
---|
| 109 | int bsearch(const char *d, uint sz) const;
|
---|
| 110 |
|
---|
| 111 | char *at(uint index) const;
|
---|
| 112 |
|
---|
| 113 | bool setExpand(uint index, const char *d, uint sz);
|
---|
| 114 |
|
---|
| 115 | protected:
|
---|
| 116 | virtual array_data *newData();
|
---|
| 117 | virtual void deleteData(array_data *p);
|
---|
| 118 |
|
---|
| 119 | private:
|
---|
| 120 | static void msg_index(uint);
|
---|
| 121 | array_data *shd;
|
---|
| 122 | };
|
---|
| 123 |
|
---|
| 124 |
|
---|
| 125 | inline char *Q3GArray::at(uint index) const
|
---|
| 126 | {
|
---|
| 127 | #if defined(QT_CHECK_RANGE)
|
---|
| 128 | if (index >= size()) {
|
---|
| 129 | msg_index(index);
|
---|
| 130 | index = 0;
|
---|
| 131 | }
|
---|
| 132 | #endif
|
---|
| 133 | return &shd->data[index];
|
---|
| 134 | }
|
---|
| 135 |
|
---|
| 136 | QT_END_NAMESPACE
|
---|
| 137 |
|
---|
| 138 | QT_END_HEADER
|
---|
| 139 |
|
---|
| 140 | #endif // Q3GARRAY_H
|
---|