- Boost - lists.preview.boost.org

Large Bitset to download?
by Aleksey Yakovlev 05 Feb '14

05 Feb '14

Dear List, This is my first post to the list. I’ve subscribed to get some info about Zachary Turner project “Large Bitset” (based on Joachim Faulhaber ICL). What’s the status of this project? It looks promising for us, so I’d like to download sources and take a dig into them – to test, to estimate limits, performance etc. Please help, Thanks, Aleksey This message contains confidential information. If you are not the intended recipient you are hereby notified that disclosing,copying, distributing or taking any action in reliance on the contents of this information is strictly prohibited. Please notify the sender immediately and delete this e-mail from your system.

1 0

GSoC: Who is taking on the responsibility as organization admin for Boost this year?
by Hartmut Kaiser 04 Feb '14

04 Feb '14

Sorry if I missed this information... Regards Hartmut --------------- http://boost-spirit.com http://stellar.cct.lsu.edu

1 0

[modular-boost] Questions about development procedures and more
by Gennadiy Rozental 04 Feb '14

04 Feb '14

Hi, Trying to start using modular boost (and git for that matter). I have several questions about this. These are in no particular order: 1. Why does ./b2 headers on windows creates hardlink for each file instead of directories? The process takes forever. 2. What the story about cmake based build? What state is it in? Can I try it now? How? Can I help with anything to push this further? I got a bit of experience with cmake since last time I see n this discussed. 5. What the status of testing of the new tree? How is it setup? Where can I read it? Specifically I am interested in what being tested against what. 4. First command to switch to develop branch produces warning(?) ...\modular-boost\libs\test>git checkout develop Previous HEAD position was 954d3ab... Thread: merge [81791]-tools dir missing Branch develop set up to track remote branch develop from origin. Switched to a new branch 'develop' Should I worry? 5. After I switched to development branch headers directory still "points to" master branch files. Actually I am not sure what it points to now since master files are nowhere anymore. How should I switch headers? 6. What the corresponding action with git, which does what svn up from root of tree did before? What I am after is comamnd(s) which updates other libs, but keep my lib as is (maybe merge changes from other developers). If "git submodule update" is one of these commands, why does it takes forever on fresh just cloned boost tree? 7. How do I run the test which will check how my changes affect other libraries (their master branch at least). Should I just run the test from root in my local copy? How do I test against develop branch of other libs and develop branch of other libs against me? 8. Dependency specification. This actually a big question, which can be split into several: 8.1 Is there place where I can see "released versions" for particular library/submodule? 8.2. Is there way to tell which other boost submodules I depend on? 8.3 Can I specify specific release version I want to depend on (per submodule)? 8.4 Can I somehow only checkout/pull the submodules I depend on? 8.5 Can I check which submodules depend on me and checkout only those? 8.6 Is there place where I can see which submodule version constitute specific boost release? 9. One of the wiki pages refers to "git submodule summary" command. I do not understand what this command supposed to do. 10. How do I create private branch? IOW branch which is not publicized on github, but one I can share with the team? 11. This page is not clear to me: https://svn.boost.org/trac/boost/wiki/PostCvtMergePoint What do I need to do to merge my development branch into master, given that it is significantly differ now (at the time of svn->git conversion)? Thank you. Gennadiy

8 36

SQL: next iteration of sqlpp11
by Roland Bock 04 Feb '14

04 Feb '14

Dear boosters, after the lively discussion about sqlpp11 in November 2013 (http://lists.boost.org/Archives/boost/2013/11/208388.php) sqlpp11 has evolved quite a bit and I want to give you an update. https://github.com/rbock/sqlpp11 *) sqlpp11 now supports prepared statements. For instance auto ps = db.prepare(select(all_of(tab)) .from(tab) .where(tab.alpha != parameter(tab.alpha))); ps.params.alpha = 42; for (const auto& row: db.run(ps)) { std::cerr << "alpha: " << row.alpha << std::endl; std::cerr << "beta: " << row.beta << std::endl; std::cerr << "gamma: " << row.gamma << std::endl; } *) Binding of parameters and results for binary transport is now supported. Both, parameters of prepared statements and results can be bound to in-memory data of the database now. In the example above, using the provided mysql connector, neither parameters nor the non-text results are converted to/from string. *) Support for multi-row insert: //First, you create an insert: auto i = insert_into(tab).columns(tab.alpha, tab.beta); //Then you add values (one or more times): i.values(tab.alpha = 7, tab.beta = "seven"); // Then you run the insert db.run(i); There is no support for array binding in sqlpp11, since this is highly vendor specific afaict. But it would be fairly easy to add support for this in the vendor-specific connector library. I'd be happy to support you if you wanted to give it a try. *) New interpreter for SQL expression trees: This has changed and improved a lot. sqlpp11 has been stripped of all vendor specific code and will serialize standard SQL. The connector libraries can specialize an interpreter template to change the representation of certain aspects. For instance, mysql would represent the concatenation of strings as CONCAT(a,b) instead of a||b. But of course, the connector libraries are not required to turn the expression into a string. They can interpret it any way they like. I strongly believe that this is going to allow for writing connectors to XML, input streams, maps, etc. (think LINQ). *) I added a sample code generator (in python) that generates table representations from a DDL Todo-List: ---------- *) More thorough documentation *) More thorough and easier to comprehend tests *) Some of you mentioned that Boost.Fusion or Boost.Preprocessor might do be able to do the job of code generation very elegantly. I won't do that myself but I'd be interested to see such solutions. Since code generation is not integral part of the library it would make sense to have such solutions as support libraries. *) Look into cursors FYI, I am going to give a talk about sqlpp11 and some template patterns used inside of it on February 27 in Munich, see http://www.meetup.com/MUCplusplus/events/160688442/ Please let me know your questions/thoughts/suggestions/rants. Contributions welcome, of course :-) Regards, Roland PS: Given enough interest, I intend to officially propose the library to boost (after several more iterations, of course). This is why I hope it is OK to discuss sqlpp11 on this mailing list every now and then.

8 29

Regarding GSoC 2014
by shubhv＠iitk.ac.in 04 Feb '14

04 Feb '14

Hey, I am a sophomore student of Computer Science Department, IIT Kanpur, India. I have been going through the boost libraries for quite some time now, and also have read through the proposed GSoC projects in 2014. I am especially interested in the Boost.Math Generalized Hyper geometric Functions. Though I have gone through the links provided under that project and am trying to become versed with Boost's Math library, I am finding it difficult to find a starting point to contributing. I would be really glad if someone could help me in the initial phase by directing me to the right starting point and guide me through. Thanks Shubhangee Verma

2 1

Trying modular Boost
by Paul A. Bristow 04 Feb '14

04 Feb '14

FWIW here are some things I didn't understand or did wrong. (And, of course, playing Devil's Decidedly Dumb Advocate ;-) 1 How do I know if I have the right version of Git? Open GitHub icon and check Tools/About? 2 Windows hint: If you install TortoiseGIT, avoid incompatibilities by using the command line version of Git that TortoiseGIT installs. I.E. place C:\Program Files (x86)\Git\cmd in your path ahead of any other git binaries, such as cygwin. Huh? Am I Shelling, Bashing, Batting or Powershelling? How do I do that? How do I check that I have done this right? Open a Windows command window? Many Windowers will not know how to find/edit their path (and should not need to know?). A link would help. If you have dozens of items in the path, this is pretty awkward to edit? But (after a frustrating failure to get SSH access to work - in a separate post) I got to the main course using https: https://github.com/boostorg/boost.git Submodule 'io' (https://github.com/boostorg/io.git) registered for path 'libs/io' Submodule 'iostreams' (https://github.com/boostorg/iostreams.git) registered for path 'libs/iostreams' <big snip> Cloning into 'tools/quickbook'... Submodule path 'tools/quickbook': checked out '340c65150d175ffc20a9a877247928b3ed5eba1b' Success (4040769 ms @ 31-Dec-2013 17:00:21) Just over an hour (using my nominal 10 mbps living-in-the-boondocks but line-of-sight radio link) - something that should be noted in the docs (along with a strong recommendation to send to a log file)? Other you would miss/lose this very useful info? Building the Boost C++ Libraries. Performing configuration checks - symlinks supported : no - hardlinks supported : yes - 32-bit : yes . And I could test system library OK J Phew! Paul PS I had an existing (luckily current) b2.exe at c:\program files\Boost and this is implicitly in my PATH. Do we need to be more specific about how b2 is stored and accessed? Some check that b2.exe vcvars32.bat etc are all set up correctly would be good? --- Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 <mailto:pbristow@hetp.u-net.com> pbristow(a)hetp.u-net.com

7 14

Process for the Community Maintenance Team
by Marshall Clow 04 Feb '14

04 Feb '14

I’ve put up a set of procedures for the Boost Community Maintenance Team (CMT) on the wiki at: https://svn.boost.org/trac/boost/wiki/CommunityMaintenance Comments welcomed. — Marshall

4 6

Udp Socket
by •°o.O sαмι O.o°• 04 Feb '14

04 Feb '14

Asalam-o-Aliakum and Hi all, I am having a problem with boost udp socket. My program terminates after throwing exception "host unreachable". My questions: 1). why udp socket cares for host it should just send data out of its own port and its job is done? 2). And how it knows that host is not available if udp is connection less protocol? 3). And another simple question how to avoid program termination on this exception? Best Regards; Sami Ul Haq

5 6

Building with clang for Windows/MingW
by Edward Diener 03 Feb '14

03 Feb '14

When trying to test clang under Windows which is built with MingW, Boost Build runs with the options: -c -x c++ -O0 -g -fno-inline -Wall -g -mthreads However clang does not recognize -mthreads and flags it as an error. Is there anything I can do to remove this option from the clang++.exe command line when invoking Boost Build ?

2 5

named_condition_any not working.
by Marius Adrian DOBRESCU 02 Feb '14

02 Feb '14

Hello! I tried to use into my code an interprocess mechanism like producer/multiple consumers with named_sharable_mutexes. I found out that named_condition_any is not working with any kind of scoped locks. Neither with sharable_mutex or simple named_mutex. It takes the lock successful but cannot unblock another process when notify is called. I used linux, gcc 4.8, just basic build, linking with pthreads. Is this a known issue to you because I couldn't find any info related on the Internet? Maybe I can take a look next week what is in there... Adrian

2 1

http://lists.boost.org/Archives/boost/2014/01/211169.php
by Gilbert Polo 02 Feb '14

02 Feb '14

Thank you for the simple explanation. Somehow I lost sight of the forest for the trees or its a lot easier to see when the obvious is pointed out.

1 0

[C++11] Is conditional code allowed?
by Fletcher, John P 02 Feb '14

02 Feb '14

I am working on bugs in boost phoenix. I have found some problems eg. #7624 which run fine with C++11 with either Clang 3.4 or gcc 4.8.2. I also have a patch which has been suggested for bug #8704 which uses C++11. Is there a way to incorporate C++11 only code into tests or the actual headers. If so, is there an example of how to do it in Boost? Thank you John Fletcher

3 3

RTG Graph Generator
by Khaled Ammar 02 Feb '14

02 Feb '14

Hi everyone, I noticed that boost has RMAT and Erdös-Renyi graph generator but it does not include a (more) recent and realistic graph generator like RTG. RTG is based on this paper from CMU: http://www.cs.cmu.edu/~lakoglu/pubs/RTG_GraphGenerator.pdf. -- Thanks, -Khaled

1 0

[modular] and status/explicit-failures-markup.xml
by Joachim Faulhaber 01 Feb '14

01 Feb '14

Dear modularists, I've just tried to make changes to modular-boost/status/explicit-failures-markup.xml. Since I have only write permission to my own library libs/icl in modular boost, trying to push my changes failed. What is the right way to change the regression test markups in modular-boost? Best, Joachim -- Interval Container Library [Boost.Icl] http://www.joachim-faulhaber.de

3 4

[offtopic] user-defined raw string literals
by Adam Wulkiewicz 01 Feb '14

01 Feb '14

Hi, I have some idea related to the usage of UDLs in Boost.Geometry library but the way I'd like to handle it is AFAIK not supported. A little introduction first. There are many text-based languages of defining data. One of them is WKT (http://en.wikipedia.org/wiki/Well-known_text) which allows to define vector data e.g. a polygon like this: |POLYGON((30 10, 40 40, 20 40, 10 20, 30 10))| So my thought was: why not use C++11 UDLs for this purpose? There are operators in the WKT language so I should probably use string literal, put WKT in it and be happy with it. The use case could look like this: |auto ||polygon = "POLYGON((30 10,40 40,20 40,10 20,30 10))|"_wkt; Ok so now the tricky part. It should be parsed in compile-time, the type of the geometry retrieved from the string literal and proper type returned (bg::polygon<> in this case). Unfortunately string literals can't be handled as raw literals, e.g. using the variadic-template version of operator"": template <char...> void operator "" () Why? Is there a reason for this? If we had the ability to use the compile-time version with string literals it would be possible to implement various compile-time parsers, not only for the mentioned WKT. So what do you think about it? Regards, Adam

2 2

[docs][website] Can the docs on the website be xhtml + svg?
by John Maddock 01 Feb '14

01 Feb '14

I've been investigating getting better equations and graphs into the Math lib docs and one prerequisite seems to be serving up pages as XHTML rather than HTML: without that SVG's simply do not display correctly (or at all) in IE. The docbook xhtml generation seems to be working OK, but would the pages get served correctly on the current website? Thanks, John.

3 6

[conversion] Need a help with MSVC failures
by Antony Polukhin 01 Feb '14

01 Feb '14

Hi, Some of the tests for Boost.LexicalCast fail on any MSVC compiler. Unfortunately currently I have no access to Windows. Could someone please investigate the failures and tell me were to search the bug? -- Best regards, Antony Polukhin

3 8

[range] Can iterator_range also model Random Access Range?
by Mostafa 01 Feb '14

01 Feb '14

It seems that iterator_range can properly model any refinement of the Forward Range concept. Is that right? The reason I ask is that this is not very clear from the documentation, and I had to deduce this from both the iterator_range API and the Random Access Range concept definition. (See documentation at: range/reference/utilities/iterator_range.html) Thanks, Mostafa

3 6

Range Adapters (map_keys, map_values) cause undefined behavior (segv, etc) when applied to R-Values, especially in the context of BOOST_FOREACH
by Igor Lubashev 01 Feb '14

01 Feb '14

Hi! I've filed a ticket (https://svn.boost.org/trac/boost/ticket/9578) for this issue two weeks ago, but I see no action there. Does anyone else think that this (see subj) is a problem? To spare the trouble of following the link, here is the essence of the problem, as I see it. (The ticket has a simple test case attached.) When applied to r-values (for example, maps returned by value from a function), adapters do not make a copy of the r-value but just capture a reference to it. This makes the returned range_iterator dangerous, if it is used after the r-value (the temporary) is destroyed. In particular, the following use causes undefined behavior on all compilers I'd tested on: g++ (4.1.2, 4.4.3, 4.6.3) and Visual Studio (15 [VC9], 16 [VC10]). BOOST_FOREACH(const string &s, return_map_by_value() | map_keys) ... Note that the following works fine (since BOOST_FOREACH takes care of differentiating between l-values and r-values and does the right thing to r-values): BOOST_FOREACH(const MapType::value_type &v, return_map_by_value()) ... It seems that boost::range::adapters need to do a similar thing to what BOOST_FOREACH is does to identify r-values and make a copy (which the compiler is likely to optimize away). Any comments are welcome! Thanks, - Igor

3 3

Re: [boost] Participation in GSOC 2014
by Vineet Kumar, Indian Institute of Technology, BHU, Varanasi (INDIA) 31 Jan '14

31 Jan '14

Hello Everyone, I want to participate in GSOC 2014, and boost C++ is looking me the most appropriate place where I can contribute efficiently. So how to get started with boost C++ libraries ? I have an Idea of implementing a library in boost. So what I do then , concentrate on library or something else With Regards Vineet Kumar, Indian Institute of Technology, BHU

5 5

GSoC
by Utsav Tiwary 31 Jan '14

31 Jan '14

My idea for GSoC involves implementation of advanced maths libraries for boost which involve the solving of boundary value problems using finite difference method. Language to be used is C. Are there any existing implementations ?

2 2

boost::pool nextof method
by Gilbert Polo 31 Jan '14

31 Jan '14

I am currently learning how to use the boost pool library. However, I have a question regarding the nextof of method found in the class simple_segregated_storage.hpp. How does the increment of the void pointer work. How does it know how much to increment the void pointer by in order to get to the next chunk?

2 1

[type_traits] type_traits for types with operator().
by Anton Bikineev 31 Jan '14

31 Jan '14

Hello. Recently I looked for type_traits for callable classes. It so strange, I didn't find such traits. Most likely, I just missed them or something like them. I actually don't know is there a real need for them. Anyway I tried to write such traits at least for practice and metaprogramming training. I tested them with gcc, clang and msvc2010. I would appreciate if you looked at the code. Here is the link<https://github.com/AntonBikineev/is_functional/> to my github repository. It's cool that they can see hidden generated operator() of lambdas closure type. Best regards, Anton.

5 5

Trouble with constructors boost::graph::directed_graph from boost::adjacency_list in C++
by Matthias Beste 31 Jan '14

31 Jan '14

Dear Boost-Users, Related to: boost::graph::directed_graph I've trouble with the Constructors of above as a simple example shows: <<<<<<<<<<<<<<<<<<< using namespace boost; typedef directed_graph<> Directed_Graphtype; class Mywrapper { private: Directed_Graphtype g; public: Mywrapper() : g() {}; }; >>>>>>>>>>>>>>>>>> I got the following Error while compiling: <<<<<<<<<<<<<<<< HOME/svn_repos/collab_cntfet/trunk/STA_signalintegrity/circuitGraph.h|78| instanziiert von hier| /usr/include/boost/graph/directed_graph.hpp|96|Fehler: keine passende Funktion für Aufruf von »boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, unsigned int, boost::no_property>, boost::property<boost::edge_index_t, unsigned int, boost::no_property>, boost::no_property, boost::listS>::adjacency_list(const boost::directed_graph<>&)«| /usr/include/boost/graph/directed_graph.hpp|96|Anmerkung: Kandidaten sind:| /usr/include/boost/graph/adjacency_list.hpp|451|Anmerkung: template<class EdgeIterator, class EdgePropertyIterator> boost::adjacency_list::adjacency_list(EdgeIterator, EdgeIterator, EdgePropertyIterator, boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::vertices_size_type, boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::edges_size_type, const GraphProperty&)| /usr/include/boost/graph/adjacency_list.hpp|443|Anmerkung: template<class EdgeIterator> boost::adjacency_list::adjacency_list(EdgeIterator, EdgeIterator, boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::vertices_size_type, boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::edges_size_type, const GraphProperty&)| /usr/include/boost/graph/adjacency_list.hpp|435|Anmerkung: boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::adjacency_list(boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::vertices_size_type, const GraphProperty&) [with OutEdgeListS = boost::listS, VertexListS = boost::listS, DirectedS = boost::bidirectionalS, VertexProperty = boost::property<boost::vertex_index_t, unsigned int, boost::no_property>, EdgeProperty = boost::property<boost::edge_index_t, unsigned int, boost::no_property>, GraphProperty = boost::no_property, EdgeListS = boost::listS, boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::vertices_size_type = long unsigned int]| /usr/include/boost/graph/adjacency_list.hpp|435|Anmerkung: keine bekannte Umwandlung für Argument 1 von »const boost::directed_graph<>« nach »long unsigned int«| /usr/include/boost/graph/adjacency_list.hpp|418|Anmerkung: boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::adjacency_list(const boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>&) [with OutEdgeListS = boost::listS, VertexListS = boost::listS, DirectedS = boost::bidirectionalS, VertexProperty = boost::property<boost::vertex_index_t, unsigned int, boost::no_property>, EdgeProperty = boost::property<boost::edge_index_t, unsigned int, boost::no_property>, GraphProperty = boost::no_property, EdgeListS = boost::listS, boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS> = boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, unsigned int, boost::no_property>, boost::property<b oost::edg e_index_t, unsigned int, boost::no_property>, boost::no_property, boost::listS>]| /usr/include/boost/graph/adjacency_list.hpp|418|Anmerkung: keine bekannte Umwandlung für Argument 1 von »const boost::directed_graph<>« nach »const boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, unsigned int, boost::no_property>, boost::property<boost::edge_index_t, unsigned int, boost::no_property>, boost::no_property, boost::listS>&«| /usr/include/boost/graph/adjacency_list.hpp|414|Anmerkung: boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::adjacency_list(const GraphProperty&) [with OutEdgeListS = boost::listS, VertexListS = boost::listS, DirectedS = boost::bidirectionalS, VertexProperty = boost::property<boost::vertex_index_t, unsigned int, boost::no_property>, EdgeProperty = boost::property<boost::edge_index_t, unsigned int, boost::no_property>, GraphProperty = boost::no_property, EdgeListS = boost::listS]| /usr/include/boost/graph/adjacency_list.hpp|414|Anmerkung: keine bekannte Umwandlung für Argument 1 von »const boost::directed_graph<>« nach »const boost::no_property&«| ||=== Build finished: 11 errors, 0 warnings ===| >>>>>>>>>>>>>>>>>>>>>>>>>> I would really like to know, where the problem is with this templates. The default constructor exists of course for boost::directed_graph and boost::adjacency_list a.s.o. ... however the compiler don't like them. This is confusing. Can someone help me out? Kind Regards Matthias -- Dipl.-Ing. Matthias Beste Wissenschaftlicher Mitarbeiter Lehrstuhl für Dependable Nano Computing (CDNC) Institute für technische Informatik (ITEC) Karlsruhe Institute of Technology (KIT) Haid-und-Neu Str.7 (Bldg 07.21) 76131 Karlsruhe, Germany Phone: +49 721 608-45009; Fax: +49 721 608-43962 Email: matthias.beste(at)kit.edu <mailto:matthias.beste@kit.edu> web: http://cdnc.itec.kit.edu/

1 0

[cmake] Plans/status
by Ruslan Baratov 31 Jan '14

31 Jan '14

Hello everyone! I want to ask few questions about this project: https://github.com/boost-cmake/boost-cmake I start with simple one, what is the current status of this project and are there any plans to apply it to the mainline?

1 0