Sophie

Sophie

distrib > Mandriva > 2010.2 > i586 > media > contrib-backports > by-pkgid > 4f5f2dc0f55b453456458df885792b0b > files > 11

ucommon-doc-5.0.4-1mdv2010.2.i586.rpm

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>ucommon: queue.cpp</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<!-- Generated by Doxygen 1.6.3 -->
<div class="navigation" id="top">
  <div class="tabs">
    <ul>
      <li><a href="main.html"><span>Main&nbsp;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Data&nbsp;Structures</span></a></li>
      <li><a href="files.html"><span>Files</span></a></li>
      <li><a href="examples.html"><span>Examples</span></a></li>
    </ul>
  </div>
</div>
<div class="contents">
<h1>queue.cpp</h1><p>An example of the thread queue class. This may be relevant to producer- consumer scenarios and realtime applications where queued messages are stored on a re-usable object pool.</p>
<div class="fragment"><pre class="fragment"><span class="comment">// Copyright (C) 2010 David Sugar, Tycho Softworks.</span>
<span class="comment">//</span>
<span class="comment">// This file is part of GNU uCommon C++.</span>
<span class="comment">//</span>
<span class="comment">// GNU uCommon C++ is free software: you can redistribute it and/or modify</span>
<span class="comment">// it under the terms of the GNU Lesser General Public License as published</span>
<span class="comment">// by the Free Software Foundation, either version 3 of the License, or</span>
<span class="comment">// (at your option) any later version.</span>
<span class="comment">//</span>
<span class="comment">// GNU uCommon C++ is distributed in the hope that it will be useful,</span>
<span class="comment">// but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<span class="comment">// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</span>
<span class="comment">// GNU Lesser General Public License for more details.</span>
<span class="comment">//</span>
<span class="comment">// You should have received a copy of the GNU Lesser General Public License</span>
<span class="comment">// along with GNU uCommon C++.  If not, see &lt;http://www.gnu.org/licenses/&gt;.</span>

<span class="preprocessor">#ifndef DEBUG</span>
<span class="preprocessor"></span><span class="preprocessor">#define DEBUG</span>
<span class="preprocessor"></span><span class="preprocessor">#endif</span>
<span class="preprocessor"></span>
<span class="preprocessor">#include &lt;<a class="code" href="a00204.html" title="Top level include file for the GNU uCommon C++ core library.">ucommon/ucommon.h</a>&gt;</span>

<span class="preprocessor">#include &lt;stdio.h&gt;</span>

<span class="keyword">using namespace </span>UCOMMON_NAMESPACE;

<span class="keyword">static</span> <span class="keywordtype">unsigned</span> reused = 0;

<span class="keyword">class </span>myobject : <span class="keyword">public</span> ReusableObject
{
<span class="keyword">public</span>:
    <span class="keywordtype">unsigned</span> count;

    myobject()
        {count = ++reused;};
};

<span class="keyword">static</span> mempager pool;
<span class="keyword">static</span> paged_reuse&lt;myobject&gt; myobjects(&amp;pool, 100);
<span class="keyword">static</span> queueof&lt;myobject&gt; mycache(&amp;pool, 10);

<span class="keyword">extern</span> <span class="stringliteral">&quot;C&quot;</span> <span class="keywordtype">int</span> main()
{
    <span class="keywordtype">unsigned</span> i;

    myobject *x;
    <span class="keywordflow">for</span>(i = 0; i &lt; 10; ++i) {
        x = myobjects.create();
        mycache.post(x);
    }
    assert(x-&gt;count == 10);

    <span class="keywordflow">for</span>(i = 0; i &lt; 3; ++i) {
        x = mycache.lifo();
        assert(x != NULL);
    }
    assert(x-&gt;count == 8);

    init&lt;myobject&gt;(x);
    assert(x-&gt;count == 11);

    <span class="keywordflow">for</span>(i = 0; i &lt; 3; ++i) {
        x = mycache.lifo();
        assert(x != NULL);
        myobjects.release(x);
    }

    x = init&lt;myobject&gt;(NULL);
    assert(x == NULL);
    assert(reused == 11);
    <span class="keywordflow">return</span> 0;
}

</pre></div> </div>
<hr class="footer"/><address style="text-align: right;"><small>Generated on Thu Jul 14 16:38:56 2011 for ucommon by&nbsp;
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.6.3 </small></address>
</body>
</html>