- Boost-users - lists.boost.org

[Range] Sliced range adaptor, alternative for non RandomAccessRanges?
by Alastair Rankine 31 Jan '11

31 Jan '11

Hi, Currently it seems that the sliced range adaptor [1] requires a Random Access Range to do its job. Hence it can't be used for other ranges which dont model this concept. I want to use it with a Forward Range, specifically a std::set iterator range. What I want to do is this: std::set<int> input; input += 1,2,3,4,5,6,7,8,9; boost::copy( input | sliced(2, 5), std::ostream_iterator<int>(std::cout, ",")); (as per the sliced example, but with a std::set instead of a std::vector). I don't know much about the internals of the sliced adapter, but could it be changed to work a similar manner to counting_range, in order to locate the relevant slice of the input range? This would allow it to operate efficiently on Forward Ranges. Failing this, is there an efficient alternative to the above example? [1]: http://www.boost.org/doc/libs/1_45_0/libs/range/doc/html/range/reference/ad…)

3 3

graph- single source K shortest path with Boost Library
by Alexandre Lima 31 Jan '11

31 Jan '11

Hi, I would like to know if somebody could help me with Graphs. I need to find the 10th or kth shortest path in a single source problem, weighted >0, in other words, I need to keep the 10th or more first paths of one source to all other vertexes. I had already done that using a K shortest path algorithm (Yen, http://code.google.com/p/k-shortest-paths/ ),which discovery all the paths of a source to a sink, and I had just used a "for" with an objective to try all the sink nodes to solve the problems to all vertexes. It works, but the problem is that I can't use it in a big graph with 500 000 nodes, problems with memory. And now I am trying to use the boost library to compute at least the 10th shortest path to all nodes from a sink, but I don't know how can I keep the other paths. Attached: graph_al.cpp that is the code of boost library to compute a single source shortest path with dijkstra and pseudo_code that I was thinking to use to storage the other paths, but I don't know how to use it in a complex code like dijkstra boost code. If someone could help me ? thank you in advance. Alexandre de Lima

1 0

Re: [Boost-users] What's happened to Ryppl?
by Brian Wood 31 Jan '11

31 Jan '11

Edward Diener: >On 1/30/2011 7:16 PM, Scott McMurray wrote: >> >> >> I agree -- everything different about a DVCS is a consequence of >> allowing local commits. The best way I've seen of phrasing that >> fundamental difference: >> >> "[A DVCS] separates the act of committing new code from the act of >> inflicting it on everybody else." ~<http://hginit.com/00.html> > > But of course when you eventually merge all your local commits which Git > encourages you to keep to yourself until you are good and ready to > combine them with other people's repositories and local commits, I think that's called chewing the cud. I'm not a Git user, but it reminds me of the saying, "Don't call us, we'll call you." I find this thread interesting so thanks to all involved. And thanks for not top-posting. -- Brian Wood Ebenezer Enterprises http://webEbenezer.net (651) 251-9384

1 0

[boost 1.45.0][mingw] Boost build failure
by Pavel Belski 30 Jan '11

30 Jan '11

I'm trying to build some libraries from Boost using bjam, as it is suggested here(http://www.boost.org/doc/libs/1_45_0/doc/html/boost_asio/using.html). Because i have more than one compiler installed, I've changed the command line a bit to chose the toolset(mingw that comes together with Qt SDK) explicitly: D:\boost_1_45_0>bjam toolset=gcc --with-system --with-thread --with-datetime --with-regex --with-serialization stage Immediately i get the error message: mingw.jam: No such file or directory D:/boost_1_45_0/tools/build/v2/build\toolset.jam:38: in toolset.using rule mingw.init unknown in module toolset. D:/boost_1_45_0/tools/build/v2/build\project.jam:881: in using project-config.jam:1: in modules.load D:/boost_1_45_0/tools/build/v2\build-system.jam:257: in load-config D:/boost_1_45_0/tools/build/v2\build-system.jam:423: in load-configuration-files D:/boost_1_45_0/tools/build/v2\build-system.jam:554: in load D:\boost_1_45_0\tools\build\v2/kernel\modules.jam:283: in import D:\boost_1_45_0\tools\build\v2\kernel\bootstrap.jam:142: in boost-build D:\boost_1_45_0\boost-build.jam:17: in module scope what should i do?

2 1

Google summer of Code 2011 - would a collection of checksums, checkdigits be a useful project?
by Paul A. Bristow 30 Jan '11

30 Jan '11

I have posted some tentative ideas for a GSoC project to create a collection of functions to create and validate check digits at https://svn.boost.org/trac/boost/wiki/SoC2011 Previous discussions suggested that many people might find these useful. Some possible existing systems in wide user are : Simple modulo 256 etc check values and digits. http://en.wikipedia.org/wiki/Cyclic_redundancy_check http://www.boost.org/doc/libs/1_45_0/libs/crc/crc.html Boost's Cyclic redundancy checks codes http://www.boost.org/doc/libs/1_45_0/libs/crc/index.html http://www.netrino.com/Embedded-Systems/How-To/CRC-Calculation-C-Code crc_16_type BISYNCH, ARC crc_ccitt_type designated by CCITT (Comité Consultatif International Télégraphique et Téléphonique) crc_xmodem_type XMODEM crc_32_type PKZip, AUTODIN II, Ethernet, FDDI MD5 hash http://www.md5.net/ SHA hashes http://en.wikipedia.org/wiki/SHA-1 ... Luhn algorithm http://en.wikipedia.org/wiki/Luhn_algorithm Verhoeff algorithm http://en.wikipedia.org/wiki/Verhoeff_algorithm (These two are used by many of the others below). European Article numbering EAN Symbol Specification Manual, Universal Product Code, Uniform Code Council, Dayton, Ohio, USA. Version of check used by Mastercard, VISA, and most other credit card companies. http://www.beachnet.com/~hstiles/cardtype.html Generalised to arbitrary radix version allowing any characters (not just digits). Gene Callahan, Dr Dobb's Journal, Dec 1995, 131, 132 & 149. Generating Sequential keys in an Arbitrary Radix. IBAN International Banking format http://en.wikipedia.org/wiki/International_Bank_Account_Number http://en.wikipedia.org/wiki/Machine-readable_passport check digit US driving licence US Social security numbers Canadian Social Insurance Numbers UK National Insurance number ISBN http://en.wikipedia.org/wiki/International_Standard_Book_Number ISSN http://en.wikipedia.org/wiki/International_Standard_Serial_Number POSTNET http://en.wikipedia.org/wiki/POSTNET Bar codes http://www.dlsoft.com/services/CheckCalc/ http://en.wikipedia.org/wiki/Check_digit#Other_examples_of_check_digits Chemical abstracts http://en.wikipedia.org/wiki/CAS_registry_number Vehicle Id Number http://en.wikipedia.org/wiki/Vehicle_identification_number And there are no doubt many, many more. Suggestions? A question that Boost users/ developers/gurus might to comment on is the format these should take. Should it something naïve like bool ISBNcheck(string); // return true if is a full valid ISBN with correct decimal digit or X check digit. char ISBNcompute(string); // return the decimal digit or X check digit of the ISBN number passed. and similarly for the other check systems. or do we need something more complicated? String or Arrays of (unsigned?) bytes or? (Most of these examples *are* short strings). What return type? Efficiency is not like to be an issue for many of these? (Boost.crc handles this in a much more generic and complex package but handles some popular types. Some of its examples could be packaged simply as above.) Views? Paul --- Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 pbristow(a)hetp.u-net.com

1 0

[CfP] Reminder: 5th Annual BoostCon, Aspen (CO, USA), May 15-20, 2011
by Hartmut Kaiser 30 Jan '11

30 Jan '11

Please note the extended deadline: February 10th, 2011 ------------------ Please distribute. ------------------ 5TH ANNUAL BOOST CONFERENCE 2011 Aspen CO, USA, May 15 - 20, 2011, www.boostcon.com CALL FOR PARTICIPATION We invite you to submit session proposals to the 5th Annual Boost Conference: BoostCon 2011 (Aspen CO, USA, May 15 - 20, 2011). Traditionally the main face-to-face event for all things Boost (www.boost.org) BoostCon 2011 will present leading speakers from the whole C++ community. From using the Boost libraries to writing and maintaining them, from evangelizing to deploying Boost within your organization, from infrastructure and process to vision and mission, and the new C++ Standard, BoostCon brings together the sessions, the colleagues, and the inspiration to support your work with C++ and Boost in particular for the next year. To reflect the breadth of the Boost community, the conference includes sessions aimed at three constituencies: Boost end-users, hard-core Boost library and tool developers, and academics focusing on research. The program fosters interaction and engagement within and across those groups, with an emphasis on hands-on, participatory sessions. SESSION TOPICS Topics of interest include, but are not restricted to, the following: * General tutorial sessions introducing 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 * C++0x and how it changes life for users and library writers * 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 nature of both the on-line Boost community and 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 Boost and Boost users. Panels ------------- Panels feature three or four people presenting their ideas and experiences relating to 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 Boost-relevant skills. 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 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 have to be done through the EasyChair conference management system: http://www.easychair.org/conferences/?conf=boostcon2011. 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 BoostCon website and will be available to attendees. For general information on the BoostCon 2011 paper submission or the scope of technical papers solicited, please refer to the conference website at www.boostcon.com. For any other questions about the submission process or paper format, please contact the Program Committee at boostcon2011(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 BoostCon. IMPORTANT DATES New proposal submissions due: January 10th, 2011. Proposals decisions sent (tentative program): February 17th, 2011. Fully scheduled program available: February 25th, 2011. Session materials due: April 15th, 2011. Hartmut Kaiser: hartmut.kaiser(a)gmail.com (Program Committee Chair) David Abrahams: dave(a)boostpro.com (Conference Chair) On behalf of the conference organizers

1 0

Boost regex library problem on Mac
by Michael Muratet 30 Jan '11

30 Jan '11

Greetings I am using some simple boost regex code: const boost::regex eparse("^([[:digit:]]+).*"); (in a header file) boost::cmatch matches; (in a cpp file) from the subroutine if (boost::regex_match(edit.c_str(), matches, eparse)) { // matches[0] contains the original string. matches[n] // contains a sub_match object for each matching // subexpression for (int i = 1; i < matches.size(); i++) { // sub_match::first and sub_match::second are iterators that // refer to the first and one past the last chars of the // matching subexpression std::string match(matches[i].first, matches[i].second); std::cout << "\tmatches[" << i << "] = " << match << std::endl; } } with a makefile: CXXFLAGS = -O2 -g -Wall -fmessage-length=0 -I/usr/local/boost_1_39_0 OBJS = CrossMapper.o CrossMap.o Read.o Target.o LIBS = -L/lib -lboost_regex-xgcc40-mt-1_39 INCLUDE= /usr/local/boost_1_39_0 TARGET = CrossMapper $(TARGET): $(OBJS) $(CXX) -o $(TARGET) $(OBJS) $(LIBS) all: $(TARGET) clean: rm -f $(OBJS) $(TARGET) It links but will not load: Macintosh-8:~/Documents/workspace/CrossMapper mmuratet$ ./CrossMapper dyld: Library not loaded: libboost_regex-xgcc40-mt-1_39.dylib Referenced from: /Users/mmuratet/Documents/workspace/CrossMapper/./ CrossMapper Reason: image not found Trace/BPT trap Macintosh-8:~/Documents/workspace/CrossMapper mmuratet$ I've been chasing this for several hours and can't get anywhere. Can anyone offer any suggestions? Thanks Mike

2 2

Problems compiling those libraries that are not header only on 64 bit Windows 7
by Ted Byers 29 Jan '11

29 Jan '11

I tried asking this yesterday, but received a message saying I had to subscribe to this list first. I don't understand that reply as I had already subscribed half an hour before I asked the question, and I have been receiving email from the list ever since. So, I am going to try again (with the query updated to reflect my latest attempts). ============================================================================ ==================== I am working on Windows 7 Pro, 64 bit. I have two versions of MS VS: MS VS 2005 and MS VS 2010. I guess my first question is, "Will library files produced by MS VS 2005 work with MS VS 2010?" I know that library files compiled by compilers from different sources (gcc vs MSVC) won't work with each other (unless the library was written in C or FORTRAN), but does the same apply to different versions fo the same compiler? I have a long practice of passing my code through different compilers when part of the requirement is to produce portable code, since different compiler producers will have different strengths and weaknesses; different understandings of applicable standards. But a limited budget means I have to coerce them to live on the same hardware. I used a prebuilt distribution of bjam for all my attempts to build the boost libraries using msvc++. I did not compile it myself. I also have Cygwin installed. >From the C:\boost_1_45_0 directory, I tried the following to keep the builds for the two versions separate (planning on changing the library directories based on the build environment), but when both finished, both C:\boost_1_45_0\lib\msvc2010\x64 and bjam --build-dir=C:\boost_1_45_0\lib\msvc2010\x32 were empty and C:\boost_1_45_0\stage\lib had 606 items. bjam --build-dir=C:\boost_1_45_0\lib\msvc2010\x32 --build-type=complete bjam --build-dir=C:\boost_1_45_0\lib\msvc2010\x64 --build-type=complete And if I execute bjam in status, I get a result that says something like 30 out of 30K tests failed. (Is that normal?) So, what do I do when trying to support both MSVC++ 2005 and MSVC++ 2010? Here are the results from my latest attempt using cygwin. $ ../boost-jam-3.1.18/bin.cygwinx86/bjam --layout=versioned --build-type=complete warning: No toolsets are configured. warning: Configuring default toolset "gcc". warning: If the default is wrong, your build may not work correctly. warning: Use the "toolset=xxxxx" option to override our guess. warning: For more configuration options, please consult warning: http://boost.org/boost-build2/doc/html/bbv2/advanced/configuration.html Building the Boost C++ Libraries. /home/Ted/boost_1_45_0/tools/build/v2/build/configure.jam:145: in builds-raw *** argument error * rule UPDATE_NOW ( targets * : log ? : ignore-minus-n ? ) * called with: ( <pbin.v2/libs/regex/build/gcc-4.3.4/debug>has_icu.exe : : ignore-minus-n : ignore-minus-q ) * extra argument ignore-minus-q (builtin):see definition of rule 'UPDATE_NOW' being called /home/Ted/boost_1_45_0/tools/build/v2/build/configure.jam:179: in configure.builds /home/Ted/boost_1_45_0/tools/build/v2/build/configure.jam:216: in object(check-target-builds-worker)(a)394.check /home/Ted/boost_1_45_0/tools/build/v2/kernel/modules.jam:103: in modules.call-in /home/Ted/boost_1_45_0/tools/build/v2/util/indirect.jam:96: in indirect.call /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:1012: in targets.evaluate-requirements /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:1393: in basic-target.compute-usage-requirements /home/Ted/boost_1_45_0/tools/build/v2/build/alias.jam:47: in compute-usage-requirements /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:1319: in object(alias-target-class)(a)398.generate /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:732: in generate-really /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:704: in object(main-target)(a)836.generate /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:848: in targets.generate-from-reference /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:1217: in generate-dependencies /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:1268: in object(typed-target)(a)401.generate /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:732: in generate-really /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:704: in object(main-target)(a)837.generate /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:848: in targets.generate-from-reference /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:1217: in generate-dependencies /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:1266: in object(typed-target)(a)147.generate /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:732: in generate-really /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:704: in object(main-target)(a)818.generate /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:258: in object(project-target)(a)129.generate /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:848: in targets.generate-from-reference /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:1217: in generate-dependencies /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:1268: in object(install-target-class)(a)63.generate /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:732: in generate-really /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:704: in object(main-target)(a)629.generate /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:848: in targets.generate-from-reference /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:1217: in generate-dependencies /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:1268: in alias-target-class.generate Jamroot:648: in build-multiple Jamroot:634: in object(top-level-target)(a)72.generate /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:732: in generate-really /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:704: in object(main-target)(a)633.generate /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:848: in targets.generate-from-reference /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:1217: in generate-dependencies /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:1268: in alias-target-class.generate Jamroot:648: in build-multiple Jamroot:634: in object(top-level-target)(a)73.generate /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:732: in generate-really /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:704: in object(main-target)(a)634.generate /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:258: in object(project-target)(a)16.generate /home/Ted/boost_1_45_0/tools/build/v2/build-system.jam:735: in load /home/Ted/boost_1_45_0/tools/build/v2/kernel/modules.jam:283: in import /home/Ted/boost_1_45_0/tools/build/v2/kernel/bootstrap.jam:142: in boost-build /home/Ted/boost_1_45_0/boost-build.jam:17: in module scope And nothing was built. So, what do I have to do to pursuade bjam to produce all of the library files in cygwin? Thanks Ted

5 9

[network] Bagged, Tagged, New Release 0.8.1
by Dean Michael Berris 29 Jan '11

29 Jan '11

Hi Everyone, Just a quick note, there's an update to the 0.8 line which addresses issues that have been identified with the previous 0.8 release. It's recommended that people using the 0.8 release upgrade to 0.8.1. This release is still a header-only release, with some features back-ported from the 0.9-devel branch. You can get the 0.8.1 release at https://github.com/cpp-netlib/cpp-netlib/downloads Have a good day everyone and I hope this helps. PS. The 0.9 release should come out soon, final documentation updates are just getting done; the 0.9 line will be the version that shall be submitted for review, looking for interested review managers at this time. -- Dean Michael Berris about.me/deanberris

1 0

boost recursive_mutex destructor call in child (forked) process
by Prince Singh 29 Jan '11

29 Jan '11

I am facing a problem in using boost::recursive_mutex. Flow of my program is:- 1. Get a boost::recursive_mutex lock 2. Fork the process 3. In parent sleep for few seconds and then unlock boost::recursive_mutex. 4. In child call exit(0) What is happening is that child process is calling the destructor of boost::recursive_mutex and core is dumped. I want that child process should not inherit the boost mutex lock of parent. Please tell me how to do it. Please find attached the core, binary file and the source files. *Stack of core dumped* Thread 1 (Thread 32305): #0 0x0000003bb9c30265 in raise () from /lib64/libc.so.6 #1 0x0000003bb9c31d10 in abort () from /lib64/libc.so.6 #2 0x0000003bb9c296e6 in __assert_fail () from /lib64/libc.so.6 #3 0x0000000000401224 in boost::recursive_mutex::~recursive_mutex(this=0x602c40, __in_chrg=<value optimized out>) at /installs/boost/boost_1_39_0/include/boost-1_39/boost/ thread/pthread/recursive_mutex.hpp:62 #4 0x0000000000400f08 in __tcf_1 () at ../BoostTestClass.cpp:10 #5 0x0000003bb9c333a5 in exit () from /lib64/libc.so.6 #6 0x0000000000400f69 in main () at ../BoostTestClass.cpp:29 -- Thanks and Regards Prashant Gour Software Engineer Drishti-Soft Solutions Pvt. Ltd.

2 1