/usr/include/cegui-0.8.7/CEGUI/falagard/NamedDefinitionCollator.h is in libcegui-mk2-dev 0.8.7-1.3+b2.
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 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 | /***********************************************************************
created: Mon Jun 11 2012
author: Paul D Turner <paul@cegui.org.uk>
*************************************************************************/
/***************************************************************************
* Copyright (C) 2004 - 2012 Paul D Turner & The CEGUI Development Team
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
* IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR
* OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
* ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
* OTHER DEALINGS IN THE SOFTWARE.
***************************************************************************/
#ifndef _CEGUINamedDefinitionCollator_h_
#define _CEGUINamedDefinitionCollator_h_
#include "CEGUI/Base.h"
#include <vector>
#include <algorithm>
#if defined(_MSC_VER)
# pragma warning(push)
# pragma warning(disable : 4251)
#endif
namespace CEGUI
{
/*!
\brief
Helper container used to implement inherited collections of component
definitions specified in a WidgetLook.
*/
template<typename K, typename V>
class NamedDefinitionCollator
{
public:
typedef V value_type;
//! Return total number of values in the collection.
size_t size() const
{ return d_values.size(); }
//! return reference to value at given index.
V& at(size_t idx)
{ return d_values.at(idx).second; }
//! return const reference to value at given index.
const V& at(size_t idx) const
{ return d_values.at(idx).second; }
/*!
\brief
Set value for a given key. If a value is already associated with the
given key, it is replaced with the new value and the value is moved to
the end of the collection.
*/
void set(const K& key, const V& val)
{
typename ValueArray::iterator i =
std::find_if(d_values.begin(), d_values.end(), pred(key));
if (i != d_values.end())
d_values.erase(i);
d_values.push_back(std::make_pair(key, val));
}
protected:
typedef std::pair<K, V> Entry;
typedef std::vector<Entry CEGUI_VECTOR_ALLOC(Entry)> ValueArray;
struct pred
{
const K& d_k;
pred(const K& k) : d_k(k) {}
bool operator()(const Entry& e)
{ return e.first == d_k; }
};
ValueArray d_values;
public:
/** This is not intended to provide full std::iterator support, it is here
* so that we can provide access via CEGUI::ConstVectorIterator.
*/
class const_iterator
{
public:
const_iterator(typename ValueArray::const_iterator i) :
d_iter(i) {}
const_iterator(const const_iterator& iter) :
d_iter(iter.d_iter) {}
const_iterator()
{}
const V& operator*() const
{ return d_iter->second; }
const V* operator->() const
{ return &**this; }
bool operator==(const const_iterator& iter) const
{ return d_iter == iter.d_iter; }
bool operator!=(const const_iterator& iter) const
{ return !operator==(iter); }
const_iterator& operator++()
{
++d_iter;
return *this;
}
const_iterator& operator++(int)
{
const_iterator& tmp = *this;
++*this;
return tmp;
}
const_iterator& operator--()
{
--d_iter;
return *this;
}
const_iterator& operator--(int)
{
const_iterator& tmp = *this;
--*this;
return tmp;
}
const_iterator& operator=(const const_iterator& iter)
{
d_iter = iter.d_iter;
return *this;
}
protected:
typename ValueArray::const_iterator d_iter;
};
const_iterator begin() const
{ return const_iterator(d_values.begin()); }
const_iterator end() const
{ return const_iterator(d_values.end()); }
const_iterator find(const K& key) const
{
return const_iterator(std::find_if(d_values.begin(),
d_values.end(),
pred(key)));
}
};
}
#if defined(_MSC_VER)
# pragma warning(pop)
#endif
#endif
|