/usr/include/qpid/sys/CopyOnWriteArray.h is in libqpidcommon2-dev 0.16-9ubuntu2.
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 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 | #ifndef QPID_SYS_COPYONWRITEARRAY_H
#define QPID_SYS_COPYONWRITEARRAY_H
/*
*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you 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.
*
*/
#include "qpid/sys/Mutex.h"
#include <algorithm>
#include <vector>
#include <boost/shared_ptr.hpp>
namespace qpid {
namespace sys {
/**
* An array that copies on adding/removing element allowing lock-free
* iteration.
*/
template <class T>
class CopyOnWriteArray
{
public:
typedef boost::shared_ptr<const std::vector<T> > ConstPtr;
CopyOnWriteArray() {}
CopyOnWriteArray(const CopyOnWriteArray& c) : array(c.array) {}
bool empty()
{
Mutex::ScopedLock l(lock);
return array ? array->empty() : true;
}
void add(T& t)
{
Mutex::ScopedLock l(lock);
ArrayPtr copy(array ? new std::vector<T>(*array) : new std::vector<T>());
copy->push_back(t);
array = copy;
}
bool remove(T& t)
{
Mutex::ScopedLock l(lock);
if (array && std::find(array->begin(), array->end(), t) != array->end()) {
ArrayPtr copy(new std::vector<T>(*array));
copy->erase(std::find(copy->begin(), copy->end(), t));
array = copy;
return true;
} else {
return false;
}
}
bool clear()
{
Mutex::ScopedLock l(lock);
if (array && !array->empty()) {
ArrayPtr copy;
array = copy;
return true;
} else {
return false;
}
}
template <class F>
bool add_unless(T& t, F f)
{
Mutex::ScopedLock l(lock);
if (array && std::find_if(array->begin(), array->end(), f) != array->end()) {
return false;
} else {
ArrayPtr copy(array ? new std::vector<T>(*array) : new std::vector<T>());
copy->push_back(t);
array = copy;
return true;
}
}
template <class F>
bool remove_if(F f)
{
Mutex::ScopedLock l(lock);
if (array && std::find_if(array->begin(), array->end(), f) != array->end()) {
ArrayPtr copy(new std::vector<T>(*array));
copy->erase(std::remove_if(copy->begin(), copy->end(), f), copy->end());
array = copy;
return true;
}
return false;
}
template <class TestFn, class ModifierFn>
bool modify_if(TestFn f, ModifierFn & m)
{
if (!array)
return false;
{
Mutex::ScopedLock l(lock);
if (std::find_if(array->begin(), array->end(), f) != array->end())
{
ArrayPtr copy(new std::vector<T>(*array));
m(*std::find_if(copy->begin(), copy->end(), f));
array = copy;
return true;
}
}
return false;
}
template <class F>
F for_each(F f)
{
ArrayPtr a;
{
Mutex::ScopedLock l(lock);
a = array;
}
if (!a) return f;
return std::for_each(a->begin(), a->end(), f);
}
ConstPtr snapshot()
{
ConstPtr a;
{
Mutex::ScopedLock l(lock);
a = array;
}
return a;
}
private:
typedef boost::shared_ptr< std::vector<T> > ArrayPtr;
Mutex lock;
ArrayPtr array;
};
}}
#endif /*!QPID_SYS_COPYONWRITEARRAY_H*/
|