/usr/include/mongo/util/array.h is in mongodb-dev 1:2.4.9-1ubuntu2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 | // array.h
/*
* Copyright 2010 10gen Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
namespace mongo {
/*
* simple array class that does no allocations
* same api as vector
* fixed buffer, so once capacity is exceeded, will assert
* meant to be-reused with clear()
*/
template<typename T>
class FastArray {
public:
FastArray( int capacity=10000 )
: _capacity( capacity ) , _size(0) , _end(this,capacity) {
_data = new T[capacity];
}
~FastArray() {
delete[] _data;
}
void clear() {
_size = 0;
}
T& operator[]( int x ) {
verify( x >= 0 && x < _capacity );
return _data[x];
}
T& getNext() {
return _data[_size++];
}
void push_back( const T& t ) {
verify( _size < _capacity );
_data[_size++] = t;
}
void sort( int (*comp)(const void *, const void *) ) {
qsort( _data , _size , sizeof(T) , comp );
}
int size() {
return _size;
}
bool hasSpace() {
return _size < _capacity;
}
class iterator {
public:
iterator() {
_it = 0;
_pos = 0;
}
iterator( FastArray * it , int pos=0 ) {
_it = it;
_pos = pos;
}
bool operator==(const iterator& other ) const {
return _pos == other._pos;
}
bool operator!=(const iterator& other ) const {
return _pos != other._pos;
}
void operator++() {
_pos++;
}
T& operator*() {
return _it->_data[_pos];
}
string toString() const {
stringstream ss;
ss << _pos;
return ss.str();
}
private:
FastArray * _it;
int _pos;
friend class FastArray;
};
iterator begin() {
return iterator(this);
}
iterator end() {
_end._pos = _size;
return _end;
}
private:
int _capacity;
int _size;
iterator _end;
T * _data;
};
}
|