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

Iterator Range, sub range of a desired size
by David Kimmel 02 Nov '12

02 Nov '12

Is there a function in BOOST, given a starting point and a desired size, that returns iterators for a (sub) range? For example, given: a boost::circular_buffer which contains: 1 2 3 4 5 6 7 8 9 10 a starting point which is an iterator pointing to 5 and finally a desired size which is an int s = 4 The result of which would be iterators producing: 5 6 7 8 A possible implementation might be this (but I was hoping there was a BOOST version since I can't find an STD algorithm) template <typename Itr> std::pair<Itr, Itr> getWindowDown(Itr begin, Itr end, Itr start, const int windowSize) { // Down first, then up if need be const Itr bottom = (end - start > windowSize) ? (start + windowSize) : (end); const Itr top = (bottom - begin > windowSize) ? (bottom - windowSize) : (begin); return make_pair(top, bottom); } Thanks, -- View this message in context: http://boost.2283326.n4.nabble.com/Iterator-Range-sub-range-of-a-desired-si… Sent from the Boost - Users mailing list archive at Nabble.com.

6 17

bug of boost algorithm library or boost asio?
by kpzhang 01 Nov '12

01 Nov '12

Hi, Apologize if this is not the right place for this mail. This program (it has been narrowed down from a larger program) always crashes after compiled in vs2008 Release(Win32) mode under windows 7. I am not familiar with assembly code and don't know it's a bug of compiler or boost::ends_with or boost::asio::buffers_iterator. It can be compiled and executed with g++ in Ubuntu without any problem. People said it's very unlikely to be compiler's bug, but when compiled in debug moded(or disable optimization), the problem does disappear. I have been stuck with this problem for quite a few hours. Any help is appreciated. Thanks in advance. #include <iostream>#include <string>#include <boost/asio.hpp>#include <boost/algorithm/string.hpp> typedef boost::asio::buffers_iterator<boost::asio::const_buffers_1> iterator_t;typedef boost::iterator_range<iterator_t> range_t;static const std::string LINE_END_MARK = "\r\n"; int main(int argc, char* argv[]){ boost::asio::streambuf _buf; std::ostream os(&_buf); os<<"END\r\n"; iterator_t cursor = boost::asio::buffers_begin(_buf.data()); iterator_t end = boost::asio::buffers_end(_buf.data()); std::ostream_iterator<char> it(std::cout," "); std::copy(LINE_END_MARK.begin(), LINE_END_MARK.end(), it); range_t r(cursor, end); if(!boost::ends_with(r, LINE_END_MARK)) return 0; return 1;}

4 3

C++ Now 2013 Call for Submissions
by Hartmut Kaiser 31 Oct '12

31 Oct '12

---------------------------------------------------------------------------- C++ NOW CONFERENCE 2013 - Aspen CO, USA, May 13-17, 2013, www.cppnow.org ---------------------------------------------------------------------------- CALL FOR SUBMISSIONS -------------------- We invite you to submit session proposals to the 2nd annual C++ Now Conference (Aspen CO, USA, May 13-17, 2013). Building upon the resounding success of C++ Now 2012 and five years of BoostCon, C++ Now 2013 will present leading speakers from the whole C++ community. The C++ Now Conference is dedicated to discussion and education about C++, an open and free language and standard. Our Conference will focus on discussion and education about open source software usage and developments in the C++ developer and user community. To reflect the breadth of the C++ and Boost communities, the conference includes sessions aimed at three constituencies: C++ and Boost end-users, hard-core Boost library and tool developers, and researchers pushing the boundaries of computation. The program fosters interaction and engagement within and across those groups, with an emphasis on hands-on, participatory sessions. As a multi-paradigm language, C++ is a melting pot where the most compelling ideas from other programming communities are blended in powerful ways. Historically, some of the most popular sessions at C++ Now have highlighted these concepts, from DSLs to functional programming to transactional memory and more. Bring your C#, Python, Ruby or Haskell influences to bear in an environment that will broaden their exposure. At C++ Now 2013 we would like to focus on parallel and distributed computing with C++. However, by no means this is intended to restrict the topics of proposals we hope to see. Any other topic related to C++ as outlined below is perfectly fine for submission. IMPORTANT DATES --------------- New proposal submissions due: December 15th, 2013. Proposals decisions sent (tentative program available): January 30th, 2013. Fully scheduled program available: February 24th, 2013. BEST PRESENTATION AWARDS ------------------------ We know how much effort it takes to prepare talks for our conference. For this reason we will award the best presentations in the following categories: Best Presentation, Best Short Presentation, Best Tutorial, and Best Workshop. The awards will be given based on the audience's voting. Each award will include the author's name listed on the cover of the C++ Now website for that year and a plaque containing all the C++ Now conference information. SESSION TOPICS -------------- Topics of interest include, but are not restricted to, the following: * Parallelism in the new C++11 standard * Parallel, distributed and GPGPU topics relating to C++ * C++11 and how it changes life for users and library writers * General tutorial sessions on C++11, the C++11 Standards library, and one or more Boost libraries * In-depth sessions on using specific Boost libraries * Case studies on using Boost * Experts panels * Advanced sessions on implementation techniques used within Boost libraries * Development workshops to extend or enhance existing Boost libraries * Workshops on design process * Infrastructure workshops such as Build tools, Website, Testing * Concepts and Generic Programming * Hardware and infrastructure presentations focused on how libraries can make better use of the technology * Software development tools and their application to C++ and or Boost * Other topics likely to be of great interest to C++ users and developers Interactive and collaborative sessions are encouraged, as this is the style of learning and participation that has proven most successful at such events. Sessions can be tutorial based, with an emphasis on interaction and participant involvement, or workshop based, whether hands-on programming or paper-based, discussion-driven collaborative work. SESSION FORMATS --------------- Presentations Presentations focus on a practitioner's ideas and experience with anything relevant to C++11, Boost and users. Panels Panels feature three or four people presenting their ideas and experiences relating to C++11 and Boost's relevant, controversial, emerging, or unresolved issues. Panels may be conducted in several ways, such as comparative, analytic, or historic. Tutorials Tutorials are sessions at which instructors teach conference participants specific skills relevant to C++11 and Boost. Workshops Workshops provide an active arena for advancements in Boost-relevant topics. Workshops provide the opportunity for experienced practitioners to develop new ideas about a topic of common interest and experience. Author's Corner Presentations These were introduced at BoostCon 2008, and were a great success. They are short (30 minute) sessions, focusing on tips on usage and design. In addition, we're looking to uncover the hidden design gems in Boost libraries. Tool Vendors Presentations We actively encourage tool vendors and ISP's to submit proposals for a special Tool Vendors Session Track aimed at products related to Boost and C++ (compilers, libraries, tools, etc.). Other formats may also be of interest. Don't hold back a proposal just because it doesn't fit into a pigeonhole. SUBMITTING A PROPOSAL --------------------- Standard Sessions are 90 minutes. You may submit a proposal for fractions Or multiples of 90-minutes. Fractional proposals will be grouped into 90 Minute sessions covering related topics. Longer sessions, such as tutorials and classes, will be assigned three hour (i.e. half day), or six hour (i.e. full day) time slots. Please include: * The working title. * Type of session: presentation, panel, tutorial, workshop, authors corner, vendor track, other. * A paragraph or two describing the topic covered, suitable for the conference web site. * Proposed length: 10-20 minute short talks, 45 minutes, 90 minutes, half day, full day. * Alternate lengths, if you are willing to make adjustments: 10-20 minute short-talks, 45 minutes, 90 minutes, half-day, full day. * Audience: users, developers, both. * Level: basic, intermediate, advanced. * A biography, suitable for the conference web site. * Your contact information (will not be made public). SUBMISSION DETAILS ------------------ All submissions should be made through the EasyChair conference management system: http://www.easychair.org/conferences/?conf=cppnow2013. If you have not already registered at EasyChair, you will need to do so in order to submit your proposal. All submissions will go through a peer review process. Authors are invited (but are not required) to submit PDF versions of full papers of up to 10 pages in ACM conference proceedings format (see http://www.acm.org/sigs/publications/proceedings-templates). The full papers are not required unless you want them published in the proceedings. All accepted proposals will be made available in the Association for Computing Machinery (ACM) Digital Library (approval pending). Best papers, after further reviews, will be considered to be book chapters or journal articles in a renowned journal. The session materials go on the C++ Now website and will be available to attendees. For general information on the C++ Now 2013 paper submission or the scope of technical papers solicited; please refer to the conference website at www.cppnow.org. For any other questions about the submission process or paper format, please contact the Program Committee at cppnow2013(a)easychair.com. If you have any technical problems with EasyChair, please contact EasyChair for help. Note: Presenters must agree to grant a non-exclusive perpetual license to publish submitted materials, either electronically or in print, in any media related to C++ Now. Hartmut Kaiser, email: hartmut.kaiser(a)gmail.com (Program Committee Chair) Dave Abrahams, email: dave(a)boostpro.com (Conference Chair) On behalf of the conference organizers

1 0

lockfree is part of the boost-1.52?
by niXman 31 Oct '12

31 Oct '12

Hi, As I can see, lockfree is in trunk, but in the documentation for boost-1.52 is not said about that. Why? And one more question: How can I determine what lockfree is part of the boost? Is there a macro for this? -- Regards, niXman ___________________________________________________ Dual-target(32 & 64-bit) MinGW compilers for 32 and 64-bit Windows: http://sourceforge.net/projects/mingwbuilds/

2 1

[fusion] Compile Error using BOOST_FUSION_DEFINE_STRUCT_INLINE with VC10 and GCC 4.2.1
by Oswin Krause 31 Oct '12

31 Oct '12

HI, the following code gives a compile error on VC10 and GCC 4.2.1. Clang and GCC 4.7 like it: #include <boost/fusion/sequence.hpp> #include <boost/fusion/include/define_struct_inline.hpp> #include <iostream> template<class T> struct enclosing { BOOST_FUSION_DEFINE_STRUCT_INLINE( employee, (std::string, name) (int, age)) }; int main() { enclosing<int>::employee e; e.name="abc"; std::cout<<boost::fusion::deref(boost::fusion::begin(e)); } complete error mssag on VC10: 1>c:\program files (x86)\boost\boost_1_51\boost\fusion\iterator\deref.hpp(34): error C2504: 'enclosing<T>::employee::employee_iterator<boost_fusion_uglified_Seq,N>::deref<boost_fusion_uglified_T>': Basisklasse undefiniert 1> with 1> [ 1> T=int, 1> boost_fusion_uglified_Seq=enclosing<int>::employee, 1> N=0 1> ] 1> and 1> [ 1> boost_fusion_uglified_T=enclosing<int>::employee::employee_iterator<enclosing<int>::employee,0> 1> ] 1> c:\program files (x86)\boost\boost_1_51\boost\fusion\iterator\deref.hpp(53): Siehe Verweis auf die Instanziierung der gerade kompilierten Klassen-template "boost::fusion::extension::deref_impl<boost::fusion::iterator_facade_tag>::apply<Iterator>". 1> with 1> [ 1> Iterator=enclosing<int>::employee::employee_iterator<enclosing<int>::employee,0> 1> ] 1> c:\users\ulfi\documents\visual studio 2010\projects\test\test\test.cpp(18): Siehe Verweis auf die Instanziierung der gerade kompilierten Klassen-template "boost::fusion::result_of::deref<Iterator>". 1> with 1> [ 1> Iterator=enclosing<int>::employee::employee_iterator<enclosing<int>::employee,0> 1> ] 1>c:\users\ulfi\documents\visual studio 2010\projects\test\test\test.cpp(18): error C2893: Funktionsvorlage 'result_of::deref<Iterator>::type boost::fusion::deref(const Iterator &)' konnte nicht spezialisiert werden 1> Mit den folgenden Vorlagenargumenten: 1> 'enclosing<T>::employee::employee_iterator<boost_fusion_uglified_Seq,N>' 1> with 1> [ 1> T=int, 1> boost_fusion_uglified_Seq=enclosing<int>::employee, 1> N=0 1> ] I don't have a clue what is wrong here. Is the error on my side? i just added the template<class T> to the example code of BOOST_FUSION_DEFINE_STRUCT_INLINE. Without, everything is fine. Gretings, Oswin

2 9

question on multi_index_container
by John M. Dlugosz 31 Oct '12

31 Oct '12

I created a multi_index_container in a way to emulate and enhance a std::set. That is, ordered_unique on some key extraction I specified. Like a std::set, inserting a "duplicate" will not do the assignment at all and the old value remains. However, what I want is for the new item to replace the old with the same key. Is there an easy or straightforward way to configure multi_index_container to do this?

2 1

(no subject)
by Yiğit Çağrı Akkaya 31 Oct '12

31 Oct '12

Hi, I have an MFC application. There are plenty of dll's written by us. In one dll module, we use boost. However, on start up of application, it throws several assertions about loading dll. I know assertions are available only for debug mode, but we want to get rid of every small problem in order to provide a stable release. I made web search and I found this thread: http://lists.boost.org/threads-devel/2009/06/0476.php This belongs to 2009 and Boost 1.39. We use Boost 1.48 and Visual Studio 2008 SP1. Thread says that this happens when MFC application statically linked to boost. Probably, nothing changed up to 1.48 because I found that line and commented it out(extern BOOL (WINAPI * const _pRawDllMain)(HANDLE, DWORD, LPVOID)=&dll_callback;). Is there a macro defined in boost to differentiate static and dynamic builds? If there is a macro, we are planning to wrap macro around that line. Or is there any better solution for this? Thanks in advance...

1 0

[phoenix] std::function doesn't work with phoenix ?
by Kamil Zubair 31 Oct '12

31 Oct '12

When I try to do this is VC++ 2010 : #include <functional> #include <boost\bind.hpp> #include <boost\phoenix.hpp> float Func() { return 1.f; } typedef std::function<float()> F; int main() { F f2 = boost::phoenix::bind(&Func); } It failed to compile, but when I change boost::phoenix::bind to boost::bind it compiled just fine. What's going on ? I thought phoenix::bind and boost::bind is interchangeable.

2 1

[Boost.Test] What's the best way to make custom assertions?
by legalize+jeeves＠mail.xmission.com 31 Oct '12

31 Oct '12

[Please do not mail me a copy of your followup] I want to make custom assertion methods that report the failure location as the place where the custom assertion is invoked, not the location where the BOOST_REQUIRE_xxx macros are used in the implementation of the custom assertion. In my own code, when I wanted to do report the point of invocation instead of the point of implementation, I implemented my code along the lines of void report(char const* file, int line) { // ... // output a message using line and file // ... } #define REPORT() report(__FILE__, __LINE__) void code() { REPORT(); // report something interesting here } When I look at how the assertion macros are implemented in Boost.Test, it seems that __FILE__ and __LINE__ are substituted down pretty far in the macro invocation chain. This means that if I want to write my own custom assertion that reports messages at the point of invocation and not at the point of implementation, I have to call these very low-level macro facilities and duplicate a bunch of stuff that's in Boost.Test. One thing I don't want to do is make a gigantic multi-line macro for my custom assertion. I really don't like using macros for things that could be done with functions and a custom assertion, IMO, falls into that category. Is there a clean way of implementing a custom assertion in the manner I've described without replicating a bunch of the intermediate layers of Boost.Test's macros? Gennady, if you're reading this and there isn't a clean way of doing what I'd like, are you willing to accept a refactoring changeset that promotes __FILE__ and __LINE__ arguments higher in the macro call chain? -- "The Direct3D Graphics Pipeline" free book <http://tinyurl.com/d3d-pipeline> The Computer Graphics Museum <http://computergraphicsmuseum.org> The Terminals Wiki <http://terminals.classiccmp.org> Legalize Adulthood! (my blog) <http://legalizeadulthood.wordpress.com>

3 7

[mpi] many undefined references to serialize<boost::mpi::detail::mpi_datatype_oarchive>
by Brian Budge 30 Oct '12

30 Oct '12

Hi all - I've got a class hierarchy that can already be serialized into text or binary archives. I'm explicitly instantiating the template functions for serialize and/or load/save. I'm trying to add the capability to have boost mpi perform the serialization through send/recv/broadcast. I've added explicit instantiations for the boost::mpi::packed_iarchive and packed_oarchive. My code compiles, but at the end I get a bunch of undefined references for serialize<boost::mpi::detail::mpi_datatype_oarchive>. I can add the explicit instantiations for this oarchive, and this seems to fix my linking issue, but this seems broken, i.e. I should not have to deal with anything in a boost::detail namespace? Is there another suggestion for how to get this to work? Thanks, Brian

5 11