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

[python] TypeError when left side is noncopyable
by Igor R 12 Jun '14

12 Jun '14

I'm trying to expose an operator: struct my_class : boost::noncopyable {}; my_class &operator <<(my_class &e, int i); // in the module definition: class_<my_class, boost::noncopyable>("my_class") .def(self << int()) ; However, an attempt to invoke this operator in python causes the following error: TypeError: No to_python (by-value) converter found for C++ type: my_class I guess this is related to the fact my_class is noncopyable, isn't it? Is there a workaround for this issue? Thanks.

1 0

Meeting C++ Schedule released
by Jens Weller 12 Jun '14

12 Jun '14

Hello C++ & Boost Community, since last week the schedule for Meeting C++ is released: http://meetingcpp.com/index.php/schedule14.html Like last year Meeting C++ will feature 21 Talks in 3 Tracks, the conference will be opened by Scott Meyers, the closing Keynote will be given by Hartmut Kaiser. This years Theme Track is "Scientific Programming with C++". Also, if your are a student, you have the chance to participate in our student program which will give 50 Students access to the conference: http://meetingcpp.com/index.php/newsreader/items/meeting-cpp-2014-the-stude… kind regards, Jens Weller

1 0

pure virtuals on multiple hierarchy levels
by Igor R 12 Jun '14

12 Jun '14

Hello, What's the right way to wrap the following, when exposing this hierarchy to Python: sturct base { virtual void func1() = 0; }; struct intermediate : base { virtual void func2() = 0; }; struct derived : intermediate { void func1(); void func2(); }; Thanks.

1 0

[BGL]
by Pablo Madoery 11 Jun '14

11 Jun '14

Hello, I Have 2 graphs: graph1 and graph2, and two sets of edge descriptors. One set is associated to edges of graph1 and another set associated to edges of graph2. I don't understand why is it possible to access information about edges of graph2 by using graph1 and the edge descriptors of graph2. I realized of that because of an own mistake when using graphs. What I would like to know is why is that possible to do and if it should be an exception that can handle this situation. I send the code I was using to test this: #include <iostream> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/graphviz.hpp> #include <fstream> #include "GraphInfo.h" using namespace std; using namespace boost; typedef adjacency_list<setS, vecS, bidirectionalS, VertexInfo, EdgeInfo> Graph; void printGraph(Graph graph, string file) { ofstream ofs(file.c_str()); dynamic_properties dp; dp.property("node_id", get(vertex_index, graph)); dp.property("label", get(&EdgeInfo::weight, graph)); write_graphviz_dp(ofs, graph, dp); } int main() { Graph graph1; Graph::vertex_descriptor a1 = add_vertex(graph1); Graph::vertex_descriptor b1 = add_vertex(graph1); Graph::vertex_descriptor c1 = add_vertex(graph1); Graph::edge_descriptor e1 = (add_edge(a1, b1, graph1)).first; Graph::edge_descriptor e2 = (add_edge(b1, a1, graph1)).first; graph1[a1].id = 10; graph1[b1].id = 20; graph1[c1].id = 30; graph1[e1].weight = 1; graph1[e2].weight = 2; Graph graph2; Graph::vertex_descriptor a2 = add_vertex(graph2); Graph::vertex_descriptor b2 = add_vertex(graph2); Graph::vertex_descriptor c2 = add_vertex(graph2); Graph::vertex_descriptor d2 = add_vertex(graph2); Graph::edge_descriptor e4 = (add_edge(c2, b2, graph2)).first; Graph::edge_descriptor e5 = (add_edge(b2, c2, graph2)).first; Graph::edge_descriptor e6 = (add_edge(d2, a2, graph2)).first; Graph::edge_descriptor e7 = (add_edge(a2, d2, graph2)).first; graph2[a2].id = 10; graph2[b2].id = 20; graph2[c2].id = 30; graph2[e4].weight = 13; graph2[e5].weight = 14; graph2[e6].weight = 15; graph2[e7].weight = 16; // WHY IS THIS POSSIBLE TO DO // IT IS ASKING FOR AN EDGE OF GRAPH2 BUT USING GRAPH1 ??? double weight = graph1[e7].weight; cout<<"weight: "<<weight<<endl; printGraph(graph1, "graph1.dot"); printGraph(graph2, "graph2.dot"); cout << "end" << endl; return 0; } Thank you very much

2 1

Fwd: Lexical cast between narrow and wide strings
by Andrew Marlow 11 Jun '14

11 Jun '14

I hope this is the right place to post my question. I expected to be able to convert between narrow and wide strings using boost lexical cast but it fails to compile. I suppose that conversion is not supplied or supported. It would be really useful to me if it was. I am developing on win32 for wince and on wince there seeem to be many places where wide strings are required, especially when using the win32 API. Is there any chance this could be added to boost? I checked using boost 1.55.0 -- Regards, Andrew Marlow http://www.andrewpetermarlow.co.uk

5 6

Is boost asio appropriate for this use case ?
by Aaron Boxer 10 Jun '14

10 Jun '14

I am decoding an image file: the file has tagged header info mixed with 4K pixel code blocks. Platform is primarily windows, but could be osx or linux. Once I read in a code block, I can launch (asynchronously) my decode routine on this block, while continuing to read the file for header info and code blocks. Currently, I do synchronous reads using fread(...). Is is worthwhile to switch to boost asio to asynchronously read in the code blocks? The read callback could trigger my decode routine. But I wouldn't have to wait for the read before I carry on to the next code block. If so, can anyone point me to a reference/tutorial covering boost::asio asynch reads from disk?

3 3

[boost] [pimpl] Boost.Pimpl review canceled
by Glen Fernandes 09 Jun '14

09 Jun '14

Hi everyone, Vladimir has elected to withdraw Boost.Pimpl submission and cancel the formal review. On behalf of Vladimir, thank you for the feedback provided in response to the pre-view announcement mail: it was especially useful to him. Best, Glen

1 0

memory mapped file thread safety
by Aaron Boxer 09 Jun '14

09 Jun '14

Simple question: If I call get_address() on a region, can I pass this pointer to another thread and have this thread access the memory ? Thanks!

2 2

Boost Build
by skk 09 Jun '14

09 Jun '14

I am building Boost for MSVS10.0. I have generated the bjam.exe file and run it with the command line: bjam toolset=msvc10.0 variant=debug,release threading=multi link=static Looking at the libraries built, there are no sgd libs and the linker wants: libboost_regex-vc100-mt-sgd-1_55.lib Don't know how to get the sgd libs. Thanks -- View this message in context: http://boost.2283326.n4.nabble.com/Boost-Build-tp4663758.html Sent from the Boost - Users mailing list archive at Nabble.com.

3 2

[Filesystem] remove and recursive_directory_iterator
by gast128 09 Jun '14

09 Jun '14

I couldn't find a description of the iterator stability of recursive_directory_iterator but it gives problems when you remove the directory which is being iterated even when that directory is empty. For example if you want to remove all empty directories, the following code will throw an exception in ++it after the 'remove' call: fs::path pthDirectory = ...; fs::recursive_directory_iterator itEnd; for (fs::recursive_directory_iterator it(pthDirectory); it != itEnd; ++it) { boost::system::error_code ec; const fs::path& rPath = it->path(); if (fs::is_directory(rPath, ec)) { if (fs::is_empty(rPath, ec)) { fs::remove(rPath, ec); } } } It seems solvable with the way one erases a map (i.e. using while (it != itEnd) and using the equivalent of map.erase(it++)). Maybe add a note to the documentation or did I overlook something?

1 0