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

[Thread] Using thread accross libraries
by Sébastien Gallou 28 Nov '13

28 Nov '13

Hi all, first, thanks for this great library. I'm using Boost::thread and experiencing a problem when trying to interrupt thread executed in a dynamic library (DLL, under Windows). I reproduced it in a minimal example, that I join to this post (I don't know if attachment is authorized so I also put it on my GDrive<https://drive.google.com/file/d/0B3dXqBwTbfcAQ1E0MDRfU0hxNVE/edit?usp=shari…>, and copy the code at the end of this mail). In this code, I start a thread in the main, calling a function "doWork" of a plugin, dynamically loaded. The doWork just do some sleep and wait for boost::thread_interrupted exception. The problem is that the exception is never received when the main call interrupt on the thread. If the doWork code is in the main application, all works well. Trying to debug into Boost, I'm seeing that in the interruptible_wait function, the test "if(detail::get_current_thread_data() && detail::get_current_thread_data()->interruption_enabled)" doesn't give the same result if code is in DLL (test result is false) or in the main (true). What is the reason of this behaviour ? Thanks for your help, Sébastien Gallou Here is the code : *TestBoostThread.cpp :* IPlugin* Plugin; void doWork(){ try { Plugin->doWork(); } catch (boost::thread_interrupted&) { // End-of-thread exception was not catch by plugin, // it's a developer's error, we have to report it std::cout << "Plugin didn't catch boost::thread_interrupted."; }} int main(int argc, char* argv[]){ HMODULE libraryHandle = LoadLibrary(L"Dll.dll"); boost::function<IPlugin* ()> construct = (IPlugin* (*)(void))GetProcAddress(libraryHandle, "construct"); Plugin=construct(); boost::shared_ptr<boost::thread> thread = boost::shared_ptr<boost::thread>(new boost::thread(doWork)); Sleep(1500); thread->interrupt(); thread->join(); FreeLibrary(libraryHandle); return 0;} *Dll.cpp :* class MyPlugin : public IPlugin{ virtual ~MyPlugin(){} virtual void doWork() { try { while(1) { std::cout << "MyPlugin is running..."; // Give a chance to exit plugin thread boost::this_thread::sleep(boost::posix_time::milliseconds(1000)); }; } catch (boost::thread_interrupted&) { std::cout << "MyPlugin is stopped..."; } }}; extern "C" __declspec(dllexport) IPlugin* construct(){ return new MyPlugin;}

2 1

Hash collision for pairs of int
by Saurabh T 27 Nov '13

27 Nov '13

Hi, I'm experiencing a lot of collisions using the hash_combine function in functional/hash/hash.hpp for integer-pairs-as-keys when there are few unique ints in each of the pair's positions (put together the keys themselves are unique of course). I've uploaded a simple enough test case here: http://www.speedyshare.com/Wcem6/hash.cc.gz. If there's a more preferred way to upload, let me know and I'll reupload. With 400K pairs, this returns only 86K unique indices and has a max of 18 collisions in size_t. Am I doing something really wrong here? Thank you. saurabh

3 3

[Graph] filters and subgraphs?
by The Maschine 27 Nov '13

27 Nov '13

Hi all, What Im trying to do is the get a filtered or subgraph that holds the properties of the original graph (vertex and edge bundles). Ill use the 'subgraph' in other algorithms but from time to time I'd like to be able to trace the original vertex_descriptor and push data back to the original graph. (that might be able to happen via the original_vertex_d below but lets see..) Below is an attempt to use graph filters to do it but for reasons that can be found in topics by others, I think this is not going to work. (filtered graph are too simple.. etc) Is it possible to use the 'distance map', that I use to produce a filtered graph, for producing a subgraph that all info from the original (minus the filtered vertexes that we dont want of course) data are there and can be also further used in algorithms? Thanks ///////////////////////////// struct VertexProperties { boost::graph_traits<unGraph>::vertex_descriptor original_vertex_d; // might be needed for the question above double m_bc; // for betweenness ..... .... }; struct EdgeProperties { double m_weight1; double m_weight2; }; typedef double Weight; typedef boost::property<boost::edge_weight_t, double> EdgeWeightProperty; typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, VertexProperties, EdgeProperties> unGraph; typedef boost::graph_traits < unGraph >::vertex_descriptor Vertex; typedef boost::property_map < unGraph, boost::vertex_index_t >::type IndexMap; typedef boost::iterator_property_map < Vertex*, IndexMap, Vertex, Vertex& > PredecessorMap; typedef boost::iterator_property_map < Weight*, IndexMap, Weight, Weight& > DistanceMap; struct vertex_distance_filter { vertex_distance_filter() { } vertex_distance_filter(std::vector<Weight> distance_map, double radius) : m_dist_map(distance_map), m_radius(radius) { } bool operator()(const typename boost::graph_traits<unGraph>::vertex_descriptor& v) const { return m_radius > m_dist_map[v]; } double m_radius; std::vector<Weight> m_dist_map; }; ////// int i = 0; // simplified boost::graph_traits<unGraph>::vertex_descriptor s_vertex = boost::vertex(i, m_ugraph); // Filter 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); boost::dijkstra_shortest_paths(m_ugraph, s_vertex, boost::weight_map(boost::get(&EdgeProperties::m_weight1, m_ugraph)).predecessor_map(predecessorMap).distance_map(distanceMap)); vertex_distance_filter filter(distances, 400.0f); typedef boost::filtered_graph<unGraph, vertex_distance_filter> FilteredGraphType; FilteredGraphType filteredGraph(m_ugraph, filter); // Work on the filtered graph. Subgraph maybe??? std::vector< double > v_centrality_vec(boost::num_vertices(filteredGraph), 0.0); // different weight from above. here m_weight2 boost::brandes_betweenness_centrality(filteredGraph , boost::centrality_map(boost::make_iterator_property_map(v_centrality_vec.begin(),boost::get(boost::vertex_index, filteredGraph),double())).vertex_index_map(get(boost::vertex_index, m_ugraph)).weight_map(boost::get(&EdgeProperties::m_weight2, m_ugraph)) ); // here we start having problems... comments above boost::graph_traits<unGraph>::vertex_iterator vertex_iterator_begin, vertex_iterator_end; for ( boost::tie(vertex_iterator_begin, vertex_iterator_end) = vertices(filteredGraph); vertex_iterator_begin != vertex_iterator_end; ++vertex_iterator_begin) { // this is the original unfiltered graph!!!! m_ugraph[*vertex_iterator_begin].m_bc = v_centrality_vec[*vertex_iterator_begin]; }

1 0

[log] switching from n loggers to 1
by Eric Prud'hommeaux 27 Nov '13

27 Nov '13

I'm updating an old library which sets up eight separate loggers with different channel labels: BOOST_LOG_INLINE_GLOBAL_LOGGER_DEFAULT(DefaultLog, SWObjectsLogger); BOOST_LOG_INLINE_GLOBAL_LOGGER_CTOR_ARGS(RewriteLog, SWObjectsLogger, (channel = "Rewrite")); ... BOOST_LOG_SEV(L::RewriteLog::get(), L::info) << "foo->bar\n"; I'd like to update to 1.54 (or 1.55) and before I `perl -i` the heck out of it, I'm wondering what are the tradeoffs around using a single logger: BOOST_LOG_INLINE_GLOBAL_LOGGER_DEFAULT(TheLogger, boost::log::sources::severity_channel_logger< severity_level >) ... BOOST_LOG_CHANNEL_SEV(L::TheLogger::get(), L:Rewrite, L::info) << "foo->bar"; I can guess that many loggers gives me more (future) versatility to log Rewrite stuff to a different stream and that these eight loggers come with some memory footprint. Is that about right? (Also, why does adding a template parameter for the channel BOOST_LOG_INLINE_GLOBAL_LOGGER_DEFAULT(TheLogger, boost::log::sources::severity_channel_logger< severity_level >) barf with macro errors? expressions_channel_severity_filter.cpp:306:127: error: macro "BOOST_LOG_INLINE_GLOBAL_LOGGER_DEFAULT" passed 3 arguments, but takes just 2 expressions_channel_severity_filter.cpp:306:1: error: ‘BOOST_LOG_INLINE_GLOBAL_LOGGER_DEFAULT’ does not name a type? ) -- -ericP office: +1.617.599.3509 mobile: +33.6.80.80.35.59 (eric(a)w3.org) Feel free to forward this message to any list for any purpose other than email address distribution. There are subtle nuances encoded in font variation and clever layout which can only be seen by printing this message on high-clay paper.

1 0

[multiarray] How to make a generic one from an existing C multi-array.
by Mostafa 27 Nov '13

27 Nov '13

Given the following: template <typename T, std::size_t D1> void foo(T (&arr)[D1]) { typedef boost::multi_array_ref < typename boost::remove_all_extents<T>::type, boost::rank<T[D1]>::value > arr_type; // ? = ExtentList or extents_tuple. arr_type ma(arr, ?); } Are there any existing tools to create an ExtentList or extents_tuple obj from the type of arr? Thanks, Mostafa

1 0

[graph] How to use default ColorMap when using depth_first_visit
by Laila, Akeel 26 Nov '13

26 Nov '13

Hi, I'm looking to use depth_first_visit to traverse a labeled_graph, but the below code fails to compile due to the absence of ColorMap argument: depth_first_visit(dependencyGraph, targetDepVertex, visitor(cycleDetector)); error C2780: 'void boost::depth_first_visit(const IncidenceGraph &,graph_traits<G>::vertex_descriptor,DFSVisitor,ColorMap,TerminatorFunc)' : expects 5 arguments - 3 provided e:\TR\ToolsRelease\git\boost\1.54.0\src\boost/graph/depth_first_search.hpp:320:0 : see declaration of 'boost::depth_first_visit' error C2780: 'void boost::depth_first_visit(const IncidenceGraph &,graph_traits<G>::vertex_descriptor,DFSVisitor,ColorMap)' : expects 4 arguments - 3 provided e:\TR\ToolsRelease\git\boost\1.54.0\src\boost/graph/depth_first_search.hpp:309:0 : see declaration of 'boost::depth_first_visit' On the other hand, depth_first_search compile just fine: depth_first_search(dependencyGraph, visitor(cycleDetector)); I guess what it comes down to is that a default ColorMap is utilized by depth_first_search. Anyone know how I can access this same default ColorMap (which I can then feed to depth_first_visit()) FYI, my labeled_graph type is defined as follows: typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS , DependencyVertex, DependencyEdge> DependencyGraphInternalType; typedef boost::labeled_graph<DependencyGraphInternalType, string> DependencyGraphType; Thanks, Akeel Laila ________________________________ This email is non-binding, is subject to contract, and neither Kulicke & Soffa Industries Inc nor its subsidiaries shall have any obligation to you to consummate the transactions herein or to enter into any agreement, other than in accordance with the terms and conditions of a definitive agreement if and when negotiated, finalized and executed between the parties.

1 0

how to learn Boost
by e.palmero＠googlemail.com 26 Nov '13

26 Nov '13

Dear Boost Developer: I am new to Boost and I would like to know any suggestion for books to get deeply inside the Boost libraries. Best Ernesto

4 3

[multiprecision] FMA without expression templates?
by Francesco Biscani 26 Nov '13

26 Nov '13

Hello, I would like to start using the Boost multiprecision library in my code. For a series of reasons, I would like to disable the expression template support (I need the return type of a + b to be the type of a or b, and not an expression). My understanding after briefly venturing into the library code is that there is the concept of a multiply_add() function (e.g., in boost/multiprecision/detail/default_ops.hpp), but that such support is hidden behind the expression template magic and it is not exposed when ET is disabled. I tried to look into Boost math as well, where there is a fused multiply-add function, but it seems like it is built to support floating-point types and I need support for integral types (for the implementation of algebraic operations on polynomials with integer coefficients). Is my understanding correct or is there a way to use some kind of a multiply_accumulate function in multiprecision without using ET? Many thanks, Francesco.

1 0

[random] infinite loop in uniform_real_distribution
by Jérémy Coulon 26 Nov '13

26 Nov '13

Hello, I'm using Boost 1.54. The following code hangs in infinite loop when generating a single floating point number : #include <boost/random.hpp> #include <iostream> #include <limits> int main() { boost::random::mt19937 rng; boost::random::uniform_real_distribution<float> distrib( -std::numeric_limits<float>::max(), std::numeric_limits<float>::max()); std::cout << distrib(rng) << std::endl; return 0; } I can reproduce the bug with both - Linux GCC 4.8 x86_64 and - Windows VisualStudio 2012 32bits It looks like this uniform distribution doesn't work if the range [min,max] is large. From uniform_real_distribution.hpp:61 T result = numerator / divisor * (max_value - min_value) + min_value; Here the operation (max_value - min_value) produces an overflow. Regards, Jeremy

3 7

[Iostreams] Segmentation fault when stream is flushed or closed
by Steven Maenhout 26 Nov '13

26 Nov '13

Hello, I'm trying to open a boost::iostreams::stream in the constructor of a class and to close the stream in the destructor. This works fine but when I pass a reference to a std::stringstream in that same constructor I get a segmentation fault in the destructor when I flush or close the stream. This happens irrespective if the passed std::stringstream reference takes part in the boost::iostream::stream or not. I'm using gcc 4.6.3 with boost 1.53 on Linux x86_64. Below I provided a small example that exhibits this behaviour. Any ideas anyone? #include "test.h" int main(int argc, char **argv) { std::stringstream logStream; Test test(logStream); return 0; } where test.h contains: #include <fstream> #include <sstream> #include <boost/iostreams/stream.hpp> #include <boost/iostreams/tee.hpp> typedef boost::iostreams::tee_device<std::stringstream, std::ofstream> TeeDevice; typedef boost::iostreams::stream<TeeDevice> TeeStream; class Test { public: Test(const std::stringstream& logStream) { std::ofstream dummyFileHandle("/dev/null", std::ios_base::out | std::ios_base::app); std::stringstream logStream2; TeeDevice myTee (logStream2, dummyFileHandle); m_out.open(myTee); } virtual ~Test() { if(m_out.is_open()) { m_out.flush(); m_out.close(); } }; protected: TeeStream m_out; };

2 4

activating Boost Graph Library finish_edge
by Michael Behrns-Miller 25 Nov '13

25 Nov '13

Hello boost users. I'm using BGL, and was happy to see the addition of the finish_edge() visitor to DFS. I had previously added code to finish_vertex() to emulate this visitor, had to track vertices, not ideal. But when I add the template function to my Visitor class, the code is never hit. Specifically, I'm using Visual Studio 2013 and the compiler is telling me my debug breakpoint will never get hit in the function as the code did not make it into the executable. The visitor class is below, any thoughts on what I'm doing wrong? I took a look at undirected_dfs.hpp and it includes call_finish_edge() in the DFS algorithm in undir_dfv_impl(). Thanks, Michael class BaseVisitor : public boost::dfs_visitor<> { public: template <class E, class G> void examine_edge(E e, const G& g) { // gets hit... } template <class V, class G> void discover_vertex(V v, const G& g) { // gets hit... } template <class V, class G> void finish_vertex(V v, const G& g) { // gets hit... } template <class E, class G> void finish_edge(const E& e, const G& g) { // NOT built or hit... // Tried using [E e] param as well... } };

1 0

Peer Review Report for proposed Boost.TypeIndex v2.1 Nov 12th – 21st 2013
by Niall Douglas 24 Nov '13

24 Nov '13

Please let me know as soon as possible any errata, missing credits etc. Niall Boost Peer Review Report for proposed Boost.TypeIndex v2.1 Nov 12th – 21st 2013 This report is the first edition, dated Sunday 24th November 2013. The review manager was Niall Douglas http://www.nedprod.com/. Source: https://github.com/apolukhin/type_index/zipball/master Documentation: http://apolukhin.github.com/type_index/index.html Peer review discussion detail: http://boost.2283326.n4.nabble.com/TypeIndex-Peer-review-period-for-library… My thanks to the Boost members whose peer review makes up this report: Robert Ramey, Vicente J. Botet Escriba, Gavin Lambert, Andrey Semashev, Steven Watanabe, pfultz2, Mathieu Champlon, Joël Lamotte Klaim, Rob Stewart, Jan Herrmann, Tony Van Eerd. Contents: · Summary of consensus from peer review ......................................................................................................... 1 · My recommendation to the library author and the Review Wizards ................................................................ 3 Summary of consensus from peer review: The consensus feedback was to accept TypeIndex after substantial modifications. There were two recommendations of rejection due to how substantial such modifications would need to be (i.e. a request for a second round of peer review with a new implementation). Note that my personal opinion based on post-review reflection is written in [square bracketed italics]. · Many seemed to feel that a boost::type_info’s member function API, where identically named to that of std::type_info member function API, ought to have identical compile-time effects. This implied that missing member function APIs, or other compile time errors for missing or incomplete functionality, would be okay but if name() returns some const char *, then any const char * so long as it meets the C++ standard is okay. [I think there are three use cases for a type_info like substitute: (i) as a lightest possible weight, non-RTTI requiring minimal type_info which can have any API it likes and ought to not be directly substitutable for std::type_info or std::type_index (ii) as a compile-time substitute for std::type_info in that it will compile without third party code modification, but may not produce reliable code due to not returning exactly the same values as std::type_info (iii) as a runtime substitute for std::type_info in that it will require code to be “ported” to it due to having a breaking API, but thereafter produces reliable code. I’ll be very blunt in saying that (ii) is a bad idea in my opinion, and (iii) is valuable but out of scope enhancement which could be added as a separate class after peer review. In my opinion, (i) is where we ought to focus, and I would recommend that the lightest possible weight type_info replacement be deliberately compile-time incompatible with std::type_info (where output is not identical to std::type_info) to force porting code to it so authors are not lazy.] · A large minority seemed to feel that a boost::type_info’s member function API, where identically named to that of std::type_info member function API, ought to have identical run-time outcomes. Most specifically, this would mean that member functions e.g. name() would return exactly what std::type_info’s name() does, even if for example name() returns a std::string instead of a const char * as would be necessary in pre-C++11 compilers. [This is really use case (iii) in the previous item.] · It was mentioned that it should be possible to optionally specialise std::hash<> for type_info for optional seamless use in hash taking containers. · Some felt that implementation-specific std::type_info quirks ought to be replicated. Others felt they should not, and a portable interface which works identically on all platforms is preferred. [This is really use case (iii) in the previous item.] · boost::type_info is currently initialised via a static cast from a std::type_info when RTTI is available. This is undefined behaviour, and some felt this to be a showstopper. I (Niall Douglas) looked into this more deeply due to its seriousness, and found that because most STL implementations define std::type_info with a virtual function table, the undefined behaviour static cast would cause dynamic_cast on a boost::type_info instance to misoperate. [I believe the RTTI induced misoperation to indeed be a showstopper, and that this use of undefined behaviour to reduce code bloat is an unsafe optimisation. A much lighter weight non-direct-substitute for std::type_info ought to be as code bloat parsimonious as is possible, while its lack of non-explicit interoperation ability with std::type_info ought to allow avoidance of needing any UB tricks.] · Some felt that any use of implied boost::type_info ought to be explicitly written as boost::type_info instead of relying on namespace lookup, as the name similarity to std::type_info may introduce confusion. [I agree] · It was mentioned that some function-local static data members are initialised in a thread unsafe way. [For information I have to hand a very lightweight BOOST_BEGIN_MEMORY_TRANSACTION() implementation ideal for this purpose. We could submit it to Boost.Detail and then everyone could use it?] · Magic macros such as __PRETTY_FUNCTION__ ought to not be referenced outside of a function as they don’t technically exist there. Checks for their existence ought to be within a function. · It was requested that a boost::type_id<> which takes some unknown variable instance as a parameter and therefore allows the compiler to deduce the type of the variable as the boost::type_index<T> type would be valuable. · A mechanism for programming compile-time logic with class inheritance trees such that inheritance can be determined at compile-time with RTTI disabled was requested. My recommendation to the library author and the Review Wizards: · In my opinion Antony ought to make TypeIndex v3 quite literally a very lightweight container of some unknown, but known to be uniquely identifying for some type, static const char * string. I think its class type and its list of member functions ought to be deliberately compile-time incompatible with std::type_info to force authors to upgrade their code. A conversion member function ought to be able to synthesise a corresponding std::type_info using typeid() from some boost::type_index<T>, but that’s about it. I would even, personally speaking, go so far as to only provide a boost::type_index and no corresponding boost::type_info, especially if the boost::type_id<T>() function can return a const boost::type_index<T>& and therefore can be used as a static const lref, or copy constructed from it etc. A suggested name() member function replacement which correctly breaks out the multiple confounding uses of std::type_info::name() into each of their three use cases (and which intentionally causes any use of name() to fail to compile) might be: Text Box: /*! Returns a static const char string of unknown format uniquelyidentifying this type.The only guarantee is that this string will beunique to the type within this process lifetime. */const char *unique_name() const noexcept;/*! Returns a representation of this type suitable for printing.This call may take some time as its storage may not be cached. */std::string pretty_name() const;class enum mangling{Native, //!< Whatever the native mangling used by this toolset isMSVC, //!< The Microsoft C++ mangling formatItanium //!< The Itanium C++ mangling format};/*! Returns the mangled form of the string representation of the type.After the calculation the value is cached statically such that the c_str()function can be used to convert the returned string to a const char *format identical to what may be returned by std::type_info::name() (orraw_name() on MSVC).This function may throw an exception if it does notsupport mangled type string calculation, including when mangling=Native onsome Bear in mind that user code can always subclass boost::type_index and add their own name() implementation based on one or more of the above new member functions. · In other words, here I think “less is more” in every way you look at it. I think a slimmer less heavy TypeIndex would be a superior solution. · I request the Review Wizards to allow Antony some time to make the changes to produce a v3 of the library, and then to allow TypeIndex v3 a Fast Track Review of five days to ensure the Boost community is happy and that its feedback has been incorporated. It was asked during peer review that such a five day period please include a weekend. I would be happy to serve as review manager again if requested. Niall Douglas Waterloo, Canada, November 2013

1 0

[boost-TLS] Thread Local Storage (TLS) Question
by Kyle Ketterer 24 Nov '13

24 Nov '13

Hello, I am using multiple threads for I/O operations. The issue I am having is joining these threads on the main thread. It appears that calling join() on a thread with TLS pointers, it results in a hang. I have multiple thread specific pointers declared outside of the function and in the beginning of the method I call reset ( new std::string ) ....etc etc. I also am acquiring some resource handlers as Im using a boost::thread_specific_ptr < ifstream > infile So, when I create the thread in the main thread and join() it I get a hang. The only thing I can think of is that the handlers are not being released so join() waits indefinitely. I read in the documentation that the pointers should be cleaned up on thread exit - but the thread apparently never exits because then resources are not released? I understand that it may not be "conventional" to use a tls pointer for ifstream but I find it a lot better than locking with mutexes. Also, I'm not sure if there are limits as to how many TLS pointers you can actually use but I am currently using about 10 for one thread method. Another thing to note is that when calling detach() on the thread, all of the threads execute properly and I get expected output. However, I need to call join() every x amount of threads due to OS limitations of how many threads can actually be created. I need to read about 5000 files so obviously I can't create 5000 threads as Windows maxes out at 700 I believe. I am reading files off of a RAID setup so I believe this is a situation that can benefit from multiple threads reading files. Basically, I only want to create 4 threads at a time, then join() the previous 4, ensure that they have all completed successfully and continue to create more. Any suggestions or comments on this issue? Thanks -- Kyle Ketterer <reminisc3(a)gmail.com>

3 3

Boost 1.55 and ICL : Compile error
by Adam Baxter 24 Nov '13

24 Nov '13

Hello all, I'm getting a compile error under Boost 1.55 using ICL's Closed Interval include: In file included from /home/abaxter/Projects/Du/apollo/libapollo/src/theory.cpp:21:0: /home/abaxter/local/include/boost/icl/closed_interval.hpp: In constructor 'boost::icl::closed_interval<DomainT, Compare>::closed_interval()': /home/abaxter/local/include/boost/icl/closed_interval.hpp:35:31: error: 'DefaultConstructibleConcept' was not declared in this scope BOOST_CONCEPT_ASSERT((DefaultConstructibleConcept<DomainT>)); ^ /home/abaxter/local/include/boost/icl/closed_interval.hpp:35:66: error: expected primary-expression before '>' token BOOST_CONCEPT_ASSERT((DefaultConstructibleConcept<DomainT>)); ^ /home/abaxter/local/include/boost/icl/closed_interval.hpp:35:67: error: expected primary-expression before ')' token BOOST_CONCEPT_ASSERT((DefaultConstructibleConcept<DomainT>)); ^ /home/abaxter/local/include/boost/icl/closed_interval.hpp:35:68: error: there are no arguments to 'BOOST_CONCEPT_ASSERT' that depend on a template parameter, so a declaration of 'BOOST_CONCEPT_ASSERT' must be available [-fpermissive] BOOST_CONCEPT_ASSERT((DefaultConstructibleConcept<DomainT>)); ^ /home/abaxter/local/include/boost/icl/closed_interval.hpp:35:68: note: (if you use '-fpermissive', G++ will accept your code, but allowing the use of an undeclared name is deprecated) /home/abaxter/local/include/boost/icl/closed_interval.hpp:36:31: error: 'LessThanComparableConcept' was not declared in this scope BOOST_CONCEPT_ASSERT((LessThanComparableConcept<DomainT>)); ^ /home/abaxter/local/include/boost/icl/closed_interval.hpp:36:64: error: expected primary-expression before '>' token BOOST_CONCEPT_ASSERT((LessThanComparableConcept<DomainT>)); ^ /home/abaxter/local/include/boost/icl/closed_interval.hpp:36:65: error: expected primary-expression before ')' token BOOST_CONCEPT_ASSERT((LessThanComparableConcept<DomainT>)); ^ /home/abaxter/local/include/boost/icl/closed_interval.hpp:36:66: error: there are no arguments to 'BOOST_CONCEPT_ASSERT' that depend on a template parameter, so a declaration of 'BOOST_CONCEPT_ASSERT' must be available [-fpermissive] BOOST_CONCEPT_ASSERT((LessThanComparableConcept<DomainT>)); ^ /home/abaxter/local/include/boost/icl/closed_interval.hpp: In constructor 'boost::icl::closed_interval<DomainT, Compare>::closed_interval(const DomainT&)': /home/abaxter/local/include/boost/icl/closed_interval.hpp:46:31: error: 'DefaultConstructibleConcept' was not declared in this scope BOOST_CONCEPT_ASSERT((DefaultConstructibleConcept<DomainT>)); ^ /home/abaxter/local/include/boost/icl/closed_interval.hpp:46:66: error: expected primary-expression before '>' token BOOST_CONCEPT_ASSERT((DefaultConstructibleConcept<DomainT>)); ^ /home/abaxter/local/include/boost/icl/closed_interval.hpp:46:67: error: expected primary-expression before ')' token BOOST_CONCEPT_ASSERT((DefaultConstructibleConcept<DomainT>)); ^ /home/abaxter/local/include/boost/icl/closed_interval.hpp:46:68: error: there are no arguments to 'BOOST_CONCEPT_ASSERT' that depend on a template parameter, so a declaration of 'BOOST_CONCEPT_ASSERT' must be available [-fpermissive] BOOST_CONCEPT_ASSERT((DefaultConstructibleConcept<DomainT>)); ^ /home/abaxter/local/include/boost/icl/closed_interval.hpp:47:31: error: 'LessThanComparableConcept' was not declared in this scope BOOST_CONCEPT_ASSERT((LessThanComparableConcept<DomainT>)); ^ /home/abaxter/local/include/boost/icl/closed_interval.hpp:47:64: error: expected primary-expression before '>' token BOOST_CONCEPT_ASSERT((LessThanComparableConcept<DomainT>)); ^ /home/abaxter/local/include/boost/icl/closed_interval.hpp:47:65: error: expected primary-expression before ')' token BOOST_CONCEPT_ASSERT((LessThanComparableConcept<DomainT>)); ^ /home/abaxter/local/include/boost/icl/closed_interval.hpp:47:66: error: there are no arguments to 'BOOST_CONCEPT_ASSERT' that depend on a template parameter, so a declaration of 'BOOST_CONCEPT_ASSERT' must be available [-fpermissive] BOOST_CONCEPT_ASSERT((LessThanComparableConcept<DomainT>)); ^ /home/abaxter/local/include/boost/icl/closed_interval.hpp: In constructor 'boost::icl::closed_interval<DomainT, Compare>::closed_interval(const DomainT&, const DomainT&)': /home/abaxter/local/include/boost/icl/closed_interval.hpp:55:31: error: 'DefaultConstructibleConcept' was not declared in this scope BOOST_CONCEPT_ASSERT((DefaultConstructibleConcept<DomainT>)); ^ /home/abaxter/local/include/boost/icl/closed_interval.hpp:55:66: error: expected primary-expression before '>' token BOOST_CONCEPT_ASSERT((DefaultConstructibleConcept<DomainT>)); ^ /home/abaxter/local/include/boost/icl/closed_interval.hpp:55:67: error: expected primary-expression before ')' token BOOST_CONCEPT_ASSERT((DefaultConstructibleConcept<DomainT>)); ^ /home/abaxter/local/include/boost/icl/closed_interval.hpp:55:68: error: there are no arguments to 'BOOST_CONCEPT_ASSERT' that depend on a template parameter, so a declaration of 'BOOST_CONCEPT_ASSERT' must be available [-fpermissive] BOOST_CONCEPT_ASSERT((DefaultConstructibleConcept<DomainT>)); ^ /home/abaxter/local/include/boost/icl/closed_interval.hpp:56:31: error: 'LessThanComparableConcept' was not declared in this scope BOOST_CONCEPT_ASSERT((LessThanComparableConcept<DomainT>)); ^ /home/abaxter/local/include/boost/icl/closed_interval.hpp:56:64: error: expected primary-expression before '>' token BOOST_CONCEPT_ASSERT((LessThanComparableConcept<DomainT>)); ^ /home/abaxter/local/include/boost/icl/closed_interval.hpp:56:65: error: expected primary-expression before ')' token BOOST_CONCEPT_ASSERT((LessThanComparableConcept<DomainT>)); ^ /home/abaxter/local/include/boost/icl/closed_interval.hpp:56:66: error: there are no arguments to 'BOOST_CONCEPT_ASSERT' that depend on a template parameter, so a declaration of 'BOOST_CONCEPT_ASSERT' must be available [-fpermissive] BOOST_CONCEPT_ASSERT((LessThanComparableConcept<DomainT>)); ^ make[2]: *** [libapollo/src/CMakeFiles/libapollo.dir/theory.cpp.o] Error 1 make[1]: *** [libapollo/src/CMakeFiles/libapollo.dir/all] Error 2 make: *** [all] Error 2 15:18:23: The process "/usr/bin/make" exited with code 2. Any ideas? Adam

1 0

[Thread] TLS / locking ?
by beet 24 Nov '13

24 Nov '13

Hi there, I have a number of threads and, within the context of each thread, a large number of objects may be active. I would now like to provide all objects accessed by a thread with a common random number generator. i.e., there would be as many random number generators as there are threads, and all objects active inside of a given thread would access the same generator, but objects in different threads use different generators. The obvious approach would be to store the generator in thread-local storage. I am concerned, however, about the performance implications. In particular, does access to thread-local storage implicitly involve locking of sorts? If so, the (very) frequent access to the random number generator would effectively serialize my application. Thanks and Best Regards, Beet

3 3

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

Issue with compilation using XCode 4.6/GCC
by Tim Burgess 18 Nov '13

18 Nov '13

Hi, I have a project for Windows/Mac that builds fine using VS2010, but generates errors when I build using Xcode 4.6 with the GCC compiler (required, as this project also uses wxWidgets). All of my modules compile cleanly, but I get the following "orphaned" error output that doesn't seem to belong to any module: SurfaceReader Group /users/tim/developer/libraries/boost_1_54_0/boost/type_traits/decay.hpp /users/tim/developer/libraries/boost_1_54_0/boost/type_traits/decay.hpp:28: '<anonymous enum>' is/uses anonymous type /users/tim/developer/libraries/boost_1_54_0/boost/type_traits/decay.hpp:28: Trying to instantiate 'template<class T> struct boost::remove_reference' /users/tim/developer/libraries/boost_1_54_0/boost/type_traits/decay.hpp:38: '<anonymous enum>' is/uses anonymous type /users/tim/developer/libraries/boost_1_54_0/boost/type_traits/decay.hpp:38: Trying to instantiate 'template<class T> struct boost::remove_reference' I realise that I haven't provided the command that Xcode is using to build the project - this isn't deliberate, but I can't seem to locate where Xcode provides this on-screen using the VoiceOver accessibility tool (I'm a totally blind developer). Can anybody offer any advice regarding decay.hpp errors (I'm not including it directly in any of my modules), or can direct to me to where I might find a log that would provide more detail as to the compilation options that Xcode is using (i.e. its GCC-equivalent command line)? Many thanks in advance. Best wishes. Tim Burgess

1 1

Can gil library in boost 1.49 load png palette images?
by Guangchao Wang 18 Nov '13

18 Nov '13

I'm tried to load a png which can be found in the attachment, I find the color of this png is PNG_COLOR_TYPE_PALETTE and its depth is 8, I reviewed the code of png_io_private.hpp and found that no such type of PNG is supported. Can you give me some help about how to load such PNG with boost.gil library? Thank you very much. Best, Guangchao

4 6

Did build of Boost succeed - lib vs. stage/lib?
by Lutz Gehlen 17 Nov '13

17 Nov '13

Hello all, I am trying to build the Boost libraries version 1.55.0 with Visual Studio 2010 Express under Windows XP. Following the instructions in the documentation, I have unpacked the source code distribution, opened a Visual Studio command line window, and executed bootstrap .\b2 I haven't noticed any errors, and I was told in the end that I had successfully built the Boost libraries. So far, so good. I then tried to build the example program in section 6 of the Getting started guide. Section 6.1 instructs to add "C:\Program Files\boost\boost_1_55_0\lib" (in my case E:\boost_1_55_0\lib) to the list of Additional Library Directories. However, I do not have a lib directory in E:\boost_1_55_0?! I tried to build the example program and then searched for the library file libboost_regex-vc100-mt-gd-1_55.lib that Visual Studio was failing to find. I found it in E:\boost_1_55_0\stage\lib instead of E:\boost_1_55_0\lib. Adding this directory to the list of Additional Library Directories allowed me to build and execute the example program successfully. However, I am wondering now whether my build worked correctly or not. I am trying to avoid running into subtle and hard to debug problems later. Does anyone know if or what went wrong with my build? What is the stage directory and is it safe to use it? Thank you very much for your help and best wishes Lutz

2 2

the link to the documentation for "explicit bool operator" is broken
by Adam Romanek 17 Nov '13

17 Nov '13

Dear Boosters, I've just discovered that there's a broken link to the documentation of "explicit bool operator" macro on http://www.boost.org/doc/libs/1_55_0/libs/utility/index.html WBR, Adam Romanek

2 1

Can I return std::unique_ptr in a boost::future?
by Aaron_Wright＠selinc.com 15 Nov '13

15 Nov '13

I'm trying to return a std::unique_ptr in a boost::future. I can't get it to compile. Is it possible? The code wraps a packaged_task in a functor to make it copyable enough to pass to a boost::asio::io_service, where the work will be done in another thread. The code works for other return types that are copyable. This is what I have for a small test case: std::unique_ptr< int > get_int_impl(int i) { return std::unique_ptr< int >(new int(i)); } std::unique_ptr< int > get_int(int i) { typedef boost::packaged_task< std::unique_ptr< int > > Task; boost::shared_ptr< Task > task = boost::make_shared< Task >(boost::bind(&get_int_impl, 42)); boost::unique_future< std::unique_ptr< int > > future = task->get_future(); // <--- Error from this line. m_service.post(boost::bind(&Task::operator(), task)); return future.get(); } BOOST_AUTO_TEST_CASE(test_get_int) { BOOST_CHECK_EQUAL(*get_int(42), 42); } The error: boost/thread/future.hpp(239): error C2248: 'std::unique_ptr<_Ty>::unique_ptr' : cannot access private member declared in class 'std::unique_ptr<_Ty>' --- Aaron Wright

4 6

Re: [Boost-users] [Math] BOOST_FPU_EXCEPTION_GUARD on Linux
by David Roberts 15 Nov '13

15 Nov '13

> As I recall this was a hardware issue on early AMD 64-bit CPU's, possibly a > GLIBC issue too. In fact if I recall it was this issue: > http://sourceware.org/bugzilla/show_bug.cgi?id=2445 which didn't get much > help from the glibc guys > > But basically if any of the FPU exception flags are set prior to a call to > pow or exp, you risk getting a garbage answer back. I'll add a link to the > above in the code. > > HTH, John. That Bugzilla link was extremely helpful - thanks! I've done a bit more research and I'm pretty sure this WAS a bug in glibc. It's fixed on recent versions of Linux though. Taking your test program from http://sourceware.org/bugzilla/show_bug.cgi?id=2445 and trying it on some different Linux versions and CPUs resulted in this: SLES 10: kernel 2.6.16.21-0.8-smp glibc 2.4 g++ 4.1.0 CPU Xeon E5-2630 FAILS CentOS 6.2: kernel 2.6.32-220.el6.x86_64 glibc 2.12 g++ 4.4.6 CPU Xeon X3450 FAILS Amazon Linux 2013.03: kernel 3.4.57-48.42.amzn1.x86_64 glibc 2.12 g++ 4.6.3 CPU Xeon E5507 FAILS OpenSuSE 12.1: kernel 3.1.10-1.16-ec2 glibc 2.14.1 g++ 4.6.2 CPU Xeon E5-2650 WORKS OpenSuSE 12.2: kernel 3.4.6-2.10-ec2 glibc 2.15 g++ 4.7.1 CPU Xeon E5-2650 WORKS Fedora 20 beta: kernel 3.11.6-300.fc20.x86_64 glibc 2.18 g++ 4.8.2 CPU Xeon E5645 WORKS This shows that the problem definitely occurs on Intel CPUs as well as AMD, and is much more likely to be caused by glibc than the compiler or the kernel. The most likely change to the glibc code that fixed the problem is this one from May 2011: http://repo.or.cz/w/glibc.git/commitdiff/8db736347c7aca3201f61e3f05b5f672bc… There was a place in powl() where 4500 decimal was used instead of 0x4500 hex. 4500 decimal is 0x1194 hex. This number was then tested against the floating point status word. The exception flags are in the low byte of this word (see http://www.nacad.ufrj.br/online/intel/Documentation/en_US/compiler_f/main_f… for the values) and as a result of the typo the presence of either FE_UNDERFLOW = 0x10 or FE_DIVBYZERO = 0x4 will cause the test to pass unintentionally. More experiments with your test program on CentOS 6.2 (glibc 2.12) seem to confirm this - if only the flags FE_INEXACT, FE_OVERFLOW and/or FE_INVALID are set they DON'T cause the weird result to occur. Given the bug was in the x86_64-specific powl() implementation and it seems to be fixed in glibc version 2.14, I think you could get away with tightening up the criteria on your guard from: #if ((defined(__linux__) && !defined(__UCLIBC__)) || defined(__QNX__) || defined(__IBMCPP__)) && !defined(BOOST_NO_FENV_H) to: #if ((defined(__linux__) && defined(__x86_64__) && !defined(__UCLIBC__) && (!defined(__GLIBC_PREREQ) || !__GLIBC_PREREQ(2,14))) || defined(__QNX__) || defined(__IBMCPP__)) && !defined(BOOST_NO_FENV_H) That still doesn't help people like me who have to work on current 64 bit enterprise Linux releases, but for the benefit of anyone else who stumbles across this having suffered the same performance problem, here's a hack that works OK if neither your code nor any other 3rd party library you're using cares about the floating point flags. In boost/math/tools/config.hpp change: struct fpu_guard { fpu_guard() { fegetexceptflag(&m_flags, FE_ALL_EXCEPT); feclearexcept(FE_ALL_EXCEPT); } ~fpu_guard() { fesetexceptflag(&m_flags, FE_ALL_EXCEPT); } private: fexcept_t m_flags; }; to: struct fpu_guard { fpu_guard() { if (fetestexcept(FE_UNDERFLOW | FE_DIVBYZERO) != 0) { feclearexcept(FE_ALL_EXCEPT); } } }; This is beneficial for performance because the expensive calls are feclearexcept() and fesetexceptflag(). The (more-or-less identical on Linux) fegetexceptflag() and fetestexcept() functions are much quicker. Not bothering to reset the cleared flags saves one expensive call - obviously this relies on nothing downstream caring about them. Only clearing the flags if one of the problematic ones is set often avoids the other expensive call. I've noticed that the FE_INEXACT flag is almost always set if you do any serious floating point calculation, but the other 4 flags are set much less frequently. I'm not suggesting that you put this hack into the official Boost codeline, but just thought it might be useful to anyone in my situation who finds this post via a search engine.

2 1

concept_check() fails for types from unnamed namespace on gcc 4.2.3
by Adam Romanek 15 Nov '13

15 Nov '13

Dear Boosters! I have a problem compiling some source code that uses Boost 1.54 and gcc 4.2.3 (it's a toolchain for a MIPS platform but that's irrelevant). Basically there is a problem with checking concepts on types that come from unnamed namespaces. See the attached code example and compiler error message. Note that the same code compiles without any problems on gcc 4.6.3. I've found a question on boost-dev list [1] and a ticket [2] related to this particular issue. Note that the ticket was closed with "worksforme" resolution, which I don't understand - the problem is still out there. Now since Boost's minimal requirements are gcc 3.3 [3] then should I consider it a bug that I should report or is it a known issue? In case the latter is true then what should I do? [1] http://boost.2283326.n4.nabble.com/concept-check-fails-with-types-declared-… [2] https://svn.boost.org/trac/boost/ticket/2037 [3] http://www.boost.org/users/history/version_1_55_0.html WBR, Adam Romanek

1 0

Can gil library in boost 1.49 load png palette images?
by Guangchao Wang 15 Nov '13

15 Nov '13

I'm tried to load a png which can be fund in the attachment, I find the color of this png is PNG_COLOR_TYPE_PALETTE and its depth is 8, I reviewed the code of png_io_private.hpp and found that no such type of PNG is supported. Can you give me some help about how to load such PNG with boost.gil library? Thank you very much. Best, Guangchao

1 0

boost::serialization warnings for template class
by Michele Vallisneri 15 Nov '13

15 Nov '13

Dear Boost experts, I'm serializing (intrusively) a template class Matrix<T> that includes a double-pointer buffer of data of type T. So my save/load pair looks like template<class Archive> void save(Archive & ar, const unsigned int version) const { ar & row_dim; ar & col_dim; for ( size_t i = 0; i < row_dim; i++ ) for ( size_t j = 0; j < col_dim; j++ ) { ar & value[i][j]; } } template<class Archive> void load(Archive & ar, const unsigned int version) { size_t rowdim, coldim; ar & rowdim; ar & coldim; resize( rowdim, coldim ); for ( size_t i = 0; i < rowdim; i++ ) for ( size_t j = 0; j < coldim; j++ ) ar & value[i][j]; } The type of value is T**. The serialization works OK, but I'm getting some warnings that lead me to suspect that Boost is trying to track the addresses of the value[i][j] elements, which is not needed, and presumably a problem for performance. g++ -c -m64 -O3 -Wall -I../../include -I/usr/depot/redhatel5_64/boost/1.48.0/include -o Linux-x86_64/obj/test_Matrix.o test_Matrix.cpp /usr/depot/redhatel5_64/boost/1.48.0/include/boost/mpl/print.hpp: In instantiation of 'boost::mpl::print<boost::serialization::BOOST_SERIALIZATION_STATIC_WARNING_LINE<98> >': /usr/depot/redhatel5_64/boost/1.48.0/include/boost/serialization/static_warning.hpp:92: instantiated from 'boost::serialization::static_warning_test<false, 98>' /usr/depot/redhatel5_64/boost/1.48.0/include/boost/archive/detail/check.hpp:98: instantiated from 'void boost::archive::detail::check_object_tracking() [with T = gcore::Matrix<int>]' /usr/depot/redhatel5_64/boost/1.48.0/include/boost/archive/detail/oserializer.hpp:313: instantiated from 'static void boost::archive::detail::save_non_pointer_type<Archive>::invoke(Archive&, T&) [with T = gcore::Matrix<int>, Archive = boost::archive::text_oarchive]' /usr/depot/redhatel5_64/boost/1.48.0/include/boost/archive/detail/oserializer.hpp:525: instantiated from 'void boost::archive::save(Archive&, T&) [with Archive = boost::archive::text_oarchive, T = gcore::Matrix<int>]' /usr/depot/redhatel5_64/boost/1.48.0/include/boost/archive/detail/common_oarchive.hpp:69: instantiated from 'void boost::archive::detail::common_oarchive<Archive>::save_override(T&, int) [with T = gcore::Matrix<int>, Archive = boost::archive::text_oarchive]' /usr/depot/redhatel5_64/boost/1.48.0/include/boost/archive/basic_text_oarchive.hpp:80: instantiated from 'void boost::archive::basic_text_oarchive<Archive>::save_override(T&, int) [with T = gcore::Matrix<int>, Archive = boost::archive::text_oarchive]' /usr/depot/redhatel5_64/boost/1.48.0/include/boost/archive/detail/interface_oarchive.hpp:63: instantiated from 'Archive& boost::archive::detail::interface_oarchive<Archive>::operator<<(T&) [with T = gcore::Matrix<int>, Archive = boost::archive::text_oarchive]' test_Matrix.cpp:43: instantiated from here /usr/depot/redhatel5_64/boost/1.48.0/include/boost/mpl/print.hpp:55: warning: comparison between signed and unsigned integer expressions Is my suspicion correct, and how do I change my code to avoid the warnings (and performance hits, if any)? Thanks! Michele

1 0

Boost 1.55 and warning in Boost.Circular
by gast128 14 Nov '13

14 Nov '13

Hello all, I just dl 1.55 and I got a warning: D:\Develop\SDK and Libraries\boost_1_55_0\boost/circular_buffer/base.hpp(199): warning C4172: returning address of local variable or temporary Code is crytpic due to all the templates. Is this a client error?

1 2