From 9b9220321e647b381a999f67cad12345334b2cbe Mon Sep 17 00:00:00 2001
From: wangzhengquan <wangzhengquan85@126.com>
Date: 星期四, 06 八月 2020 13:06:23 +0800
Subject: [PATCH] update

---
 src/queue/include/shm_queue.h |   23 +++++++++++++++--------
 1 files changed, 15 insertions(+), 8 deletions(-)

diff --git a/src/queue/include/shm_queue.h b/src/queue/include/shm_queue.h
index ca5036f..5c82b05 100644
--- a/src/queue/include/shm_queue.h
+++ b/src/queue/include/shm_queue.h
@@ -38,9 +38,10 @@
 
   inline ELEM_T &operator[](unsigned i);
 
-  static void remove_queues_exclude(int keys[], size_t length);
-  static void remove_queues_include(int keys[], size_t length);
-  static void remove_queue(int key);
+ // @deprecate
+  static size_t remove_queues_exclude(int keys[], size_t length);
+  static size_t remove_queues(int keys[], size_t length);
+  static size_t remove_queue(int key);
 
 private:
 protected:
@@ -53,13 +54,15 @@
   SHMQueue<ELEM_T>(const SHMQueue<ELEM_T> &a_src);
 };
 
+// @deprecate
 template <typename ELEM_T>
-void SHMQueue<ELEM_T>::remove_queues_exclude(int keys[], size_t length) {
+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++) {
@@ -73,29 +76,33 @@
       mqueue = (LockFreeQueue<ELEM_T, SHM_Allocator> *)hashtable_get(hashtable, *keyItr);
       delete mqueue;
       hashtable_remove(hashtable, *keyItr);
+      count++;
     }
   }
   delete keyset;
+  return count;
 }
 
 
-
 template <typename ELEM_T>
-void SHMQueue<ELEM_T>::remove_queues_include(int keys[], size_t length) {
+size_t SHMQueue<ELEM_T>::remove_queues(int keys[], size_t length) {
   hashtable_t *hashtable = mm_get_hashtable();
   LockFreeQueue<ELEM_T, SHM_Allocator> *mqueue;
+  size_t count = 0;
   for(int i = 0; i< length; i++) {
     // 閿�姣佸叡浜唴瀛樼殑queue
     mqueue = (LockFreeQueue<ELEM_T, SHM_Allocator> *)mm_get_by_key(keys[i]);
     delete mqueue;
     hashtable_remove(hashtable, keys[i]);
+    count++;
   }
+  return count;
 }
 
 template <typename ELEM_T>
-void SHMQueue<ELEM_T>::remove_queue(int key) {
+size_t SHMQueue<ELEM_T>::remove_queue(int key) {
   int keys[] = {key};
-  remove_queues_include(keys, 1);
+  return remove_queues(keys, 1);
 }
 
 template <typename ELEM_T>

--
Gitblit v1.8.0