- Boost-users - lists.preview.boost.org

[MP11] Loosing const-qualification on type result with GCC 4.8 only
by Mateusz Loskot 25 Apr '19

25 Apr '19

Hi, I prepared a lenghty MWE which reproduces my problem with type manipulation using MP11 that for some reason looses const-qualification on a ::type result Here it is at https://godbolt.org/z/eCsakP and copied below. I hope the XXXXXX comments make sense and important static assertions in the main() at the bottom explain what is the expected result. ``` #include <boost/mp11.hpp> #include <cstdint> #include <type_traits> namespace mp11 = boost::mp11; template <typename BitField, int FirstBit, int NumBits, bool IsMutable> struct bit_range_reference { /* long definition, irrelevant */ }; template <typename BitField, typename FirstBit, typename NumBits> struct bit_range_reference_type { using type = bit_range_reference < BitField, FirstBit::value, NumBits::value, true > const; // XXXXXX Why this const gets lost with GCC 4.8 XXXXXX }; template <typename BitField, typename RangeBitSizes> class bit_range_reference_list { template <typename FirstBit, typename NumBits> using reference_type = typename bit_range_reference_type < BitField, FirstBit, NumBits >::type; // XXXXXX Should carry the const, shouldn't? GCC >4.8 do. // If RangeBitSizes is mp11::mp_list_c<int,7,7,2> // then first_bit_list will be mp11::mp_list_c<int,0,7,14,16> using first_bit_list = mp11::mp_fold_q < RangeBitSizes, mp11::mp_list<std::integral_constant<int, 0>>, mp11::mp_bind < mp11::mp_push_back, mp11::_1, mp11::mp_bind < mp11::mp_plus, mp11::mp_bind<mp11::mp_back, mp11::_1>, mp11::_2 > > >; static_assert(mp11::mp_at_c<first_bit_list, 0>::value == 0, "first bit must be 0"); public: using type = mp11::mp_transform < reference_type, mp11::mp_pop_back<first_bit_list>, RangeBitSizes >; }; using reference3_list = typename bit_range_reference_list < std::uint8_t, mp11::mp_list_c<int, 3> >::type; int main() { using r1_t = mp11::mp_at_c<reference3_list, 0>; using r2_t = bit_range_reference<std::uint8_t, 0, 3, true>; using r2c_t= bit_range_reference<std::uint8_t, 0, 3, true> const; //#if defined(__GNUC__) && (__GNUC__ == 4) // GCC 4.8 compiles, later versions of GCC fail to compile static_assert(std::is_same<r1_t, r2_t>::value, "GCC says r1_t is const-qualified"); //#else // GCC 4.9, 5, 6, 7, 8 versions compile, GCC 4.8 fail to compile static_assert(std::is_same<r1_t, r2c_t>::value, "GCC says r1_t is NOT const-qualified"); //#endif } ``` To summary, I expect this to yield true: std::is_same < mp11::mp_at_c<reference3_list, 0> bit_range_reference<std::uint8_t, 0, 3, true> const > I got this confirmed by all GCC versions but GCC 4.8. (clang and MSVC also seem to agree with the GCC >= 4.9) Is mp11::mp_transform loosing const-qualification or have I made a mistake somewhere? I'm using Boost.MP11 from Boost 1.70 and from current develop branch Best regards, -- Mateusz Loskot, http://mateusz.loskot.net

1 0

Building Boost 1.70 with VS2019?
by Osman Zakir 19 Apr '19

19 Apr '19

Hi, everyone. How can I have Boost.Build use VS2019 when building Boost? I have a side-by-side installation of VS2019 on my computer, along with VS2017 also still being there. If this hasn't been tested yet, I'll wait until it has.

3 4

boost::xpressive use of before(...)
by Simon Giddings 18 Apr '19

18 Apr '19

Good morning, In our project I have the enviable task of transforming a large number of perl regex into boost::xpressive static code in c++. To ensure that the code I write, I have put together a simple test app where I create the sregex object and can then test that the result is that which is exected. I am stuck with the use of before(...) Here is my test - which fails std::string strInput = "&9-A02FEfoo"; sregex re; re = bos >> as_xpr("&9-A02FE") >> before("foo"); if(regex_match(strInput, sm, re)) { strResult = "matched : " + sm[0].str(); } According to the documentation (v1.67) this should work. What am I doing wrong here ? Best regards Simon

2 1

Need help resolving Boost error with Log Library: Candidate function not viable, expects an l-value for 1st argument
by Austin Tapp 15 Apr '19

15 Apr '19

Hello, I am trying to resolve this error: "5. Candidate function [with LoggerT = boost::log::v2s_mt_posix::sources::severity_logger_mt<boost::log::v2s_mt_posix::trivial::severity_level>] not viable: expects an l-value for 1st argument". This error results in the inability to use the function "make_record_pump", in my .cxx file, because "make_record_pump" is not recognized as a function within "record_ostream.hpp" due to the previous error. I am attempting to compile this project on Xcode 10.2, after building the project with the newest version of CMake. I have built boost (version 1.69.0) and installed the dynamic libraries with homebrew. Thank you, Austin Tapp

1 0

[gil] Boost.MPL replaced with Boost.MP11
by Mateusz Loskot 14 Apr '19

14 Apr '19

Hi, FYI, Boost.GIL switched from MPL and TypeTraits to MP11 (thank you Peter Dimov!) and C++11 <type_traits>: https://github.com/boostorg/gil/pull/274 This is a significant refactoring and as such it may have introduced bugs. GIL tests coverage had not been 100% and despite we've added numerous new tests, it's still far from complete. Any GIL users out there, if you notice any bugs, please let us know by opening new issue at GitHub or posting to to https://lists.boost.org/boost-gil/ Best regards, -- Mateusz Loskot, http://mateusz.loskot.net

1 0

[release] Boost 1.70.0
by Marshall Clow 12 Apr '19

12 Apr '19

Release 1.70.0 of the Boost C++ Libraries is now available. These open-source libraries work well with the C++ Standard Library, and are usable across a broad spectrum of applications. The Boost license encourages both commercial and non-commercial use. This release contains numerous enhancements and bug fixes for existing libraries. For details, including download links, see < http://www.boost.org/users/news/version_1.70.0> You can also download directly from: < https://dl.bintray.com/boostorg/release/1.70.0/source> SHA-256 sums: ae2bb1b35d1f238e72e3f819b42336f4bd27c9ed2092aab5d87818ccb0c9161a boost_1_70_0.7z 430ae8354789de4fd19ee52f3b1f739e1fba576f0aded0897c3c2bc00fb38778 boost_1_70_0.tar.bz2 882b48708d211a5f48e60b0124cf5863c1534cd544ecd0664bb534a4b5d506e9 boost_1_70_0.tar.gz 48f379b2e90dd1084429aae87d6bdbde9670139fa7569ee856c8c86dd366039d boost_1_70_0.zip To install this release on your system, see < http://www.boost.org/doc/libs/release/more/getting_started/index.html> Thanks to everyone who participated in this release. Thanks, -- The Boost Release Team Vladimir Prus, Marshall Clow, Daniel James, Micheal Caisse

4 3

[release] Boost 1.70.0 Release Candidate 2 available
by Marshall Clow 11 Apr '19

11 Apr '19

The second release candidate for the 1.70.0 release are now available at: <https://dl.bintray.com/boostorg/release/1.70.0/source/> Changes since rc1: * Boost.Config changes to work better with msvc-14.2 * Boost.Beast bug fixes * Boost.Move bug fix * Boost.Math non-ascii characters removed from header file The SHA256 checksums are as follows: 882b48708d211a5f48e60b0124cf5863c1534cd544ecd0664bb534a4b5d506e9 ./boost_1_70_0_rc2.tar.gz 430ae8354789de4fd19ee52f3b1f739e1fba576f0aded0897c3c2bc00fb38778 ./boost_1_70_0_rc2.tar.bz2 48f379b2e90dd1084429aae87d6bdbde9670139fa7569ee856c8c86dd366039d ./boost_1_70_0_rc2.zip ae2bb1b35d1f238e72e3f819b42336f4bd27c9ed2092aab5d87818ccb0c9161a ./boost_1_70_0_rc2.7z As always, the release managers would appreciate it if you download the candidate of your choice and give building it a try. Please report both success and failure, and anything else that is noteworthy. -- The Boost Release Managers

3 5

[variant2] Review - Review period extended until April 15
by Michael Caisse 09 Apr '19

09 Apr '19

Hi all - The review period for Boost.Variant2 has bee extended to April 15. Thank you to those who have participated so far. There has been a fair amount of discussion about the merits of never valueless. A core design _feature_ of Variant2 is never valueless. You may have made different trade-offs. Understanding motives makes sense but in this review we are not trying to change this basic design choice. This paper by Peter discusses valueless variants some and may be useful reading: <http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2016/p0308r0.html> If you haven't started your review yet, you have time! Reviews ranging from detailed discussions of inner workings to a user-perspective of the library and documentation are all helpful. I personally believe we need more user-based reviews in Boost. So, feeling sheepish about reviewing? Don't! Your review is important in the process. Here is one more motivation if you are on the fence ... Peter's code is a joy to read. The library is extremely clean and the code is accessible. There might be all kinds of things you learn from reading the source. Thank you again community for staying involved. We get great libraries when people ask questions, review, and provide input to everything from the docs to the design. Happy coding! michael -- Michael Caisse Ciere Consulting ciere.com

1 0

Re: [Boost-users] [boost] [release] Boost 1.70.0 Release Candidate 1 available
by Vinnie Falco 09 Apr '19

09 Apr '19

On Mon, Apr 8, 2019 at 3:51 PM Stefan Seefeld <stefan(a)seefeld.name> wrote: > At this point in time, I'd argue...fixes, to make sure... > But soft, what commit through yonder git log states? It is a bug, and 5e88637752ea0ecb49824904be3098656740298c is the fix! ... To merge, or not to merge? That is the question. Regards

1 0

[release] Boost 1.70.0 Release Candidate 1 available
by Marshall Clow 08 Apr '19

08 Apr '19

The release candidates for the 1.70.0 release are now available at: <https://dl.bintray.com/boostorg/release/1.70.0/source/> The SHA256 checksums are as follows: 6e5cba1269225395bb5e78dda48441ccadaf745e42638180015e9e6257068336 ./boost_1_70_0_rc1.7z 35d8e1361e2063f70aa3a6ca0dd8af0877ceb75477ebbd2c726bb1d039658c7a ./boost_1_70_0_rc1.tar.bz2 ec8ddbbee2fd61e2f78a1dfe9a07ad83ca8f6a2f4c704d6f297d89c6afdc4f2c ./boost_1_70_0_rc1.tar.gz ee2c3b97ce10f85a31b6a105ad8edf1c20fb4b936c9a6e6008206059cb98ab1b ./boost_1_70_0_rc1.zip As always, the release managers would appreciate it if you download the candidate of your choice and give building it a try. Please report both success and failure, and anything else that is noteworthy. -- The Boost Release Managers

8 15

Newbie error trying to construct an offset_ptr in a managed shared memory segment.
by Bill Baker 03 Apr '19

03 Apr '19

1 0

cannot compile boost pmr small_vector snippet
by Pedro Pinto pedro.pinto＠bluetradesys.com 02 Apr '19

02 Apr '19

Hi there, I am trying to use the pmr version of the boost small_vector container. I expected the following to work: #include <boost/container/pmr/polymorphic_allocator.hpp>#include <boost/container/pmr/small_vector.hpp> boost::container::pmr::polymorphic_allocator<int> alloc; boost::container::pmr::small_vector<int,4> vec(alloc); But this does not compile with boost 65, gcc 7.3/clang 6.0. The compile error seems to suggest I should be using small_vector_allocator which is an internal class. The exact clang error is below. Am I missing something here? Thanks /usr/include/boost/container/small_vector.hpp:514:41: note: candidate constructor not viable: no known conversion from 'boost::container::pmr::polymorphic_allocator<int>' to 'const boost::container::small_vector<int, 4, boost::container::pmr::polymorphic_allocator<int> >::allocator_type' (aka 'const small_vector_allocator<boost::container::pmr::polymorphic_allocator<int> >') for 1st argument BOOST_CONTAINER_FORCEINLINE explicit small_vector(const allocator_type &a)

1 0

[variant2] Review of Variant2 started today : April 1 - April 10
by Michael Caisse 02 Apr '19

02 Apr '19

The Boost formal review of Peter Dimov's Variant2 library will take place April 1 - 10, 2019. Please consider participating in this review. The success of Boost is partially a result of the quality review process which is conducted by the community. You are part of the Boost community. I will be grateful to receive a review based on whatever level of effort or time you can devote. Variant2 is a never-valueless C++11/14/17 implementation of std::variant. >From the README: The class boost::variant2::variant<T...> is an almost conforming implementation of std::variant with the following differences: * A converting constructor from, e.g. variant<int, float> to variant<float, double, int> is provided as an extension; * The reverse operation, going from variant<float, double, int> to variant<int, float> is provided as the member function subset<U...>. (This operation can throw if the current state of the variant cannot be represented.) * variant<T...> is not trivial when all contained types are trivial. To avoid going into a valueless-by-exception state, this implementation falls back to using double storage unless * one of the alternatives is the type monostate, * one of the alternatives has a nonthrowing default constructor, or * all the contained types are nothrow move constructible. If the first two bullets don't hold, but the third does, the variant uses single storage, but emplace constructs a temporary and moves it into place if the construction of the object can throw. In case this is undesirable, one can force emplace into always constructing in- place by adding monostate as one of the alternatives. You can find the source code here: <https://github.com/pdimov/variant2> The master branch will be stable for the review: <https://github.com/pdimov/variant2/tree/master> Find the documentation here (also stable during the review): <https://pdimov.github.io/variant2/doc/html/variant2.html> Note: The repository contains an expected implementation also; however, that is not being considered in this review. Please provide in your review information you think is valuable to understand your choice to ACCEPT or REJECT including Variant2 as a Boost library. Please be explicit about your decision (ACCEPT or REJECT). Some other questions you might want to consider answering: - What is your evaluation of the design? - What is your evaluation of the implementation? - What is your evaluation of the documentation? - What is your evaluation of the potential usefulness of the library? - Did you try to use the library? With which compiler(s)? Did you have any problems? - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? - Are you knowledgeable about the problem domain? More information about the Boost Formal Review Process can be found here: <http://www.boost.org/community/reviews.html> Thank you for your effort in the Boost community. Happy coding - michael -- Michael Caisse Ciere Consulting ciere.com

1 0

[boost][stacktrace] stacktrace keep eating memory
by Hao Jiang 29 Mar '19

29 Mar '19

I am using stacktrace on Windows. I found stacktrace keep eating my memory. A simple test program: void foo() { auto st = boost::stacktrace::stacktrace{}; auto line = st.begin()->source_line(); std::cout << line << std::endl; } void main() { for (int i = 0; i < 0xFFFF; i++) { foo(); } } Based on MSVC memory profiling tool, memory usage keep growth: [cid:image001.png@01D4DF46.BA4E1090] And frame allocator is taking heap: [cid:image004.png@01D4DF47.6F38C310] Anyone knows why it happens? Br, Hao. Platform: Windows 7. Compiler: MSVC 2017 Boost version: 1.67 Compile and link: release, static-link, static runtime.

2 1

[dll] Notifying a plugins host that a plugin should be unloaded
by Sean Farrow 29 Mar '19

29 Mar '19

Hi all, I have an application that uses boost.dll to provide plugin functionality. I have a base class defined that all plugins derive from. I'm looking for a way to notify the host application that a particular plugin should be unloaded. This is determined by the plugin itself. Is signals/slots appropriate here or is there a better option? Has anyone else done anything like this? Any help appreciated. Kind regards Sean.

2 1

[range] Conflict with string algorithms
by Bill Buklis 29 Mar '19

29 Mar '19

I noticed there is a conflict between boost range and the string algorithm header files. There may be others, but the specific one I was dealing with was boost::find. For example, the following code results in an ambiguous warning. This is because boost::find is defined both in algorithm/string/find.hpp and range/algorithm/find.hpp. #include <vector> #include <boost/range/algorithm.hpp> #include <boost/algorithm/string.hpp> int main() { std::vector<int> vec; boost::find(vec, 3); } Is this intentional or is it is an oversight or am I just doing something wrong? -- Bill

2 1

[review][variant2] Variant2 Review Starts April 1
by Michael Caisse 24 Mar '19

24 Mar '19

The Boost formal review of Peter Dimov's Variant2 library will take place April 1 - 10, 2019. Please consider participating in this review. The success of Boost is partially a result of the quality review process which is conducted by the community. You are part of the Boost community. I will be grateful to receive a review based on whatever level of effort or time you can devote. Variant2 is a never-valueless C++11/14/17 implementation of std::variant. >From the README: The class boost::variant2::variant<T...> is an almost conforming implementation of std::variant with the following differences: * A converting constructor from, e.g. variant<int, float> to variant<float, double, int> is provided as an extension; * The reverse operation, going from variant<float, double, int> to variant<int, float> is provided as the member function subset<U...>. (This operation can throw if the current state of the variant cannot be represented.) * variant<T...> is not trivial when all contained types are trivial. To avoid going into a valueless-by-exception state, this implementation falls back to using double storage unless * one of the alternatives is the type monostate, * one of the alternatives has a nonthrowing default constructor, or * all the contained types are nothrow move constructible. If the first two bullets don't hold, but the third does, the variant uses single storage, but emplace constructs a temporary and moves it into place if the construction of the object can throw. In case this is undesirable, one can force emplace into always constructing in- place by adding monostate as one of the alternatives. You can find the source code here: <https://github.com/pdimov/variant2> and the documentation here: <https://pdimov.github.io/variant2/doc/html/variant2.html> Please take an early look at the library and ask questions now. Peter Dimov is very active on the Cpplang Slack #boost channel; however, please consider using the Boost Dev or User Mail Lists so that the entire community might benefit from your conversation. Note: The repository contains an expected implementation also; however, that is not being considered in this review. Thank you for your participation! michael -- Michael Caisse Ciere Consulting ciere.com -- Michael Caisse Ciere Consulting ciere.com

1 0

How to keep a pointer on a shared data in a boost shared memory segment
by jucin loic 24 Mar '19

24 Mar '19

Hi everyone ! How to keep a pointer on a shared data in a boost shared memory segment ? I have a function which returns shm.construct<SharedData>(_nameSeg.c_str())(innerDataAllocator); But outside of the function, the object pointed by SharedData is inaccessible My general problem is that I want to have way to get, and set data in shared memory, but without, each time, having to : -get shm -find object in shm based on its name -construct allocators. So I would like to store 1) allocators and 2)a pointer to the shared object How could I do this ? I made a SO question about my problem, can you have a look ? It should be clearer :) https://stackoverflow.com/questions/55195149/how-to-keep-a-pointer-on-a-sha…

4 5

Future of boost.compute
by Heriberto Delgado 23 Mar '19

23 Mar '19

My apologies if this has been asked before. To be honest, I'm not good doing stuff with mailing lists. However, this is something about which I would really like to know your opinion. With Apple recently deprecating OpenCL / GL technologies in their software, and the newer APIs on the market - Vulkan, Metal - and current native APIs - DX Compute, also Metal Compute - , it sure looks like boost.compute, which is essentially a wrapper around OpenCL, is on its way to become a legacy API. That is, unless the API gets modified to allow multiple APIs and platforms. So, what do you think is going to happen? Is boost.compute eventually going to "disappear" (similar to how boost pointer classes were replaced by std:: pointer classes), or is there some kind of effort to move it beyond OpenCL and into newer APIs? - Heriberto Delgado.

1 0

Re: [Boost-users] Zero-malloc memory pool for Boost Intrusive smart pointers
by Gavin Lambert 23 Mar '19

23 Mar '19

At 09:25 23/03/2019, Francesco wrote: >Yes I know about std::make_shared<> and indeed I >was using that solution before implementing the >memory pool based on intrusive pointers. >The problem is that in my workload I have >several threads that need to get a smart pointer >to a fairly-big object every time they process >input data and they will release it later. Which brings up another point; your current implementation is not thread-safe. Which is fine, but you should probably mention that explicitly in your readme. A very common worker pattern is to have all allocations on one thread and all deallocations on another thread, and that wouldn't work as-is. >Now allocating with std::make_shared<>Â a new >object on every input data was causing my >threads to do lots of mallocs/sec and that >became the performace limiting factor. >The use of a memory pool instead allows me to do >a very large memory allocation from time to time >(in blocks of e.g. 1024 items) and still have >each single item of the memory pool independently refcounted. Yes, I realise that. It still could be possible to have individual node allocations strung up into a free list rather than requiring a larger contiguous allocation. But you're correct that arena allocation and intrusive_ptr is probably more efficient in the end. >My first implementation of the memory pool >indeed was using C++11 perfect forwarding to >call the ctor/dtor of type T when the item was >pulled out the pool or was returning to it. >I later removed such feature because I realized >that calling the ctor of the items to recycle >produced issues with classes having multiple inheritance IIRC. >I don't think it's safe and sane to call the >ctor of the same instance multiple times...Â Calls must be paired -- you allocate aligned uninitialised storage (aligned_storage), then placement-new to call the constructor on that storage, then eventually call the destructor, and then later you can placement-new again. You must never call the constructor twice in a row or the destructor twice in a row (unless it's trivial), but alternating is fine. Again, this is how things like optional and variant work internally -- and since they do that part for you, it can be useful to re-use it rather than re-implementing it.

2 1

Zero-malloc memory pool for Boost Intrusive smart pointers
by Francesco 22 Mar '19

22 Mar '19

Hi all, I have developed for my needs a C++11 memory pool that can provides C++ object instances in the form of boost::intrusive_ptr<> that automatically return to the pool once their refcount goes to zero. I found the need for such memory pool to have a zero-malloc memory pool algorithm for some performance-oriented applications that were relying on std::shared_ptr<>. Here's the link in case anybody is interested: https://github.com/f18m/boost-intrusive-pool with some (initial) benchmark as well. I thought that this may be useful to anybody else already using Boost intrusive pointers as well... Any comment is welcome! Francesco Montorsi

2 2

compile error, boost_1_70_0_b1, C++17, MSVC 1916, "/Zc:noexceptTypes-" compiler flag
by Thomas Wollenzin 20 Mar '19

20 Mar '19

Hello, We came across a compiler error with Boost version 1.70.0 b1 when compiling via MSVC 1916, C++17 standard and the "/Zc:noexceptTypes-" compiler flag set. The resulting error is of type: boost\type_traits\detail\is_member_function_pointer_cxx_11.hpp(359): error C2953: 'boost::is_member_function_pointer<Ret(__cdecl C::* )(Args...)>': class template has already been defined boost\type_traits\detail\is_member_function_pointer_cxx_11.hpp(48): note: see declaration of 'boost::is_member_function_pointer<Ret(__cdecl C::* )(Args...)>' A corresponding issue was created here: https://github.com/boostorg/type_traits/issues/118 We're wondering of the chances of getting this fixed with the final 1.70 release and if possible would like to get priority on a fix. Thanks for your time! Kind regards, Thomas Wollenzin ___________ Crytek GmbH / Hugo-Junkers-Strasse 3, 60386 Frankfurt am Main / HR B 77322 Amtsgericht Frankfurt am Main / Geschäftsführer/Managing Directors: Avni Yerli, Faruk Yerli, Ahmet Sahin / VAT-ID DE20432461 / www.crytek.com

1 0

Update to problem of http::request call failing
by Osman Zakir 20 Mar '19

20 Mar '19

Hi. I still have the same exception, but I did notice something I was doing wrong: the API endpoint and the key for the request to the currency API were wrong. I fixed them, but the exception is still there. I sent an email to the OpenSSL users mailing list to ask them if I did anything wrong in the root certificate stuff. Entire source code for app is on GitHub here: https://github.com/DragonOsman/currency_converter .

1 0

Using async_pipe as named pipe in windows
by parean 20 Mar '19

20 Mar '19

I have this code: boost::asio::io_service ios; std::vector<char> buf(20); bp::async_pipe ap(ios, "\\\\.\\pipe\\SamplePipe"); boost::asio::async_read(ap, boost::asio::buffer(buf), [](const boost::system::error_code &ec, std::size_t size) {}); ios.run(); Now, I execute "echo 42 > \\.\pipe\SamplePipe" in the cmd and expect an asynchronous read to the buffer to occur. But instead I get the following error: "All pipe instances are busy." I'm sure I'm doing something wrong. Can you please tell me what should I add to my code for it to work? -- Sent from: http://boost.2283326.n4.nabble.com/Boost-Users-f2553780.html

2 1

multi_index reserve but allocate
by Olivier Tristan 20 Mar '19

20 Mar '19

Hi, Looks like that even if I call reserve on a multi_index, it stills allocate memory while I am still below the reserve size. Is this the intended behavior ? If so, what is the best way to avoid allocation in a fixed sized multi_index Thanks ! -- Olivier Tristan Research & Development www.uvi.net

2 4