<feed xmlns='http://www.w3.org/2005/Atom'>
<title>delta/python-packages/qpid-python.git/qpid/cpp/src/tests/InlineAllocator.cpp, branch M3</title>
<subtitle>git.apache.org: qpid.git
</subtitle>
<link rel='alternate' type='text/html' href='http://91.123.203.49/cgit/delta/python-packages/qpid-python.git/'/>
<entry>
<title>src/qpid/RangeSet.h: generic set implementation using ranges.</title>
<updated>2008-04-21T16:36:08+00:00</updated>
<author>
<name>Alan Conway</name>
<email>aconway@apache.org</email>
</author>
<published>2008-04-21T16:36:08+00:00</published>
<link rel='alternate' type='text/html' href='http://91.123.203.49/cgit/delta/python-packages/qpid-python.git/commit/?id=ff757c027f8b7142364360f0ee800c9743355903'/>
<id>ff757c027f8b7142364360f0ee800c9743355903</id>
<content type='text'>
 - no heap allocation for simple sets (&lt;= 3 ranges)
 - binary searches for o(log(n)) performance in complex sets


git-svn-id: https://svn.apache.org/repos/asf/incubator/qpid/trunk@650198 13f79535-47bb-0310-9956-ffa450edef68
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
 - no heap allocation for simple sets (&lt;= 3 ranges)
 - binary searches for o(log(n)) performance in complex sets


git-svn-id: https://svn.apache.org/repos/asf/incubator/qpid/trunk@650198 13f79535-47bb-0310-9956-ffa450edef68
</pre>
</div>
</content>
</entry>
</feed>
