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

Cannot use Boost.Croutines with range based for
by Mueller-Roemer, Johannes Sebastian 29 Aug '14

29 Aug '14

Hi, I am (again) having issues with the Boost.Coroutines library. Aside from yet another new API, the coroutines no longer work with range based for. Even though the examples include range based for! With the following code (taken directly from the documentation and added the includes and main): #include <boost/coroutine/asymmetric_coroutine.hpp> #include <iostream> int main() { boost::coroutines::asymmetric_coroutine<int>::pull_type source( [&](boost::coroutines::asymmetric_coroutine<int>::push_type& sink){ int first=1, second=1; sink(first); sink(second); for(int i=0;i<8;++i){ int third=first+second; first=second; second=third; sink(third); } } ); for(auto i : source) std::cout << i << " "; } I get this error: D:\projects\combinators\coro_test.cpp: In function 'int main()': D:\projects\combinators\coro_test.cpp:20:15: error: 'begin' was not declared in this scope for(auto i : source) ^ D:\projects\combinators\coro_test.cpp:20:15: note: suggested alternatives: In file included from D:\projects\combinators\coro_test.cpp:1:0: D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/coroutine/asymmetric_coroutine.hpp:2255:1: note: 'std::begin' begin( boost::coroutines::push_coroutine< R > & c) ^ In file included from D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range/functions.hpp:18:0, from D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range.hpp:18, from D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/coroutine/asymmetric_coroutine.hpp:17, from D:\projects\combinators\coro_test.cpp:1: D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range/begin.hpp:106:61: note: 'boost::range_adl_barrier::begin' inline BOOST_DEDUCED_TYPENAME range_iterator<const T>::type begin( const T& r ) ^ D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range/begin.hpp:106:61: note: 'boost::range_adl_barrier::begin' D:\projects\combinators\coro_test.cpp:20:15: error: 'end' was not declared in this scope for(auto i : source) ^ D:\projects\combinators\coro_test.cpp:20:15: note: suggested alternatives: In file included from D:\projects\combinators\coro_test.cpp:1:0: D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/coroutine/asymmetric_coroutine.hpp:2260:1: note: 'std::end' end( boost::coroutines::push_coroutine< R > & c) ^ In file included from D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range/functions.hpp:19:0, from D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range.hpp:18, from D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/coroutine/asymmetric_coroutine.hpp:17, from D:\projects\combinators\coro_test.cpp:1: D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range/end.hpp:100:61: note: 'boost::range_adl_barrier::end' inline BOOST_DEDUCED_TYPENAME range_iterator<const T>::type end( const T& r ) ^ D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range/end.hpp:100:61: note: 'boost::range_adl_barrier::end' mingw32-make[2]: *** [CMakeFiles/coro-test.dir/coro_test.cpp.obj] Error 1 mingw32-make[1]: *** [CMakeFiles/coro-test.dir/all] Error 2 mingw32-make: *** [all] Error 2 For completeness sake: I am using MinGW-w64 with GCC 4.9.1 and the -std=c++11 flag Regards, Johannes S. Mueller-Roemer -- Johannes S. Mueller-Roemer, MSc Wiss. Mitarbeiter - Interactive Engineering Technologies (IET) Fraunhofer-Institut für Graphische Datenverarbeitung IGD Fraunhoferstr. 5 | 64283 Darmstadt | Germany Tel +49 6151 155-606 | Fax +49 6151 155-139 johannes.mueller-roemer(a)igd.fraunhofer.de | www.igd.fraunhofer.de

5 20

[filesystem] : How to get a parametrized basic_string from filesystem::path
by Vincent R. 28 Aug '14

28 Aug '14

Hi, I am trying to modify an existing code to keep the possibility to use string or wstring, so I have changed the definition to parametrize it as shown below (Path inherits from path): template <class TChar> bool GetFileList(const std::basic_string<TChar>& i_strBaseDir, std::vector<std::basic_string<TChar> >& o_FileList) { boost::system::error_code ec; Path thePath(i_strBaseDir); boost::filesystem::directory_iterator iter(thePath, ec); if (! ec) { boost::filesystem::directory_iterator iter_end; for (; iter != iter_end; ++ iter) { boost::system::error_code ec; // This is to avoid an exception in case of any error if(!boost::filesystem::is_directory(iter->path(), ec)) //find file and not directory { std::basic_string<TChar> strFile = iter->path().????); // HOW TO DO IT o_FileList.push_back(strFile); } } } return (o_FileList.size() != 0); } My problem is with the following line : std::basic_string<TChar> strFile = iter->path().??????; I have solved like that (without testing it) : template <typename CharT, typename T> std::basic_string<CharT> string_cast(const T& r) { std::basic_ostringstream<CharT> stream; stream.imbue(std::locale::classic()); stream << r; return stream.str(); } std::basic_string<TChar> strFile = string_cast<TChar>(iter->path()); but since it uses some stream we might loose some performance. I have found another string_cast here : http://codereview.stackexchange.com/questions/1205/c-string-cast-template-f… that might be better in terms of performance. Do you have some other suggestion ? Wouldn't be interesting to add a boost::string_cast that would allow to convert from templated methods from/to string/wstring ? Thanks

1 0

[graph] Unique vertices using setS
by Nicholas Dahm 27 Aug '14

27 Aug '14

Hi All, I'm trying to create a graph with unique vertices using setS for vertices, but it doesn't seem to be working. To test it I've made a simple example simply using int's for the vertex properties: typedef boost::adjacency_list<boost::setS, boost::setS, boost::undirectedS, int, int> gtype; typedef boost::graph_traits<gtype>::vertex_descriptor gvd; gtype gr; int v1 = 4; gvd vd1 = add_vertex(v1, gr); gvd vd2 = add_vertex(v1, gr); printf("vd1: %ld, gr[vd1]: %d\n", vd1, gr[vd1]); printf("vd2: %ld, gr[vd2]: %d\n", vd2, gr[vd2]); printf("num_vertices: %d\n", num_vertices(gr)); Output: vd1: 17473168, gr[vd1]: 4 vd2: 17473248, gr[vd2]: 4 num_vertices: 2 So my graph has two vertices represented by the int 4, suggesting it's not a set! Any idea what I'm missing? Is the set for vertex descriptors, but the vertices themselves stored elsewhere? cheers Nick

1 1

Re: [Boost-users] [graph] Unique vertices using setS
by Jeremiah Willcock 27 Aug '14

27 Aug '14

On Wed, Aug 27, 2014 2:47 AM EDT Nicholas Dahm wrote: >Hi All, > >I'm trying to create a graph with unique vertices using setS for vertices, but it doesn't seem to be working. > >To test it I've made a simple example simply using int's for the vertex properties: > > typedef boost::adjacency_list<boost::setS, boost::setS, boost::undirectedS, int, int> gtype; > typedef boost::graph_traits<gtype>::vertex_descriptor gvd; > > gtype gr; > int v1 = 4; > gvd vd1 = add_vertex(v1, gr); > gvd vd2 = add_vertex(v1, gr); > printf("vd1: %ld, gr[vd1]: %d\n", vd1, gr[vd1]); > printf("vd2: %ld, gr[vd2]: %d\n", vd2, gr[vd2]); > printf("num_vertices: %d\n", num_vertices(gr)); > >Output: > > vd1: 17473168, gr[vd1]: 4 > vd2: 17473248, gr[vd2]: 4 > num_vertices: 2 > >So my graph has two vertices represented by the int 4, suggesting it's not a set! Any idea what I'm missing? Is the set for vertex descriptors, but the vertices themselves stored elsewhere? There is a difference between vertex descriptors and properties. There are no requirements that property values are unique for any graph type; those are up to you to set however you want. If gr[vd1] and gr[vd2] had the same address, that would be a problem. However, you initialized both of those property slots with the same value 4, and the graph type has no issue with you doing that. One reason for this is that the same graph can have multiple vertex and edge properties, and so you might want some of them to be unique and some not, so the graph type would not know where to enforce uniqueness. -- Jeremiah Willcock > >cheers > >Nick >_______________________________________________ >Boost-users mailing list >Boost-users(a)lists.boost.org >http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

[geometry] Buffer (with strategy) to offset polygons
by Olivier Tournaire 27 Aug '14

27 Aug '14

Dear all, I have used successfully the buffering algorithm to offset a shapefile of 2D polygons. However, there are 4 polygons (amongst nearly 4000) in my SHP does are not successfully processed. They do not have topology or orientation errors. I use GDAL 1.9 to read the SHP, boost 1.56 precompiled binaries from sourceforge on a 64bit windows 7. If someone is willing to have a look at the problem, I can share the files and the code I use. Here is a quick overview: typedef double coordinate_type; typedef boost::geometry::model::d2::point_xy<coordinate_type> point_xy_type; typedef boost::geometry::model::polygon<point_xy_type> polygon_type; boost::geometry::strategy::buffer::end_flat end_strategy; boost::geometry::strategy::buffer::point_square point_strategy; boost::geometry::strategy::buffer::side_straight side_strategy; boost::geometry::strategy::buffer::distance_symmetric<coordinate_type> distance_strategy(buffer_distance); boost::geometry::strategy::buffer::join_miter join_strategy(buffer_distance); polygon_type p; boost::geometry::model::multi_polygon<polygon_type> result; // Build a polygon_type from OGRPolygon OGRLinearRing* exteriorRing = polygon->getExteriorRing(); for(int i=0;i<exteriorRing->getNumPoints();++i) { OGRPoint pt; exteriorRing->getPoint(i,&pt); p.outer().push_back( point_xy_type(pt.getX(), pt.getY()) ); } for(int i=0;i<polygon->getNumInteriorRings();++i) { OGRLinearRing* interiorRing = polygon->getInteriorRing(i); polygon_type::ring_type ring; for(int j=0;j<interiorRing->getNumPoints();++j) { OGRPoint pt; interiorRing->getPoint(j,&pt); ring.push_back( point_xy_type(pt.getX(), pt.getY()) ); } p.inners().push_back(ring); } boost::geometry::buffer(p, result, distance_strategy, side_strategy, join_strategy, end_strategy, point_strategy); if(result.size() == 0) { int indexID = feature->GetFieldIndex("ID"); cout << "No result build for polygon with ID " << feature->GetFieldAsString(indexID) << endl; } else { typedef boost::geometry::strategy::distance::pythagoras<coordinate_type> pythagoras_distance_strategy; typedef boost::geometry::strategy::distance::projected_point<coordinate_type, pythagoras_distance_strategy> projected_point_strategy; boost::geometry::strategy::simplify::douglas_peucker<point_xy_type, projected_point_strategy> dp; OGRPolygon poly; for(size_t i=0;i<result.size();++i) { polygon_type result_i = result[i]; polygon_type result_i_simplified; boost::geometry::simplify(result_i, result_i_simplified, 0.1, dp); { OGRLinearRing ring; for(size_t j=0;j<result_i_simplified.outer().size();++j) ring.addPoint( result_i_simplified.outer()[j].x(), result_i_simplified.outer()[j].y() ); poly.addRing(&ring); } { OGRLinearRing ring; for(size_t j=0;j<result_i_simplified.inners().size();++j) { for(size_t k=0;k<result_i_simplified.inners()[j].size();++k) { ring.addPoint( result_i_simplified.inners()[j][k].x(), result_i_simplified.inners()[j][k].y() ); } poly.addRing(&ring); } } } Note that I use a simplification algorithm after buffering to remove colinear points. Hope you could help. Best regards, Olivier

3 9

Re: [Boost-users] Cannot use Boost.Croutines with range based for
by Mueller-Roemer, Johannes Sebastian 27 Aug '14

27 Aug '14

Adding the following namespace boost { namespace coroutines { using boost::begin; using boost::end; } } solves the problem, however this would seem to indicate that the provided begin and end are in the wrong namespace and therefore do not take part in ADL. Should I report this as a bug? Doesn't seem to be intended. -- Johannes S. Mueller-Roemer, MSc Wiss. Mitarbeiter - Interactive Engineering Technologies (IET) Fraunhofer-Institut für Graphische Datenverarbeitung IGD Fraunhoferstr. 5 | 64283 Darmstadt | Germany Tel +49 6151 155-606 | Fax +49 6151 155-139 johannes.mueller-roemer(a)igd.fraunhofer.de | www.igd.fraunhofer.de From: Mueller-Roemer, Johannes Sebastian Sent: Wednesday, August 27, 2014 12:57 To: 'boost-users(a)lists.boost.org' Subject: Cannot use Boost.Croutines with range based for Hi, I am (again) having issues with the Boost.Coroutines library. Aside from yet another new API, the coroutines no longer work with range based for. Even though the examples include range based for! With the following code (taken directly from the documentation and added the includes and main): #include <boost/coroutine/asymmetric_coroutine.hpp> #include <iostream> int main() { boost::coroutines::asymmetric_coroutine<int>::pull_type source( [&](boost::coroutines::asymmetric_coroutine<int>::push_type& sink){ int first=1, second=1; sink(first); sink(second); for(int i=0;i<8;++i){ int third=first+second; first=second; second=third; sink(third); } } ); for(auto i : source) std::cout << i << " "; } I get this error: D:\projects\combinators\coro_test.cpp: In function 'int main()': D:\projects\combinators\coro_test.cpp:20:15: error: 'begin' was not declared in this scope for(auto i : source) ^ D:\projects\combinators\coro_test.cpp:20:15: note: suggested alternatives: In file included from D:\projects\combinators\coro_test.cpp:1:0: D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/coroutine/asymmetric_coroutine.hpp:2255:1: note: 'std::begin' begin( boost::coroutines::push_coroutine< R > & c) ^ In file included from D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range/functions.hpp:18:0, from D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range.hpp:18, from D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/coroutine/asymmetric_coroutine.hpp:17, from D:\projects\combinators\coro_test.cpp:1: D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range/begin.hpp:106:61: note: 'boost::range_adl_barrier::begin' inline BOOST_DEDUCED_TYPENAME range_iterator<const T>::type begin( const T& r ) ^ D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range/begin.hpp:106:61: note: 'boost::range_adl_barrier::begin' D:\projects\combinators\coro_test.cpp:20:15: error: 'end' was not declared in this scope for(auto i : source) ^ D:\projects\combinators\coro_test.cpp:20:15: note: suggested alternatives: In file included from D:\projects\combinators\coro_test.cpp:1:0: D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/coroutine/asymmetric_coroutine.hpp:2260:1: note: 'std::end' end( boost::coroutines::push_coroutine< R > & c) ^ In file included from D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range/functions.hpp:19:0, from D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range.hpp:18, from D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/coroutine/asymmetric_coroutine.hpp:17, from D:\projects\combinators\coro_test.cpp:1: D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range/end.hpp:100:61: note: 'boost::range_adl_barrier::end' inline BOOST_DEDUCED_TYPENAME range_iterator<const T>::type end( const T& r ) ^ D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range/end.hpp:100:61: note: 'boost::range_adl_barrier::end' mingw32-make[2]: *** [CMakeFiles/coro-test.dir/coro_test.cpp.obj] Error 1 mingw32-make[1]: *** [CMakeFiles/coro-test.dir/all] Error 2 mingw32-make: *** [all] Error 2 For completeness sake: I am using MinGW-w64 with GCC 4.9.1 and the -std=c++11 flag Regards, Johannes S. Mueller-Roemer -- Johannes S. Mueller-Roemer, MSc Wiss. Mitarbeiter - Interactive Engineering Technologies (IET) Fraunhofer-Institut für Graphische Datenverarbeitung IGD Fraunhoferstr. 5 | 64283 Darmstadt | Germany Tel +49 6151 155-606 | Fax +49 6151 155-139 johannes.mueller-roemer(a)igd.fraunhofer.de<mailto:johannes.mueller-roemer@igd.fraunhofer.de> | www.igd.fraunhofer.de<http://www.igd.fraunhofer.de>

1 0

[Smart Pointer] Reference counting when you don't want to manage memory [Honeywell Internal]
by Hickman, Steve (AdvTech) 26 Aug '14

26 Aug '14

Classification: Honeywell Internal Smart pointers (as in http://www.boost.org/doc/libs/1_56_0/libs/smart_ptr/smart_ptr.htm ) assume that the action you want to perform when the count goes to zero is to free the memory pointed to. That isn't the only use for reference counting. Why doesn't the Smart Pointer library decouple the reference counting from the action to be taken and provide a generic reference counting mechanism that will call an arbitrary function when the count goes to zero? The default can be "delete" to provide the expected memory management capability but it would provide a robust mechanism for those who need other capabilities. Reviewing the <boost/shared_ptr.hpp> code, it appears this decoupling already exists - through the use of boost::checked_delete and boost::checked_deleter (<boost/checked_delete.hpp>). It just doesn't appear to be documented. Why not document this so others know how to use it? Steve Hickman System Architect, Flight Deck of the Future 480-236-8367 ============================================================================================================================================================================================================ This message classified as Honeywell Internal by Hickman, Steve (AdvTech) on Tuesday, August 26, 2014 at 12:35:32 PM. The above classification labels are in accordance with the Honeywell Corporate Classification Policy. The information contained in this electronic message is confidential and intended only for the use of the individual/entity named above, and the information may be privileged. If you, the reader of this message, are not the intended recipient or an employee or agent responsible to deliver this message to the intended recipient, you are hereby notified that any dissemination, distribution or copying of this communication is strictly prohibited. If you have received this communication in error, please immediately notify the sender and delete the original message. ============================================================================================================================================================================================================

3 3

Multi-Index: custom iterator
by Sensei 26 Aug '14

26 Aug '14

Dear all, I'm not yet satisfied with my MultiIndex games, so now I am trying to do something that is purely cosmetic. However, I have *no idea* how I can do this. How can I build a custom iterator on a MultiIndex? The objective is simple. As you may recall, I am building a MultiIndex with 128 bits, indexing them by MSB, LSB, and HSB (in the middle). It works like a charm. Now I'd like to write something like this (or similar): auto it = storage.myfind<byMSB>(MSB(value128bits)); for (; i != it.end(); i++) In essence, I'd like to hide the get<> and everything I am using right now (as shown below). So I need an iterator for this data structure: typedef __uint128_t Storage; // Indexing placeholders struct byMSB { }; struct byHSB { }; struct byLSB { }; // Storage type with indexing typedef boost::multi_index::multi_index_container< Storage, boost::multi_index::indexed_by< // Hashed by subject/predicate/object boost::multi_index::hashed_non_unique<boost::multi_index::tag<byMSB>, boost::multi_index::global_fun<Storage, soSub, &Data::msb>>, // 0 boost::multi_index::hashed_non_unique<boost::multi_index::tag<byHSB>, boost::multi_index::global_fun<Storage, soPre, &Data::hsb>>, // 1 boost::multi_index::hashed_non_unique<boost::multi_index::tag<byLSB>, boost::multi_index::global_fun<Storage, soObj, &Data::lsb>> // 2 > > DataStorage; DataStorage storage_; With your suggestions I've achieved to find all items by MSB, but sincerely, now I don't know how to write a custom iterator for this type. The code for finding elements is this: //typedef typename DataStorage::template nth_index<0>::type byHashedIndex; //typedef typename DataStorage::template index<byMSB>::type byHashedIndex; //byHashedIndex &p = storage_.template get<byMSB>(); auto &p = storage_.template get<byMSB>(); auto q = p.equal_range(subject(v)); while (q.first != q.second) { std::cout << " EQID " << *(q.first) << " | " << msb(*(q.first)) << " | " << hsb(*(q.first)) << " | " << lsb(*(q.first)) << std::endl; l.push_back(*(q.first)); q.first++; } Note: I *have* written iterators, but they were much easier (for instance char*). This is far too complex for making my way on my own! From the code above, I guess I have begin() and end() point to an equal_range output .first and .second. But what will the "pointer" I need in the iterator will be? Of course, my first attempt is a complete failure: // Iterator template <class T> class iterator : public std::iterator<std::input_iterator_tag, Storage> { typedef typename DataStorage::template index<T>::type byHashedIndex; byHashedIndex &p; // Default constructor iterator() : p(storage_.get<T>()) { }; // Copy constructor iterator(const iterator& i) : p(i.p) { }; // Pre-increment ++it iterator& operator++() { ++p; return *this; }; // Post-increment it++ iterator operator++(int) {iterator tmp(*this); operator++(); return tmp; }; // Equality bool operator==(const iterator& rhs) { return p == rhs.p; }; // Non-equality bool operator!=(const iterator& rhs) { return p != rhs.p; }; // Access Storage& operator*() { return *p; }; // Difference iterator operator-(int i) { return iterator(p - i); }; // Addition iterator operator+(int i) { return iterator(p + i); }; }; Can you point me in the right direction? Thanks!

2 3

"newbie" Build Boost Matrix
by Ismael Fadiga 25 Aug '14

25 Aug '14

hi all After executing the below sql query in c++, the printed results are: WITH rnum AS (SELECT s.ISN, s.Date, ClosedPrice, row_number() OVER (partition BY s.ISN ORDER BY s.ISN, s.Date DESC) AS rownumber FROM SecurityData s INNER JOIN PortfolioHoldings p ON s.ISN = p.ISN WHERE p.Pfid = 1876) SELECT DISTINCT ISN, Date, ClosedPrice FROM rnum WHERE rownumber <= 250)) //ID Date Price US345 2014-08-17 342 US345 2014-08-16 310 ... FR123 2014-08-17 18.20 FR123 2014-08-16 15 Does anyone know how to build a price matrix for the IDs like:? |342 18.20| MAT=|310 15 | |... ... | Your feedback would be very appreciated Cheers

2 5

[ConceptCheck] Same type concept
by Robert Jones 25 Aug '14

25 Aug '14

I'd like a concept check to check for two types being the same type. I can see how to write such a concept, but this is such an obvious requirement that either there should be one already, or there's some blindingly obvious reason why you never need one, a reason that escapes me. A little guidance would be appreciated. Thanks, Rob.

3 3