/***************************************************************************************** * * * OpenSpace * * * * Copyright (c) 2014-2017 * * * * 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 OR COPYRIGHT * * HOLDERS 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 __OPENSPACE_MODULE_GLOBEBROWSING___LRU_THREAD_POOL___H__ #define __OPENSPACE_MODULE_GLOBEBROWSING___LRU_THREAD_POOL___H__ #include #include #include #include #include #include #include // Implementatin based on http://progsch.net/wordpress/?p=81 namespace openspace { namespace globebrowsing { template class LRUThreadPool; template class LRUThreadPoolWorker { public: LRUThreadPoolWorker(LRUThreadPool& pool); void operator()(); private: LRUThreadPool& _pool; }; /** * The LRUThreadPool will only enqueue a certain number of tasks. The most * recently enqueued task is the one that will be executed first. This class is templated * on a key type which used as an identifier to determine wheter or not a task with the * given key has been enqueued or not. This means that a task can be enqueued several * times. The user must ensure that an enqueued task with a given key should be * equal in outcome to a second enqueued task with the same key. This is because a second * enqueued task with the same key will simply be bumped and prioritised before other * enqueued tasks. The given task will be ignored. */ template class LRUThreadPool { public: LRUThreadPool(size_t numThreads, size_t queueSize); ~LRUThreadPool(); void enqueue(std::function f, KeyType key); bool touch(KeyType key); std::vector getQueuedTasksKeys(); std::vector getUnqueuedTasksKeys(); void clearEnqueuedTasks(); private: struct DefaultHasher { unsigned long long operator()(const KeyType& key) const { return static_cast(key); } }; friend class LRUThreadPoolWorker; std::vector _workers; cache::LRUCache, DefaultHasher> _queuedTasks; std::vector _unqueuedTasks; std::mutex _queueMutex; std::condition_variable _condition; bool _stop; }; } // namespace globebrowsing } // namespace openspace #include "lruthreadpool.inl" #endif // __OPENSPACE_MODULE_GLOBEBROWSING___LRU_THREAD_POOL___H__