- Boost-users - lists.boost.org

[BGL] Free graph - double free or corruption
by Matthieu BOUSSARD 04 Jan '10

04 Jan '10

Hello, I'm using BGL to construct an exploration graph. At each decision step I have to create a new graph. It seems that I'm not freeing correctly the memory, causing a memory leak. The name of a node in the graph is a pointer to a structure, typedef adjacency_list <listS,vecS, directedS, property<vertex_name_t, state_t *, property<vertex_prop_t,s_prop> >, property<edge_weight_t, float, property<edge_name_t,int> > >Graph; I also use a map to find the vertex according to a given state typedef std::tr1::unordered_map<state_t *, vertex_t> state_vertex_map_t; In the destructor of my planner object, every time I try to free anything (from the map or from the vertices of the graph) I'v got an "double free or corruption" error. Could you help me to find the way to free all the memory ? Thank you. Best regards Matthieu

2 4

Re: [Boost-users] Defining Statements with Proto
by David A. Greene 04 Jan '10

04 Jan '10

On Sunday 03 January 2010 18:55:36 you wrote: > On Sunday 03 January 2010 12:15:59 you wrote: > > > There were a few other small problems, but on the whole, you were > > > pretty close. > > You moved the code around a bit so the diff isn't trivial. What were the > other small problems? Ah, I found one. Duplicated template parameters for the expression rules. -Dave

1 0

[test] Unexpected Exceptions
by Florian Winter 04 Jan '10

04 Jan '10

Hi, What is the intended behavior of Boost.Test if an unexpected exception is thrown? Example: void do_not_throw() throw() { throw "unexpected"; } Some of my applications using Boost.Test seem exit with an error code of 0 (successful) if an unexpected exception is thrown. Is this the intended behavior? Best regards, fw

3 5

[UTF] Accessing global fixture members within tests
by Simon Pickles 04 Jan '10

04 Jan '10

Hi I am using the Unit Test Framework to test my use of boost.python. I am using a global fixture to initialize the python intepreter a single time (rather than before each test). My problem is I would like to use the Python initialising class in my tests, and I can't figure out how to do this. I don't want to use normal fixtures since each test would call initialize the interpreter, causing problems. Here is what I want to do: ////////////////////////////////////////////////////// #include <boost//python.hpp> #include <boost//test//unit_test.hpp> #include "..//pythonManager//pythonManager.h" using namespace boost; // First make a global fixture which sets up python interpreter struct PythonManagerFixture { PythonManagerFixture() { pm.Init(); } PythonManager pm; }; // Set up suite BOOST_AUTO_TEST_SUITE(TestPythonManager) // Only init python interpreter once BOOST_GLOBAL_FIXTURE(PythonManagerFixture); BOOST_AUTO_TEST_CASE(TestInit) { // Get python globals dict python::dict globalDict = python::extract<python::dict>(pm.m_pyGlobals); // COMPILE ERROR 'pm' : undeclared identifier // Has logging module been imported? BOOST_REQUIRE(globalDict.has_key("logging")); } BOOST_FIXTURE_TEST_CASE(TestLogCallback, PythonManagerFixture) // RUNTIME ERROR pm.Init called a second time - bad { function<void(const string&, const string&)> f = pm.GetLogFunction(); // pm is in scope though.... BOOST_REQUIRE(f); } // End the suite BOOST_AUTO_TEST_SUITE_END() /////////////////////////////////////////////////////////////////// I need a way to supply the PythonManager instance, pm, to the test cases. Thanks for any advice Simon

2 3

alignment question
by Slawomir Lisznianski 03 Jan '10

03 Jan '10

I'm having trouble implementing properly aligned storage. The following example shows conceptually what I'm trying to do, but it's NOT a correct way of doing it. template <typename T> struct envelope { size_t len = sizeof(T); // <--- compiler may pad here, hence this doesn't work... T body; }; So, given an arbitrary type T, we want to create an envelope that will have the size of T immediately before it, with no padding between len and body. The user would then be able to: envelope<MyStruct> env; env.body.x = ... send(env); I'm curious if anyone has run into something similar and have a clean solution. Our code currently has to defer to temporary buffers and memcpy'ing data back to it. Thanks, Slaw

3 2

Re: [Boost-users] regex
by ninti＠internode.on.net 03 Jan '10

03 Jan '10

Thanks for your help, linking was exactly the problem. As you can no doubt tell, I'm new not only to Boost but C++ in general. If you have the patience for one more newbie question ... I have the following code (in a FastCGI++ web application). The intention is to sanitise user input by allowing only alphanumeric characters, spaces, full stops and hyphens, simply replacing everything else with underscores: std::string input_name = environment.posts["name"].value; std::string filler = "_"; boost::regex re("[^a-zA-Z0-9\s.-]"); std::string output_name = boost::regex_replace(input_name, re, filler); Compilation fails with the following error: contact.cpp: In member function ‘virtual bool Contact::response()’: contact.cpp:48: error: unknown escape sequence '\s' The regex works fine with the \s removed (but of course replaces all spaces with underscores). These alternatives compile OK but don't work (program still replaces all spaces with underscores): [^a-zA-Z0-9\\s.-] [^a-zA-Z0-9[:space:].-] I know this is going to be something pretty basic, but how can I include whitespace - non-breaking, breaking, tabs, newlines, the lot - in the regex above as symbols to NOT be replaced? Thanks again Mike

2 1

regex
by ninti＠internode.on.net 03 Jan '10

03 Jan '10

Boost 1.40 on CentOS 5.3 64bit: I have #included <boost/regex.hpp> in a file but get the following compile time error: /tmp/ccXM0HkR.o: In function `boost::basic_regex<char, boost::regex_traits<char, boost::cpp_regex_traits<char> > >::assign(char const*, char const*, unsigned int)': contact.cpp:(.text._ZN5boost11basic_regexIcNS_12regex_traitsIcNS_16cpp_regex_traitsIcEEEEE6assignEPKcS7_j[boost::basic_regex<char, boost::regex_traits<char, boost::cpp_regex_traits<char> > >::assign(char const*, char const*, unsigned int)]+0x27): undefined reference to `boost::basic_regex<char, boost::regex_traits<char, boost::cpp_regex_traits<char> > >::do_assign(char const*, char const*, unsigned int)' collect2: ld returned 1 exit status This file definitely exists at /usr/include/boost/regex.hpp. Another Boost #include in the same file (<boost/date_time/posix_time/posix_time.hpp>) produces no error. 'ldconfig -p' lists libboost_regex.so. What am I doing wrong? Thanks Mike

2 1

regex again
by ninti＠internode.on.net 03 Jan '10

03 Jan '10

Sorry if this is double-posted, but my webmail has stripped angle brackets and their contents out of my previous email ... Boost 1.40 on CentOS 5.3 64bit: I have #included boost/regex.hpp in a file but get the following compile time error (mangled by webmail): /tmp/ccXM0HkR.o: In function `boost::basic_regex boost::cpp_regex_traits > >::assign(char const*, char const*, unsigned int)': contact.cpp:(.text._ZN5boost11basic_regexIcNS_12regex_traitsIcNS_16cpp_regex_traitsIcEEEEE6assignEPKcS7_j[boost::basic_regex boost::regex_traits > >::assign(char const*, char const*, unsigned int)]+0x27): undefined reference to `boost::basic_regex > >::do_assign(char const*, char const*, unsigned int)' collect2: ld returned 1 exit status The important bit appears to be 'undefined reference to boost__basic_regex' etc This file definitely exists at /usr/include/boost/regex.hpp. Another Boost #include in the same file (boost/date_time/posix_time/posix_time.hpp) produces no error. 'ldconfig -p' lists libboost_regex.so. What am I doing wrong? Thanks Mike

1 0

[Accumulators] Evaluation of Expression Tree
by Horst S 02 Jan '10

02 Jan '10

Hello! Given an expression tree over mathematical expressions like 'sum', 'min', 'product', etc. and a fixed number of variables X1..Xn like the following, would it be possible to use BOOST Accumulators to re-evaluate the root evaluation function based on changes in the values of the variables efficiently? sum / \ / \ min product / \ / / \ X1 X2 X3 X4 Note that variables appear only as leaf nodes. Obviously, one can flatten the tree to the following expression: RootValue = sum( min(X1,X2), product(X2,X3,X4) ) Assuming that the current values of the variables are X1=3, X2=4, X3=2, X4=2 then RootValue evaluates to 19. Now setting X2=2 results in 10. The main objective is to minimize the cost of computing the value of the root evaluation function when changing the value of a subset of variables in X1..Xn. One can assume that the subset of variables that changes each time is rather small (typically only one) and the size of the expression tree is rather large. Are BOOST Accumulators a suitable way to model such kind of expressions and the corresponding incremental evaluation? Thanks!

2 1

[boost] [program options] Recommended way to specify a list of strings
by Sanjit Jhala 01 Jan '10

01 Jan '10

Say I want to specify a list of servers via the boost program_options library. Something like: --total-servers N --server srv1 --server srv2 ... --server srvN How would I do this? It doesn't look like multitoken would work for this case, so would it be better for me to just have something like: --total-servers N --serverlist srv1 srv2 ... srvN and use a single string to store the serverlist and parse it myself? -Sanjit

4 6