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

Boost Library Writers Workshop at CPP Con 2014
by Robert Ramey 14 Aug '14

14 Aug '14

Have you been lurking out there in cyberspace all these years? Slaving away on your fantastic new library for boost? Stuck, discouraged, concerned about getting ripped apart on the mailing list? Well, this is for you !!!! The Boost Library Writers Workshop http://rrsd.com/blincubator.com/open-content/ . Share your library and get it critiqued by you peer group - other unsung authors battling the same daemons. Best of all you can attend this workshop without being registered at the conference - to attend this workshop all you have to do is ... attend!. That's right, it's absolutely free. That's right free. And not free like in free software. Really free like "free beer". (note: there is no free beer). So if you're in the area and you want to get your library off your chest because it's weighing you down, keeping you awake, ruining your love life attend this workshop. Spaces are limited so signup now at the above web page. Robert Ramey -- View this message in context: http://boost.2283326.n4.nabble.com/Boost-Library-Writers-Workshop-at-CPP-Co… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

boost::serialization: 'serialize' is not a member of 'Eigen::internal::workaround_msvc_stl_support<T>'
by LynnC 13 Aug '14

13 Aug '14

Boost 1.50 MSVS 2010 My problem occurs when I attempt to serialize pcl::PointCloud<pcl::PointXYZ> g...specifically g.points which is std::vector<Point, Eigen::aligned_allocator<Point> > pcl::PointCloud<Point>::points. I have the following code: #ifndef SERIALIZATIONSUPPORT_H #define SERIALIZATIONSUPPORT_H #include <pcl/point_cloud.h> #include <pcl/io/pcd_io.h> #include <pcl/point_types.h> // needed for pcl::PointXYZ Point #include <boost/serialization/base_object.hpp> #include <boost/serialization/utility.hpp> #include <boost/serialization/list.hpp> #include <boost/serialization/assume_abstract.hpp> #include <boost/serialization/vector.hpp> typedef pcl::PointXYZ Point; namespace boost { namespace serialization { template<class Archive> void serialize(Archive & ar, pcl::PointCloud<Point>& g, const unsigned int version) { ar & g.points; } template<class Archive> void serialize(Archive & ar, Point& g, const unsigned int version) { ar & g.getVector3fMap().data()[0]; ar & g.getVector3fMap().data()[1]; ar & g.getVector3fMap().data()[2]; } } // namespace serialization } // namespace boost #endif /* SERIALIZATIONSUPPORT_H */ Error received: error C2039: 'serialize' : is not a member of 'Eigen::internal::workaround_msvc_stl_support<T>' Special notes...no problems with my code when compiling on Ubuntu 12.04 LTS using Boost 1.48. Only a problem when compiling on Windows. Any idea as to why I would be receiving this? I already have a method for serializing Point. Shouldn't that be enough? -- View this message in context: http://boost.2283326.n4.nabble.com/boost-serialization-serialize-is-not-a-m… Sent from the Boost - Users mailing list archive at Nabble.com.

2 2

composite_key with array member
by Uthpal Urubail 13 Aug '14

13 Aug '14

I am looking for a container where I have to use 5-10 keys to get the value. I am trying to write something like below.. Can some one help to solve this? struct entry { int a[10]; int id; }; using boost::multi_index_container; using namespace boost::multi_index; typedef multi_index_container< entry, indexed_by< ordered_non_unique< composite_key< entry, member<entry,unsigned int,&entry::a> ???? > >, ordered_unique< member<entry,unsigned int,&entry::id> > > > book; Regards, UJ

2 1

[BGL] Question about using remove_edge() in boost graph library
by Yi-Ping Huang 12 Aug '14

12 Aug '14

Dear boost-users: I just start learning boost graph library and have a basic problem on using the remove_edge function in boost graph library. I would like to remove an edge in a multigraph. For a graph with two edges connect vertice 0 and 1, I would like to remove one of them, but kept the other. According to the user guide, remove_edge(u ,v , g) removes all occurrences of (u ,v). So I should use remove_edge(e ,g) instead. Here, e is a valid edge descriptor. For a single graph, g, I am able to perform both remove_edge(u ,v , g) and remove_edge(e ,g) operation. However, when I want to generalize the implementation to fit my need by putting graphs in a vector container, I got segmentation fault for remove_edge(e ,graph_list[0]). (The compiler show no warning message.) On the other hand, remove_edge(u,v,g) works perfectly. I am not sure what's the difference between those two syntax causes this problem. I really want to make remove_edge(e,g) and vector container work at the same time. So any suggestion that can help my bypass this difficulty is appreciated. Thanks a lot!! Yi-Ping

1 0

Allocation/deallocations during boost serialization (tracking help?)
by miles_c＠verizon.net 12 Aug '14

12 Aug '14

1 0

asio::ip::tcp iostream wrong byte count read for last packet
by Steve Coleman 12 Aug '14

12 Aug '14

I just started out with Boost and was writing a little binary file transfer app and ran into a little problem, so I would appreciate if someone could kindly point out what I am doing wrong here. My problem is in getting the correct byte count read in the final packet received. My last frame always returns the size of the buffer, not the number of bytes read into the buffer. Isn't iostream::gcount(() meant for this? If not, what is the correct 'Boost' way of doing this? int spool_binary_data() { boost::asio::ip::tcp::endpoint dataServerEndpoint(boost::asio::ip::tcp::v4(), PMMS_TRANSFER_PORT_NUMBER); boost::asio::ip::tcp::acceptor acceptor(dataServer, dataServerEndpoint); boost::asio::ip::tcp::iostream dataServerStream; acceptor.accept(*dataServerStream.rdbuf()); char buffer[2048]; std::streamsize nbytes = sizeof(buffer); FILE * pFile = fopen ("binary.out","w"); // count = getavailable(this->native_socket) ?? // stream->rdbuf()->available() ?? while ( dataServerStream.read((char*)&buffer, nbytes) ) { int bytes_read = dataServerStream.gcount(); // always 2048 std::cout << "bytes read " << bytes_read << std::endl; fwrite(buffer,1,bytes_read,pFile); } dataServerStream.close(); fclose(pFile); }

2 3

Basic question about using remove_edge() in boost graph library
by Yi-Ping Huang 11 Aug '14

11 Aug '14

Dear boost-users: I just start learning boost graph library and have a basic problem on using the remove_edge function in boost graph library. I would like to remove an edge in a multigraph. For a graph with two edges connect vertice 0 and 1, I would like to remove one of them, but kept the other. According to the user guide, remove_edge(u ,v , g) removes all occurrences of (u ,v). So I should use remove_edge(e ,g) instead. Here, e is a valid edge descriptor. For a single graph, g, I am able to perform both remove_edge(u ,v , g) and remove_edge(e ,g) operation. However, when I want to generalize the implementation to fit my need by putting graphs in a vector container, I got segmentation fault for remove_edge(e ,graph_list[0]). I really want to make remove_edge(e,g) and vector container work at the same time. So any suggestion that can help my bypass this difficulty is appreciated. Thanks a lot!! Yi-Ping *************************Here is the complete code************************* #include <iostream> #include <utility> #include <algorithm> #include <vector> #include "boost/graph/graph_traits.hpp" #include "boost/graph/adjacency_list.hpp" using namespace boost; typedef adjacency_list<vecS, vecS, undirectedS> UndirectedGraph; typedef boost::graph_traits<UndirectedGraph>::edge_iterator edge_iterator; int graph_show(UndirectedGraph &g); int main(int argc, char *argv[]) { UndirectedGraph g; typedef boost::graph_traits<UndirectedGraph>::edge_descriptor edge_descriptor; edge_descriptor ed; std::vector<edge_descriptor> edge_list; std::vector<std::vector<edge_descriptor> > graph_edge_list; std::vector<UndirectedGraph> graph_list; int nb=0; int Nl=4; bool inserted; while(nb<Nl) { tie(ed,inserted)=add_edge(nb,nb+1,g); edge_list.push_back(ed); tie(ed,inserted)=add_edge(nb,nb+1,g); edge_list.push_back(ed); graph_edge_list.push_back(edge_list); nb=nb+1; graph_list.push_back(g); } std::cout<<"size of the graph vector is: "<<graph_list.size()<<std::endl; remove_edge(graph_edge_list[0][0],graph_list[0]);//This is where the problem shows. //I got Segmentation fault (core dumped) //remove_edge(0,1,graph_list[0]); /*Remove edges by assigning vertices works fine, but that is not what I need.*/ for (int ig = 0; ig < Nl; ++ig) { std::cout<<"graph#"<<ig<<std::endl; std::cout<<"Size of edge_list is: "<<graph_edge_list[ig].size()<<std::endl; graph_show(graph_list[ig]); } std::cout<<"Success"<<std::endl; return 0; } int graph_show(UndirectedGraph &g) { std::cout<<"Number of edges is : "<<boost::num_edges(g)<<std::endl; std::cout<<"Number of vertices is : "<<boost::num_vertices(g)<<std::endl; std::pair<edge_iterator,edge_iterator> ei=edges(g); for (edge_iterator edge_iter = ei.first; edge_iter!=ei.second; ++edge_iter) { std::cout<<"("<< boost::source(*edge_iter,g)<<","<<boost::target(*edge_iter,g)<<")"<<std::endl; } typedef boost::graph_traits<UndirectedGraph>::vertex_iterator iter_v; std::cout<<"vertices(g)={ "; for (std::pair<iter_v,iter_v> p = vertices(g); p.first != p.second; ++p.first) { std::cout<< *p.first; std::cout<<" "; } std::cout<<"}"<<std::endl; return 0; }

1 0

[String algorithms] User defined finders and predicates
by Aaron Levy 11 Aug '14

11 Aug '14

Are there good examples of writing user defined finders and predicates for functions such as find_token? Aaron

1 0

Boost 1.56.0 has been released
by Marshall Clow 11 Aug '14

11 Aug '14

Release 1.56.0 of the Boost C++ Libraries is now available. These open-source libraries work well with the C++ Standard Library, and are usable across a broad spectrum of applications. The Boost license encourages both commercial and non-commercial use. This release contains one new library and numerous enhancements and bug fixes for existing libraries. === Modularization === Boost version control has migrated to a system using git submodules. This shouldn't make too much of a difference to users, although the directory structure is now a bit different. Parts of some libraries have been moved into different modules, and several new modules have been extracted from existing code. All header paths should remain the same. The new modules are: • Assert: Customizable assert macros. Maintained by Peter Dimov. • Core: Core utilities used by other libraries, with minimal dependencies. Maintained by Peter Dimov, Glen Fernandes and Andrey Semashev. • Lexical_Cast: General literal text conversions, such as an int represented a string, or vice-versa, from Kevlin Henney. • Throw_Exception: A common infrastructure for throwing exceptions from Boost libraries, from Emil Dotchevski. • Winapi: Windows API declarations without <windows.h>, for internal Boost use. === New Libraries === • Align: Memory alignment functions, allocators, and adaptors, from Glen Fernandes. • Type_Index: Runtime/Compile time copyable type info, from Antony Polukhin. For details, including download links, see http://www.boost.org/users/news/version_1.56.0 You can also download directly from SourceForge: http://sourceforge.net/projects/boost/files/boost/1.56.0/ To install this release on your system, see http://www.boost.org/doc/libs/release/more/getting_started/index.html Thanks, --The Boost release team Vladimir Prus Rene Rivera Marshall Clow Eric Niebler Daniel James Beman Dawes

8 10

[asio] multiple simultaneous async_read calls
by bbxiong 11 Aug '14

11 Aug '14

Hello, all, If i write some code like this: boost::asio::async_read(socket_, bosot::asio::buffer(buffer1_.data(), len1, handler1); boost::asio::async_read(socket_, boost::asio::buffer(buffer2_.data(), len2, handler2); Will asio guarantee len1 bytes received by the first async_read, then schedule async_read2? or the result is undefined(like several bytes filled into buffer1, then next several bytes into buffer, then next several bytes into buffer1)? if the result is undefined, why asio don't add a check here? Thanks all in advance!

5 8