3 Copyright (C) 2010-2013 celeron55, Perttu Ahola <celeron55@gmail.com>
5 This program is free software; you can redistribute it and/or modify
6 it under the terms of the GNU Lesser General Public License as published by
7 the Free Software Foundation; either version 2.1 of the License, or
8 (at your option) any later version.
10 This program is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU Lesser General Public License for more details.
15 You should have received a copy of the GNU Lesser General Public License along
16 with this program; if not, write to the Free Software Foundation, Inc.,
17 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
20 #ifndef UTIL_CONTAINER_HEADER
21 #define UTIL_CONTAINER_HEADER
23 #include "../irrlichttypes.h"
24 #include "../exceptions.h"
25 #include "../jthread/jmutex.h"
26 #include "../jthread/jmutexautolock.h"
27 #include "../jthread/jsemaphore.h"
35 Queue with unique values with fast checking of value existence
38 template<typename Value>
44 Does nothing if value is already queued.
47 false: value already exists
49 bool push_back(const Value& value)
51 if (m_set.insert(value).second)
61 m_set.erase(m_queue.front());
65 const Value& front() const
67 return m_queue.front();
72 return m_queue.size();
76 std::set<Value> m_set;
77 std::queue<Value> m_queue;
80 template<typename Key, typename Value>
88 void set(const Key &name, const Value &value)
90 JMutexAutoLock lock(m_mutex);
92 m_values[name] = value;
95 bool get(const Key &name, Value *result)
97 JMutexAutoLock lock(m_mutex);
99 typename std::map<Key, Value>::iterator n;
100 n = m_values.find(name);
102 if(n == m_values.end())
111 std::vector<Value> getValues()
113 std::vector<Value> result;
114 for(typename std::map<Key, Value>::iterator
115 i = m_values.begin();
116 i != m_values.end(); ++i){
117 result.push_back(i->second);
128 std::map<Key, Value> m_values;
133 Generates ids for comparable values.
134 Id=0 is reserved for "no value".
137 - Returning value by id (very fast)
138 - Returning id by value
139 - Generating a new id for a value
142 - Remove an id/value pair (is possible to implement but slow)
145 class MutexedIdGenerator
152 // Returns true if found
153 bool getValue(u32 id, T &value)
157 JMutexAutoLock lock(m_mutex);
158 if(m_id_to_value.size() < id)
160 value = m_id_to_value[id-1];
164 // If id exists for value, returns the id.
165 // Otherwise generates an id for the value.
166 u32 getId(const T &value)
168 JMutexAutoLock lock(m_mutex);
169 typename std::map<T, u32>::iterator n;
170 n = m_value_to_id.find(value);
171 if(n != m_value_to_id.end())
173 m_id_to_value.push_back(value);
174 u32 new_id = m_id_to_value.size();
175 m_value_to_id.insert(value, new_id);
181 // Values are stored here at id-1 position (id 1 = [0])
182 std::vector<T> m_id_to_value;
183 std::map<T, u32> m_value_to_id;
187 FIFO queue (well, actually a FILO also)
205 m_list.push_front(t);
212 throw ItemNotFoundException("Queue: queue is empty");
214 typename std::list<T>::iterator begin = m_list.begin();
223 throw ItemNotFoundException("Queue: queue is empty");
225 typename std::list<T>::iterator last = m_list.back();
239 return m_list.empty();
248 Thread-safe FIFO queue (well, actually a FILO also)
255 template<typename Key, typename U, typename Caller, typename CallerData>
256 friend class RequestQueue;
263 JMutexAutoLock lock(m_mutex);
264 return (m_size.GetValue() == 0);
268 JMutexAutoLock lock(m_mutex);
273 /* this version of pop_front returns a empty element of T on timeout.
274 * Make sure default constructor of T creates a recognizable "empty" element
276 T pop_frontNoEx(u32 wait_time_max_ms)
278 if (m_size.Wait(wait_time_max_ms))
280 JMutexAutoLock lock(m_mutex);
282 typename std::list<T>::iterator begin = m_list.begin();
293 T pop_front(u32 wait_time_max_ms)
295 if (m_size.Wait(wait_time_max_ms))
297 JMutexAutoLock lock(m_mutex);
299 typename std::list<T>::iterator begin = m_list.begin();
306 throw ItemNotFoundException("MutexedQueue: queue is empty");
314 JMutexAutoLock lock(m_mutex);
316 typename std::list<T>::iterator begin = m_list.begin();
322 T pop_back(u32 wait_time_max_ms=0)
324 if (m_size.Wait(wait_time_max_ms))
326 JMutexAutoLock lock(m_mutex);
328 typename std::list<T>::iterator last = m_list.end();
336 throw ItemNotFoundException("MutexedQueue: queue is empty");
340 /* this version of pop_back returns a empty element of T on timeout.
341 * Make sure default constructor of T creates a recognizable "empty" element
343 T pop_backNoEx(u32 wait_time_max_ms=0)
345 if (m_size.Wait(wait_time_max_ms))
347 JMutexAutoLock lock(m_mutex);
349 typename std::list<T>::iterator last = m_list.end();
365 JMutexAutoLock lock(m_mutex);
367 typename std::list<T>::iterator last = m_list.end();
380 // NEVER EVER modify the >>list<< you got by using this function!
381 // You may only modify it's content
382 std::list<T> & getList()