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

[BGL] Modern benchmarks available?
by Nathan Cooprider 08 Oct '09

08 Oct '09

I'm evaluating the Boost Graph Library for a project would like to present my manager with some benchmark numbers. The only ones I have been able to find are from the GGCL OOPSLA paper, and those are pretty out of date. Does anybody know of any modern work at benchmarking BGL performance? I am looking at adjacency lists with sets in particular, but anything is better than nothing. I realize that I may just have to give big-O estimates in the end (because it is all dependent on the graph structure), but any estimates would help me for my initial evaluation. I have generally steered clear of Parallel BGL because it does not seem as mature as BGL. Is this a false assumption? Should I look further into PBGL? Thank you very much. Nathan

3 2

[serialization?] converting utf8 string to unicode wstring
by Igor R 08 Oct '09

08 Oct '09

Hello, I try to accomplish the subj with help of boost's utf8_codecvt_facet. I based my code on this example: http://www.boost.org/doc/libs/1_40_0/libs/serialization/doc/codecvt.html . The only difference is that my utf8 text resides in std::string: #include <sstream> #include <iostream> #include "boost/archive/detail/utf8_codecvt_facet.hpp" // link with boost/libs/serialization/src/utf8_codecvt_facet.cpp int main() { std::string utf; utf.resize(11); // hardcode some utf8 text utf[0] = 0xd7; utf[1] = 0x90; utf[2] = 0xd7; utf[3] = 0x99; utf[4] = 0xd7; utf[5] = 0x92; utf[6] = 0xd7; utf[7] = 0x95; utf[8] = 0xd7; utf[9] = 0xa8; utf[10] = 0x0; std::locale old_locale; std::locale utf8_locale(old_locale, new boost::archive::detail::utf8_codecvt_facet()); std::locale::global(utf8_locale); std::stringstream in; in.imbue(utf8_locale); in.str(utf); std::wstringstream out; out << in; std::wcout << out.str() << std::endl; } The above code doesn't work: "out" buffer doesn't contain correct unicode interpretation of the string. Actually, all i want is a c++ equivalent to the following WinAPI: #include "windows.h" int main() { std::string utf; utf.resize(11); // hardcode some utf8 text utf[0] = 0xd7; utf[1] = 0x90; utf[2] = 0xd7; utf[3] = 0x99; utf[4] = 0xd7; utf[5] = 0x92; utf[6] = 0xd7; utf[7] = 0x95; utf[8] = 0xd7; utf[9] = 0xa8; utf[10] = 0x0; wchar_t outBuff[11]; MultiByteToWideChar(CP_UTF8, 0, utf.c_str(), -1, outBuff, 10); } ...which works well. Any idea would be greatly appreciated! Thanks.

3 3

newbie: help to start with object_pool
by Jenia 08 Oct '09

08 Oct '09

Hi this is my first try with boost. I need an object pool, where I can preallocate X objects and reuse them with ability to allocate more if the pool runs empty and shrink my pool if needed. My questions: 1. Is object_pool suitable for this purpose? 2. Does object_pool.free() returns object memory to the pool or return pool's memory to the system? 3. How do I use object_pool.construct()? I didn't get the number of parameters requirement in the documentation (http://www.boost.org/doc/libs/1_40_0/libs/pool/doc/interfaces/object_pool.h…)

2 1

Re: [Boost-users] error C2733 second C linkage of overloaded function InterlockedIncrement not allowed
by Darth Vader 08 Oct '09

08 Oct '09

This is an old thread (1 year old) I'm answering to: This is about compiling some of the Boost library (1.39) on Windows CE 6.0. I got the following error: error C2733 second C linkage of overloaded function _InterlockedIncrement not allowed It turns out that "_InterlockedIncrement" is already defined in winbase.h so I commented out: extern "C" long __cdecl InterlockedIncrement( long* ); extern "C" long __cdecl InterlockedDecrement( long* ); extern "C" long __cdecl InterlockedCompareExchange( long*, long, long ); extern "C" long __cdecl InterlockedExchange( long*, long ); extern "C" long __cdecl InterlockedExchangeAdd( long*, long ); In interlocked.hpp and everything compiled fine.

1 0

[xpressive] Calling a placeholder method from within an action?
by Ami Ganguli 08 Oct '09

08 Oct '09

Hi all, I'm using an object as a placeholder, and would like to call various methods to the object from within my actions. Something along the lines of: port = (s1= *digit) [ _placeholder->setPort( as<int>(s1) ) ]; I've found a way to do something equivalent using method pointers, but the resulting code is really opaque. I'm afraid nobody else will ever be able to figure out what I've done. I also know I can do this by creating separate function objects for each method that will be called. This is less opaque, but really verbose. I end up with hundreds of lines of boilerplate code. Is there a "right" way to achieve something similar? Regards, Ami.

2 2

Stripped down "runtime" version of boost
by Paul Moore 08 Oct '09

08 Oct '09

At the moment, I'm using boost by simply unpacking the archive (I've only needed the header-only libraries thus far). But it's a fairly large archive, full of things that aren't actually needed to simply *use* the libraries. Is there a means of creating a subset of the boost distribution with *just* the headers (and libraries, ultimately) needed to compile programs using boost? I'm guessing that all I'd need is the boost subdirectory (with the headers) plus whatever parts of the lib directory are created as part of the boost.build process. Is that right? Are there any more explicit instructions anywhere? Thanks, Paul.

3 2

BGL -- adjacency_matrix, graph concepts
by Raymond Wan 08 Oct '09

08 Oct '09

Hi all, I have a basic question about BGL, but I'm a bit too new with templating to understand some of the terms used in the documentation... :-( I'd like to build a graph using an adjacency matrix and the edge_iterator_constructor of the graph (or anything faster than repeated add_edge's). In the docs, I found this for adjacency_list: template <class EdgeIterator> adjacency_list(EdgeIterator first, EdgeIterator last, vertices_size_type n, edges_size_type m = 0, const GraphProperty& p = GraphProperty()) but the closest I found for adjacency_matrix is: template <typename EdgeIterator> adjacency_matrix(EdgeIterator first, EdgeIterator last, vertices_size_type n, const GraphProperty& p = GraphProperty()) It's not the same because of "typename"? As a toy example, I've taken the MST example and have modified it a lot to get this: ----- #include <boost/config.hpp> #include <boost/graph/adjacency_matrix.hpp> #include <boost/graph/graph_utility.hpp> #include <iostream> int main () { using namespace boost; typedef adjacency_matrix < undirectedS, no_property, property < edge_weight_t, int > > Graph; typedef graph_traits < Graph >::edge_descriptor Edge; typedef graph_traits < Graph >::vertex_descriptor Vertex; typedef std::pair<int, int> E; const int num_nodes = 5; E edges[] = { E(0, 2), E(1, 3), E(1, 4), E(2, 1), E(2, 3), E(3, 4), E(4, 0) }; int weights[] = { 1, 1, 2, 7, 3, 1, 1 }; std::size_t num_edges = sizeof(edges) / sizeof(E); Graph g1 (num_nodes); for (unsigned int i = 0; i < num_edges; i++) { add_edge (edges[i].first, edges[i].second, g1); } print_graph (g1); Graph g2 (num_nodes); // Graph g2 (edges, edges + num_edges, weights, num_nodes); print_graph (g2); return EXIT_SUCCESS; } ----- The 5th line from the end is what is causing me problems. It seemed to work with an adjacency_list. (I'd also would like to add weights, but I guess add_edge could support that...I just think that this way is faster based on the "Quick Tour of the BGL" page in the docs.) I looked in my examples directory [1.39] and simply grepped for "adjacency_matrix" and came up with only one file: adjacency_matrix.cpp . Other than the pros/cons of adjacency matrices and lists, is there something wrong with adjacency matrices; any reason for its absence in the examples directory? One final question -- in the documentation, it lists various graph concepts (http://www.boost.org/doc/libs/1_40_0/libs/graph/doc/graph_concepts.html) such as BidirectionalGraph, VertexAndEdgeListGraph, AdjacencyMatrix, etc. Are these concepts relevant to BGL or only in a general sense? What I mean is what is their relationship with adjacency_list and adjacency_matrix? Any pointers would be appreciated... Thank you! Ray

3 11

[lambda][shared_ptr] Creating a shared_ptr with a custom delete function using a lambda expression
by Ryan McConnehey 08 Oct '09

08 Oct '09

I have a class that maintains a list of available numbers. The user will ask for a number and receive a shared_ptr with a value. Once the user is done with the number it will be put back on the list of available numbers. I'm trying to initialize the list with numbers and a custom delete function for the shared_ptr to be return to the list. Any help would be appropriated in how to get the lambda and custom delete function to work. Ryan class CTNGenerator { public: CTNGenerator(void) { m_AvailableCTNs.resize(20); unsigned short startValue = 15; typedef boost::shared_ptr<unsigned short> bus; //The lambda function isn't compiling with how it's currently written. std::for_each(m_AvailableCTNs.begin(), m_AvailableCTNs.end(), _1 = bus(new bus(var(startValue++)), &makeCTNAvailable)); } private: void CTNGenerator::makeCTNAvailable(unsigned short * ctn) { m_AvailableCTNs.push_back(boost::shared_ptr<unsigned short>(ctn)); } private: std::list< boost::shared_ptr<unsigned short> > m_AvailableCTNs; };

1 0

error in recreation of shared memory using boost:: interprocess
by manish4gupta 07 Oct '09

07 Oct '09

Hi, I am creating shared memory with given name(by given file name with key value ) and creating the map in the shared region by parsing key-value from the file. First time it is ok. but when i try to do it again, I am getting following error. terminate called after throwing an instance of 'boost::interprocess::interprocess_exception' what(): File exists Aborted What is the cause of this error. Thanks in advance. -- View this message in context: http://www.nabble.com/error-in-recreation-of-shared-memory-using-boost%3A%3… Sent from the Boost - Users mailing list archive at Nabble.com.

2 1

Setting QOS doesn't work?
by Dominique Lacerte 07 Oct '09

07 Oct '09

Hi, I have some QOS code in a product that is working fine. We're porting that code to using the socket support in ASIO and the QOS code doesn't seem to be working any longer. We're using WinXP under both environments and running our old code works fine but the new code has issues. Setting the TOS bits via: ::setsockopt(mSocket.native(), IPPROTO_IP, IP_TOS, (char *)(&uiTOS), sizeof(uiTOS)) Works fine, but setting the service type does not. We're making the following call: DWORD dwBytesReturned = 0; bool bSuccess = (SOCKET_ERROR != ::WSAIoctl( mSocket.native(), SIO_SET_QOS, (void *)reinterpret_cast<const BYTE *>(&tQOS), sizeof(tQOS), NULL, 0, &dwBytesReturned, NULL, NULL )); With values such as: SocketAddress bytes: 0200fc22c0a863670000000000000000 ===RX=== TokenRate: -1 TokenBucketSize: -1 PeakBandwidth: -1 Latency: -1 DelayVariation: -1 ServiceType: 6 MaxSduSize: -1 MinimumPolicedSize: -1 ===TX=== TokenRate: 4600 TokenBucketSize: -1 PeakBandwidth: -1 Latency: -1 DelayVariation: -1 ServiceType: 2 MaxSduSize: -1 MinimumPolicedSize: -1 And it returns success, but the DSCP bits in the packets are not being set. If we call SIO_GET_QOS afterwards we always get back the default: SocketAddress bytes: <NULL> ===RX=== TokenRate: -1 TokenBucketSize: -1 PeakBandwidth: -1 Latency: -1 DelayVariation: -1 ServiceType: 1 MaxSduSize: -1 MinimumPolicedSize: -1 ===TX=== TokenRate: -1 TokenBucketSize: -1 PeakBandwidth: -1 Latency: -1 DelayVariation: -1 ServiceType: 1 MaxSduSize: -1 MinimumPolicedSize: -1 Is there something different about the sockets implementation used by ASIO that prevents the WSAIoctl() call from working correctly? Dominique Lacerte Senior Software Engineer CounterPath Corporation T 250.380.0584 x1368 M 250.595.1362 [cid:image001.png@01CA472D.8E379C30]<http://www.counterpath.com/>

1 0

[BGL] premature termination in dijkstra using visitor
by Ralf Goertz 07 Oct '09

07 Oct '09

Hi, I have some very large undirected graphs (half a million vertices). Edges have weight 0 or 1. For each vertex I need to find all vertices * that are in sum 2 edges away * whose distance is 0 Both tasks can be done with breadth-first searches but I don't know in advance how many edges in depth I have to traverse. That's why I thought of Dijkstra's algorithm. But in my case this is overkill as I am not interested in the exact distance of a vertex from a given vertex but only in if it is not farther than 0 or 2 away. Is it possible to use a visitor to alter the colormap to mark vertices as final that are too far even thought they are not final yet? Ralf

5 12

[proto] Question on grammar and operator overloading
by Hal Finkel 06 Oct '09

06 Oct '09

Hello, I'm writing a complex number class using boost::proto by extending proto::terminal< boost::array<_, 2> >. I've attached a copy of my current code, which compiles, runs, and (at least with both g++ and icc on my machine) demonstrates a significant speed improvement compared to std::complex. However, there is (at least) one thing which don't work as it should: In the grammar I have to specify lazy_complex< double > instead of lazy_complex< _ >, otherwise the compiler cannot find proto's operator overloads, why? Note: This code will not compile under 1.37, but will compile under 1.40, because of some issue in 1.37 which manifests itself as a problem with the overloading of the '<<' operator. I've not tested the releases in between 1.37 and 1.40. General suggestions are also welcome. I'd like to get this cleaned up for general redistribution. Thank you in advance, Hal

3 7

Newbie: Boost Graph example request
by Brian Troutwine 06 Oct '09

06 Oct '09

Hello all. I'm new to using the Boost Graph library and am bewildered by its (seemingly essential) complexity. A solution to the simplistic problem I pose below would help provide a workable context around which to wrap my brain and would be most appreciated. -- Let G be the undirected graph given by the following adjacency list: 0 -> 2, 3 1 -> 2, 4 2 -> 3, 4 3 -> 1 4 -> 3 5 -> 0 6 -> 7 7 -> 8, 9 9 -> 10 Using, say, a breadth first search, for any two random nodes in the graph print the shortest path between them. For example, the shortest path between 5 and 3 is: 5 -> 0 -> 3 My apologies if a similar question has been asked before. A search through the mailing list archive did not return promising results. Also, I have, incidentally, ordered The Boost Graph Library text and am very much looking forward to its arrival. Thank you. Brian Troutwine

2 2

Shared memory volatility
by manish4gupta 06 Oct '09

06 Oct '09

Is shared memory created by Interprocess communication gets deleted when system is switched off? -- View this message in context: http://www.nabble.com/Shared-memory-volatility-tp25764705p25764705.html Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

[iterator_transform]'s reference
by er 06 Oct '09

06 Oct '09

Hi All, It appears that transform_iterator's reference is F::result_type, not result_of<F(Ref)> where Ref = iterator_reference<It>::type. Did I misinterpret the documentation?

1 0

dynamic objects (was Re: PBGL / Dynamic Property Maps complexity)
by Mathieu Malaterre 05 Oct '09

05 Oct '09

Nick, [reviving an old thread] On Sat, Sep 12, 2009 at 9:39 PM, Nick Edmonds <ngedmond(a)cs.indiana.edu> wrote: <...> > If your graphs aren't static... PBGL doesn't do well with dynamic graphs at > the moment, they'll *sort of* work... *sometimes* :) What do you mean by that ? What does not work ? I am currently trying to understand whether or not I can use dynamic objects stored in bundled properties, or will there be an issue in PBGL (when the object will be copied over to another machine) ? Sorry for evasive question but I could not find any example of BGL or PBGL that did not use POD struct for storing the properties. Thanks, -- Mathieu

2 1

compatibility of boost 1.39
by manish4gupta 05 Oct '09

05 Oct '09

Is boost library 1.39 compatible on ia64 machine(itanium) with compiler gcc 3.4.6 on a Redhat Enterprise Linux 4 Update 5? -- View this message in context: http://www.nabble.com/compatibility-of-boost-1.39-tp25696866p25696866.html Sent from the Boost - Users mailing list archive at Nabble.com.

2 12

Re: [Boost-users] Boost unit_test.cpp problem when try to compile simple program
by Robert Matusewicz 04 Oct '09

04 Oct '09

Gennadiy Rozental writes: >> You need different include than. Can't have it both ways. Either you include >> library implementation or you link with it. >> >> Use boost/test/unit_test.hpp " Just to close the topic. We can use boost/test/included/unit_test.hpp with Boost DLLs. We have to define BOOST_TEST_SOURCE. RM -- My public key can be found at https://keyserver2.pgp.com

2 1

modify_key() for a composite_key of a multi_index_container that contains a shared_ptr
by Zsolt Vajna 04 Oct '09

04 Oct '09

I'd like to modify_key() for a composite_key of a multi_index_container that contains a shared_ptr. I found a thread in this mailing list dealing with a similar kind of situation, not totally the same though: "[Boost-users] [multi_index] modify problem with composite_key" My example: This compiles fine: struct entry { entry(int a, int b):m_x(a), m_y(b){} int m_x; int m_y; }; typedef multi_index_container< entry, indexed_by< ordered_unique< composite_key< entry, member<entry,int,&entry::m_x>, member<entry,int,&entry::m_y>>>>> C; void updateX(C::iterator iter,int x, C& m_c) { m_c.get<0>().modify( iter, (&ll::_1)->*&entry::m_x=x); } My first problem is if I change modify to modify_key I get the following error: operator_lambda_func_base.hpp(237) : error C3892: 'boost::lambda::detail::select' : you cannot assign to a variable that is const My second problem is that instead of typedef multi_index_container< entry, indexed_by< ordered_unique< composite_key< entry, member<entry,int,&entry::m_x>, member<entry,int,&entry::m_y>>>>> C; i want to have a typedef multi_index_container< shared_ptr<entry>, indexed_by< ordered_unique< composite_key< entry, member<entry,int,&entry::m_x>, member<entry,int,&entry::m_y>>>>> C; Note the shared_ptr added. In this later case I get another error: boost\lambda\detail\member_ptr.hpp(512) : error C2440: 'newline' : cannot convert from 'const rt0 ' to 'entry *const ' I assume I need to change something around the _1 bit, but have no idea what. Thanks

2 1

cmake can't find Boost 1.40.0
by Timothy Chan 04 Oct '09

04 Oct '09

Hi all, I have a newbie question here. I am installing a software called gazebo which uses cmake. The software requres boost 1.35+. I have 1.32 on the system, and 1.40 installed locally. Cmake seems to only be able to find 1.32 and is not able to find my local installation of 1.40. I have boost installed in: /home/timchan/boost_1_40_0 In my .bashrc file I put: export LD_LIBRARY_PATH=/home/timchan/boost_1_40_0/libs:$LD_LIBRARY_PATH export CPATH=/home/timchan/boost_1_40_0/boost:$CPATH When I run cmake, I get the following error: CMake Error at /usr/share/cmake/Modules/FindBoost.cmake:868 (message): Unable to find the requested Boost libraries. Boost version: 1.32.0 Boost include path: /usr/include Detected version of Boost is too old. Requested version was 1.35 (or newer). Any help would be greatly appreciated!!

3 2

Regarding address specified in fixed managed shared memory
by Hector Troy 04 Oct '09

04 Oct '09

Hi, I am trying to use Boost Interprocess library's fixed managed shared memory. The Boost documentation has given an example of fixed managed shared memory with an address of 0x30000000 . fixed_managed_shared_memory segment (open_only ,"MyFixedAddressSharedMemory" ,(void*)0x30000000 ) My question is how can we gaurentee that this address would be available in the process that would be mapping the shared memory to its address space. What would happen in that case ? Thanks,

1 0

Yahoo! Auto Response
by hardik.kheskani＠yahoo.com 03 Oct '09

03 Oct '09

I use hkheskani(a)gmail.com now, since yahoo doesn't allow me to forward my email there...I just have to inform you in this manner. sorry for the inconvenience. thanks

1 0

[Asio] when stopping io_service, I get a system_error : mutex: invalid argument
by philipp_muenzel＠web.de 03 Oct '09

03 Oct '09

Hello, I'm using asio for a udp receiver. I used the example code from http://www.boost.org/doc/libs/1_40_0/doc/html/boost_asio/example/multicast/… and created a class that in its contructor opens a socket, binds to it, calls async_receive_from, and in the receive handler again calls async_receive from. Now i have manager class that takes care of the io service, the thread, and an instance of the receiver class. Everything works fine until the moment I destroy the manager class. Here is what the destructor looks like: Manager::~Manager { // first, make sure that no further requests are handled that would prevent io_service from quitting m_receiver->getSock()->shutdown(boost::asio::ip::udp::socket::shutdown_both); m_receiver->getSock()->close(); // destroy the receiver by resetting its auto_ptr m_receiver.reset(); // reset the work auto_ptr, destroying the work for io_service, so that it can quit m_io_work.reset(0); // join the thread in which io_service.run() was called. m_receiver_thread.join(); // now stop the io // this line is commented, it has no effect whether i remove the slashes // m_io_service.stop(); } When I destroy the manager, i get the following error: "terminate called after throwing an instance of 'boost::exception_detail::clone_impl<boost::exception::detail::error_info_injector<boost::system::system_error> > ' what(): mutex: Invalid argument" It seems similar to the problem that was discussed here: http://lists.boost.org/Archives/boost/2008/03/134169.php But I'm pretty sure that given I destroy the instance that holds the socket first, the io_service has no work left. I tried catching the exception within the destructor and within the run() of the thread, but no luck. I cannot find the place where the exception is thrown, nor do I have an idea what else to do to ensure the io_service has no work left. Any help on fixing this is greatly appreciated. Regards, Philipp ________________________________________________________________ Neu: WEB.DE Doppel-FLAT mit Internet-Flatrate + Telefon-Flatrate für nur 19,99 Euro/mtl.!* http://produkte.web.de/go/02/

1 0

[Process (Vault)] child::wait error on OS X 10.6
by Rush Manbert 03 Oct '09

03 Oct '09

I am using the version of the Process library that was announced by Boris Schaeling in this document: http://www.highscore.de/cpp/process/ I used the link in the introduction to get the zip file, so I think I have the correct version. I am running the following test function: namespace bp = boost::process; namespace bios = boost::iostreams; int BoostProcessTest (void) { std::cout << "\nTesting launch of child process using Boost.Process\n"; std::string exec = bp::find_executable_in_path("svn"); std::vector<std::string> args; args.push_back("svn"); args.push_back("info"); // context bp::context ctx; // child launch bp::child c = bp::launch(exec, args, ctx); // sleep(1); //wait const bp::status s = c.wait(); // parse status if (s.exited() && s.exit_status() == EXIT_SUCCESS) std::cout << "Directory is a working copy." << std::endl; else std::cout << "Directory is not a working copy." << std::endl; std::cout << std::endl; return 0; } I call this function in a loop for as long as it returns 0, which should be forever. The test is run in a directory that is NOT a svn working copy, so all that the child process does is to write a line to stderr and exit. What I'm seeing, however is this message: Error: Caught an exception! boost::process::child::wait: waitpid(2) failed: Interrupted system call The only way I have found to make that go away is by adding the sleep (1) call (commented out above). Then it runs forever. I'm hoping Boris will read this and have some idea of what's happening. My google searches haven't turned up much of value. - Rush

2 1

[Graph] Type "VertexIndexMap"
by Alexandre Bos 03 Oct '09

03 Oct '09

Hello, I am trying to create an instance of edmonds_augmenting_path_finder : --------- test.cpp --------- #include <boost/graph/adjacency_list.hpp> #include <boost/graph/max_cardinality_matching.hpp> using namespace std; using namespace boost; typedef adjacency_list<vecS, vecS, undirectedS> custom_graph; [...] typedef std::vector<graph_traits<custom_graph>::vertex_descriptor> matemap_t; matemap_t mate(42); custom_graph g(42); edmonds_augmenting_path_finder<custom_graph, matemap_t, property_map<custom_graph, vertex_index_t>::type > augmentator(g, mate, get(vertex_index, g)); [...] --------------------------- The compiler (g++) returns the following error : /.../max_cardinality_matching.hpp: In constructor 'boost::edmonds_augmenting_path_finder<Graph, MateMap, VertexIndexMap>::edmonds_augmenting_path_finder(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::no_property, boost::no_property, boost::listS>, MateMap = std::vector<long unsigned int, std::allocator<long unsigned int> >, VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]': /.../convert.cpp:102: instantiated from here /.../max_cardinality_matching.hpp:190: error: no matching function for call to 'get(std::vector<long unsigned int, std::allocator<long unsigned int> >&, const long unsigned int&)' How can I fix this ? Thank you, Alexandre

2 2