/usr/include/mongo/util/lruishmap.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 | // lru-ish map.h
/* Copyright 2009 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.
*/
#pragma once
#include "mongo/pch.h"
#include "../util/goodies.h"
namespace mongo {
/* Your K object must define:
int hash() - must always return > 0.
operator==
*/
template <class K, class V, int MaxChain>
class LRUishMap {
public:
LRUishMap(int _n) {
n = nextPrime(_n);
keys = new K[n];
hashes = new int[n];
for ( int i = 0; i < n; i++ ) hashes[i] = 0;
}
~LRUishMap() {
delete[] keys;
delete[] hashes;
}
int _find(const K& k, bool& found) {
int h = k.hash();
verify( h > 0 );
int j = h % n;
int first = j;
for ( int i = 0; i < MaxChain; i++ ) {
if ( hashes[j] == h ) {
if ( keys[j] == k ) {
found = true;
return j;
}
}
else if ( hashes[j] == 0 ) {
found = false;
return j;
}
}
found = false;
return first;
}
V* find(const K& k) {
bool found;
int j = _find(k, found);
return found ? &values[j] : 0;
}
private:
int n;
K *keys;
int *hashes;
V *values;
};
} // namespace mongo
|