November 2011 - Boost-users

[C++ Now! 2012] Call for Submissions
by Hartmut Kaiser 10 Nov '11

10 Nov '11

INAUGURAL C++ NOW! CONFERENCE 2012 Aspen CO, USA, May 14-18, 2012, www.cppnow.org CALL FOR SUBMISSIONS We invite you to submit session proposals to the Inaugural C++ Now! Conference: C++Now! 2012 (Aspen CO, USA, May 14 - 18, 2012). Based on the successful traditions of 5 years of BoostCon, which was the main face-to-face event for all things C++ and Boost (www.boost.org) C++Now! 2012 will present leading speakers from the whole C++ community. The conference name is changing to C++ Now! to reflect the current value of the language, the focus on its new state (from the new Standard), and the need to continually look to the future so the language remains useful to the C++ community. The focus of this conference will be the new C++11 language Standard and as usual Boost: what's new in C++, its Standard library, and in the Boost libraries, how to write and maintain them, how to evangelize or to deploy Boost within your organization. The new C++ Standard, but also the infrastructure and process of Boost, its vision and mission - no matter what you are interested in, it all comes together in the C++Now! sessions. Meet the colleagues, and feel the inspiration to support your work with C++ and Boost for the next year. 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. IMPORTANT DATES New proposal submissions due: January 10th, 2012. Proposals decisions sent (tentative program available): February 17th, 2012. Fully scheduled program available: February 25th, 2012. Session materials due: April 15th, 2012. 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: * C++11 and how it changes life for users and library writers * General tutorial sessions on C++11, the C++11 Standardslibrary, 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 Boost 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 These were introduced at BoostCon 2008, and were a great Presentations 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 We actively encourage tool vendors and ISP's to submit Presentations 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 60 minutes. You may submit a proposal for fractions or multiples of 90-minutes. Fractional proposals will be grouped into 60 minute sessions covering related topics. Longer sessions, such as tutorials and classes, will be assigned 90 minute, 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=cppnow2012. 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! 2012 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 cppnow2012(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

3 5

Can't run Library Status tests
by Tim Musson 10 Nov '11

10 Nov '11

Hello, I installed boost 1.47.0 and wanted to run the Library Status tests but tools/regression/library_test does not exist and was not created when I built tools/regression/build (according to instructions at http://www.boost.org/doc/libs/1_47_0/tools/regression/doc/library_status.ht…) It doesn't seem like this question belongs on the Regression list, but if it does just let me know and I'll post over there. Thanks in advance! Tim

1 0

[gil] Using gil with windows bitmaps
by Dan Bloomquist 10 Nov '11

10 Nov '11

Hi, Yesterday I went on a bend to understand memory images, so far I've just taken them for granted. I have a situation where I need to resample photos at print time. If a client uses their 37 gigapixel camera and I print that to pdf it bloats the size of the pdf so as they can't email them. My old hack was with GDI+, code I barely understood. So I've gotten to the code below and for all I know it is not a good start, but it works. With gil I could do more like crop and rotate without modifying the source image. Right now I'm at a loss as to how to attach a bitmap to a gil view. (Over ride the allocator?) In my test I've got two extra memcpy calls I should not have to do. I'd like to use gil directly on the windows bitmap memory. BTW, that one hour flash at Adobe was great. Now I want to 'Gilify' my code. Note HEImage::g_image is a rgb8_image_t; HBITMAP test_gil( HBITMAP hBitmap ) { DIBSECTION d; //testing, assume rgb8_image_t in object int nBytes = ::GetObject( hBitmap, sizeof( DIBSECTION ), &d ); HEImage image( d.dsBm.bmWidth, d.dsBm.bmHeight );//, d.dsBm.bmBits, 0 ); should just be able to attach bits memcpy( &image.g_image._view[ 0 ], d.dsBm.bmBits, d.dsBmih.biSizeImage ); //gil::jpeg_read_image( "C:\\cpp\\HE_9\\jpeg-8c\\GIL_test\\In\\IMG_0006.JPG", image.g_image ); HEImage image2( d.dsBm.bmWidth, d.dsBm.bmHeight ); //testing, just flip image... gil::copy_pixels( gil::rotated180_view( image.g_image._view ), image2.g_image._view ); BITMAPINFO bi24BitInfo; //testing, populate to match rgb8_image_t memset( &bi24BitInfo, 0, sizeof( BITMAPINFO ) ); bi24BitInfo.bmiHeader.biSize = sizeof(bi24BitInfo.bmiHeader); bi24BitInfo.bmiHeader.biBitCount = 24; // rgb 8 bytes for each component(3) bi24BitInfo.bmiHeader.biCompression = BI_RGB;// rgb = 3 components bi24BitInfo.bmiHeader.biPlanes = 1; bi24BitInfo.bmiHeader.biWidth = d.dsBm.bmWidth; bi24BitInfo.bmiHeader.biHeight = d.dsBm.bmHeight; HBITMAP oBitmap = ::CreateDIBSection( NULL, &bi24BitInfo, DIB_RGB_COLORS, 0, 0, 0 ); nBytes = ::GetObject( oBitmap, sizeof( DIBSECTION ), &d ); memcpy( d.dsBm.bmBits, &image2.g_image._view[ 0 ], d.dsBmih.biSizeImage ); return oBitmap; } In test used like: bResamplePhoto= true; //TODO testing.... if( bResamplePhoto ) { for( size_t i= 0; i < photoWnd.size( ); ++i ) { HBITMAP hB= test_gil( photoWnd.at( i ) ); photoWnd.at( i ).Destroy( ); photoWnd.at( i ).Attach( hB ); } }

1 0

Re: [Boost-users] [boost] Boost.Local Review (Nov 10, 2011 to Nov 19, 2011
by Alex Perry 10 Nov '11

10 Nov '11

Oops sorry my bad - email client messed up the link so couldn't go to it directly and was looking in https://svn.boost.org/svn/boost/sandbox/local/doc/ instead Alex > -----Original Message----- > From: Alex Perry > Sent: 10 November 2011 14:04 > To: 'boost-users(a)lists.boost.org' > Subject: RE: [Boost-users] [boost] Boost.Local Review (Nov 10, 2011 to Nov > 19, 2011 > > > On Wed, 9 Nov 2011 21:52:53 -0800 "Jeffrey Lee Hellrung, Jr." > <jeffrey.hellrung(a)gmail.com> wrote :- snip > > The code and documentation are available from the Boost sandbox ( > > https://svn.boost.org/svn/boost/sandbox/) > > > > https://svn.boost.org/svn/boost/sandbox/local/ [everything] > > https://svn.boost.org/svn/boost/sandbox/local/boost/ [code] > > https://svn.boost.org/svn/boost/sandbox/local/libs/local/doc/html/inde > > x.ht > > ml[documentation] > > > Not sure if its just me but I can't seem to find the documentation following > these links > > https://svn.boost.org/svn/boost/sandbox/local/libs/local/doc/ > > exists but only has a src directory which doesn't appear to have anything > useful (a bunch of css files) > > Alex

1 0

Re: [Boost-users] [boost] Boost.Local Review (Nov 10, 2011 to Nov 19, 2011
by Alex Perry 10 Nov '11

10 Nov '11

On Wed, 9 Nov 2011 21:52:53 -0800 "Jeffrey Lee Hellrung, Jr." <jeffrey.hellrung(a)gmail.com> wrote :- snip > The code and documentation are available from the Boost sandbox ( > https://svn.boost.org/svn/boost/sandbox/) > > https://svn.boost.org/svn/boost/sandbox/local/ [everything] > https://svn.boost.org/svn/boost/sandbox/local/boost/ [code] > https://svn.boost.org/svn/boost/sandbox/local/libs/local/doc/html/index.ht > ml[documentation] > Not sure if its just me but I can't seem to find the documentation following these links https://svn.boost.org/svn/boost/sandbox/local/libs/local/doc/ exists but only has a src directory which doesn't appear to have anything useful (a bunch of css files) Alex

1 0

file system create directory permissions problem in windows
by Jose 10 Nov '11

10 Nov '11

Hi, I am trying to create a directory in my temp folder in windows. Using this sintax : boost::filesystem::remove_all(tcd); boost::filesystem::create_directory(boost::filesystem::path(tcd)); tcd is a char* that looks like : "%TEMP%\file_123456" I get the error "the system can not find the patch" If I use _mkdir. I also get an error. Is there anything that I am missing to create directories in the env. variable temp in windows? The code works just fine in linux. Thanks Jose

2 1

Re: [Boost-users] [Spirit-general] Pattern matching with boost
by Alec Taylor 10 Nov '11

10 Nov '11

Thank you very much everybody! I am currently building boost (as my current boost was under a different toolset), but once it's built I'll be able to test. Thank you all for your code samples + advice, especially Seth (sehe) on stackoverflow :] On Thu, Nov 10, 2011 at 1:15 PM, Seth Heeren <bugs(a)sehe.nl> wrote: > On 11/09/2011 10:31 PM, Alec Taylor wrote: >> Feel free to add it to stackoverflow (I've been having some trouble >> posting there) >> >> I can't give you what I've done so far, because I wasn't sure if it >> was within the capabilities of the boost::spiriti libraires to do what >> I'm trying to do. > Alec, since you came to the Spirit list, it is only fair if I tried to > show you a Spirit way. It uses Qi for parsing, and Karma for output > generation. As you consented, I posted it on StackOverflow on your behalf: > > http://stackoverflow.com/questions/8074103/how-would-i-perform-this-text-pa… > > so by all means, have a look there (and don't forget to upvote it, if > the answer was in any way helpful to your question. I think it (at > least) comprehensively answers the main question ("is it withing the > capabilities of the boost::spirit libraries"). Whether or not you would > elect to do so, is up to you, of course! > > Cheers, > Seth > > ------------------------------------------------------------------------------ > RSA(R) Conference 2012 > Save $700 by Nov 18 > Register now > http://p.sf.net/sfu/rsa-sfdev2dev1 > _______________________________________________ > Spirit-general mailing list > Spirit-general(a)lists.sourceforge.net > https://lists.sourceforge.net/lists/listinfo/spirit-general >

3 5

[Thread] Semantics regarding memory barrier/happens-before relationship
by Falk S. 10 Nov '11

10 Nov '11

Hi, I have read an article on Dr.Dobbs (http://drdobbs.com/cpp/184401518?pgno=3) about the Boost Thread Library and a given example quoted below raised a question to me regarding race condition safety (stripped). > |const| |int| |BUF_SIZE = 10;| > |const| |int| |ITERS = 100;| > > |boost::mutex io_mutex;| > > |class| |buffer| > |{| > |public||:| > | ||typedef| |boost::mutex::scoped_lock| > | ||scoped_lock; ||| |[..]| > > | ||int| |get()| > | ||{| > | ||scoped_lock lk(mutex);| > | ||if| |(full == 0)| > | ||{| |[..]| > | ||while| |(full == 0)| > | ||cond.wait(lk);| > | ||}| > | ||int| |i = buf[c];| > | ||c = (c+1) % BUF_SIZE;| > | ||--full;| > | ||cond.notify_one();| > | ||return| |i;| > | ||}| > | | > |private||:| > | ||boost::mutex mutex;| > | ||boost::condition cond;| > | ||unsigned ||int| |p, c, full;| > | ||int| |buf[BUF_SIZE];| > |};| I wonder if it is possible the compiler produces optimised code and checking the member 'full' before creating the scoped lock. Imagine two threads calling/entering method buffer.get. That would lead to a possible race condition. Why is this not possible and how is this guaranteed with current C++ Compilers? Thanks for any reply, Falk Sticken

2 1

Pattern matching with boost
by Alec Taylor 10 Nov '11

10 Nov '11

Good morning, I'm trying to parse a relatively simple pattern across 4 std::strings, extracting whatever the part which matches the pattern into a separate std::string. In an abstracted sense, here is what I want: s1=<string1><consecutive number>, s2=<consecutive number><string2>, s3=<string1><consecutive number>, s4=<consecutive number><string2> Less abstracted: s1="apple 1", s2="2 cheese", s3="apple 3", s4="4 cheese" Actual contents: s1="lxckvjlxcjvlkjlkje xvcjxzlvcj wqrej lxvcjz ljvl;x czvouzxvcu j;ljfds apple 1 xcvljxclvjx oueroi xcvzlkjv; zjx", s2="xzljlkxvc jlkjxzvl jxcvljzx lvjlkj wre 2 cheese", s3="apple 3", s4="kxclvj xcvjlxk jcvljxlck jxcvl 4 cheese" How would I perform this pattern matching? Thanks for all suggestions, Alec Taylor

4 4

boost.org home page
by Jerry Jeremiah 09 Nov '11

09 Nov '11

Hello, The boost home page says: "We aim to establish "existing practice" and provide reference implementations so that Boost libraries are suitable for eventual standardization. Ten Boost libraries are already included in the C++ Standards Committee's Library Technical Report (TR1) and will be in the new C++0x Standard now being finalized. C++0x will also include several more Boost libraries in addition to those from TR1. More Boost libraries are proposed for TR2." Now that the standard is final we should change this. What I think people would like to see is which boost libraries are reflected in the standard and how those standard ones differ from the boost ones. I know the boost ones have to be more feature rich than the standard ones because the boost ones are continuously being extended and the standard ones are locked in stone. Unfortunately that's all I really know. Now, I realize probably everyone who actually knows this information is probably busier than I so I need to be the one that actually makes the time to figure it out amd create a draft of the new information. Would it be possible for one of you to give me a list of all the boost libraries that are reflected in the new standard? Jerry

2 1