From 4f05cb2af239ca8471b77c9f1d1c32e8c4cd3abc Mon Sep 17 00:00:00 2001
From: Stanislaw Halik <sthalik@misaki.pl>
Date: Fri, 22 Mar 2013 21:48:28 +0100
Subject: Remove .bat files, actually finish rename this time

---
 faceapi/lockfree.h | 65 ++++++++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 65 insertions(+)
 create mode 100644 faceapi/lockfree.h

(limited to 'faceapi/lockfree.h')

diff --git a/faceapi/lockfree.h b/faceapi/lockfree.h
new file mode 100644
index 00000000..ce7d2a64
--- /dev/null
+++ b/faceapi/lockfree.h
@@ -0,0 +1,65 @@
+//lock free queue template class by Herb Sutter
+//Dr Dobbs Journal article http://www.drdobbs.com/cpp/210604448;jsessionid=OQGQPSMNL4X4XQE1GHPSKH4ATMY32JVN?pgno=1
+
+template <typename T> class LockFreeQueue
+{
+private:
+	struct Node
+	{
+		Node( T val ) : value(val), next(nullptr) { }
+		T value;
+		Node* next;
+	};
+  
+	Node* first;			// for producer only
+	Node* divider, last;	// shared
+
+	//not working in VC2008
+	//atomic<Node*> divider, last;	// shared
+
+public:
+	LockFreeQueue()
+	{
+		// add dummy separator		
+		first = divider = last = new Node( T() );
+  	}
+
+	~LockFreeQueue()
+	{
+		while( first != nullptr )
+		{   
+			// release the list			
+			Node* tmp = first;
+			first = tmp->next;
+			delete tmp;
+		}
+	}
+
+	void Produce( const T& t )
+	{
+		last->next = new Node(t);  	// add the new item
+		last = last->next;			// publish it
+    
+		while( first != divider )
+		{	
+			// trim unused nodes			
+			Node* tmp = first;
+			first = first->next;
+			delete tmp;
+		}
+	}
+
+	bool Consume( T& result )
+	{
+		if( divider != last )
+		{
+			// if queue is nonempty			
+			result = divider->next->value; 	// copy it back
+			divider = divider->next; 		// publish that we took it
+			return true;          			// and report success
+    		}
+		
+		return false;           			// else report empty
+	}
+};
+
-- 
cgit v1.2.3