|
1 /**************************************************************************** |
|
2 ** |
|
3 ** Copyright (C) 2010 Nokia Corporation and/or its subsidiary(-ies). |
|
4 ** All rights reserved. |
|
5 ** Contact: Nokia Corporation (qt-info@nokia.com) |
|
6 ** |
|
7 ** This file is part of the Qt Mobility Components. |
|
8 ** |
|
9 ** $QT_BEGIN_LICENSE:LGPL$ |
|
10 ** No Commercial Usage |
|
11 ** This file contains pre-release code and may not be distributed. |
|
12 ** You may use this file in accordance with the terms and conditions |
|
13 ** contained in the Technology Preview License Agreement accompanying |
|
14 ** this package. |
|
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 ** |
|
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. |
|
27 ** |
|
28 ** If you have questions regarding the use of this file, please contact |
|
29 ** Nokia at qt-info@nokia.com. |
|
30 ** |
|
31 ** |
|
32 ** |
|
33 ** |
|
34 ** |
|
35 ** |
|
36 ** |
|
37 ** |
|
38 ** $QT_END_LICENSE$ |
|
39 ** |
|
40 ****************************************************************************/ |
|
41 // Copyright (c) 2008 Roberto Raggi <roberto.raggi@gmail.com> |
|
42 // |
|
43 // Permission is hereby granted, free of charge, to any person obtaining a copy |
|
44 // of this software and associated documentation files (the "Software"), to deal |
|
45 // in the Software without restriction, including without limitation the rights |
|
46 // to use, copy, modify, merge, publish, distribute, sublicense, and/or sell |
|
47 // copies of the Software, and to permit persons to whom the Software is |
|
48 // furnished to do so, subject to the following conditions: |
|
49 // |
|
50 // The above copyright notice and this permission notice shall be included in |
|
51 // all copies or substantial portions of the Software. |
|
52 // |
|
53 // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR |
|
54 // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, |
|
55 // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE |
|
56 // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER |
|
57 // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, |
|
58 // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN |
|
59 // THE SOFTWARE. |
|
60 |
|
61 #ifndef CPLUSPLUS_ARRAY_H |
|
62 #define CPLUSPLUS_ARRAY_H |
|
63 |
|
64 #include "CPlusPlusForwardDeclarations.h" |
|
65 #include <new> |
|
66 |
|
67 namespace CPlusPlus { |
|
68 |
|
69 template <typename _Tp, int SEGMENT_SHIFT = 4> |
|
70 class CPLUSPLUS_EXPORT Array |
|
71 { |
|
72 Array(const Array &other); |
|
73 void operator =(const Array &other); |
|
74 |
|
75 public: |
|
76 Array() |
|
77 : _segments(0), |
|
78 _allocatedSegments(0), |
|
79 _segmentCount(-1), |
|
80 _allocatedElements(0), |
|
81 _count(-1) |
|
82 { } |
|
83 |
|
84 ~Array() |
|
85 { |
|
86 if (_segments) { |
|
87 for (int index = 0; index <= _segmentCount; ++index) { |
|
88 delete[] (_segments[index] + (index << SEGMENT_SHIFT)); |
|
89 } |
|
90 std::free(_segments); |
|
91 } |
|
92 } |
|
93 |
|
94 inline unsigned size() const |
|
95 { return _count + 1; } |
|
96 |
|
97 inline unsigned count() const |
|
98 { return _count + 1; } |
|
99 |
|
100 inline const _Tp &at(unsigned index) const |
|
101 { return _segments[index >> SEGMENT_SHIFT][index]; } |
|
102 |
|
103 inline const _Tp &operator[](unsigned index) const |
|
104 { return _segments[index >> SEGMENT_SHIFT][index]; } |
|
105 |
|
106 inline _Tp &operator[](unsigned index) |
|
107 { return _segments[index >> SEGMENT_SHIFT][index]; } |
|
108 |
|
109 void push_back(const _Tp &value) |
|
110 { |
|
111 if (++_count == _allocatedElements) { |
|
112 if (++_segmentCount == _allocatedSegments) { |
|
113 _allocatedSegments += 4; |
|
114 _segments = (_Tp **) std::realloc(_segments, _allocatedSegments * sizeof(_Tp *)); |
|
115 } |
|
116 |
|
117 _Tp *segment = new _Tp[SEGMENT_SIZE]; |
|
118 _segments[_segmentCount] = segment - (_segmentCount << SEGMENT_SHIFT); |
|
119 _allocatedElements += SEGMENT_SIZE; |
|
120 } |
|
121 |
|
122 _segments[_count >> SEGMENT_SHIFT][_count] = value; |
|
123 } |
|
124 |
|
125 private: |
|
126 enum { |
|
127 SEGMENT_SIZE = 1 << SEGMENT_SHIFT |
|
128 }; |
|
129 |
|
130 _Tp **_segments; |
|
131 int _allocatedSegments; |
|
132 int _segmentCount; |
|
133 |
|
134 int _allocatedElements; |
|
135 int _count; |
|
136 }; |
|
137 |
|
138 } // end of namespace CPlusPlus |
|
139 |
|
140 |
|
141 #endif // CPLUSPLUS_ARRAY_H |