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

Design query using Boost.
by Rahul Mathur 24 Nov '13

24 Nov '13

All, I have a design sinerio. I have different struct (C structures) having different data's but NO similarities between struct and each struct does different operations. The struct for example are - struct Apple { int A; char B; long C; double d; .. ..}; struct Orange { char A; int B; unsigned int C; long d; .. }; and maybe few more. Above few struct data members have dynamic data and other members have fixed/hardcoded datas. The complete struct is send as a buffer to a remote machine through native send()/read() API calls which has been successfully implemented. Please note this data as tested were hard coded or completely static but didn't had combination of dynamic/real and static data.. Now such operations (viz different or repeated) with ONE/MULTIPLE SET of data could be many as 1000, I wish now to send complete operations to remote machine, get a ACK from it and work on this struct data with modification/cancellation/reject/etc operations. One way could be to work with something similar - struct Apple { ... ..}; vector <Apple> data; data.insert (begin();end()) --- But, I have few questions - 1. I can have "std::map<string, vector>" and send this data as native send(). Latter read/recv() with string. Am I correct as I would have multiple operations? 2. I do wish to maintain synchronisation using Boost::lockfree mechanism latter? 3. Any other techniques? Thanks.

1 0

[log] Why aren't logger operations const ?
by Mauricio Carneiro 24 Nov '13

24 Nov '13

I am trying to use a severity channel logger but I hit the problem with BOOST_LOG_SEV not being a const method -- I'm thinking because of both open_record() and push_record() This will basically force me to make all methods in my classes not const because they want to write out to their loggers. I can't really afford to do that -- so I'm restricted to global loggers at the moment. In my current implementation, each class has a logger with the class name as the channel (initialized in their constructors), and it issues log messages at any point with BOOST_LOG_SEV(this->logger, level) I'd love to hear the reason behind the non-constness and if my design is not the intended for Boost::Log. Thank you for your help. Mauricio Carneiro, Ph.D. http://www.broadinstitute.org/~carneiro/

2 4

Re: [Boost-users] New-style for on an iterator-range of filter_iterator of strings crashes/hangs
by Ami Tavory 24 Nov '13

24 Nov '13

Steven Watanabe: > AMDG > > On 11/23/2013 11:12 AM, Ami Tavory wrote: > > <snip> > > typedef > > filter_iterator<function<bool (const string &)>, > > vector<string>::const_iterator> > > filter_it_t; > > auto r = make_iterator_range(filter_it_t(fn, ss.begin()), > > filter_it_t(fn, ss.end())); > > <snip> > > > > yields an executable that crashes with > > {{{ > > Segmentation fault (core dumped) > > }}} > > > > <snip> > > > > You're not constructing the filter_iterators correctly. > From the documentation: > > filter_iterator(Predicate f, Iterator x, Iterator end = Iterator()); > > Effects: > > Constructs a filter_iterator where m_iter is either > the first position in the range [x,end) such that > f(*m_iter) == true or else``m_iter == end``. The > member m_pred is constructed from f and m_end from end. > > You need to pass the end iterator as well. (Or use > the Boost.Range version) > > In Christ, > Steven Watanabe Many thanks!

1 0

New-style for on an iterator-range of filter_iterator of strings crashes/hangs
by Ami Tavory 23 Nov '13

23 Nov '13

Hello, Using g++ 4.8.1 (g++ (Ubuntu/Linaro 4.8.1-10ubuntu8) 4.8.1) with boost 1.5.3, building the code below with {{{ g++ -o example/filter.out -std=c++0x -Wall -g -rdynamic -I/usr/include/boost example/filter.cpp }}} {{{ #include <vector> #include <string> #include <iostream> #include <functional> #include <boost/iterator/filter_iterator.hpp> #include <boost/range/iterator_range.hpp> using namespace std; using namespace boost; int main() { vector<string> ss{"hello", "world"}; // function<bool (const string &)> fn = [](const string &s){return false;}; function<bool (const string &)> fn = [](const string &s){return s.size() > 3;}; cout << fn("Hello") << endl; // (1) cout << fn("world") << endl; // (2) typedef filter_iterator<function<bool (const string &)>, vector<string>::const_iterator> filter_it_t; auto r = make_iterator_range(filter_it_t(fn, ss.begin()), filter_it_t(fn, ss.end())); for(const string &a: r) cout << a << endl; return 0; } }}} yields an executable that crashes with {{{ Segmentation fault (core dumped) }}} Exchanging the comment in the two lines {{{ // function<bool (const string &)> fn = [](const string &s){return false;}; function<bool (const string &)> fn = [](const string &s){return s.size() > 3;}; }}} (so that the first lambda is used) yields an executable that hangs. In either case, the application first prints the results of the lines marked (1) and (2). Can't figure out what I'm doing wrong, and would appreciate advice. Thanks, Ami

2 1

self_loop=false for Unique R-MAT generator
by Николай Кинаш 23 Nov '13

23 Nov '13

>The R-MAT graph model is different from the BA model; are you sure you >want R-MAT? Hmm.... I`m not sure. How to create BA model in BPGL? Thanks.

2 1

Re: [Boost-users] [boost] Subversion repository closing. Conversion to Git imminent.
by Beman Dawes 22 Nov '13

22 Nov '13

On Fri, Nov 22, 2013 at 6:09 PM, Edward Diener <eldiener(a)tropicsoft.com>wrote: > On 11/22/2013 11:52 AM, Beman Dawes wrote:... > >> >> Please make no svn commits after that time. We will be adding a pre-commit >> hook that prevents commits, but please do not wait for that becomes >> active. >> >> After svn is closed, the conversion will be run one last time, and then >> turned off. Then there is a week set aside for final validity checks, >> testing, and general scurrying around. When that is done, the boostorg >> repo >> on GitHub will open for business. If everything goes smoothly, it may take >> less than a week but if there are glitches it may take longer. >> > > Can the boostorg repo on GitHub be pulled from at any time during that > week or is the idea to wait until everything has been verified first. > The boostorg repos, both super-project and individual libraries, can be cloned and that might be useful for some limited testing. For example, creating a private branch "experiments" and making some trial changes and commits. But there is still a risk that any changes pushed up to the GitHub boostpro public repo will get overwritten. This would happen if we decide to rerun the conversion one last time to fix some showstopper that surfaces during testing. So other than throw-away experiments, best bet is to relax, and don't depend on the GitHub public repos until we post a message saying we are totally live. Useful questions, Thanks! --Beman

1 0

[Geometry] Finding polygon self-intersections efficiently
by Rob Conde 22 Nov '13

22 Nov '13

Given a possibly self-intersecting polygon, I'm trying to find the self-intersecting segments of the polygon. I can do this naively of course using Segment and intersects, but I'd like to know if there's a more efficient suggested approach in Boost.Geometry...I'm having a hard time finding anything from the documentation. Thanks, Rob Conde

1 0

Re: [Boost-users] [Boost-docs] [boost] Improving Documentation
by Paul A. Bristow 22 Nov '13

22 Nov '13

> -----Original Message----- > From: Boost-docs [mailto:boost-docs-bounces@lists.boost.org] On Behalf Of Paul A. Bristow > Sent: Wednesday, November 20, 2013 12:09 PM > To: Discussion of Boost Documentation > Subject: [Boost-docs] FW: [boost] Improving Documentation I've had yet another go at Robert Ramey's challenge to document his to-be-proposed Safe Integers library You can see the results of my most recent efforts (now only for users) at https://dl.dropboxusercontent.com/u/43940943/safe_numerics/libs/safe_numeri… and as a single pdf file https://dl.dropboxusercontent.com/u/43940943/safe_numerics/libs/safe_numeri… Apart from the effort involved in providing Doxygen comments (which I believe is small, especially during writing the code, because there is lots of boiler plating possible), our main differences of view are on how to provide the 'concepts' information. The only true concepts used by this library (at present) are the ubiquitous assignable and copyconstructable. For the more common concepts, I have used a simple link to the concept like http://www.sgi.com/tech/stl/Assignable.html because the library is not using Boost.Concept (yet). (There is also a concept of a Numeric type but this is not enforced by the use of the library, although it can be tested using file https://dl.dropboxusercontent.com/u/43940943/safe_numerics/boost/safe_numer… provided). The information on type Numeric in this file is documented in my Doxygenated version here: https://dl.dropboxusercontent.com/u/43940943/safe_numerics/libs/safe_numeri… Robert has contrasted his presentation of concepts (and other information) thus http://htmlpreview.github.io/?https://raw.github.com/robertramey/safe_numer… doc/html/index.html with mine. I believe that it contains the same information (about Numeric) and can be found by using the automatically produced Index - see https://dl.dropboxusercontent.com/u/43940943/safe_numerics/libs/safe_numeri… l The other information about operators can also be found using the index, for example, operator>= see https://dl.dropboxusercontent.com/u/43940943/safe_numerics/libs/safe_numeri… /safe_compare/greater_than_equal.html The difference is that Robert provides a simple list, whereas I provide an index to individual operators (not all are currently documented - retrofitting is tedious!). IMO the user will find the index method easier (when that is the users' expectation). With a tiny library like this (chosen as a demo because it is small) it may be easy to find the concepts section, but for a typical much larger library making the table and finding it will be less attractive. The size of the documentation is much, much bigger, but it is more likely to be complete, and more likely to be accurate, (and nearly all will be unread so its repetitions unimportant). A typical example of what the user is likely to read is about the key template 'safe': https://dl.dropboxusercontent.com/u/43940943/safe_numerics/libs/safe_numeri… /safe.html You will note how this references concepts DefaultConstructible,... If Concepts get into the C++ language, or Boost.Concept is used, or the method using by Boost.GIL - see http://www.boost.org/doc/libs/1_55_0/libs/gil/doc/html/g_i_l_0286.html I believe we could make this fairly automatic, but I think the library must do this as it is conceived. Views welcome. Paul PS A more typical library with Doxygen comments in the C++ reference section is at https://dl.dropboxusercontent.com/u/43940943/circular_buffer/libs/circular_… l showing the info about circular buffer, for example at https://dl.dropboxusercontent.com/u/43940943/circular_buffer/libs/circular_… cular_buffer.html --- Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 pbristow(a)hetp.u-net.com

1 0

Re: [Boost-users] [BGL] visitors.hpp:138: error: no type named 'event_filter' in 'class dijkstra_custom_visitor'
by The Maschine 22 Nov '13

22 Nov '13

Well Jeremiah, My email and the assumptions are completely wrong. Im sorry. just forget about it, next time Ill have my coffee before debuting code :) thanks

1 0

Subversion repository closing. Conversion to Git imminent.
by Beman Dawes 22 Nov '13

22 Nov '13

The Boost Steering Committee has given the final approval for the conversion from Subversion to Git, including the modularization of Boost library repositories. The Subversion repository will be closed for all changes to all branches, including the sandbox, Sunday, November 23 2013, 00:00 hours UTC. That's 8 PM Saturday, US East Coast time, and 5 PM US West Coast time. Please make no svn commits after that time. We will be adding a pre-commit hook that prevents commits, but please do not wait for that becomes active. After svn is closed, the conversion will be run one last time, and then turned off. Then there is a week set aside for final validity checks, testing, and general scurrying around. When that is done, the boostorg repo on GitHub will open for business. If everything goes smoothly, it may take less than a week but if there are glitches it may take longer. --Beman

1 0

self_loop=false for Unique R-MAT generator
by Николай Кинаш 22 Nov '13

22 Nov '13

Hi. I use Parallel Boost Graph Library to create network Barabási–Albert (BA) model int main(int argc, char* argv[]) { boost::mpi::environment env(argc, argv); boost::minstd_rand gen; Graph g(RMATGen(gen, 100, 400, 0.3, 0.1, 0.2, 0.03), RMATGen(), 100); write_graphviz(std::cout, g); } This graph always have self-loops vertex. How i can to forbid self_loop for Unique R-MAT generator ?

2 1

Re: [Boost-users] [BGL] visitors.hpp:138: error: no type named 'event_filter' in 'class dijkstra_custom_visitor'
by The Maschine 22 Nov '13

22 Nov '13

Hi, My code is very simple so I suspect I missing something about the real 'examine_vertex' meaning. One example with the custom visitor and one without that produces the correct results out site the 'search' (I;d like to be able to do it with a visitor though for later steps) Simplified to just the essentials. #### With VISITOR #### IndexMap indexMap = boost::get(boost::vertex_index, m_ugraph); PredecessorMap predecessorMap(&predecessors[0], indexMap); DistanceMap distanceMap(&distances[0], indexMap); glm::dvec3 s_mid = m_ugraph[*vertex_iterator_begin].m_mid_point; double thres = 500.0f; dijkstra_threshold vis(s_mid,thres); try { boost::dijkstra_shortest_paths(m_ugraph, *vertex_iterator_begin, boost::predecessor_map(predecessorMap).distance_map(distanceMap).visitor(vis)); } catch (...) { } int total_node_count2 = 0; double total_depth2 = 0.0; for (boost::tie(vi, vi_end) = boost::vertices(m_ugraph); vi != vi_end; ++vi) { if( (double(distances[*vi])*1.1) >= std::numeric_limits<double>::max() || (std::isnan(distances[*vi])) || !(std::isfinite(distances[*vi])) ) { } else { total_depth2 += double(distances[*vi]); total_node_count2 += 1; } } #### To the total distances and the number of nodes within the radius is not correct… #### Without a visitor outside dijkstra_shortest_paths #### try { boost::dijkstra_shortest_paths(m_ugraph, *vertex_iterator_begin, boost::predecessor_map(predecessorMap).distance_map(distanceMap)); } catch (...) { } int total_node_count2 = 0; double total_depth2 = 0.0; for (boost::tie(vi, vi_end) = boost::vertices(m_ugraph); vi != vi_end; ++vi) { if( (double(distances[*vi])*1.1) >= std::numeric_limits<double>::max() || (std::isnan(distances[*vi])) || !(std::isfinite(distances[*vi])) ) { } else { if( thres > 0.0f && glm::distance(s_mid, m_ugraph[*vi].m_mid_point) < thres ) { total_depth2 += double(distances[*vi]); total_node_count2 += 1; } } ### This give you the correct results but you searched the full graph. Any ideas? Thanks

2 1

Visitor pattern with functor front end
by Daniele Barzotti 22 Nov '13

22 Nov '13

Hi, maybe this will be a trivial question but I'm quite new to MSM. If I would to use the visitor pattern, how can I define it using the functor front-end? Regards, Daniele.

1 1

Boost.log file rotation current file name
by Daniel Krikun 22 Nov '13

22 Nov '13

Hello, I use some log viewer tool to display and filter logs. In log4j there is a feature that allows for the current logfile to have some constant name, e.g 'current.log', and only after it is finalized it is renamed to its name (probably having some timestamp/counter) in it. This feature makes it most convenient with log viewers. Is it possible to achieve this with Boost.Log? If not I would like to suggest it as a feature request. Regards,

1 0

Fwd: Boost.log file collector
by Daniel Krikun 22 Nov '13

22 Nov '13

Hello, When I set up text_file_backend with file rotation and a file collector with the target directory other from the directory where my application resides, then if the application crashes, the current log file will not be collected to the target directory. This is somewhat inconvenient, because, let's say we setup the file collector to collect all the log files under 'logs' subfolder, and then if the application crashes we ask the user to simply e-mail the 'logs' folder to see what possibly went wrong before the crash, but, alas, the most interesting piece is missing. Is there a way to work around the problem? Thanks,

1 0

[multiprecision] Empty intervals and intervals with NaN check
by Александров Петр 21 Nov '13

21 Nov '13

Hello. In MPFI documentation it is said that "MPFI functions operate on valid intervals ..., their behavior with non-valid intervals as input is undefined". Are intervals checked in Boost Multiprecision library whether they are invalid? Can this be easily done using Boost? Kind regards, Petr.

2 3

Problem with variadic BOOST_PP_TUPLE_REM in Clang
by Jeremiah Willcock 21 Nov '13

21 Nov '13

When using Clang version "Apple LLVM version 5.0 (clang-500.2.79) (based on LLVM 3.3svn)" in C++11 mode, the code: #include <boost/preprocessor.hpp> BOOST_PP_TUPLE_REM()(foo(bar, baz) const) is not expanded correctly. The second line expands to: BOOST_PP_TUPLE_REM_(foo(bar, baz) const) while on GCC 4.9, it expands to: foo(bar, baz) const Is there a known issue with this macro on Clang? -- Jeremiah Willcock

6 12

Re: [Boost-users] [BGL] visitors.hpp:138: error: no type named 'event_filter' in 'class dijkstra_custom_visitor'
by The Maschine 21 Nov '13

21 Nov '13

Thanks a lot for that. Problem solved, in terms of the function call. What remains is that my custom visitor is not behaving as I thought** it would! What I wanted to implement (which partially is based on an older thread that you replied) is cut-off radius around the source. The problem with my version of visitor is that it dies when it 'examines' the first vertex outside the radius, but this doesnt imply that everything within radium is correctly found (correct distances etc). Any tips about this? Thanks a lot

2 1

[BGL] visitors.hpp:138: error: no type named 'event_filter' in 'class dijkstra_custom_visitor'
by The Maschine 21 Nov '13

21 Nov '13

Hi, Im trying to use a custom visitor but I get this error. My custom visitor is: class dijkstra_custom_visitor : public boost::default_dijkstra_visitor { public: dijkstra_threshold(glm::dvec3 source, double threshold): s(source), threshold(threshold) {} struct hit_threshold {}; void examine_vertex(boost::graph_traits <unGraph>::vertex_descriptor v, const unGraph& g) { glm::dvec3 dest = boost::get(&VertexProperties::m_mid_point, g, v); if( glm::distance(s,dest) > threshold ) throw hit_threshold(); } double threshold; glm::dvec3 s; }; My 'calling' line is: std::vector<Vertex> predecessors(boost::num_vertices(m_ugraph)); std::vector<Weight> distances(boost::num_vertices(m_ugraph), std::numeric_limits<double>::max() ); IndexMap indexMap = boost::get(boost::vertex_index, m_ugraph); PredecessorMap predecessorMap(&predecessors[0], indexMap); DistanceMap distanceMap(&distances[0], indexMap); glm::dvec3 s_mid = m_ugraph[*vertex_iterator_begin].m_mid_point; double thres = 500.0f; boost::dijkstra_shortest_paths(m_ugraph, *vertex_iterator_begin, boost::predecessor_map(predecessorMap).distance_map(distanceMap).visitor(boost::make_dijkstra_visitor(dijkstra_custom_visitor(s_mid,thres)))); What do you think is the problem? thanks

2 1

TypeTraits like library for inheritance access specifiers?
by Mostafa 21 Nov '13

21 Nov '13

Is there a TypeTraits like library for determining inheritance access specificers? Something like a is_private_base_of? Thanks, Mostafa

1 0

linking with boost log 1.54
by Ovanes Markarian 20 Nov '13

20 Nov '13

Hi *, I am stuck with a problem to link on linux (ubuntu 12.04) with a boost log library (clang 3.0 & libstdc++). No matter what I do it fails. The problem is: I have a 3rd party library which is delivered as an .so-module and I need to link with it. My project is organized so that we develop static libraries and link them with test or application runner executables. I currently build boost as static libraries only, after I link my project with log library I get tons of errors like: /usr/lib/gcc/x86_64-linux-gnu/4.6/../../../x86_64-linux-gnu/libpthread.a(nptl-init.o): In function `__pthread_initialize_minimal_internal': /build/buildd/eglibc-2.15/nptl/nptl-init.c:296: undefined reference to `__libc_setup_tls' /build/buildd/eglibc-2.15/nptl/nptl-init.c:314: undefined reference to `_dl_cpuclock_offset' /build/buildd/eglibc-2.15/nptl/nptl-init.c:430: undefined reference to `_dl_pagesize' /build/buildd/eglibc-2.15/nptl/nptl-init.c:456: undefined reference to `_dl_init_static_tls' /build/buildd/eglibc-2.15/nptl/nptl-init.c:458: undefined reference to `_dl_wait_lookup_done' /usr/lib/gcc/x86_64-linux-gnu/4.6/../../../x86_64-linux-gnu/libpthread.a(nptl-init.o): In function `__pthread_get_minstack': /build/buildd/eglibc-2.15/nptl/nptl-init.c:479: undefined reference to `_dl_pagesize' /usr/lib/gcc/x86_64-linux-gnu/4.6/../../../x86_64-linux-gnu/libpthread.a(pthread_create.o): In function `allocate_stack': /build/buildd/eglibc-2.15/nptl/allocatestack.c:457: undefined reference to `_dl_stack_flags' /build/buildd/eglibc-2.15/nptl/allocatestack.c:596: undefined reference to `_dl_stack_flags' /usr/local/lib/libboost_log-mt-s.a(text_file_backend.o): In function `boost::log::v2s_mt_posix::sinks::anonymous::file_collector::file_collector(boost::shared_ptr<boost::log::v2s_mt_posix::sinks::anonymous::file_collector_repository> const&, boost::filesystem::path const&, unsigned long, unsigned long)': libs/log/src/text_file_backend.cpp:(.text+0x60b): undefined reference to `boost::filesystem::detail::current_path(boost::system::error_code*)' libs/log/src/text_file_backend.cpp:(.text+0x65c): undefined reference to `boost::filesystem::absolute(boost::filesystem::path const&, boost::filesystem::path const&)' libs/log/src/text_file_backend.cpp:(.text+0x6b1): undefined reference to `boost::filesystem::detail::create_directories(boost::filesystem::path const&, boost::system::error_code*)' And so on. Do you have any hints or suggestions? Thanks, Ovanes

4 7

[String_Ref] Working with other parts of boost
by Norbert Wenzel 20 Nov '13

20 Nov '13

Hi, I wanted to play around with Boost.String_Ref and found some old code that I thought would be the ideal case for string_refs. It's basically a config file reader that stores the whole line and also a key/value pair that may be found in that line. So a single line looked something like this: std::string line; //original line as is in the file boost::string_ref key; //extracted key subpart boost::string_ref value; //extracted value subpart But when I wanted to trim the string_refs (eg. for lexical_casting them) I got compile errors, because boost::trim uses erase, which of course is not supported by string_ref. But string_ref has the remove_prefix/suffix member functions, which would be exactly what trim needs. So I quickly hacked an additional overload of trim_*_if that calls the remove_*fix instead of the .erase() member function and it seemed to work. The second problem occurred when I tried to extract my key/value pair from a line using the Tokenizer, which seems to be old, but it still works for simple cases. Tokenizer internally uses assign() to fill an internal buffer with the next token, which of course is no member function of string_ref. Since it seems Tokenizer only uses the assign version that takes two iterators it might be possible to add such an assign() function to string_ref. At least I added one as a testcase locally and it worked in my limited testcase. Are there any plans to add either trim() or Tokenizer support for string_ref? I'm not sure about the Tokenizer/assign stuff, since one would have to change string_ref but I really think the trim() support would be helpful. Anyway, these issues kept me from actually using string_ref, since the code did not compile (or required changes to boost headers in order to compile). And I did not want to redo some of the boost string algorithm stuff in order to use string_refs. Norbert

4 9

[Asio] Issues with kqueue_reactor, dynamic libraries and -fvisibility=hidden
by Andrei Bica 19 Nov '13

19 Nov '13

I'm having a problem with a larger project for MacOS which uses multiple dynamic libraries and asio features (deadline_timers and tcp/udp scokets). I've managed to reproduce my problem in the following minimal example: ////////// Timer.hpp ////////// #ifndef TIMER_HPP #define TIMER_HPP #include <boost/asio.hpp> #include <boost/thread.hpp> #define VISIBLE __attribute__ ((visibility ("default"))) class VISIBLE Timer { public: Timer(boost::asio::io_service& service); private: void onTimeout(const boost::system::error_code& code); boost::asio::deadline_timer timer; }; #endif // Timer_HPP ////////// Timer.cpp ////////// #include <Timer.hpp> Timer::Timer(boost::asio::io_service& service) : timer(service) { timer.expires_from_now(boost::posix_time::seconds(1)); timer.async_wait(boost::bind(&Timer::onTimeout, this, _1)); } void Timer::onTimeout(const boost::system::error_code& code) { std::cout << "The callback from the dynamic library was called." << std::endl; } ////////// main.cpp ////////// #include <Timer.hpp> boost::asio::io_service service; void run() { service.run(); } void onTimeout(const boost::system::error_code& code) { std::cout << "The callback from main was called." << std::endl; } int main() { Timer timer(service); boost::asio::deadline_timer deadline_timer(service); deadline_timer.expires_from_now(boost::posix_time::seconds(1)); deadline_timer.async_wait(boost::bind(&onTimeout, _1)); boost::thread t(boost::bind(&run)); t.join(); return 0; } Timer.cpp is compiled into a dynamic library and used by main.cpp which is compiled as an executable. The environment: MacOS 10.8.5, Boost 1.54.0, clang 500.2.79 The parameters which are passed to clang at compilation time are: clang++ -ggdb -c Timer.cpp -I. -I/opt/local/include -fPIC -fvisibility=hidden clang++ -ggdb -o libTimer.dylib -dynamiclib Timer.o -L/opt/local/lib -lboost_thread-mt -lboost_system-mt -fvisibility=hidden clang++ -ggdb main.cpp -o runTest -I. -I/opt/local/include -L. -L/opt/local/lib -lboost_thread-mt -lboost_system-mt -lTimer fvisibility=hidden As you can see the visibility is set to hidden at compilation time in order to expose only desired functions (e.g. the Timer class) from my library. The problem that arise is that the callback of the timer from main.cpp is never called. If I remove the visibility flag at compilation time the example works as it should (both timer callbacks are called). When I did further investigations I've observed that 2 kqueue_reactor instances are create when using hidden visibility and only one kqueue_reactor is created when visibility is set to default. I need an advise on how should I proceed so that I can still use the visibility set to hidden at compilation time but have the example working as expected. When compiling the example on Linux using visibility set to hidden the example works as expected. Regards, Andrei

1 0

Compiling Boost 1.55.0 with Intel 14.0.1 and libstdc++ from GCC 4.8.1
by Maxime Boissonneault 19 Nov '13

19 Nov '13

Hi, I am attempting to build Boost 1.55.0 with Intel compiler 14.0.1, using the Standard C++ Library provided by GCC 4.8.1 I am having a lot of errors with "fenv". Here is a subset of those errors, with one particular object that is being built by the build script. The offending command line is "icpc" -c -xc++ -w1 -inline-level=2 -O3 -ip -fPIC -DBOOST_ALL_NO_LIB=1 -DBOOST_DATE_TIME_DYN_LINK=1 -DBOOST_FILESYSTEM_DYN_LINK=1 -DBOOST_LOG_BUILDING_THE_LIB=1 -DBOOST_LOG_DLL -DBOOST_LOG_NO_THREADS -DBOOST_LOG_USE_AVX2 -DBOOST_LOG_USE_NATIVE_SYSLOG -DBOOST_LOG_USE_SSSE3 -DBOOST_LOG_WITHOUT_EVENT_LOG -DBOOST_SPIRIT_USE_PHOENIX_V3=1 -DBOOST_SYSTEM_DYN_LINK=1 -DBOOST_THREAD_DONT_USE_CHRONO=1 -DDATE_TIME_INLINE -DNDEBUG -I"." -c -o "bin.v2/libs/log/build/intel-linux/release/log-api-unix/named_scope_format_parser.o" "libs/log/src/named_scope_format_parser.cpp" Errors are such as : In file included from ./boost/math/tools/promotion.hpp(26), from ./boost/math/special_functions/detail/round_fwd.hpp(12), from ./boost/math/special_functions/math_fwd.hpp(26), from ./boost/math/special_functions/fpclassify.hpp(19), from ./boost/spirit/home/support/detail/sign.hpp(22), from ./boost/spirit/home/karma/numeric/detail/numeric_utils.hpp(22), from ./boost/spirit/home/karma/numeric/uint.hpp(33), from ./boost/spirit/include/karma_uint.hpp(16), from libs/log/src/named_scope_format_parser.cpp(22): ./boost/math/tools/config.hpp(309): error: identifier "fexcept_t" is undefined fexcept_t m_flags; ^ In file included from ./boost/math/tools/promotion.hpp(26), from ./boost/math/special_functions/detail/round_fwd.hpp(12), from ./boost/math/special_functions/math_fwd.hpp(26), from ./boost/math/special_functions/fpclassify.hpp(19), from ./boost/spirit/home/support/detail/sign.hpp(22), from ./boost/spirit/home/karma/numeric/detail/numeric_utils.hpp(22), from ./boost/spirit/home/karma/numeric/uint.hpp(33), from ./boost/spirit/include/karma_uint.hpp(16), from libs/log/src/named_scope_format_parser.cpp(22): ./boost/math/tools/config.hpp(301): error: identifier "FE_INVALID" is undefined fegetexceptflag(&m_flags, FE_ALL_EXCEPT); I have the following set export CPLUS_INCLUDE_PATH=/software6/compilers/gcc/4.8.1/include/c++/4.8.1/ if I unset CPLUS_INCLUDE_PATH, this specific object compiles fine (with warnings, but no error). Does anyone have an idea of weither this is a bug with Intel compiler or with Boost ? Best regards, -- --------------------------------- Maxime Boissonneault Analyste de calcul - Calcul Québec, Université Laval Ph. D. en physique

3 6

New Windows Build of 1.55.0
by Tom Kent 19 Nov '13

19 Nov '13

The previous build of 1.55.0 did not build with the correct zlib version (and thus the correct sub-library of iostreams did not build). I have created a 1.55.0-build2 directory on the sourceforge page with the updated version. I've also added a note to the 1.55.0/README.md file explaining that it is incomplete, but I did not remove the prior build. http://sourceforge.net/projects/boost/files/boost-binaries/1.55.0-build2/ Tom

1 0