<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Recent changes to Detailed description</title><link>https://sourceforge.net/p/sminterface/home/Detailed%2520description/</link><description>Recent changes to Detailed description</description><atom:link href="https://sourceforge.net/p/sminterface/home/Detailed%20description/feed" rel="self"/><language>en</language><lastBuildDate>Wed, 24 Aug 2011 08:49:32 -0000</lastBuildDate><atom:link href="https://sourceforge.net/p/sminterface/home/Detailed%20description/feed" rel="self" type="application/rss+xml"/><item><title>WikiPage Detailed description modified by Václav Procházka</title><link>https://sourceforge.net/p/sminterface/home/Detailed%2520description/</link><description>&lt;pre&gt;--- v7 
+++ v8 
@@ -7,7 +7,7 @@
 &lt;/p&gt;
 &lt;p style="text-align:justify"&gt;	
 SMInterface is distributed under BUT OPEN SOURCE LICENCE - you can get it here:&lt;br /&gt;
-&lt;a href="http://sourceforge.net/projects/sminterface/files/Licence.pdf/download"&gt;http://sourceforge.net/projects/sminterface/files/Licence.pdf/download&lt;/a&gt;
+&lt;a href="http://sourceforge.net/projects/sminterface/files/License.pdf/download"&gt;http://sourceforge.net/projects/sminterface/files/License.pdf/download&lt;/a&gt;
 &lt;/p&gt;
 &lt;h3 style="color:#88A; margin:0px; padding-bottom:20px"&gt;Brief usage guide&lt;/h3&gt;	
 * **Start working:**&lt;br /&gt; 
&lt;/pre&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Václav Procházka</dc:creator><pubDate>Wed, 24 Aug 2011 08:49:32 -0000</pubDate><guid>https://sourceforge.net0646dd8637dfbf5809f5eaf5d340138faf7bdc9a</guid></item><item><title>WikiPage Detailed description modified by Václav Procházka</title><link>https://sourceforge.net/p/sminterface/home/Detailed%2520description/</link><description>&lt;pre&gt;--- v6 
+++ v7 
@@ -5,6 +5,10 @@
 &lt;p style="text-align:justify"&gt;	
 Each image queue contains at least single image at all times and older images which are not used by any process are deallocated. The data queues have specific length and behave as circular buffers. The queues can contain multiple values with the same timestamp.
 &lt;/p&gt;
+&lt;p style="text-align:justify"&gt;	
+SMInterface is distributed under BUT OPEN SOURCE LICENCE - you can get it here:&lt;br /&gt;
+&lt;a href="http://sourceforge.net/projects/sminterface/files/Licence.pdf/download"&gt;http://sourceforge.net/projects/sminterface/files/Licence.pdf/download&lt;/a&gt;
+&lt;/p&gt;
 &lt;h3 style="color:#88A; margin:0px; padding-bottom:20px"&gt;Brief usage guide&lt;/h3&gt;	
 * **Start working:**&lt;br /&gt; 
     1. TSMObject SM();&lt;br /&gt;
&lt;/pre&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Václav Procházka</dc:creator><pubDate>Wed, 24 Aug 2011 08:39:59 -0000</pubDate><guid>https://sourceforge.net051876f76e6ddd1ef5b839df6ad555481a3717d3</guid></item><item><title>WikiPage Detailed description modified by Václav Procházka</title><link>https://sourceforge.net/p/sminterface/home/Detailed%2520description/</link><description>&lt;pre&gt;--- v5 
+++ v6 
@@ -5,7 +5,7 @@
 &lt;p style="text-align:justify"&gt;	
 Each image queue contains at least single image at all times and older images which are not used by any process are deallocated. The data queues have specific length and behave as circular buffers. The queues can contain multiple values with the same timestamp.
 &lt;/p&gt;
-&lt;h3 style=color:#88A; margin:0px; padding-bottom:20px"&gt;Brief usage guide&lt;/h3&gt;	
+&lt;h3 style="color:#88A; margin:0px; padding-bottom:20px"&gt;Brief usage guide&lt;/h3&gt;	
 * **Start working:**&lt;br /&gt; 
     1. TSMObject SM();&lt;br /&gt;
     * registerQueue( const string queue);  
&lt;/pre&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Václav Procházka</dc:creator><pubDate>Fri, 19 Aug 2011 08:41:18 -0000</pubDate><guid>https://sourceforge.net1dfc7ac4d3cb8dcd8f45d9c28921c31c3722aa1e</guid></item><item><title>WikiPage Detailed description modified by Václav Procházka</title><link>https://sourceforge.net/p/sminterface/home/Detailed%2520description/</link><description>&lt;pre&gt;--- v4 
+++ v5 
@@ -1,11 +1,11 @@
-&lt;h3 style="color:#CCD; margin:30px 0px 0px 0px; padding-bottom:0px"&gt;SMInterface&lt;/h3&gt;&lt;h1 style="padding-top:0px; padding-bottom:0px; margin:0px 0px 30px 0px;"&gt;Detailed description&lt;/h1&gt;
+&lt;h3 style="color:#CCD; margin:30px 0px 0px 0px; padding-bottom:0px"&gt;SMInterface&lt;/h3&gt;&lt;h1 style="color:#88A; padding-top:0px; padding-bottom:0px; margin:0px 0px 30px 0px;"&gt;Detailed description&lt;/h1&gt;
 &lt;p style="text-align:justify;"&gt;
 SMInterface allows to share timestamped images (IplImage) and data (vector&lt; float&gt;) through shared memory. It creates (or opens) its own shared memory segment. Named data- and image-queues can be created inside the shared memory and data and images can be pushed into these queues (and read from them). SMInterface can register and also deregister certain queues and only the momentarily requested ones can be computed and updated in order to minimize computation.
 &lt;/p&gt;
 &lt;p style="text-align:justify"&gt;	
 Each image queue contains at least single image at all times and older images which are not used by any process are deallocated. The data queues have specific length and behave as circular buffers. The queues can contain multiple values with the same timestamp.
 &lt;/p&gt;
-&lt;h3 style="color:#CCD; margin:0px; padding-bottom:20px"&gt;Brief usage guide&lt;/h3&gt;	
+&lt;h3 style=color:#88A; margin:0px; padding-bottom:20px"&gt;Brief usage guide&lt;/h3&gt;	
 * **Start working:**&lt;br /&gt; 
     1. TSMObject SM();&lt;br /&gt;
     * registerQueue( const string queue);  
&lt;/pre&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Václav Procházka</dc:creator><pubDate>Fri, 19 Aug 2011 08:32:14 -0000</pubDate><guid>https://sourceforge.netaa19b872ee9c9d1aa3f2dd657e8eec2f5f3792d7</guid></item><item><title>WikiPage Detailed description modified by Václav Procházka</title><link>https://sourceforge.net/p/sminterface/home/Detailed%2520description/</link><description>&lt;pre&gt;--- v3 
+++ v4 
@@ -1,14 +1,11 @@
-&lt;br /&gt;
-&lt;h3 style="padding-bottom: 0px; margin-bottom: 0px;"&gt;SMInterface&lt;/h3&gt;
-&lt;h1 style="padding-top: 0px; margin-top: 0px;"&gt;Detailed description&lt;/h1&gt;
-
-
+&lt;h3 style="color:#CCD; margin:30px 0px 0px 0px; padding-bottom:0px"&gt;SMInterface&lt;/h3&gt;&lt;h1 style="padding-top:0px; padding-bottom:0px; margin:0px 0px 30px 0px;"&gt;Detailed description&lt;/h1&gt;
+&lt;p style="text-align:justify;"&gt;
 SMInterface allows to share timestamped images (IplImage) and data (vector&lt; float&gt;) through shared memory. It creates (or opens) its own shared memory segment. Named data- and image-queues can be created inside the shared memory and data and images can be pushed into these queues (and read from them). SMInterface can register and also deregister certain queues and only the momentarily requested ones can be computed and updated in order to minimize computation.
-	
-Each image queue contains at least single image at all times and older images which are not used by any process are deallocated. 
-	
-The data queues have specific length and behave as circular buffers. The queues can contain multiple values with the same timestamp.
-	
+&lt;/p&gt;
+&lt;p style="text-align:justify"&gt;	
+Each image queue contains at least single image at all times and older images which are not used by any process are deallocated. The data queues have specific length and behave as circular buffers. The queues can contain multiple values with the same timestamp.
+&lt;/p&gt;
+&lt;h3 style="color:#CCD; margin:0px; padding-bottom:20px"&gt;Brief usage guide&lt;/h3&gt;	
 * **Start working:**&lt;br /&gt; 
     1. TSMObject SM();&lt;br /&gt;
     * registerQueue( const string queue);  
&lt;/pre&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Václav Procházka</dc:creator><pubDate>Fri, 19 Aug 2011 08:20:29 -0000</pubDate><guid>https://sourceforge.netccecda40c57f345479a763055e217383ffdd22c9</guid></item><item><title>WikiPage Detailed description modified by Václav Procházka</title><link>https://sourceforge.net/p/sminterface/home/Detailed%2520description/</link><description>&lt;pre&gt;--- v2 
+++ v3 
@@ -9,41 +9,31 @@
 	
 The data queues have specific length and behave as circular buffers. The queues can contain multiple values with the same timestamp.
 	
-**Start working:**&lt;br /&gt; 
-1) TSMObject SM();&lt;br /&gt;
-2) registerQueue( const string queue);  
-3) registerQueue( const string queue2);&lt;br /&gt;  
-
-	
-**Push Image:**&lt;br /&gt;
-1) IplImage * img = createIplImage( CvSize size, int depth, int channels);&lt;br /&gt;
-2) void pushImage( const string queue, img, long long timestamp);&lt;br /&gt;
-	
-**Get newest image:**&lt;br /&gt;
-1) getNewest( const string queue, long long &amp;timestamp, IplImage *&amp;img);&lt;br /&gt;
-2) work with the image&lt;br /&gt;
-3) returnImage( img);&lt;br /&gt;
-	
-**Get multiple images with the newest timestamp (the same timestamp):**&lt;br /&gt;
-1) long long ts = getNewestTimestamp( )&lt;br /&gt;
-2) bool success = requestTimestamp( ts);	
-3) void getImage( const string queue, long long timestamp, IplImage \*&amp; img);&lt;br /&gt;
-4) work with img&lt;br /&gt;
-5) void getImage( const string queue, long long timestamp, IplImage \*&amp; img2);&lt;br /&gt;
-6) work with img and img2&lt;br /&gt;
-...&lt;br /&gt;
-7) returnTimestamp( long long ts);&lt;br /&gt;
-	
-		
-**Push data:**&lt;br /&gt;
-bool worked = push( const std::string, std::vector&lt; float&gt; data, long long timestamp);&lt;br /&gt;
-	
-	
-**Get data for timestamp:**&lt;br /&gt;
-std::vector&lt; std::vector&lt; float&gt; &gt; get( const std::string, long long timestamp);&lt;br /&gt;
-
-**Get newest data:**&lt;br /&gt;
-std::vector&lt; std::vector&lt; float&gt; &gt; getNewest( const std::string, long long &amp;timestamp);&lt;br /&gt;
-
-**Get data newer than:** 	
-std::multi_map&lt; std::vector&lt; float&gt; &gt; getNewer( const std::string, long long timestamp);&lt;br /&gt;
+* **Start working:**&lt;br /&gt; 
+    1. TSMObject SM();&lt;br /&gt;
+    * registerQueue( const string queue);  
+    * registerQueue( const string queue2); 	
+* **Push Image:**&lt;br /&gt;
+    1. IplImage * img = createIplImage( CvSize size, int depth, int channels);&lt;br /&gt;
+    * void pushImage( const string queue, img, long long timestamp);&lt;br /&gt;
+* **Get newest image:**&lt;br /&gt;
+    1. getNewest( const string queue, long long &amp;timestamp, IplImage *&amp;img);&lt;br /&gt;
+    * work with the image&lt;br /&gt;
+    * returnImage( img);&lt;br /&gt;
+* **Get multiple images with the newest timestamp (the same timestamp):**&lt;br /&gt;
+    1. long long ts = getNewestTimestamp( );&lt;br /&gt;
+    * bool success = requestTimestamp( ts);	
+    * void getImage( const string queue, long long timestamp, IplImage \*&amp; img);&lt;br /&gt;
+    * work with img&lt;br /&gt;
+    * void getImage( const string queue, long long timestamp, IplImage \*&amp; img2);&lt;br /&gt;
+    * work with img and img2&lt;br /&gt;
+    * ...&lt;br /&gt;
+    * returnTimestamp( long long ts);&lt;br /&gt;	
+* **Push data:**&lt;br /&gt;
+    * bool worked = push( const std::string, std::vector&lt; float&gt; data, long long timestamp);&lt;br /&gt;
+* **Get data for timestamp:**&lt;br /&gt;
+    * std::vector&lt; std::vector&lt; float&gt; &gt; get( const std::string, long long timestamp);&lt;br /&gt;
+* **Get newest data:**&lt;br /&gt;
+    * std::vector&lt; std::vector&lt; float&gt; &gt; getNewest( const std::string, long long &amp;timestamp);&lt;br /&gt;
+* **Get data newer than:** 	
+    * std::multi_map&lt; std::vector&lt; float&gt; &gt; getNewer( const std::string, long long timestamp);&lt;br /&gt;
&lt;/pre&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Václav Procházka</dc:creator><pubDate>Fri, 19 Aug 2011 08:05:41 -0000</pubDate><guid>https://sourceforge.net1c5674754d7c6435d8748230453b34d917cf2bf6</guid></item><item><title>WikiPage Detailed description modified by Václav Procházka</title><link>https://sourceforge.net/p/sminterface/home/Detailed%2520description/</link><description>&lt;pre&gt;--- v1 
+++ v2 
@@ -1,5 +1,6 @@
 &lt;br /&gt;
-**SMInterface - Detailed description**
+&lt;h3 style="padding-bottom: 0px; margin-bottom: 0px;"&gt;SMInterface&lt;/h3&gt;
+&lt;h1 style="padding-top: 0px; margin-top: 0px;"&gt;Detailed description&lt;/h1&gt;
 
 
 SMInterface allows to share timestamped images (IplImage) and data (vector&lt; float&gt;) through shared memory. It creates (or opens) its own shared memory segment. Named data- and image-queues can be created inside the shared memory and data and images can be pushed into these queues (and read from them). SMInterface can register and also deregister certain queues and only the momentarily requested ones can be computed and updated in order to minimize computation.
&lt;/pre&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Václav Procházka</dc:creator><pubDate>Wed, 17 Aug 2011 06:35:40 -0000</pubDate><guid>https://sourceforge.net7a2817b328a17d40fbe63cd6bdfd4929150bc40f</guid></item><item><title>WikiPage Detailed description modified by Václav Procházka</title><link>https://sourceforge.net/p/sminterface/home/Detailed%2520description/</link><description>&lt;br /&gt;
**SMInterface - Detailed description**


SMInterface allows to share timestamped images (IplImage) and data (vector&lt; float&gt;) through shared memory. It creates (or opens) its own shared memory segment. Named data- and image-queues can be created inside the shared memory and data and images can be pushed into these queues (and read from them). SMInterface can register and also deregister certain queues and only the momentarily requested ones can be computed and updated in order to minimize computation.
	
Each image queue contains at least single image at all times and older images which are not used by any process are deallocated. 
	
The data queues have specific length and behave as circular buffers. The queues can contain multiple values with the same timestamp.
	
**Start working:**&lt;br /&gt; 
1) TSMObject SM();&lt;br /&gt;
2) registerQueue( const string queue);  
3) registerQueue( const string queue2);&lt;br /&gt;  

	
**Push Image:**&lt;br /&gt;
1) IplImage * img = createIplImage( CvSize size, int depth, int channels);&lt;br /&gt;
2) void pushImage( const string queue, img, long long timestamp);&lt;br /&gt;
	
**Get newest image:**&lt;br /&gt;
1) getNewest( const string queue, long long &amp;timestamp, IplImage *&amp;img);&lt;br /&gt;
2) work with the image&lt;br /&gt;
3) returnImage( img);&lt;br /&gt;
	
**Get multiple images with the newest timestamp (the same timestamp):**&lt;br /&gt;
1) long long ts = getNewestTimestamp( )&lt;br /&gt;
2) bool success = requestTimestamp( ts);	
3) void getImage( const string queue, long long timestamp, IplImage \*&amp; img);&lt;br /&gt;
4) work with img&lt;br /&gt;
5) void getImage( const string queue, long long timestamp, IplImage \*&amp; img2);&lt;br /&gt;
6) work with img and img2&lt;br /&gt;
...&lt;br /&gt;
7) returnTimestamp( long long ts);&lt;br /&gt;
	
		
**Push data:**&lt;br /&gt;
bool worked = push( const std::string, std::vector&lt; float&gt; data, long long timestamp);&lt;br /&gt;
	
	
**Get data for timestamp:**&lt;br /&gt;
std::vector&lt; std::vector&lt; float&gt; &gt; get( const std::string, long long timestamp);&lt;br /&gt;

**Get newest data:**&lt;br /&gt;
std::vector&lt; std::vector&lt; float&gt; &gt; getNewest( const std::string, long long &amp;timestamp);&lt;br /&gt;

**Get data newer than:** 	
std::multi_map&lt; std::vector&lt; float&gt; &gt; getNewer( const std::string, long long timestamp);&lt;br /&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Václav Procházka</dc:creator><pubDate>Tue, 16 Aug 2011 11:17:47 -0000</pubDate><guid>https://sourceforge.net8c10f5153411cf045d98bab833afbea380adef4e</guid></item></channel></rss>