delta/python-packages/qpid-python.git/cpp/src/tests/InlineVector.cpp, branch qpid.0-10

src/qpid/RangeSet.h: generic set implementation using ranges.

2008-04-21T16:36:08+00:00

 - no heap allocation for simple sets (<= 3 ranges)
 - binary searches for o(log(n)) performance in complex sets


git-svn-id: https://svn.apache.org/repos/asf/incubator/qpid/trunk/qpid@650198 13f79535-47bb-0310-9956-ffa450edef68

Patch for improved compatibility with gcc 3.4 and boost 1.33

2008-04-17T21:46:22+00:00

git-svn-id: https://svn.apache.org/repos/asf/incubator/qpid/trunk/qpid@649294 13f79535-47bb-0310-9956-ffa450edef68

Fixed to build with boost 1.34 as well as boost 1.33

2007-11-28T17:13:28+00:00

 - boost::ptr_map API changed.
 - Boost.Test unit test framework changes.


git-svn-id: https://svn.apache.org/repos/asf/incubator/qpid/trunk/qpid@599067 13f79535-47bb-0310-9956-ffa450edef68

Added qpid::InlineVector - std::vector with inline storage to avoid

2007-11-16T20:16:23+00:00

heap allocation for small vectors.

Made SequenceNumberSet : public InlineVector

In 100k perftest reduces heap allocation in client by  40%, broker 9%.
.


git-svn-id: https://svn.apache.org/repos/asf/incubator/qpid/trunk/qpid@595808 13f79535-47bb-0310-9956-ffa450edef68