| | |
| | | |
| | | ELEM_T &operator[](unsigned i); |
| | | |
| | | // @deprecate |
| | | static size_t remove_queues_exclude(int keys[], size_t length); |
| | | |
| | | private: |
| | | protected: |
| | |
| | | SHMQueue<ELEM_T>(const SHMQueue<ELEM_T> &a_src); |
| | | }; |
| | | |
| | | // @deprecate |
| | | // template <typename ELEM_T> |
| | | // size_t SHMQueue<ELEM_T>::remove_queues_exclude(int keys[], size_t length) { |
| | | // hashtable_t *hashtable = mm_get_hashtable(); |
| | | // std::set<int> *keyset = hashtable_keyset(hashtable); |
| | | // std::set<int>::iterator keyItr; |
| | | // LockFreeQueue<ELEM_T, SHM_Allocator> *mqueue; |
| | | // bool found; |
| | | // size_t count = 0; |
| | | // for (keyItr = keyset->begin(); keyItr != keyset->end(); keyItr++) { |
| | | // found = false; |
| | | // for (size_t i = 0; i < length; i++) { |
| | | // if (*keyItr == keys[i]) { |
| | | // found = true; |
| | | // break; |
| | | // } |
| | | // } |
| | | // if (!found && *keyItr > 100) { |
| | | // // 销毁共享内存的queue |
| | | // mqueue = (LockFreeQueue<ELEM_T, SHM_Allocator> *)hashtable_get(hashtable, *keyItr); |
| | | // delete mqueue; |
| | | // hashtable_remove(hashtable, *keyItr); |
| | | // count++; |
| | | // } |
| | | // } |
| | | // delete keyset; |
| | | // return count; |
| | | // } |
| | | |
| | | |
| | | |
| | | |