summaryrefslogtreecommitdiff
path: root/cpp/src/qpid/concurrent/LockedQueue.h
diff options
context:
space:
mode:
authorAlan Conway <aconway@apache.org>2006-11-01 21:43:43 +0000
committerAlan Conway <aconway@apache.org>2006-11-01 21:43:43 +0000
commit4d12deb7e15ccb488d93704f6c2a2740a09a40cd (patch)
tree61c390737bc9850192ea01499722683e3bb24e1d /cpp/src/qpid/concurrent/LockedQueue.h
parent46bd95f010c850fc5e3d158481dd0aa9959a842b (diff)
downloadqpid-python-4d12deb7e15ccb488d93704f6c2a2740a09a40cd.tar.gz
Removed unused code.
git-svn-id: https://svn.apache.org/repos/asf/incubator/qpid/trunk/qpid@470110 13f79535-47bb-0310-9956-ffa450edef68
Diffstat (limited to 'cpp/src/qpid/concurrent/LockedQueue.h')
-rw-r--r--cpp/src/qpid/concurrent/LockedQueue.h68
1 files changed, 0 insertions, 68 deletions
diff --git a/cpp/src/qpid/concurrent/LockedQueue.h b/cpp/src/qpid/concurrent/LockedQueue.h
deleted file mode 100644
index e55bd9f25a..0000000000
--- a/cpp/src/qpid/concurrent/LockedQueue.h
+++ /dev/null
@@ -1,68 +0,0 @@
-/*
- *
- * Copyright (c) 2006 The Apache Software Foundation
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- *
- */
-#ifndef _LockedQueue_
-#define _LockedQueue_
-
-#include <queue>
-#include "qpid/concurrent/Monitor.h"
-
-/**
- * A threadsafe queue abstraction
- */
-namespace qpid {
-namespace concurrent {
- template<class T, class L> class LockedQueue
- {
- L lock;
- std::queue<T*> queue;
-
- public:
- void put(T* item);
- T* take();
- bool empty();
- };
-
- template<class T, class L> void LockedQueue<T, L>::put(T* item){
- lock.acquire();
- queue.push(item);
- lock.release();
- }
-
- template<class T, class L> T* LockedQueue<T, L>::take(){
- lock.acquire();
- T* item = 0;
- if(!queue.empty()){
- item = queue.front();
- queue.pop();
- }
- lock.release();
- return item;
- }
-
- template<class T, class L> bool LockedQueue<T, L>::empty(){
- lock.acquire();
- bool result = queue.empty();
- lock.release();
- return result;
- }
-
-}
-}
-
-
-#endif