/usr/share/doc/libucommon-dev/a00011.html is in libucommon-doc 3.2.0-0ubuntu1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 | <!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 Page</span></a></li>
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
<li><a href="annotated.html"><span>Data 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 <http://www.gnu.org/licenses/>.</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 <<a class="code" href="a00210.html" title="Top level include file for the GNU uCommon C++ core library.">ucommon/ucommon.h</a>></span>
<span class="preprocessor">#include <stdio.h></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<myobject> myobjects(&pool, 100);
<span class="keyword">static</span> queueof<myobject> mycache(&pool, 10);
<span class="keyword">extern</span> <span class="stringliteral">"C"</span> <span class="keywordtype">int</span> main()
{
myobject *x;
<span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> i = 0; i < 10; ++i) {
x = myobjects.create();
mycache.post(x);
}
assert(x->count == 10);
<span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> i = 0; i < 3; ++i) {
x = mycache.lifo();
assert(x != NULL);
}
assert(x->count == 8);
init<myobject>(x);
assert(x->count == 11);
<span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> i = 0; i < 3; ++i) {
x = mycache.lifo();
assert(x != NULL);
myobjects.release(x);
}
x = init<myobject>(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 Tue Jul 6 08:22:01 2010 for UCommon by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.6.3 </small></address>
</body>
</html>
|