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

problem with interprocess queue in boost 1.39
by orialtman 23 Feb '12

23 Feb '12

Hi All! I am using boost 1.39 on windows. i have implemented a simple client server application and ran the client and server simultaneously. The client pushes request using 'send' api with no timeout. it then sleeps for 3 seconds and sends another request and so on. the server pops messages from the queue with a timeout of 1 second. it then sleeps for 1 seconds and pops again and so on. this was created to simulate a problem i have in a more complicated server which actually performs work on received items. After some random time has passed i see that the client is locked and unable to push messages. it is locked in the 'notify' function which takes place at the end of do_send method of message_queue.hpp. while it is locked there i also see that the number of waiters on the condition is 1. when i pause the server application i see that it is not inside the do_receive method and therefore there is no appearent reason for the lock to be unavailable and for the number of waiters to be 1. has anyone come across something similar? is this a known issue for 1.39 or am i using the queue in a bad form? -- View this message in context: http://boost.2283326.n4.nabble.com/problem-with-interprocess-queue-in-boost… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

[variant] 'which' out of range assertion
by Igor R 23 Feb '12

23 Feb '12

Hello, It appears that since 1.47 Boost.Variant has a bug that can be reproduced as follows (MSVC10, Debug mode): #include <boost/variant.hpp> #include <boost/mpl/vector/vector30.hpp> struct struct1{}; struct struct2{}; struct struct3{}; struct struct4{}; struct struct5{}; struct struct6{}; struct struct7{}; struct struct8{}; struct struct9{}; struct struct10{}; struct struct11{}; struct struct12{}; struct struct13{}; struct struct14{}; struct struct15{}; struct struct16{}; struct struct17{}; struct struct18{}; struct struct19{}; struct struct20{}; struct struct21{}; typedef boost::mpl::vector21< struct1, struct2, struct3, struct4, struct5, struct6, struct7, struct8, struct9, struct10, struct11, struct12, struct13, struct14, struct15, struct16, struct17, struct18, struct19, struct20, struct21 >::type vec_type; typedef boost::make_variant_over<vec_type>::type var_type; int main() { var_type v; v = struct21(); } The last line generates assertion in variant_impl.hpp, line 264, visitation_impl() function: "Boost.Variant internal error: 'which' out of range." According to the release notes, variant wasn't changed in 1.47, but I recalled teh following discussion: http://boost.2283326.n4.nabble.com/large-variant-performance-compared-50-el… It seems that the above issue is somehow related to this change. Igor'.

3 12

numerical quadrature
by Dr. Bruce Elenbogen 23 Feb '12

23 Feb '12

There seems to be documentation about boost numerical quadrature, but when I download boost no such libraries exist. Where can I find the quadrature libraries? thank you Bruce

2 1

[range] unique
by Bill Buklis 23 Feb '12

23 Feb '12

This may simply be my lack of understanding of the range library as I'm still just working my way through the algorithms, but is boost::unique returning the correct result range? Given that std::unique returns an iterator to the first non-unique value you can do something like: vec.erase( std::unique(vec.begin(), vec.end(), vec.end() ); However, boost::unique returns the range of the "unique" values. I would expect instead that it would return the range of non-unique values so that it matched the standard algorithm version, which effectively returns the range of non-unique values. Correspondingly trying: boost::erase( vec, boost::unique(vec) ); eliminates the complete opposite of what the standard version does. I can get around this by calling: vec.erase( boost::unique(vec).end(), vec.end() ); but this seems rather counter-intuitive to me. Is this correct? Is this by intent? What is the benefit of having it this way? The documentation doesn't mention anything at all about the return range in the description. Since I'm still just beginning to use the range library, I don't know all the tricks and benefits yet, so I ask. -- Bill

2 2

Boost.Units: Issue with user-defined and unitless quantities
by Pieter 22 Feb '12

22 Feb '12

LS, This is a repost of an earlier question that unfortunately remained unanswered - I still hope sincerely someone out there can help me out as I feel really stuck here. I have some problems working with user defined quantities/units in combination with unitless quantities (such as the results of a sin() or cos() operations).Taking the example of the 'nautical mile', which is presented in the documentation: ---START CODE --- namespace nautical { struct length_base_unit : boost::units::base_unit<length_base_unit, length_dimension, 1> { static std::string name() { return "nautical mile"; } static std::string symbol() { return "nmi"; } }; typedef boost::units::make_system<length_base_unit>::type system; typedef unit<length_dimension,system> length; static const length mile,miles; } BOOST_UNITS_DEFINE_CONVERSION_FACTOR(nautical::length_base_unit, boost::units::si::meter_base_unit, double, 1.852e3); ---END CODE --- The following does not compile: ---START CODE --- typedef quantity<boost::units::si::plane_angle> TAngleInRad; typedef boost::units::quantity<nautical::length> TNauticalDistanceInNMI; TNauticalDistanceInNMI NauticalDistanceInNMI; TNauticalDistanceInNMI SumNauticalDistanceInNMI = NauticalDistanceInNMI + NauticalDistanceInNMI; // OK TNauticalDistanceInNMI ScaledSumNauticalDistanceInNMI = NauticalDistanceInNMI + NauticalDistanceInNMI*sin(AngleInRad); // Last line does not compile due to lack of a suitable operator+ ---END CODE --- It does work correctly when using the 'nautical mile' as it has been defined in the library itself in "nautical_mile.hpp" (as a scaled base unit related to the si::meter): ---START CODE --- namespace metric { typedef scaled_base_unit<boost::units::si::meter_base_unit, scale<1852, static_rational<1> > > nautical_mile_base_unit; } // definition of the nautical mile from "nautical_mile.hpp" typedef boost::units::metric::nautical_mile_base_unit::unit_type nautical_mile_unit; typedef quantity<nautical_mile_unit> TNauticalDistanceInNMI; ---END CODE --- However, I don't think I can specify my user-defined units/quantities in this manner as they use a scale factor represented by an arbitrary floating point value. My perception is that the example of the documentation does not work due to the mixing of quantities from the si system (the sin() returns a dimensionless quantity in that system) with user-defined quantities in another ('nautical') system, while the 'nautical mile' from 'nautical_mile.hpp' is a scaled version of the si::meter and thus defined within the realms of the si::system - but please correct me if I am wrong here. My problem can thus be summarized as follows: - the solution from the documentation does not compile - the solution from 'nautical_mile.hpp' uses a scaled base unit which is limited to scaling factors of the form scale<Base,Exponent> and my question is therefore: how can I define my user-defined units/quantities in such a way that they allow the required operations while being related to base units by an arbitrary scale factor? Help would be highly appreciated, Pieter ------------------- Nautical mile version #1 (from the included nautical_mile.hpp): namespace metric { typedef scaled_base_unit<boost::units::si::meter_base_unit, scale<1852, static_rational<1> > > nautical_mile_base_unit; } template<> struct base_unit_info<metric::nautical_mile_base_unit> { static const char* name() { return("nautical mile"); } static const char* symbol() { return("nmi"); } }; typedef quantity<boost::units::si::plane_angle> TAngleInRad; typedef quantity<boost::units::si::length> TDistanceInM; typedef boost::units::metric::nautical_mile_base_unit::unit_type nautical_mile_unit; typedef quantity<nautical_mile_unit> TDistanceInNMI; typedef boost::units::quantity<nautical::length> TNauticalDistanceInNMI; # this is OK: TAngleInRad Angle(0.5*radians); TDistanceInNMI DistanceInNMI; TDistanceInNMI SumDistanceInNMI = DistanceInNMI + DistanceInNMI; TDistanceInNMI ScaledSumDistanceInNMI = DistanceInNMI + DistanceInNMI*sin(AngleInRad); TNauticalDistanceInNMI NauticalDistanceInNMI; TNauticalDistanceInNMI SumNauticalDistanceInNMI = NauticalDistanceInNMI + NauticalDistanceInNMI; TNauticalDistanceInNMI ScaledSum NauticalDistanceInNMI = NauticalDistanceInNMI + NauticalDistanceInNMI*sin(AngleInRad); // DOES NOT COMPILE for lack of a suitable operator+

1 0

[Serialization] base64 encoding/decoding an archive as it's written/read
by Sean Farrow 22 Feb '12

22 Feb '12

Hi: Is there any way of base64 encoding/decoding an archive as it is wread/written? I have found some code that encodes, but wondered whether there was already any ioStreams written. Cheers Sean.

2 2

Acknowledgement messages
by norulez＠me.com 22 Feb '12

22 Feb '12

Hi, can anybody explain me on how to stop the "Boost-users post acknowledgement" messages after I submit a message? Thanks in advance Best Regards NoRulez

2 2

Re: [Boost-users] undefined reference to '__sync_add_and_fetch_4'whencross-compiling boost::asio fors mips
by Jayne 22 Feb '12

22 Feb '12

Hello Andreas, Thanks for the help. I have eventually managed! In short I... - defined BOOST_ASIO_DISABLE_THREADS both while building Boost, and in the application which used it - implemented the atomic primitives using code from the gcc headers All working now! thanks, Jayne. On Fri 17/02/12 12:37 , "Andreas Wehrmann" a.wehrmann(a)centersystems.com sent: Alright, I looked into how I did when I faced the problem (my previous reply was a fast shot). I put the following #defines in the user config header (boost/config/user.hpp): #define BOOST_ASIO_DISABLE_FENCED_BLOCK #define BOOST_SP_USE_SPINLOCK This did the trick for me. From what I recall, the problem lies with shared_ptr since the implementation tries to use gcc builtins for the locking mechanism it needs for refcounting but which are not implemented on every platform (in my case it was Coldfire/m68k). Regards -- Dipl.-Ing. (FH) Andreas Wehrmann Software Development -------------------------------------------------------------- Center Communication Systems GmbH A-1210 Wien, Ignaz-Köck-Straße 19 Sitz in Wien FN 796 88p, Firmenbuchgericht Wien http://www.centersystems.com [1]">www.centersystems.com Tel.: +43 (0) 190 199 - 3616 Mobile: +43 (0) 664 884 75916 Fax: +43 (0) 190 199 - 2110 E-Mail: a.wehrmann(a)centersystems.com Links: ------ [1] http://www.centersystems.com

1 0

Re: [Boost-users] mpi/serialization: broadcasting derived class through base pointer
by MM 22 Feb '12

22 Feb '12

> -----Original Message----- > From: Matthias Troyer [mailto:troyer@phys.ethz.ch] > Sent: 16 December 2010 15:20 > To: > Subject: Re: [Boost-users] mpi/serialization: broadcast function and > the value argument > > > On Dec 16, 2010, at 10:54 PM, Hicham Mouline wrote: > > > 1.44 > > As I wrote, I am able to debug deep into boost mpi and archive. > > Please let me know if I should send any more stacks or other data, > > > > Please try with 1.45. Pointer serialization in Boost.MPI has been > broken in 1.44 due to changes in Boost.Serialization. > > Matthias Hello Matthias, Robert Ramey, I am revisiting the topic of mpi broadcast-receiving a polymorphic object through a base class null pointer: void recv_histodata(boost::mpi::communicator& world) { historical_data_base* hd = nullptr; boost::mpi::broadcast(world, hd, master_process); } historical_data_base has 3 derived classes. I get the unregistered class exception from the serialization library, and so I am trying to register the derived type as shown in the serialization doc at /libs/serialization/doc/index.html : reference ar.template register_type<derived_one>(); but where do I put that? Regards, MM

6 19

return std::vector<> as boost::python::list
by Andy Falanga (afalanga) 21 Feb '12

21 Feb '12

Hi everyone, I'd originally worked out this issue by following the guidelines at the python wiki for exposing C++ containers into python. Basically, I made my vector act like a python list. This, however, created a problem for our teams build environment, specifically, that we didn't have python_d.lib to link with. This irritation cannot be tolerated in our environment so, I'm tasked with moving that vector to a boost::python::list object. However, all of my searches haven't returned much in terms of how to use this list object. The vector is of a simple structure that doesn't have anything but primitive types. Because of this, returning the list by value isn't a problem. Could I simply make a wrapper around the function that returns the vector with function that returns the list? For example: std::vector<myStruct>& GetVector() { // important stuff return vector; } boost::python::list GetPythonList(std::vector<myStruct>& structure) { boost::python::list boostPyList; for(int i(0); i < structure.size(); i++) { // copy each element into the python list } return boostPyList; } Would this work? Is it that simple? Thanks, Andy

1 0

[Multi-Index] Design Rationale behind erase in ordered_index container
by Ovanes Markarian 21 Feb '12

21 Feb '12

Hello Joaquín, the doc states in erase that an iterator or end-iterator is returned when erasing an element. What was the rationale behind returning the iterator? Where other members return the number of elements being removed. My point is that end-iterator is also returned when erasing an element where iterator points one before the end iterator. Now to be sure that the specified element was really removed my call must either use the key and search for that element again or compare the size before and after the erase call. Many thanks, Ovanes http://www.boost.org/doc/libs/1_47_0/libs/multi_index/doc/reference/ord_ind… iterator erase(iterator position); *Requires:* position is a valid dereferenceable iterator of the index. *Effects:* Deletes the element pointed to by position. *Returns:* An iterator pointing to the element immediately following the one that was deleted, or end() if no such element exists. *Complexity:* O(D(n)). *Exception safety:* nothrow.

5 10

Using a part of a Jamfile.v2
by Daryle Walker 21 Feb '12

21 Feb '12

I was thinking about tweaking a library in Boost. Its BOOST_ROOT/libs/math/test/ directory is shared with some other libraries, so there's a lot of test files and the shared Jamfile.v2 used to make the tests is huge. Is there a way to restrict which targets are built from the command line? Right now, it takes MANY hours to go through every test. (When I did something similar last week with another library, I just commented out all the other libraries sharing the file. Do I have to resort to that all the time?) Daryle W.

2 1

[hash] Reliability of hash_value() for std::string
by Szymon Gatner 21 Feb '12

21 Feb '12

Hi, I am coding a simple serialization/factory lib and want to use class hash code based on std::string representing class name as a factory identifier. My question is: how portable / reliable is hash value produced by std::string hash_value() overload? Will it be the same across platforms? Across boost versions? Or maybe actual algorithm is dictated by standard? Or should I just go with explicit algo like crc32? btw. I was just very hardly bitten by the fact that hash_value() for const char* != hash_value() for std::string, (it is just being treated as regular pointer). In other words hash_value("Class") != hash_value(std::string("Class")) which gave me few more gray hair. Is that desirable? Cheers, Szymon Gatner

3 4

Seeking in a serialized file
by gnu indian 21 Feb '12

21 Feb '12

hi, I am fairly new to boost and using it for serialization. Though I went through the archives, couldn't get a clear answer to the following: How do I fseek in a file and load from an offset. I don't want to read the whole data in the file; which works ( as given in some tutorial); but normal fseekg and then loading apparently doesn't work. Here is the sample code: const char* fileName = "xyz.txt"; // Create some objects const Obj o1(1, false); const Obj o2; const Obj o3(2, true); const Obj* const p1 = &o1; int p = 0; int q = 0; // Save data { // Create an output archive std::fstream ofs(fileName); boost::archive::binary_oarchive ar(ofs,boost::archive::no_header); // Write data ar & o1 & o2 & o3 & p1; p = ofs.tellp(); ar & o1 & o2 & o3 & p1; } // Restore data Obj restored_o1; Obj restored_o2; Obj restored_o3; Obj* restored_p1; { // Create and input archive std::ifstream ifs(fileName); boost::archive::binary_iarchive ar(ifs, boost::archive::no_header ifs.seekg(p); ar & restored_o1 & restored_o2 & restored_o3 & restored_p1; } Mridul

3 2

Quick (hopefully simple) Spirit::Qi question
by david.weber＠l-3com.com 21 Feb '12

21 Feb '12

I have a grammar that fully works. I'm in the process of now adding semantic actions to actually *do* something, and I'm hitting a snag. (BTW, I've used Boost::Spirit::Classic, but this is my first time w/ Qi) Grammar: template <typename Iterator> struct FortranLineGrammar : grammar<Iterator, space_type> { FortranLineGrammar() : FortranLineGrammar::base_type(start) { lvalue %= !hex_int >> lexeme[alpha >> *(alnum | '_')] >> *dim; BOOST_SPIRIT_DEBUG_NODE(lvalue); assignment = lvalue[ppp_print] >> "=" >> command; BOOST_SPIRIT_DEBUG_NODE(assignment); ... } typedef rule<Iterator, std::string(), space_type> string_rule_t; string_rule_t lvalue; }; Semantic action: extern void ppp_print(std::string& b); and later void ppp_print(std::string& b) { std::cout << b << std::endl; } So, what I'm going for, is when an lvalue is encountered, to call ppp_print with whatever matched that value. Unfortunately, I'm only getting the first character?!? Here is the debug output, not the right match, but I'm still tweaking the grammar. Looking at the actions only... PRINT *, 'AHHHH! ' <start> <lvalue> <try>PRINT *, 'AHHHH! '</try> <dim> <try> *, 'AHHHH! '</try> <fail/> </dim> <success> *, 'AHHHH! '</success> <attributes>[[P]]</attributes> </lvalue> So what gives?

2 1

How to make boost asio fork safe
by Ranadheer 20 Feb '12

20 Feb '12

I have built a C++ library using boost ASIO. The library needs to be both thread-safe and fork-safe. It has service scheduler thread, which calls "_io_service.run())". To support fork-safety, I've registered pre_fork, post_fork_parent and post_fork_child handlers. The pre_fork() handler, calls "_io_service.notify_fork(boost::io_service:fork_prepare();", post_fork_parent handler calls "_io_service.notify_fork(boost::asio::io_service::fork_parent);" and post_fork_child calls "_io_service.notify_fork(boost::asio::io_service::fork_child);". The problem I'm facing in, when the fork() happens, the service scheduler thread might be in middle of some operation and might have acquired lock on data members of io_service object. So, the child process seems them in the same state and in the post_fork_child() when we call "_io_service.notify_fork(boost::asio::io_service::fork_child);" it tries to acquire the lock on the same object and hence get blocked indefinitely (as there is no thread in child to release the lock). The stack trace I see in the child process, which is blocked, is - fffffd7ffed07577 lwp_park (0, 0, 0) fffffd7ffecffc18 mutex_lock_internal () + 378 fffffd7ffecfffb2 mutex_lock_impl () + 112 fffffd7ffed0007b mutex_lock () + b fffffd7fff26419d __1cFboostEasioGdetailLscoped_lock4n0CLposix_mutex__2t5B6Mrn0D__v_ () + 1d fffffd7fff2866a2 __1cFboostEasioGdetailQdev_poll_reactorMfork_service6Mn0BKio_serviceKfork_event__v_ () + 32 fffffd7fff278527 __1cFboostEasioGdetailQservice_registryLnotify_fork6Mn0BKio_serviceKfork_event__v_ () + 107 fffffd7fff27531c __1cDdesGtunnelQServiceSchedulerPpost_fork_child6M_v_ () + 1c fffffd7fff29de24 post_fork_child () + 84 fffffd7ffec92188 _postfork_child_handler () + 38 fffffd7ffecf917d fork () + 12d fffffd7ffec172d5 fork () + 45 fffffd7ffef94309 fork () + 9 000000000043299d main () + 67d 0000000000424b2c ???????? () Apparently the "dev_poll_reactor" is locked (because it seems to be dispatching some pending events) in the service scheduler thread when the fork has happened which is causing the problem. I think to solve the problem, I need to ensure that service scheduler thread is not in the middle of any processing when the fork happens and one way to guarantee that would be to call "io_service.stop()" in pre_fork() handler but that doesn't sound like a good solution. Could you please let me know what is the right approach to make the library fork safe? The code snippets looks something like this. /** * Combines Boost.ASIO with a thread for scheduling. */ class ServiceScheduler : private boost::noncopyable { public : /// The actual thread used to perform work. boost::shared_ptr<boost::thread> _service_thread; /// Service used to manage async I/O events boost::asio::io_service _io_service; /// Work object to block the ioservice thread. std::auto_ptr<boost::asio::io_service::work> _work; ... }; /** * CTOR */ ServiceScheduler::ServiceScheduler() : _logger("ServiceScheduler"), _io_service(), _work(std::auto_ptr<boost::asio::io_service::work>( new boost::asio::io_service::work(_io_service))), _is_running(false) { } /** * Starts a thread to run async I/O service to process the scheduled work. */ void ServiceScheduler::start() { ScopedLock scheduler_lock(_mutex); if (!_is_running) { _is_running = true; _service_thread = boost::shared_ptr<boost::thread>( new boost::thread(boost::bind( &ServiceScheduler::processServiceWork, this))); } } /** * Processes work passed to the ASIO service and handles uncaught * exceptions */ void ServiceScheduler::processServiceWork() { try { std::cout<<"Running io_service"<<std::endl; _io_service.run(); } catch (std::exception& e) { TUNNEL_LOGGER_ERROR(_logger, "Exception while running ioservice" << e.what()); } catch (...) { TUNNEL_LOGGER_ERROR(_logger, "Uncaught exception while running " << "ioservice"); } } /** * Pre-fork handler */ void ServiceScheduler::pre_fork() { _io_service.notify_fork(boost::asio::io_service::fork_prepare); } /** * Post-fork parent handler */ void ServiceScheduler::post_fork_parent() { _io_service.notify_fork(boost::asio::io_service::fork_parent); } /** * Post-fork child handler */ void ServiceScheduler::post_fork_child() { _io_service.notify_fork(boost::asio::io_service::fork_child); } I'm using boost 1.47 and running the application on Solaris i386. The library and application are built using studio-12.0. Thanks Ranadheer -- View this message in context: http://boost.2283326.n4.nabble.com/How-to-make-boost-asio-fork-safe-tp44040… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

Boost.Format for variadic numbers of arguments
by Philipp Moeller 20 Feb '12

20 Feb '12

I currently have a lot of code that formats list into something readable. Is it possible to do something like: boost::format fmt("List [ %V,%]"); std::vector<std::string> c = {"foo", "bar" }; std::for_each(begin(c), end(c), [&fmt](const std::string& x) { fmt % x; }); Where V would indicate a variable list and the character constant immediately after it would be the separator. (I'm not sure about V as a parameter, but someone more familiar with the library might have an answer to that.) Alternatively, suggestions for a flexible container pretty printer would be welcome as well. Cheers, Philipp Moeller

1 0

Edmonds karp max flow compile error
by coolhead.pranay＠gmail.com 19 Feb '12

19 Feb '12

Hi, I want to use BGL to compute the maximum flow in a network. Following is the definition of Graph that I am using typedef adjacency_list_traits < listS, listS, bidirectionalS > Traits; typedef adjacency_list < listS, listS, bidirectionalS, property < vertex_name_t, int >, property < edge_capacity_t, long, property < edge_residual_capacity_t, long, property < edge_reverse_t, Traits::edge_descriptor > > > > Graph; . Before computing the max flow, I have the following optional parameters setup property_map < Graph, edge_capacity_t >::type capacity = get(edge_capacity, this->g); property_map < Graph, edge_reverse_t >::type rev = get(edge_reverse, this->g); property_map < Graph, edge_residual_capacity_t >::type residual_capacity = get(edge_residual_capacity, this->g); property_map < Graph, vertex_name_t >::type vname = get(vertex_name,this->g); std::vector<default_color_type> color(num_vertices(this->g)); std::vector<Traits::edge_descriptor> pred(num_vertices(this->g)); The call to the algorithm is.. int flow = edmonds_karp_max_flow(g, s, t, capacity, residual_capacity, rev, &color[0], &pred[0]); When I try to compile the program it fails with the following error message. Can someone explain the reason for this ? /usr/include/boost/graph/edmonds_karp_max_flow.hpp: In function ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = Graph, CapacityEdgeMap = boost::adj_list_edge_property_map<boost::bidirectional_tag, long int, long int&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_capacity_t>, ResidualCapacityEdgeMap = boost::adj_list_edge_property_map<boost::bidirectional_tag, long int, long int&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_residual_capacity_t>, ReverseEdgeMap = boost::adj_list_edge_property_map<boost::bidirectional_tag, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_reverse_t>, ColorMap = boost::default_color_type*, PredEdgeMap = boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>*]’: boost_funcs.h:161: instantiated from here /usr/include/boost/graph/edmonds_karp_max_flow.hpp:99: error: array subscript is not an integer boost_funcs.h:161: instantiated from here /usr/include/boost/graph/edmonds_karp_max_flow.hpp:100: error: array subscript is not an integer boost_funcs.h:161: instantiated from here /usr/include/boost/graph/edmonds_karp_max_flow.hpp:106: error: array subscript is not an integer In file included from /usr/include/boost/graph/edmonds_karp_max_flow.hpp:22, from boost_funcs.h:20, from vertex_walk.h:21, from graph_miner.cpp:14: /usr/include/boost/graph/breadth_first_search.hpp: In function ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_name_t, int, boost::no_property>, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::bidirectional_tag, long int, long int&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_residual_capacity_t> >, boost::keep_all>, Buffer = boost::queue<void*, std::deque<void*, std::allocator<void*> > >, BFSVisitor = boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>*, boost::on_tree_edge> >, ColorMap = boost::default_color_type*]’: /usr/include/boost/graph/edmonds_karp_max_flow.hpp:102: instantiated from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = Graph, CapacityEdgeMap = boost::adj_list_edge_property_map<boost::bidirectional_tag, long int, long int&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_capacity_t>, ResidualCapacityEdgeMap = boost::adj_list_edge_property_map<boost::bidirectional_tag, long int, long int&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_residual_capacity_t>, ReverseEdgeMap = boost::adj_list_edge_property_map<boost::bidirectional_tag, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_reverse_t>, ColorMap = boost::default_color_type*, PredEdgeMap = boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>*]’ boost_funcs.h:161: instantiated from here /usr/include/boost/graph/breadth_first_search.hpp:105: error: no matching function for call to ‘put(boost::default_color_type*&, void*&, boost::default_color_type)’ In file included from boost_funcs.h:20, from vertex_walk.h:21, from graph_miner.cpp:14: /usr/include/boost/graph/edmonds_karp_max_flow.hpp: In function ‘void boost::detail::augment(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredEdgeMap, ResCapMap, RevEdgeMap) [with Graph = boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_name_t, int, boost::no_property>, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::no_property, boost::listS>, PredEdgeMap = boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>*, ResCapMap = boost::adj_list_edge_property_map<boost::bidirectional_tag, long int, long int&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_residual_capacity_t>, RevEdgeMap = boost::adj_list_edge_property_map<boost::bidirectional_tag, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_reverse_t>]’: /usr/include/boost/graph/edmonds_karp_max_flow.hpp:107: instantiated from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = Graph, CapacityEdgeMap = boost::adj_list_edge_property_map<boost::bidirectional_tag, long int, long int&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_capacity_t>, ResidualCapacityEdgeMap = boost::adj_list_edge_property_map<boost::bidirectional_tag, long int, long int&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_residual_capacity_t>, ReverseEdgeMap = boost::adj_list_edge_property_map<boost::bidirectional_tag, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_reverse_t>, ColorMap = boost::default_color_type*, PredEdgeMap = boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>*]’ boost_funcs.h:161: instantiated from here /usr/include/boost/graph/edmonds_karp_max_flow.hpp:55: error: array subscript is not an integer /usr/include/boost/graph/edmonds_karp_max_flow.hpp:107: instantiated from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = Graph, CapacityEdgeMap = boost::adj_list_edge_property_map<boost::bidirectional_tag, long int, long int&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_capacity_t>, ResidualCapacityEdgeMap = boost::adj_list_edge_property_map<boost::bidirectional_tag, long int, long int&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_residual_capacity_t>, ReverseEdgeMap = boost::adj_list_edge_property_map<boost::bidirectional_tag, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_reverse_t>, ColorMap = boost::default_color_type*, PredEdgeMap = boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>*]’ boost_funcs.h:161: instantiated from here /usr/include/boost/graph/edmonds_karp_max_flow.hpp:60: error: array subscript is not an integer /usr/include/boost/graph/edmonds_karp_max_flow.hpp:64: error: array subscript is not an integer /usr/include/boost/graph/edmonds_karp_max_flow.hpp:69: error: array subscript is not an integer In file included from /usr/include/boost/graph/edmonds_karp_max_flow.hpp:22, from boost_funcs.h:20, from vertex_walk.h:21, from graph_miner.cpp:14: /usr/include/boost/graph/breadth_first_search.hpp: In function ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_name_t, int, boost::no_property>, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::bidirectional_tag, long int, long int&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_residual_capacity_t> >, boost::keep_all>, Buffer = boost::queue<void*, std::deque<void*, std::allocator<void*> > >, BFSVisitor = boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>*, boost::on_tree_edge> >, ColorMap = boost::default_color_type*]’: /usr/include/boost/graph/breadth_first_search.hpp:107: instantiated from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_name_t, int, boost::no_property>, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::bidirectional_tag, long int, long int&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_residual_capacity_t> >, boost::keep_all>, Buffer = boost::queue<void*, std::deque<void*, std::allocator<void*> > >, BFSVisitor = boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>*, boost::on_tree_edge> >, ColorMap = boost::default_color_type*]’ /usr/include/boost/graph/edmonds_karp_max_flow.hpp:102: instantiated from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = Graph, CapacityEdgeMap = boost::adj_list_edge_property_map<boost::bidirectional_tag, long int, long int&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_capacity_t>, ResidualCapacityEdgeMap = boost::adj_list_edge_property_map<boost::bidirectional_tag, long int, long int&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_residual_capacity_t>, ReverseEdgeMap = boost::adj_list_edge_property_map<boost::bidirectional_tag, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_reverse_t>, ColorMap = boost::default_color_type*, PredEdgeMap = boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>*]’ boost_funcs.h:161: instantiated from here /usr/include/boost/graph/breadth_first_search.hpp:72: error: no matching function for call to ‘put(boost::default_color_type*&, void*&, boost::default_color_type)’ /usr/include/boost/graph/breadth_first_search.hpp:107: instantiated from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_name_t, int, boost::no_property>, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::bidirectional_tag, long int, long int&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_residual_capacity_t> >, boost::keep_all>, Buffer = boost::queue<void*, std::deque<void*, std::allocator<void*> > >, BFSVisitor = boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>*, boost::on_tree_edge> >, ColorMap = boost::default_color_type*]’ /usr/include/boost/graph/edmonds_karp_max_flow.hpp:102: instantiated from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = Graph, CapacityEdgeMap = boost::adj_list_edge_property_map<boost::bidirectional_tag, long int, long int&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_capacity_t>, ResidualCapacityEdgeMap = boost::adj_list_edge_property_map<boost::bidirectional_tag, long int, long int&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_residual_capacity_t>, ReverseEdgeMap = boost::adj_list_edge_property_map<boost::bidirectional_tag, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_reverse_t>, ColorMap = boost::default_color_type*, PredEdgeMap = boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>*]’ boost_funcs.h:161: instantiated from here /usr/include/boost/graph/breadth_first_search.hpp:78: error: no matching function for call to ‘get(boost::default_color_type*&, void*&)’ /usr/include/boost/graph/breadth_first_search.hpp:107: instantiated from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_name_t, int, boost::no_property>, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::bidirectional_tag, long int, long int&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_residual_capacity_t> >, boost::keep_all>, Buffer = boost::queue<void*, std::deque<void*, std::allocator<void*> > >, BFSVisitor = boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>*, boost::on_tree_edge> >, ColorMap = boost::default_color_type*]’ /usr/include/boost/graph/edmonds_karp_max_flow.hpp:102: instantiated from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = Graph, CapacityEdgeMap = boost::adj_list_edge_property_map<boost::bidirectional_tag, long int, long int&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_capacity_t>, ResidualCapacityEdgeMap = boost::adj_list_edge_property_map<boost::bidirectional_tag, long int, long int&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_residual_capacity_t>, ReverseEdgeMap = boost::adj_list_edge_property_map<boost::bidirectional_tag, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_reverse_t>, ColorMap = boost::default_color_type*, PredEdgeMap = boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>*]’ boost_funcs.h:161: instantiated from here /usr/include/boost/graph/breadth_first_search.hpp:80: error: no matching function for call to ‘put(boost::default_color_type*&, void*&, boost::default_color_type)’ /usr/include/boost/graph/breadth_first_search.hpp:107: instantiated from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_name_t, int, boost::no_property>, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::bidirectional_tag, long int, long int&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_residual_capacity_t> >, boost::keep_all>, Buffer = boost::queue<void*, std::deque<void*, std::allocator<void*> > >, BFSVisitor = boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>*, boost::on_tree_edge> >, ColorMap = boost::default_color_type*]’ /usr/include/boost/graph/edmonds_karp_max_flow.hpp:102: instantiated from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = Graph, CapacityEdgeMap = boost::adj_list_edge_property_map<boost::bidirectional_tag, long int, long int&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_capacity_t>, ResidualCapacityEdgeMap = boost::adj_list_edge_property_map<boost::bidirectional_tag, long int, long int&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_residual_capacity_t>, ReverseEdgeMap = boost::adj_list_edge_property_map<boost::bidirectional_tag, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_reverse_t>, ColorMap = boost::default_color_type*, PredEdgeMap = boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>*]’ boost_funcs.h:161: instantiated from here /usr/include/boost/graph/breadth_first_search.hpp:87: error: no matching function for call to ‘put(boost::default_color_type*&, void*&, boost::default_color_type)’ In file included from /usr/include/boost/graph/edmonds_karp_max_flow.hpp:18, from boost_funcs.h:20, from vertex_walk.h:21, from graph_miner.cpp:14: /usr/include/boost/property_map/property_map.hpp: In member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::default_color_type*, Key = void*]’: /usr/include/boost/concept/detail/has_constraints.hpp:40: instantiated from ‘const bool boost::concept::not_satisfied<boost::ReadablePropertyMapConcept<boost::default_color_type*, void*> >::value’ /usr/include/boost/concept/detail/has_constraints.hpp:43: instantiated from ‘boost::concept::not_satisfied<boost::ReadablePropertyMapConcept<boost::default_color_type*, void*> >’ /usr/include/boost/mpl/if.hpp:67: instantiated from ‘boost::mpl::if_<boost::concept::not_satisfied<boost::ReadablePropertyMapConcept<boost::default_color_type*, void*> >, boost::concept::constraint<boost::ReadablePropertyMapConcept<boost::default_color_type*, void*> >, boost::concept::requirement<boost::ReadablePropertyMapConcept<boost::default_color_type*, void*> > >’ /usr/include/boost/concept/detail/general.hpp:19: instantiated from ‘boost::concept::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::default_color_type*, void*>)>’ /usr/include/boost/concept_check.hpp:43: instantiated from ‘void boost::function_requires(Model*) [with Model = boost::ReadablePropertyMapConcept<boost::default_color_type*, void*>]’ /usr/include/boost/property_map/property_map.hpp:220: instantiated from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::default_color_type*, Key = void*]’ /usr/include/boost/concept/detail/has_constraints.hpp:40: instantiated from ‘const bool boost::concept::not_satisfied<boost::ReadWritePropertyMapConcept<boost::default_color_type*, void*> >::value’ /usr/include/boost/concept/detail/has_constraints.hpp:43: instantiated from ‘boost::concept::not_satisfied<boost::ReadWritePropertyMapConcept<boost::default_color_type*, void*> >’ /usr/include/boost/mpl/if.hpp:67: instantiated from ‘boost::mpl::if_<boost::concept::not_satisfied<boost::ReadWritePropertyMapConcept<boost::default_color_type*, void*> >, boost::concept::constraint<boost::ReadWritePropertyMapConcept<boost::default_color_type*, void*> >, boost::concept::requirement<boost::ReadWritePropertyMapConcept<boost::default_color_type*, void*> > >’ /usr/include/boost/concept/detail/general.hpp:19: instantiated from ‘boost::concept::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::default_color_type*, void*>)>’ /usr/include/boost/concept_check.hpp:43: instantiated from ‘void boost::function_requires(Model*) [with Model = boost::ReadWritePropertyMapConcept<boost::default_color_type*, void*>]’ /usr/include/boost/graph/breadth_first_search.hpp:67: instantiated from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_name_t, int, boost::no_property>, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::bidirectional_tag, long int, long int&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_residual_capacity_t> >, boost::keep_all>, Buffer = boost::queue<void*, std::deque<void*, std::allocator<void*> > >, BFSVisitor = boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>*, boost::on_tree_edge> >, ColorMap = boost::default_color_type*]’ /usr/include/boost/graph/breadth_first_search.hpp:107: instantiated from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_name_t, int, boost::no_property>, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::bidirectional_tag, long int, long int&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_residual_capacity_t> >, boost::keep_all>, Buffer = boost::queue<void*, std::deque<void*, std::allocator<void*> > >, BFSVisitor = boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>*, boost::on_tree_edge> >, ColorMap = boost::default_color_type*]’ /usr/include/boost/graph/edmonds_karp_max_flow.hpp:102: instantiated from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = Graph, CapacityEdgeMap = boost::adj_list_edge_property_map<boost::bidirectional_tag, long int, long int&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_capacity_t>, ResidualCapacityEdgeMap = boost::adj_list_edge_property_map<boost::bidirectional_tag, long int, long int&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_residual_capacity_t>, ReverseEdgeMap = boost::adj_list_edge_property_map<boost::bidirectional_tag, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_reverse_t>, ColorMap = boost::default_color_type*, PredEdgeMap = boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>*]’ boost_funcs.h:161: instantiated from here /usr/include/boost/property_map/property_map.hpp:164: error: no matching function for call to ‘get(boost::default_color_type*&, void*&)’ /usr/include/boost/property_map/property_map.hpp: In member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::default_color_type*, Key = void*]’: /usr/include/boost/concept/detail/has_constraints.hpp:40: instantiated from ‘const bool boost::concept::not_satisfied<boost::WritablePropertyMapConcept<boost::default_color_type*, void*> >::value’ /usr/include/boost/concept/detail/has_constraints.hpp:43: instantiated from ‘boost::concept::not_satisfied<boost::WritablePropertyMapConcept<boost::default_color_type*, void*> >’ /usr/include/boost/mpl/if.hpp:67: instantiated from ‘boost::mpl::if_<boost::concept::not_satisfied<boost::WritablePropertyMapConcept<boost::default_color_type*, void*> >, boost::concept::constraint<boost::WritablePropertyMapConcept<boost::default_color_type*, void*> >, boost::concept::requirement<boost::WritablePropertyMapConcept<boost::default_color_type*, void*> > >’ /usr/include/boost/concept/detail/general.hpp:19: instantiated from ‘boost::concept::requirement_<void (*)(boost::WritablePropertyMapConcept<boost::default_color_type*, void*>)>’ /usr/include/boost/concept_check.hpp:43: instantiated from ‘void boost::function_requires(Model*) [with Model = boost::WritablePropertyMapConcept<boost::default_color_type*, void*>]’ /usr/include/boost/property_map/property_map.hpp:221: instantiated from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::default_color_type*, Key = void*]’ /usr/include/boost/concept/detail/has_constraints.hpp:40: instantiated from ‘const bool boost::concept::not_satisfied<boost::ReadWritePropertyMapConcept<boost::default_color_type*, void*> >::value’ /usr/include/boost/concept/detail/has_constraints.hpp:43: instantiated from ‘boost::concept::not_satisfied<boost::ReadWritePropertyMapConcept<boost::default_color_type*, void*> >’ /usr/include/boost/mpl/if.hpp:67: instantiated from ‘boost::mpl::if_<boost::concept::not_satisfied<boost::ReadWritePropertyMapConcept<boost::default_color_type*, void*> >, boost::concept::constraint<boost::ReadWritePropertyMapConcept<boost::default_color_type*, void*> >, boost::concept::requirement<boost::ReadWritePropertyMapConcept<boost::default_color_type*, void*> > >’ /usr/include/boost/concept/detail/general.hpp:19: instantiated from ‘boost::concept::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::default_color_type*, void*>)>’ /usr/include/boost/concept_check.hpp:43: instantiated from ‘void boost::function_requires(Model*) [with Model = boost::ReadWritePropertyMapConcept<boost::default_color_type*, void*>]’ /usr/include/boost/graph/breadth_first_search.hpp:67: instantiated from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_name_t, int, boost::no_property>, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::bidirectional_tag, long int, long int&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_residual_capacity_t> >, boost::keep_all>, Buffer = boost::queue<void*, std::deque<void*, std::allocator<void*> > >, BFSVisitor = boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>*, boost::on_tree_edge> >, ColorMap = boost::default_color_type*]’ /usr/include/boost/graph/breadth_first_search.hpp:107: instantiated from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_name_t, int, boost::no_property>, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::bidirectional_tag, long int, long int&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_residual_capacity_t> >, boost::keep_all>, Buffer = boost::queue<void*, std::deque<void*, std::allocator<void*> > >, BFSVisitor = boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>*, boost::on_tree_edge> >, ColorMap = boost::default_color_type*]’ /usr/include/boost/graph/edmonds_karp_max_flow.hpp:102: instantiated from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = Graph, CapacityEdgeMap = boost::adj_list_edge_property_map<boost::bidirectional_tag, long int, long int&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_capacity_t>, ResidualCapacityEdgeMap = boost::adj_list_edge_property_map<boost::bidirectional_tag, long int, long int&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_residual_capacity_t>, ReverseEdgeMap = boost::adj_list_edge_property_map<boost::bidirectional_tag, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_reverse_t>, ColorMap = boost::default_color_type*, PredEdgeMap = boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>*]’ boost_funcs.h:161: instantiated from here /usr/include/boost/property_map/property_map.hpp:195: error: no matching function for call to ‘put(boost::default_color_type*&, void*&, boost::default_color_type&)’ In file included from /usr/include/boost/graph/breadth_first_search.hpp:22, from /usr/include/boost/graph/edmonds_karp_max_flow.hpp:22, from boost_funcs.h:20, from vertex_walk.h:21, from graph_miner.cpp:14: /usr/include/boost/graph/visitors.hpp: In member function ‘void boost::edge_predecessor_recorder<PredEdgeMap, Tag>::operator()(Edge, const Graph&) [with Edge = boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, Graph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_name_t, int, boost::no_property>, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::bidirectional_tag, long int, long int&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_residual_capacity_t> >, boost::keep_all>, PredEdgeMap = boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>*, Tag = boost::on_tree_edge]’: /usr/include/boost/graph/visitors.hpp:109: instantiated from ‘void boost::detail::invoke_dispatch(Visitor&, T, Graph&, mpl_::true_) [with Visitor = boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>*, boost::on_tree_edge>, T = boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, Graph = const boost::filtered_graph<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_name_t, int, boost::no_property>, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::bidirectional_tag, long int, long int&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /usr/include/boost/graph/visitors.hpp:140: instantiated from ‘void boost::invoke_visitors(Visitor&, T, Graph&, Tag) [with Visitor = boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>*, boost::on_tree_edge>, T = boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, Graph = const boost::filtered_graph<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_name_t, int, boost::no_property>, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::bidirectional_tag, long int, long int&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_residual_capacity_t> >, boost::keep_all>, Tag = boost::on_tree_edge]’ /usr/include/boost/graph/breadth_first_search.hpp:155: instantiated from ‘boost::graph::bfs_visitor_event_not_overridden boost::bfs_visitor<Visitors>::tree_edge(Edge, Graph&) [with Edge = boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, Graph = const boost::filtered_graph<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_name_t, int, boost::no_property>, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::bidirectional_tag, long int, long int&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_residual_capacity_t> >, boost::keep_all>, Visitors = boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>*, boost::on_tree_edge>]’ /usr/include/boost/graph/breadth_first_search.hpp:79: instantiated from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_name_t, int, boost::no_property>, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::bidirectional_tag, long int, long int&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_residual_capacity_t> >, boost::keep_all>, Buffer = boost::queue<void*, std::deque<void*, std::allocator<void*> > >, BFSVisitor = boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>*, boost::on_tree_edge> >, ColorMap = boost::default_color_type*]’ /usr/include/boost/graph/breadth_first_search.hpp:107: instantiated from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_name_t, int, boost::no_property>, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::bidirectional_tag, long int, long int&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_residual_capacity_t> >, boost::keep_all>, Buffer = boost::queue<void*, std::deque<void*, std::allocator<void*> > >, BFSVisitor = boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>*, boost::on_tree_edge> >, ColorMap = boost::default_color_type*]’ /usr/include/boost/graph/edmonds_karp_max_flow.hpp:102: instantiated from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = Graph, CapacityEdgeMap = boost::adj_list_edge_property_map<boost::bidirectional_tag, long int, long int&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_capacity_t>, ResidualCapacityEdgeMap = boost::adj_list_edge_property_map<boost::bidirectional_tag, long int, long int&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_residual_capacity_t>, ReverseEdgeMap = boost::adj_list_edge_property_map<boost::bidirectional_tag, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>&, void*, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, boost::no_property> > >, boost::edge_reverse_t>, ColorMap = boost::default_color_type*, PredEdgeMap = boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>*]’ boost_funcs.h:161: instantiated from here /usr/include/boost/graph/visitors.hpp:176: error: no matching function for call to ‘put(boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>*&, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>&)’ -- Pranay Anchuri Computer Science Graduate Student Rensselaer Polytechnic Institute Troy,NY

2 3

Boost SSL with Visual Studio 2010 and OpenSSL
by David W 19 Feb '12

19 Feb '12

Hello, I'm trying to compile the Boost 1.47 ASIO SSL server and client examples. I can sucessfully incorporate Boost into my project, but I cannot incorporate OpenSSL. When I try to add it I get the errors: 1>SSLServer.obj : error LNK2019: unresolved external symbol _ERR_reason_error_string referenced in function "public: virtual class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > __thiscall boost::asio::error::detail::ssl_category::message(int)const " (?message@ssl_category@detail@error@asio@boost@@UBE?AV?$basic_string@DU ?$char_traits@D@std@@V?$allocator@D@2@@std@@H@Z) 1>SSLServer.obj : error LNK2019: unresolved external symbol _CRYPTO_set_id_callback referenced in function "public: __thiscall boost::asio::ssl::detail::openssl_init_base::do_init::do_init(void)" (??0do_init@openssl_init_base@detail@ssl@asio@boost@@QAE@XZ) 1>SSLServer.obj : error LNK2019: unresolved external symbol _CRYPTO_set_locking_callback referenced in function "public: __thiscall boost::asio::ssl::detail::openssl_init_base::do_init::do_init(void)" (??0do_init@openssl_init_base@detail@ssl@asio@boost@@QAE@XZ) 1>SSLServer.obj : error LNK2019: unresolved external symbol _CRYPTO_num_locks referenced in function "public: __thiscall boost::asio::ssl::detail::openssl_init_base::do_init::do_init(void)" (??0do_init@openssl_init_base@detail@ssl@asio@boost@@QAE@XZ) 1>SSLServer.obj : error LNK2019: unresolved external symbol _SSL_load_error_strings referenced in function "public: __thiscall boost::asio::ssl::detail::openssl_init_base::do_init::do_init(void)" (??0do_init@openssl_init_base@detail@ssl@asio@boost@@QAE@XZ) 1>SSLServer.obj : error LNK2019: unresolved external symbol _SSL_library_init referenced in function "public: __thiscall boost::asio::ssl::detail::openssl_init_base::do_init::do_init(void)" (??0do_init@openssl_init_base@detail@ssl@asio@boost@@QAE@XZ) 1>SSLServer.obj : error LNK2019: unresolved external symbol _ENGINE_cleanup referenced in function "public: __thiscall boost::asio::ssl::detail::openssl_init_base::do_init::~do_init(void)" (??1do_init@openssl_init_base@detail@ssl@asio@boost@@QAE@XZ) 1>SSLServer.obj : error LNK2019: unresolved external symbol _CONF_modules_unload referenced in function "public: __thiscall boost::asio::ssl::detail::openssl_init_base::do_init::~do_init(void)" (??1do_init@openssl_init_base@detail@ssl@asio@boost@@QAE@XZ) 1>SSLServer.obj : error LNK2019: unresolved external symbol _CRYPTO_cleanup_all_ex_data referenced in function "public: __thiscall boost::asio::ssl::detail::openssl_init_base::do_init::~do_init(void)" (??1do_init@openssl_init_base@detail@ssl@asio@boost@@QAE@XZ) 1>SSLServer.obj : error LNK2019: unresolved external symbol _EVP_cleanup referenced in function "public: __thiscall boost::asio::ssl::detail::openssl_init_base::do_init::~do_init(void)" (??1do_init@openssl_init_base@detail@ssl@asio@boost@@QAE@XZ) 1>SSLServer.obj : error LNK2019: unresolved external symbol _ERR_remove_state referenced in function "public: __thiscall boost::asio::ssl::detail::openssl_init_base::do_init::~do_init(void)" (??1do_init@openssl_init_base@detail@ssl@asio@boost@@QAE@XZ) 1>SSLServer.obj : error LNK2019: unresolved external symbol _ERR_free_strings referenced in function "public: __thiscall boost::asio::ssl::detail::openssl_init_base::do_init::~do_init(void)" (??1do_init@openssl_init_base@detail@ssl@asio@boost@@QAE@XZ) 1>C:\Users\Epicism\Documents\Visual Studio 2010\Projects\SSLServer\Debug\SSLServer.exe : fatal error LNK1120: 12 unresolved externals 1> 1>Build FAILED. I have tried adding the directory C:\OpenSSL-Win32\lib\, C:\OpenSSL-Win32\lib\VC\, C:\OpenSSL-Win32\lib\VC\static, C:\OpenSSL-Win32\bin, C:\OpenSSL-Win32\include to Project->General Properties->Linker->Additional Library Directories using the openssl pre-compiled libraries ( http://www.openssl.org/related/binaries.html) I have also tried compiling OpenSSL myself with the same errors. I'm really at a loss, I have tried everything I have searched Google about a thousand times, tried IRC, every combination of directories I can think of... My setup is: Windows 7 64-bit Windows Visual Studio 2010 64 bit Boost 1.47 OpenSSL 1.0.0E and G C/C++ Additional Include Directories: C:\Program Files %28x86%29\boost\boost_1_47;C:\openssl\include\;C:\OpenSSL-Win32\lib;%(AdditionalIncludeDirectories) Project->General Properties->Linker->Additional Library Directories: C:\Program Files %28x86%29\boost\boost_1_47\lib;C:\openssl\lib;C:\openssl;%(AdditionalLibraryDirectories) - I've tried adding every directory to this property as well.... Right now I'm just trying to compile the following in a VS C++ console project: // SSLServer.cpp : Defines the entry point for the console application. // #include "stdafx.h" #include <cstdlib> #include <iostream> #include <boost/bind.hpp> #include <boost/asio.hpp> #include <boost/asio/ssl.hpp> int _tmain(int argc, _TCHAR* argv[]) { return 0; } Thanks in advance. David

1 0

[serialization] issues when writing non-intrusive code
by Sean Farrow 18 Feb '12

18 Feb '12

Hi: I am writing some non-intrusive serialization code for other c++ classes. I am trying to serialize the wxString class from the wxWidgets library. I have the following code: namespace boost { namespace serialization { template<class Archive> void serialize(Archive & ar, wxString & str, const unsigned int version) { ar & str.ToStdWstring(); } } } I noticed the following two typedefs in the wxWidgets code: typedef std::wstring wxStdWideString; typedef std::basic_string<wchar_t> wxStdWideString; only one of these is executed. I then wrote a second unintrusive serialization class: namespace boost { namespace serialization { template<class Archive> void serialize(Archive & ar, wxString & str, const unsigned int version) { ar & str; } } } I am getting the following error, using visual c++ 2010: 1>c:\program files (x86)\boost\boost\archive\basic_xml_oarchive.hpp(92): error C2664: 'boost::mpl::assertion_failed' : cannot convert parameter 1 from 'boost::mpl::failed ************boost::serialization::is_wrapper<T>::* ***********' to 'boost::mpl::assert<false>::type' with [ T=const wxStdWideString ] Given that I have written code to serialize the wxStdWideString typedef, does anyone know what is happening? Are typedefs ignored with boost serialization. Currently using 1.47. Cheers Sean.

2 2

[asio] mingw compile problem
by Tim Blechmann 18 Feb '12

18 Feb '12

hi all, i'm using asio successfully on both linux and osx. but when compiling via mingw, i get the two compile errors, both are related to const-correctness. problem 1: In file included from /home/tim/workspace/supercollider/external_libraries/boost/boost/asio/detail/win_iocp_serial_port_service.hpp:225, from /home/tim/workspace/supercollider/external_libraries/boost/boost/asio/serial_port_service.hpp:26, from /home/tim/workspace/supercollider/external_libraries/boost/boost/asio/basic_serial_port.hpp:30, from /home/tim/workspace/supercollider/external_libraries/boost/boost/asio.hpp:25, from /home/tim/workspace/supercollider/server/supernova/sc/../server/../sc/../utilities/osc_server.hpp:25, from /home/tim/workspace/supercollider/server/supernova/sc/../server/../sc/sc_osc_handler.hpp:35, from /home/tim/workspace/supercollider/server/supernova/sc/../server/server.hpp:27, from /home/tim/workspace/supercollider/server/supernova/sc/sc_plugin_interface.cpp:31: /home/tim/workspace/supercollider/external_libraries/boost/boost/asio/detail/impl/win_iocp_serial_port_service.ipp: In member function ‘boost::system::error_code boost::asio::detail::win_iocp_serial_port_service::open(boost::asio::detail::win_iocp_handle_service::implementation_type&, const std::string&, boost::system::error_code&)’: /home/tim/workspace/supercollider/external_libraries/boost/boost/asio/detail/impl/win_iocp_serial_port_service.ipp:58: error: invalid conversion from ‘const char*’ to ‘CHAR*’ /home/tim/workspace/supercollider/external_libraries/boost/boost/asio/detail/impl/win_iocp_serial_port_service.ipp:58: error: initializing argument 1 of ‘void* CreateFileA(CHAR*, DWORD, DWORD, _SECURITY_ATTRIBUTES*, DWORD, DWORD, void*)’ problem 2: /home/tim/workspace/supercollider/external_libraries/boost/boost/asio/buffer.hpp: In function ‘PointerToPodType boost::asio::buffer_cast(const boost::asio::const_buffer&) [with PointerToPodType = void*]’: /home/tim/workspace/supercollider/external_libraries/boost/boost/asio/detail/impl/win_iocp_handle_service.ipp:322: instantiated from here /home/tim/workspace/supercollider/external_libraries/boost/boost/asio/buffer.hpp:428: error: invalid static_cast from type ‘const void*’ to type ‘void*’ any idea, how i can work around these issues? thanks, tim

1 0

[Boost Statechart Library] How to inherit reactions?
by Philipp Bender 18 Feb '12

18 Feb '12

Hi, I'd like to define an abstract state which reacts to a specific event and calls a virtual hook function. In classes which inherit from my base class, I'd like to define those hooks. struct EvHeartBeat : boost::statechart::event<EvHeartBeat> {}; struct EvMyFoo : boost::statechart::event<EvMyFoo> {}; // this is my base class template< class MostDerived, class Context, class InnerInitial = boost::mpl::list<>, boost::statechart::history_mode historyMode = boost::statechart::has_no_history > struct BaseState : public boost::statechart::simple_state< MostDerived, Context, InnerInitial, historyMode > { typedef BaseState< MostDerived, Context, InnerInitial, historyMode > base_state; typedef boost::mpl::list< boost::statechart::custom_reaction< EvHeartBeat > > reactions; const std::string name; virtual boost::statechart::result hook() = 0; boost::statechart::result react ( const EvHeartBeat& e) { return hook(); } }; // this is my derived class struct B : BaseState<B, SomeContext, InitialState > { typedef boost::mpl::list< boost::statechart::custom_reaction<EvMyBar> > my_reactions; typedef boost::mpl::insert_range<my_reactions, boost::mpl::end<my_reactions>::type, BBFState::bbf_state::reactions>::type reactions; boost::statechart::result react ( const EvMyFoo& ) { std::cout << "B's reaction" << std::endl; } }; The derived class needs some explanation: I want it to react to other events as well, therefore the my_reactions typedef. Then I merge the mpl::list reactions from base and derived, this is a bit ugly but should be a generic way to do get the desired result. Now the problem: My compiler (g++-4.4) complains that there is no B::react( const EvHeartBeat& ) method. But it should, it's in the parent class. Furthermore, if I _remove_ the reaction to the other event, it compiles and actually uses the parent's reaction method. Of course I can find a workaround (including some boiler plate code), but as this will be an integral part of my project, I'd like it to be as correct, maintainable and elegant as possible. I'd be happy to get some opinions about what's wrong here, best regards Philipp

2 2

Compiling Boost libraries without libstlport.so on Sun
by Shinil Gangadharan 18 Feb '12

18 Feb '12

Hi, Since libstlport.so is not compatable with libiostream.so, I am trying to get rid of libstlport.so on Sun C++ compiler V5.9. I am currently using boost version 1_46_1. Since boost libraries are dependent on libstlport.so, is there a workaround so that the libraries compile with libiostream.so instead of libstlport.so. Regards, Shinil V.G.

1 0

Is it possible to expose bit-fields through boost.python
by Andy Falanga (afalanga) 17 Feb '12

17 Feb '12

Hi, I'd like to be able expose a struct defined as a bit field in C++ to python. Being a neophyte in Boost, I'm wondering if there's a way to doing this. I'm trying the method that I used when exposing a conventional struct, but the intellisense in Visual Studio is complaining to me that bit-fields can't be exposed. I'm sure most on this list know what I mean, but just in case: struct bitField { char bit1 : 1; char bit2 : 1; char bit34 : 2; char bit567 : 3; char bit8 : 1; }; class_<bitField>("BitField") .def_readwrite("bit1", &bitField::bit1) .def_readwrite("bit2", &bitField::bit2) .def_readwrite("bit34", &bitField::bit34) .def_readwrite("bit567", &bitField::bit567) .def_readwrite("bit8", &bitField::bit8) ; Is there a way of doing this? This pattern is what I used to expose a conventional struct. Thanks, Andy

1 0

Re: [Boost-users] Boost Python and Crypto++
by Boost Users List 17 Feb '12

17 Feb '12

> when I try to import it into Python, I receive this error: > > ImportError: nf_decrypt.so: undefined symbol: > _ZN8CryptoPP21SimpleKeyingInterface6SetKeyEPKhmRKNS_14NameValuePairsE >[...] This does not sound like a Python problem. Are you linking with the appropriate -lfoo switches? -- VZ Thanks VZ! I wasn't linking in Crypto++ correctly. I got it working. Now have to figure out how to convert Python buffer objects to C++ std::strings.

1 0