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

Statechart serialization
by mbrodeur65 04 Mar '15

04 Mar '15

Hi, I'm looking for a solution to serialize boost::statechart objects. I'm aware that this feature is on the statechart library todo list but was wondering if there are any workaround to achieve this with the latest boost release (1.34) ? thanks for your help ! mbrodeur65 -- View this message in context: http://www.nabble.com/Statechart-serialization-tf4131326.html#a11749139 Sent from the Boost - Users mailing list archive at Nabble.com.

4 4

[asio] resolver::cancel() problem
by Matthew Edwards 14 Mar '14

14 Mar '14

In my application (and a separate test program) it seems as though the cancel() function on the resolver does not work as intended. For async resolves, the cancel functionality should abort them immediately and pass an 'operation aborted' error code to the callback handler. In my tests, I will resolve an invalid domain (this causes the resolve to take a few seconds, to demonstrate the problem), sleep for 100ms, then call cancel on the resolver object. No cancelling actually occurs, and the callback is simply triggered after a few seconds with a "No host found" error code, not the expected operation aborted. Has anyone experienced this before, or know how I might be using the resolver incorrectly?

3 2

[multi_array] operator= requires resize - why?
by Markus Werle 04 Jun '12

04 Jun '12

Hi! IMHO the behaviour of operator= for multi_array is a little bit broken. A lot of preconditions required: template <typename ConstMultiArray> multi_array_ref& operator=(const ConstMultiArray& other) { [...] // make sure the dimensions agree assert(other.num_dimensions() == this->num_dimensions()); assert(std::equal(other.shape(),other.shape()+this->num_dimensions(), this->shape())); Besides the fact that I get mad about asserts instead of exceptions (please change this to a way users may choose) why do we have such an odd behaviour here? >From page 1, line 3 of the docs I cite: "The interface design is in line with the precedent set by the C++ Standard Library containers" - this is not true for operator=, since std::<container>::operator= works fine for me all the time _without_ any resize. Could we please change the behaviour of multi_array::operator= to take care of resize where in need to? IMHO operator= should result in a true copy ignoring previous state. Markus

6 18

Design for boost::serialization of STL iterators.
by Carlo Wood 23 May '09

23 May '09

On Sat, Mar 11, 2006 at 11:45:36PM +0200, Peter Dimov wrote: > Carlo Wood wrote: > > > 1) WHY does boost::serialization not support serialization > > of iterators? > > It's very hard, if not impossible, in general. It is either impossible or possible. When it is possible, it can't be hard :p I think that at the moment of serialization, the actual container needs to be known. So, only concentrating on the syntax of the code that serializes an iterator, the following cannot work: ar & iter; However, the container will be known at that point (or at least, we might as well assume that). Therefore, I could imagine a syntax like: ar & foobar(container, iter); where 'foobar' is some template function (that will be part of boost::serialization in the future). Lets start with the last one (have to start somewhere). In order to deserialize the iterator (and taken into account that we already have the container) -- which makes me think that it might be better to pass a functor to operator& above. In other words, (at least for writing), use: template<class Container> struct Foobar { Foobar(Container const&, typename Container::const_iterator& iter) : M_container(container), M_iter(iter); private: Container const& M_container; Container::const_iterator& M_iter; }; and then assign to M_iter, whatever we find in M_container. > If you have access to the container to which the iterator i refers: > > a) if the container is a map, you can serialize i->first, then on > deserialization look up the key in the map using .find(); > > b) if the container is a sequence, and it has the same contents on > deserialization as it does on serialization, you can serialize the index of > the element - distance( c.begin(), i ). I don't think that it is a requirement that the whole container has to be read: either it's a map or set, in which case later insertions will not invalidate the container, or it is a vector, in which case we use an index, from which we can construct the end iterators before the whole container is reconstructed. Therefore, the following syntax can work imho: ar & FooBar(container, iter); Would you agree? There are a zillion questions and implementation details open - but I'd like to get anyones feedback about this type of interface for iterators before continuing. Current questions: What is a good name for Foobar? Am I right when I think that Foobar needs to be declared in boost::serialization? Now the hard part (for me) is that part that involves the internals of the boost library. At the moment one tries to serialize an iterator, it is possible (though not necessarily) that the object that the iterator points to is already serialized. In the case that we are dealing with an associative container (map or set etc), we don't want to store the contents of the object (or key part, in the case of a map) again: I'd like to just store that once, and store a reference in the archive at the other place. How can I make the library store an object only the first time and the store a reference the second time? This would be for an object of arbitrary type thus. I think that it is only feasible to do this when it's actually the same object (same memory address), which is the case; but while storing the object element of the container, the address of it isn't stored as well, is it? Is there a way to make: std::set<SomeData> s; [...] ar << s; Store the address of s (&s) along with the contents of s? And would that then automatically cause the library to not store that same object again when I do: std::set<SomeData>::iterator iter = s.find(...); [...] ar << *iter; Because then, &*iter would again be the same memory address as what was stored before. -- Carlo Wood <carlo(a)alinoe.com>

3 2

[BGL] citing the Boost Graph Library
by Alejandro Marcos Aragón 06 May '09

06 May '09

Can anyone point me how to cite the Boost Graph Library in a paper? Is there any information in the boost website? Thank you all, Alejandro Aragón

4 3

Boost Graph Library and Boehm Garbage Collector
by FBSL 08 Sep '08

08 Sep '08

Hello I am having trouble to garbage-collect adjacency_list<>. I have instanciated it with correctly garbage-collected vectors and lists (I have copied vecS and listS definitions, and added Boehm GC's default allocator so that they are garbage-collected). In my application I need to dynamically allocate many graphs, but it does not work, there is a (big) memory leak. Unfortunately, there is no template argument in adjacency_list<> to specify Boehm GC's allocator. Does anyone have a hint ? Snippet code "main.cpp" follows, compiled with Boost Graph Library 1.32, Boehm GC 6.4 and G++ 3.3.5, with command line : $ g++ -o main main.cpp -lgc -lgccpp -- #include <boost/graph/adjacency_list.hpp> #include <gc/gc_allocator.h> #include <gc/gc_cpp.h> #include <iostream> #include <vector> #include <list> using namespace std; using namespace boost; namespace boost { struct collected_vecS {}; struct collected_listS {}; template <class ValueType> struct container_gen<collected_vecS, ValueType> { typedef vector<ValueType,gc_allocator<ValueType> > type; }; template <class ValueType> struct container_gen<collected_listS, ValueType> { typedef list<ValueType,gc_allocator<ValueType> > type; }; template <> struct parallel_edge_traits<collected_vecS> { typedef allow_parallel_edge_tag type; }; template <> struct parallel_edge_traits<collected_listS> { typedef allow_parallel_edge_tag type; }; namespace detail { template <> struct is_random_access<collected_vecS> { enum { value = true }; typedef true_type type; }; } } typedef adjacency_list<collected_vecS, collected_vecS, directedS, no_property, no_property, no_property, collected_listS> graph; int main() { // leaks... while(true){ graph * g=new (UseGC) graph; for(unsigned int i=0; i<100; ++i){ add_vertex(*g); } for(unsigned int i=0; i<100; ++i){ for(unsigned int j=0; j<100; ++j){ add_edge(i,j,*g); } } } }

3 4

[statechart] history transitions make state-local-storage "un-cool"
by Mick Hollins 26 Jun '08

26 Jun '08

Apologies if this has been discussed before, but I couldn't find any mention of it: I am currently using the history facility of boost::fsm. I've discovered that when I re-enter a state, X, via a history transition I don't actually re-enter the same instance of X that I was in before, but instead enter a newly constructed instance of X. I just checked the UML spec regarding history transitions and it says that "Any necessary entry actions are performed", so given that boost::fsm uses constructors to represent entry actions I guess a new instance of X has to be constructed to ensure UML compliance. My actual concern is the effect this has on the "coolness" of state-local-storage (see http://boost-sandbox.sourceforge.net/libs/statechart/doc/faq.html#Whats_so_…) It seems to me that state-local-storage, which I agree is generally cool, is particularly un-cool (and bug-inducing) in the presence of history transitions. I'm not sure what a good alternative is, but just thought I'd raise the discussion. cheers, mick PS: does the history facility display the same semantics in boost::statechart? I plan to move to statechart real soon now ...

4 19

[foreach][range] How would BOOST_REVERSE_FOREACH be implemented?
by Pete Bartlett 05 Mar '08

05 Mar '08

Boost.Foreach is such a great piece of kit that once you start using it you just can't stop. Indeed I like working directly with values rather than iterators so much that is feels normal for me to write something like BOOST_FOREACH( value_type x , make_iterator_range( rbegin( seq ) , rend( seq ) ) whenever I wish to reverse iterate over a sequence. My co-workers are not big fans of typing though, so they want a REVERSE_FOREACH. At first naïve glance it looks easy to implement in terms of the original FOREACH: template<typename C> inline iterator_range</* something */> make_reverse_iterator_range(C& c) { return make_iterator_range( rbegin(c) , rend(c) ); } #define REVERSE_FOREACH( x , container ) BOOST_FOREACH( x , make_reverse_iterator_range( container ) ) This works fine when container is an lvalue. But then co-workers, used to the wonders of the original FOREACH, inevitably start to use the new macro with rvalues and get a crash due to dangling references (- the iterator_range's members point to departed quantities.....) and if you could somehow work around that, there is the issue hidden inside the "/* something */" that you have to cope with fact that MSVC has no proper const rvalue detection. Finally the #define MACRO(x,y) ANOTHER_MACRO( f(x) , g(y) ) style is not recommended because they are brittle in the face of x and/or y themselves being macros. ... but all these issues are exactly the ones that BOOST_FOREACH itself solves! Thus surely it is technically possible to write a REVERSE_FOREACH that works with rvalues as well as lvalues, e.g. by essentially copying and pasting the FOREACH implementation and replacing "begin" and "end" by "rbegin" and "rend" in the vital places. However one feels there may be a better way... has anyone had a go at creating a "fully-functional" REVERSE_FOREACH and could offer me any advice? If indeed the task is fairly intricate and requires re-use of foreach internals, would the library author consider including something in the library itself? Many thanks for reading, Pete Bartlett

4 6

MPL: flatten implementation not working
by Andreas Klöckner 25 Dec '07

25 Dec '07

Hi all, I came up with the following implementation of a "flatten" operation that turns a sequence of sequences into a flat list: 8< ------------------------------------------------------------------- #include <iostream> #include <boost/mpl/vector.hpp> #include <boost/mpl/vector_c.hpp> #include <boost/mpl/clear.hpp> #include <boost/mpl/fold.hpp> #include <boost/mpl/copy.hpp> #include <boost/mpl/placeholders.hpp> #include <boost/mpl/back_inserter.hpp> #include <boost/mpl/size.hpp> template<class Sequence> struct flatten { typedef typename boost::mpl::fold< Sequence, typename boost::mpl::clear<Sequence>::type, typename boost::mpl::copy< boost::mpl::_2, boost::mpl::back_inserter<boost::mpl::_1> >::type >::type type; }; typedef flatten< boost::mpl::vector< boost::mpl::vector_c<int, 0, 1, 2, 3>, boost::mpl::vector_c<int, 4, 5, 6> > >::type flatvec; int main() { std::cout << boost::mpl::size<flatvec>::value << std::endl; } 8< ------------------------------------------------------------------- It compiles (using gcc 4.2.1), but prints 0 instead of the expected 7. What am I doing wrong? Thanks for your help Andreas

2 1

Serialization - 'size_t' to 'std::streamsize' error
by Dave Nay 19 Nov '07

19 Nov '07

Ok....this is really confusing. I successfully created a small test project several months ago using the Boost Serialization library to serialize some binary data. I am now attempting to add binary serialization to a production project, and I receive a bunch of compiler warnings. I can still compile and execute the test application with no warnings or errors. I am using VS2005 with boost 1.34.1 I have included the first few compiler warnings below... 1>C:\Program Files\boost\boost_1_34_1\boost/archive/basic_binary_oprimitive.hpp(136) : warning C4267: 'argument' : conversion from 'size_t' to 'std::streamsize', possible loss of data 1> C:\Program Files\boost\boost_1_34_1\boost/archive/basic_binary_oprimitive.hpp(120) : while compiling class template member function 'void boost::archive::basic_binary_oprimitive<Archive,Elem,Tr>::save_binary(const void *,size_t)' 1> with 1> [ 1> Archive=boost::archive::binary_oarchive, 1> Elem=char, 1> Tr=std::char_traits<char> 1> ] 1> C:\Program Files\boost\boost_1_34_1\boost/archive/detail/oserializer.hpp(91) : see reference to function template instantiation 'void boost::archive::basic_binary_oprimitive<Archive,Elem,Tr>::save<T>(const T &)' being compiled 1> with 1> [ 1> Archive=boost::archive::binary_oarchive, 1> Elem=char, 1> Tr=std::char_traits<char>, 1> T=unsigned char 1> ] 1> C:\Program Files\boost\boost_1_34_1\boost/archive/detail/oserializer.hpp(244) : see reference to function template instantiation 'void boost::archive::save_access::save_primitive<Archive,T>(Archive &,const T &)' being compiled 1> with 1> [ 1> Archive=boost::archive::binary_oarchive, 1> T=unsigned char 1> ] Thanks, Dave -- Dave Nay CIVision, LLC

2 2

Copy from stream to vector
by Ricardo Mayerhofer 10 Nov '07

10 Nov '07

Hi all, I've started to use boost 1 month ago and I'm findind it very helpful indeed. Congratulations for the good job. I have one question, is it possible to use boost to copy from a stream to a container? If so, how do I? eg. with std copy: copy( istream_iterator<string>(FileSource), istream_iterator<FileSource> (), back_inserter( m_StringVector ) ) I wonder if boost copy would make it simpler, but I was not able to use it. It pops up a static assertion failure :( Any help? Thanks. Ricardo

5 10

[reflection] Compilation errors
by Christian Henning 08 Nov '07

08 Nov '07

Hi there, I just pulled the latest reflection code from the sandbox and tried to compile the example. But unfortunately there are compilation errors. For example: c:\boost-sandbox\boost\extension\impl\library_impl.hpp(37) : error C2664: 'LoadLibraryW' : cannot convert parameter 1 from 'const char *' to 'LPCWSTR' Is the relection lib in a usable stage? Thanks, Christian

6 10

[boost-users] [filesystem, format] ambgious overload error.
by chun ping wang 07 Nov '07

07 Nov '07

{ boost::scoped_ptr<boost::filesystem::ofstream> myfile(new boost::filesystem::ofstream(fileOutput)); BOOST_FOREACH(int element, (getKeys<std::vector, int, int>(pMap))) { if (pMap[element] >= min_sup) { std::vector<int> row(1, element); itemsContainer.push_back(row); // (*myfile) << "(" << element << ":" << pMap[element] << ")\n"; (*myfile) << boost::format("(%1%, %2%)\n") % element % pMap[element]; } } } ./cs522/c++/aprioriMain.cpp(79) : error C2593: 'operator <<' is ambiguous C:/boost_msvc/include\boost/format/free_funcs.hpp(33): could be 'std::basic_ostream<_Elem,_Traits> &boost::operator <<<char,std::char_traits<char>,std::allocator<_Ty>>(std::basic_ostream<_Elem,_Traits> &,const boost::basic_format<Ch> &)' [found using argument-dependent lookup] with [ _Elem=char, _Traits=std::char_traits<char>, _Ty=char, Ch=char ] C:/boost_msvc/include\boost/filesystem/path.hpp(617): or 'std::basic_ostream<_Elem,_Traits> &boost::filesystem::operator <<<boost::basic_format<Ch>>(std::basic_ostream<_Elem,_Traits> &,const Path &)' [found using argument-dependent lookup] with [ _Elem=char, _Traits=std::char_traits<char>, Ch=char, Path=boost::basic_format<char> ] while trying to match the argument list '(boost::filesystem::ofstream, boost::basic_format<Ch>)' with [ Ch=char ] note the commented out version works.. this only happens on msvc 2005. it passes on mingw devc++.

1 1

[filesystem] Apparent non-compliant code in current operations.hpp, ...
by Marty Fried 06 Nov '07

06 Nov '07

While building 1_34_1 on various platforms we support, I came across some compile errors for the AIX compiler, xlC/vacpp that weren't caught by gcc or MSVC, possibly due to being hidden by a level of indirection. The errors were mostly undefined classes where the template class was fully defined at the time of instantiation. I apologize if my explanation isn't clear or totally correct - I'm not an expert on the C++ standard, and got a lot of the actual explanation from coworkers that know it better than I do. But it's up to me to do the actual reporting and to try to get it to work for us on all the platforms we support. My original post was a few days ago, with the subject "[filesystem] vacpp errors building 1_34_1 filesystem library on AIX". I am because it may look like a vacpp problem, which is an unsupported compiler, but it's not really. It just happens that xlC was the only compiler that caught the error, I think. My original post can also be read at this link: http://permalink.gmane.org/gmane.comp.lib.boost.user/31028 The problem is that the class basic_directory_iterator is not fully defined until after it is used by remove_all(). There were a few other similar errors which I can provide if someone takes an interest in this. If I am wrong, or if there is a reason this won't be fixed, it would be helpful to know, so we can decide what to do. -- Marty Fried Senior Software Developer, Aldon USA http://www.aldon.com

3 7

SFINAE broken in Visual C++ Express?
by Ovanes Markarian 03 Nov '07

03 Nov '07

Hello! Does anybody else experience a problem using enable_if templates in Visual C++ Express 2005 SP1? I get compiler errors in this code: template<class LookUpType_> typename boost::enable_if_c<is_const, result_type>::type at(LookUpType_ const& key)const { return has_key(view_, key); } template<class LookUpType_> typename boost::disable_if_c<is_const, result_type>::type at(LookUpType_ const& key) { return has_key(view_, key); } It blames that type is not a member of enable_if_c or disable_if_c? This is really strance, since this should not be considered by compiler as a possible template instantiation. is_const is an enum value containing either true or false.

3 4

[boost-users] [program options]
by chun ping wang 02 Nov '07

02 Nov '07

HI how would I use program options to accept multiple input. Example I have a diffieHellmanKeyExchange program running through command prompt. // begin main program #include <iostream> #include <boost/tuple/tuple_io.hpp> #include <boost/program_options.hpp> #include "cppdef/BitOperation.cpp" #include "cppdef/mathfunc.cpp" #include "cppdef/IsPrime.cpp" #include "cppdef/DiffieHellman.cpp" #include <BigInteger.hpp> #include <BigIntegerUtils.hpp> int main( int ac, char* av[] ) { namespace po = boost::program_options; po::options_description desc("Allowed options"); boost::tuple<BigInteger, BigInteger> key_pair; desc.add_options() ("generate", "generates a pair of key") ("secert", po::value(&key_pair), "creates the share secret key"); po::variables_map vm; po::store(po::parse_command_line(ac, av, desc), vm); po::notify(vm); if (vm.count("generate")) { BigInteger my_prime = encryptcpw::random_prime<BigInteger>(&algocpw::Miller_Rabin<BigInteger>, 10); std::cout << "my prime: " << my_prime << "\n"; boost::tuple<BigInteger, BigInteger> pare(encryptcpw::dh_init<BigInteger>( my_prime )); std::cout << "pair of generated number: " << pare << "\n"; } if (vm.count("secert")) { const BigInteger p( encryptcpw::random_prime<BigInteger>(&algocpw::Miller_Rabin<BigInteger>, 10)); std::cout << encryptcpw::dh_secret<BigInteger>( p, boost::tuples::get<0>(key_pair), boost::tuples::get<1>(key_pair)); } } // end program The thing compiles but when I do DiffieHellman.exe --secert 817 697 I get this error. C:\CPW\cs_classes>DiffieHellmanEncrypt --secert 817 697 terminate called after throwing an instance of 'boost::program_options::invalid_ option_value' what(): in option 'secert': invalid option value '817' This application has requested the Runtime to terminate it in an unusual way. Please contact the application's support team for more information.

3 4

custom formatting the current local date time into a string
by Jeff 02 Nov '07

02 Nov '07

Hello, How can I grab the current local date and time, and format it so that it looks like this: YYYY_MMM_DD_HH_MM_SS ? I can't seem to get the facet stuff to work right. Thanks, Jeff

2 1

[boost-users] [general question] deciding to use member function or not.
by chun ping wang 02 Nov '07

02 Nov '07

Hi is their a simple way *at compile time *to determine if a member function exist for a particular instance, if yes than use that function otherwise do not use it. example std::list<int> li; // check if unique is a member function of li, if yes use unique. li.unique(); // else use stl unique. std::unique(li.begin(), li.end());

2 1

Serialization of C dynamic data
by Lorenzo Cavallaro 31 Oct '07

31 Oct '07

Hi, I'm trying to serialize the following piece of code (a data structure whose object size is dynamically allocated and it should use the correct size/len which has been serialized). typedef struct data { char *payload; size_t len; } data_t; vector<data_t *> v; So I added the corresponding serialize function to the structure definition void serialize(Archive & ar, const unsigned int file_version) { ar & len; for (int i = 0; i < len; i++) ar & payload[i]; } Moreover, I added a default constructor which is invoked by the serialization library whenever the object has to be unserialized data::data() { /* no error checking */ payload = (char *)calloc(1, X); len = X; } Now, of course X is fixed. I'd like to reuse the serialized 'size' (ar & size) as argument to the calloc to be able to create an object with the right size instead of having to approximate (exceeding, of course) its real dimension. Do you have any idea how to get it work the way I'd like to, please? -- if it's possible, of course. Nevertheless to say that with a right X everything works fine. I was thinking to iterate over all the elements, after the unserialization step is over, to reallocate payload using the right len... but it sucks :-) TIA, bye Lorenzo -- Lorenzo `Gigi Sullivan' Cavallaro <sullivan(a)security.dico.unimi.it> GPG key at http://security.dico.unimi.it/~sullivan/sullivan.asc Until I loved, life had no beauty; I did not know I lived until I had loved. (Theodor Korner) See the reality in your eyes, when the hate makes you blind. (A.H.X)

2 1

[Boost users] [interprocess]: static_pointer_cast on offset_ptr
by Lars Hagström 31 Oct '07

31 Oct '07

Hi, In offset_ptr.hpp the static_pointer_cast<> &co are commented out. Why is this? I need something of the kind to do casts from a void* to a bool*, for example. Is there something I am missing? Lars

3 4

REGEXP - Serializing regexp ?
by Jacques-Olivier Goussard 31 Oct '07

31 Oct '07

Hi I'm trying to use the boost-regexp package and I'm facing an issue with this. I'm basically applying a replace algo on a list of strings using a huge list of regular expressions. It seems that the boost-regexp API allows me only to either load all regular expressions in memory (i.e creating the regexp at process start) or load one regexp at a time but re-compile it each time. Is there a way to save to disk the compiled version of the regexp (so that the regexp package would not have to re-create the statemachine) ? If not, what would be the best approach for doing this ? Thanks /jog

4 9

Re: [Boost-users] Regex: Invalid preceding regular expression, problem
by Brian Krahmer 31 Oct '07

31 Oct '07

> Nope there's a bug in the options you are using - boost::regex::extended > enables the "POSIX extended" flavour of regular expressions - and these > don't support non-greedy repeats. Use boost::regex::perl if you want to use > these (since you are using Perl-style regexes). > > HTH, John. > That helps very much. Thanks for clearing that up for me, John. brian

1 0

Preprocessor lib question -- how to fold a macro that produces comma in its output across a sequence?
by Yu Di 31 Oct '07

31 Oct '07

Hi, I am trying to use the preprocessor lib to generate something like Cons<a, Cons<b, Cons<c, Cons<d, Nil> > > > from (a) (b) (c) (d) I tried something like #define START(x) Cons<x,Nil> #define ADD(s,state,x) Cons<x,state > #define GENERATE(x) BOOST_PP_SEQ_FOLD_RIGHT(ADD,START(BOOST_PP_SEQ_HEAD(BOOST_PP_SEQ_REVERSE(x))),BOOST_PP_SEQ_POP_BACK(x)) but immediately got into trouble with the commas. The best I can do is to add parentheses around the content of START and ADD, but that generated (Cons<a, (Cons<b, (Cons<c, (Cons<d, Nil>) >) >) >) which is not valid. Is there any way I can achieve the desired output? Thanks, Di, Yu 10.30 __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

2 1

FILE boost\preprocessor\arithmetic\dec.hpp
by question boost 31 Oct '07

31 Oct '07

Hi, I' ve the following error message: FILE C:\Documents and Settings\src\boost\preprocessor\arithmetic\decc.hpp LINE 17 boost/preprocessor/config/config.hpp no such file or directory So I look at decc.hpp, it contains the line # include <boost/preprocessor/config/config.hpp> and I look at the directory C:\Documents and Settings\src\boost\preprocessor\config, it contains the file config.hpp IS ANYONE GOING TO TELL ME WHAT IS THE PROBLEM WITH THOSE BOOST FILES? THANK YOU VERY MUCH David _________________________________________________________________ Vous êtes plutôt Desperate ou LOST ? Personnalisez votre PC avec votre série TV préférée ! http://specials.divertissements.fr.msn.com/SeriesTV.aspx

1 0

graph python bindings : unpickle hangs
by John Reid 31 Oct '07

31 Oct '07

Hi, Unpickling an empty boost.graph seems to hang. E.g. In [1]: import boost.graph as bgl In [2]: g=bgl.Graph() In [3]: import cPickle In [4]: cPickle.dumps(g) Out[4]: 'cboost.graph._graph\nGraph\np1\n(tRp2\n((dp3\nI0\n(l(d(dtb.' In [5]: cPickle.loads(cPickle.dumps(g)) *** never returns *** I'm using the latest SVN revision of bgl-python. John.

1 0