Permalink
Browse files

add tags, fix mistakes

  • Loading branch information...
1 parent 71eeaac commit 339a94e9d6bef32b130750e1e0b79fd996f00936 @qnikst committed Apr 11, 2013
Showing with 29 additions and 6 deletions.
  1. +1 −1 index.html
  2. +2 −2 posts/2013-04-11-using-tqueues-in-conduit.html
  3. +2 −2 rss.xml
  4. +4 −0 tags/haskell.html
  5. +20 −1 tags/haskell.xml
View
@@ -72,7 +72,7 @@
</ul>
-<p>Browse: <a href="./tags/cgroups.html">cgroups (1)</a>, <a href="./tags/gentoo.html">gentoo (1)</a>, <a href="./tags/hakyll.html">hakyll (1)</a>, <a href="./tags/haskell.html">haskell (6)</a>, <a href="./tags/latex.html">latex (1)</a>, <a href="./tags/linux.html">linux (1)</a>, <a href="./tags/pam.html">pam (1)</a>, <a href="./tags/phys.html">phys (1)</a>, <a href="./tags/projects.html">projects (1)</a>, <a href="./tags/resourcet.html">resourcet (1)</a>, <a href="./tags/univ.html">univ (1)</a>, <a href="./tags/web.html">web (1)</a></p>
+<p>Browse: <a href="./tags/cgroups.html">cgroups (1)</a>, <a href="./tags/gentoo.html">gentoo (1)</a>, <a href="./tags/hakyll.html">hakyll (1)</a>, <a href="./tags/haskell.html">haskell (7)</a>, <a href="./tags/latex.html">latex (1)</a>, <a href="./tags/linux.html">linux (1)</a>, <a href="./tags/pam.html">pam (1)</a>, <a href="./tags/phys.html">phys (1)</a>, <a href="./tags/projects.html">projects (1)</a>, <a href="./tags/resourcet.html">resourcet (1)</a>, <a href="./tags/univ.html">univ (1)</a>, <a href="./tags/web.html">web (1)</a></p>
<footer>
Site generated using <a href="http://jaspervdj.be/hakyll">Hakyll</a> using <a href="http://johnmacfarlane.net/pandoc/">pandoc</a>
@@ -41,8 +41,8 @@
</ul>
<p>and closable queues comming soon.</p>
<p>Here closable means that you can close a primitives outside it, so source will report that it is closed on the opposite infinite primitive will wait for an input forever, so you should use another conduit to handle end of a stream or send an asynchronous exception.</p>
-<p>Bounded means that there is an limit of pending messages inside primitive and if that limit is reached any thread that wants to write to the primitive will be blocked on input. This is basically what you need to guarantee limited (or event constant memory usage).</p>
-<p>New primitive TQueue was added in stm-2.3 and provides an shared amortized queue that is faster than TChan/Chan but doesn’t provide dupTChan, cloneTChan primitives.</p>
+<p>Bounded means that there is a limit of pending messages inside primitive and if that limit is reached any thread that wants to write to the primitive will be blocked on input. This is basically what you need to guarantee limited (or even constant) memory usage.</p>
+<p>New primitive TQueue was added in stm-2.3 and provides shared amortized queue that is faster than TChan/Chan but doesn’t provide dupTChan, cloneTChan primitives.</p>
<hr />
<div class="pull-right">
<em>Alexander Vershilov</em>
View
@@ -25,8 +25,8 @@
</ul>
<p>and closable queues comming soon.</p>
<p>Here closable means that you can close a primitives outside it, so source will report that it is closed on the opposite infinite primitive will wait for an input forever, so you should use another conduit to handle end of a stream or send an asynchronous exception.</p>
-<p>Bounded means that there is an limit of pending messages inside primitive and if that limit is reached any thread that wants to write to the primitive will be blocked on input. This is basically what you need to guarantee limited (or event constant memory usage).</p>
-<p>New primitive TQueue was added in stm-2.3 and provides an shared amortized queue that is faster than TChan/Chan but doesn’t provide dupTChan, cloneTChan primitives.</p>]]></summary>
+<p>Bounded means that there is a limit of pending messages inside primitive and if that limit is reached any thread that wants to write to the primitive will be blocked on input. This is basically what you need to guarantee limited (or even constant) memory usage.</p>
+<p>New primitive TQueue was added in stm-2.3 and provides shared amortized queue that is faster than TChan/Chan but doesn’t provide dupTChan, cloneTChan primitives.</p>]]></summary>
</entry>
<entry>
<title>Anouncing binary conduit</title>
View
@@ -30,6 +30,10 @@
<h1>All posts</h1>
<ul>
<li>
+ <a href="../posts/2013-04-11-using-tqueues-in-conduit.html">Using queues in conduits</a>
+ - <em>April 11, 2013</em> - by <em>Alexander Vershilov</em>
+</li>
+<li>
<a href="../posts/2013-04-07-announcing-binary-conduit.html">Anouncing binary conduit</a>
- <em>April 7, 2013</em> - by <em>Alexander Vershilov</em>
</li>
View
@@ -8,8 +8,27 @@
<name>Alexander Vershilov</name>
<email>alexander.vershilov@gmail.com</email>
</author>
- <updated>2013-04-07T00:00:00Z</updated>
+ <updated>2013-04-11T00:00:00Z</updated>
<entry>
+ <title>Using queues in conduits</title>
+ <link href="http://qnikst.github.com/posts/2013-04-11-using-tqueues-in-conduit.html" />
+ <id>http://qnikst.github.com/posts/2013-04-11-using-tqueues-in-conduit.html</id>
+ <published>2013-04-11T00:00:00Z</published>
+ <updated>2013-04-11T00:00:00Z</updated>
+ <summary type="html"><![CDATA[<p>Sometime when you use conduit you need to split processes for example when you have CPU bound and IO bound tasks thus you will have better workload. Also you may need to get events from different sources concurrently, and for such purposes you may want to use <a href="http://hackage.haskell.org/package/stm-conduit">stm-conduit</a> library.</p>
+<p>This library provides conduits over STM primitives:</p>
+<ul>
+<li><a href="http://hackage.haskell.org/packages/archive/stm-chans/1.3.1/doc/html/Control-Concurrent-STM-TMChan.html#t:TMChan">TMChans</a> - closable (finite) STM channels</li>
+<li><a href="http://hackage.haskell.org/packages/archive/stm-chans/1.3.1/doc/html/Control-Concurrent-STM-TBMChan.html#t:TBMChan">TBMChans</a> - closable (finite) bounded STM channels</li>
+<li><a href="http://hackage.haskell.org/packages/archive/stm/2.4.2/doc/html/Control-Concurrent-STM-TQueue.html#t:TQueue">TQueue</a> - infinite STM Queues</li>
+<li><a href="http://hackage.haskell.org/packages/archive/stm/2.4.2/doc/html/Control-Concurrent-STM-TBQueue.html#t:TBQueue">TBQueue</a> - infinite bounded STM Queues</li>
+</ul>
+<p>and closable queues comming soon.</p>
+<p>Here closable means that you can close a primitives outside it, so source will report that it is closed on the opposite infinite primitive will wait for an input forever, so you should use another conduit to handle end of a stream or send an asynchronous exception.</p>
+<p>Bounded means that there is a limit of pending messages inside primitive and if that limit is reached any thread that wants to write to the primitive will be blocked on input. This is basically what you need to guarantee limited (or even constant) memory usage.</p>
+<p>New primitive TQueue was added in stm-2.3 and provides shared amortized queue that is faster than TChan/Chan but doesn’t provide dupTChan, cloneTChan primitives.</p>]]></summary>
+</entry>
+<entry>
<title>Anouncing binary conduit</title>
<link href="http://qnikst.github.com/posts/2013-04-07-announcing-binary-conduit.html" />
<id>http://qnikst.github.com/posts/2013-04-07-announcing-binary-conduit.html</id>

0 comments on commit 339a94e

Please sign in to comment.