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

[multi-index] hashed_unique and sequenced question
by Ovanes Markarian 26 Apr '07

26 Apr '07

Hello, Is there any way to find an element in the multi-index container by it's hash and proceed with all elements which were added later on in the sequence after it? With Kind Regards, Ovanes Markarian

2 1

[BLL] Right usage of he placeholder _1 ?
by pheres 26 Apr '07

26 Apr '07

Hello, I've two problems so far with a simple for_each: 1. vector<string*> v2(10); fill(v2.begin(), v2.end(), new string("hehe")); for_each(v2.begin(), v2.end(), cout << *_1 << " "); // works for_each(v2.begin(), v2.end(), delete _1 ); // error // error: type ‘const struct // boost::lambda::lambda_functor<boost::lambda::placeholder<1> // >’ argument given to ‘delete’, expected pointer Shouldn't the placeholder _1 actually become a (string-)pointer as it obviously does in the expression above ( cout << *_1 << " " )? 2. Is it possible to call member functions from an placeholder of a boost-like lambda expression? vector<string> v3(10); fill(v3.begin(), v3.end(), "hoho"); for_each(v3.begin(), v3.end(), cout << _1->c_str() << " "); // error // error: base operand of ‘->’ has non-pointer type ‘const // boost::lambda::lambda_functor<boost::lambda::placeholder<1> >’ Thank you for any input!

2 1

[program_options] Problem with custom parser and boolean options
by Tarjei Knapstad 26 Apr '07

26 Apr '07

I'm trying to support non-conventional syntax on the form "option=value", where boolean options are given as "option=on" or "option=off". For this I've implemented a custom parser that splits a string on the '=' character and returns a std::pair<std::string, std::string> containing the option and it's value. This works fine for most things except I can't figure out how to handle boolean options. I've tried the following which just makes the option "disappear" if it's set to "off" and returns a pair with the option and an empty string as value if it's set to "on". It works for "off", but for "on" I get an exception stating "extra parameter in 'option'". Is there any way to get around this? Here's my custom parser: //---------------- START: code std::pair<std::string, std::string> custom_parser(std::string const & s) { std::pair<std::string, std::string> option; if (s.find("=") != std::string::npos) { std::vector<std::string> slist; boost::split(slist, s, boost::is_any_of("=")); if (slist[1] == "on") { option.first = slist[0]; } else if (slist[1] == "off") { // Return an empty option if the feature is turned off } else { option.first = slist[0]; option.second = slist[1]; } } return option; } //-------------- END: code Any help appreciated! Regards, -- Tarjei

1 0

[multi_index] inherit from a multi_index
by Guillaume Lazzara 26 Apr '07

26 Apr '07

Hi, I would like to know if it is safe to create a struct and make it inherit from a multi_index. Actually I already tried but I got this error: /usr/include/boost/multi_index_container.hpp:204: warning: base class 'struct boost::multi_index::detail::header_holder<boost::multi_index::detail::ordered_index_node<boost::multi_index::detail::index_node_base<vcsn::InitialValue<vcsn::rat::exp<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, float> > > >, boost::multi_index::multi_index_container< [...] >, boost::multi_index::indexed_by<boost::multi_index::ordered_unique<boost::multi_index::member<vcsn::InitialValue<vcsn::rat::exp<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, float> >, [...] >' should be explicitly initialized in the copy constructor Is it an issue due to Boost or because I'm doing something really bad? Thanks, -- Guillaume Lazzara Epita CSI 2008

2 2

regex_replace -- format_default
by ivan＠0x4849.net 26 Apr '07

26 Apr '07

Hi I am trying to use boost::regex_replace but I am having trouble understanding the format to use for the the format string. The Ecma-262.pdf rules for how to create a format string seem quite terse. Does anyone know of a reference that has some more examples? Here is the code I am trying to write: #include <boost/regex.hpp> #include <string> #include <iostream> int main(int argc, char** argv) { std::string str; boost::regex expression("abc"); std::string fmt(""); // WHAT GOES HERE? fn = "abcabcabc"; boost::regex_replace(str, expression, fmt); std::cout << str << std::endl; return 0; } Thank you, Ivan Novick http://www.0x4849.net

2 1

boost::random::normal_distribution
by Jeffrey Brent McBeth 26 Apr '07

26 Apr '07

#include <boost/random.hpp> #include <iostream> int main(int argc, char *argv[]) { boost::mt19937 eng; boost::normal_distribution<> norm(0,1); std::cout << norm(eng) << std::endl; } Gives me a NaN everytime. Looking at the code, it doesn't really surprise me, as _r1 = eng(); _r2 = eng(); _cached_rho = sqrt(-result_type(2)*log(result_type(1)-_r2)); would only work if eng were in the range (0,1) with 0 being degenerate, and 1 being undefined. Looking through the mt19937, that is returning a full UInt32. Perhaps those two eng() should be replaced by uniform_01? Jeffrey McBeth -- ---------------------------------------------------------------------------- Hofstadter's Law states: It always takes longer than you expect, even when you take into account Hofstadter's Law. ----------------------------------------------------------------------------

2 1

newbie problem with Boost.Serialization
by John Pye 26 Apr '07

26 Apr '07

Hi all, I have some trouble with the Boost.Serialization library. I have compiled the 'demo.cpp' example, and now I am trying to distill it a little, so that I can understand how to apply it to my own polymorphic class hierarchy. However I keep seeing the same error message, and can't work out what it means. In /usr/include/boost/archive/detail/oserializer.hpp:567 there are some comments about the error message I'm seeing but I don't understand what those comments mean. I'm using Boost 1.33.1-7ubuntu1 on Ubuntu 6.10. Any help would be much appreciated! Cheers JP Here is the error message: --------------8<--------------- jpye@john:~/boosttest$ scons scons: Reading SConscript files ... scons: done reading SConscript files. scons: Building targets ... g++ -o ser1.o -c ser1.cpp /usr/include/boost/archive/detail/oserializer.hpp: In function 'void boost::archive::save(Archive&, T&) [with Archive = boost::archive::text_oarchive, T = dd]': /usr/include/boost/archive/basic_text_oarchive.hpp:78: instantiated from 'void boost::archive::basic_text_oarchive<Archive>::save_override(T&, int) [with T = dd, Archive = boost::archive::text_oarchive]' /usr/include/boost/archive/detail/interface_oarchive.hpp:78: instantiated from 'Archive& boost::archive::detail::interface_oarchive<Archive>::operator<<(T&) [with T = dd, Archive = boost::archive::text_oarchive]' ser1.cpp:43: instantiated from here /usr/include/boost/archive/detail/oserializer.hpp:567: error: invalid application of 'sizeof' to incomplete type 'boost::STATIC_ASSERTION_FAILURE<false>' scons: *** [ser1.o] Error 1 scons: building terminated because of errors. jpye@john:~/boosttest$ -------------------------------------- Here is the code that was being compiled: -----------------8<--------------- jpye@john:~/boosttest$ cat ser1.cpp #include <iomanip> #include <iostream> #include <fstream> #include <string> #include <boost/archive/tmpdir.hpp> #include <boost/archive/text_iarchive.hpp> #include <boost/archive/text_oarchive.hpp> #include <boost/serialization/base_object.hpp> #include <boost/serialization/utility.hpp> #include <boost/serialization/list.hpp> class dd{ friend std::ostream&operator<<(std::ostream&,const dd&); friend class boost::serialization::access; double x,y; template<class Archive> void serialize(Archive & ar, const unsigned int /* file_version */){ ar & y & x; } public: // every serializable class needs a constructor dd(){}; dd(double x, double y) : x(x), y(y) {} }; std::ostream & operator<<(std::ostream &os, const dd &d) { return os << d.x << ' ' << d.y; } int main(int argc, char *argv[]){ dd D(10,20); int x = 5; std::cerr << D << std::endl; std::ofstream ofs("test.txt"); boost::archive::text_oarchive oa(ofs); oa << x; oa << D; return 0; } -------------------------------------- And, just for completeness, my build file: --------------8<---------------- jpye@ascendserver:~/boosttest$ cat SConstruct Program("test",["ser1.cpp"], LIBS=['boost_serialization']) ------------------------------------

2 3

Re: [Boost-users] [Serialization, XML] - how to get info "where am i?" in serialization helper (encoding is not recursive)?
by Frank Bergemann 26 Apr '07

26 Apr '07

Hi Gary, you made my day - many thanks! Seems we have done similar things :-) Just a final question: Could you tell me, what these defines are about? I didn't adopt them and the modules seems to be ok without. > > #define BOOST_ARCHIVE_CUSTOM_IARCHIVE_TYPES datastore::ConfigIArchive > #define BOOST_ARCHIVE_CUSTOM_OARCHIVE_TYPES datastore::ConfigOArchive > Cheers! \Frank _______________________________________________________________ SMS schreiben mit WEB.DE FreeMail - einfach, schnell und kostenguenstig. Jetzt gleich testen! http://f.web.de/?mc=021192

4 5

BOOST_CLASS_EXPORT conflicts with xml_iarchive.hpp
by Oleg V. Zhylin 26 Apr '07

26 Apr '07

Hello All, Could someone please help me to understand why code below fails to compile with STATIC_ASSERTION_FAILURE in basic_xml_iarchive.hpp // If your program fails to compile here, its most likely due to // not specifying an nvp wrapper around the variable to // be serialized. BOOST_STATIC_ASSERT(0 == sizeof(T)); Code does compile if BOOST_CLASS_EXPORT line is commeted out. #include <boost/archive/xml_iarchive.hpp> class A { friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & i; } int i; }; #include <boost/serialization/export.hpp> BOOST_CLASS_EXPORT(A) int main() { } WBR Oleg V. Zhylin ovz(a)yahoo.com __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

3 5

Filesystem - Recurse directories function?
by Jeff 25 Apr '07

25 Apr '07

I am wondering if someone would possibly post a recursive function that prints out all files and sub-directories. I've never created a recursive function before and I'm having problems getting all files and directories to print. Thank You

3 2

Boost topological_sort attempts to advance a dereferencable iterator 20 steps outside the valid range
by Stephen Torri 25 Apr '07

25 Apr '07

I am still trying to understand why boost graph's topological_sort fails for a test program I have made to sort five vertexes. Originally I compiled this program against boost 1.33.1 on a Fedora Core 6 system using gcc-4.1.1. After receiving no response from the boost-users list that could solve this problem I read the Reporting Bug document on the boost website. I followed the CVS instructions and checked out a copy from the HEAD (reported as boost-1.35) and built it. I used the following flags: bjam -sHAVE_ICU=1 -d2 -sTOOLS=gcc -sBUILD=release -sEXPAT_INCLUDE=/usr/include -sEXPAT_LIBPATH=/usr/lib stage Afterwards I installed it and rebuilt the test program. It is still failing inside the topological_sort. The output of the program is below along with the test program source code. Stephen --------- OUTPUT ------------ [storri@localhost infrastructure]$ ./test_dag Added edge: 1 -> 20 Number of edges is 1 Added edge: 1 -> 30 Number of edges is 2 Added edge: 1 -> 40 Number of edges is 3 Added edge: 1 -> 5 Number of edges is 4 Added edge: 20 -> 5 Number of edges is 5 Added edge: 30 -> 5 Number of edges is 6 Added edge: 40 -> 5 Number of edges is 7 /usr/lib/gcc/i386-redhat-linux/4.1.1/../../../../include/c ++/4.1.1/debug/safe_iterator.h:277: error: attempt to advance a dereferenceable (start-of-sequence) iterator 20 steps, which falls outside its valid range. Objects involved in the operation: iterator @ 0x0xbfead0fc { type = N11__gnu_debug14_Safe_iteratorIN9__gnu_cxx17__normal_iteratorIPN5boost18default_color_typeEN10__gnu_norm6vectorIS4_SaIS4_EEEEEN15__gnu_debug_def6vectorIS4_S8_EEEE (mutable iterator); state = dereferenceable (start-of-sequence); references sequence with type `N15__gnu_debug_def6vectorIN5boost18default_color_typeESaIS2_EEE' @ 0x0xbfead0fc } Aborted ----------- CODE --------------- #include <boost/graph/adjacency_list.hpp> #include <boost/shared_ptr.hpp> #include <boost/cstdint.hpp> #include <boost/format.hpp> #include <boost/graph/topological_sort.hpp> #include <iostream> #include <map> class Component; class Graph_Base { public: typedef boost::property< boost::vertex_index_t, boost::uint32_t, boost::property< boost::vertex_name_t, boost::shared_ptr<Component> > > VertexProperty_t; typedef boost::adjacency_list< boost::setS, // OutEdgeList boost::setS, // VertexList boost::directedS, // Directed VertexProperty_t > // VertexProperties Graph_t; typedef boost::adj_list_vertex_property_map<Graph_Base::Graph_t, boost::shared_ptr<Component>, const boost::shared_ptr<Component>&, boost::vertex_name_t> Property_Map_const_t; }; class Component { public: typedef boost::shared_ptr<Component> ptr_t; Component ( boost::uint32_t id ) : m_id ( id ) {} ~Component () { m_source_list.clear(); } // Now part of Component_Data void set_Data_Source ( uint32_t id ) { if ( ! m_source_list.insert ( std::make_pair ( id, false ) ).second ) { std::cerr << "WARNING: Attempted to add a duplicate component id."; std::cerr << std::endl; std::cerr << "Ignoring component id." << std::endl; } } std::map<boost::uint32_t, bool>::const_iterator get_Source_List_Begin() const { return m_source_list.begin(); } std::map<boost::uint32_t, bool>::const_iterator get_Source_List_End() const { return m_source_list.end(); } boost::uint32_t get_ID (void) const { return m_id; } private: boost::uint32_t m_id; std::map<boost::uint32_t, bool> m_source_list; }; class Component_Graph { public: typedef boost::graph_traits<Graph_Base::Graph_t>::vertex_descriptor Vertex_t; typedef boost::graph_traits<Graph_Base::Graph_t>::edge_descriptor Edge_t; typedef std::map<uint32_t, Vertex_t> IdVertexMap_t; Component_Graph () {} void add_Component ( Component::ptr_t obj_ptr ) { bool no_duplicate; IdVertexMap_t::iterator pos; Vertex_t node; if ( obj_ptr.get() == 0 ) { std::cerr << boost::format("Exception throw in %s at line %d") % __FILE__ % __LINE__ << std::endl; return; } boost::tie (pos, no_duplicate) = m_index.insert (std::make_pair(obj_ptr->get_ID(), node)); if ( no_duplicate ) { // Insertion was successful // Make a new vertex and return handle to 'node' node = add_vertex(m_graph); // Get list of Components boost::property_map<Graph_Base::Graph_t, boost::vertex_name_t>::type clist = boost::get(boost::vertex_name, m_graph); // Assign component to vertex position clist[node] = obj_ptr; // Add vertex handle to map position pos->second = node; // Get list of indexes boost::property_map<Graph_Base::Graph_t, boost::vertex_index_t>::type ilist = get(boost::vertex_index, m_graph); ilist[node] = obj_ptr->get_ID(); for ( std::map<boost::uint32_t,bool>::const_iterator cpos = obj_ptr->get_Source_List_Begin(); cpos != obj_ptr->get_Source_List_End(); ++cpos ) { this->add_Child ( (*cpos).first, obj_ptr ); } } else { std::cerr << "ERROR: Duplicate source found. Skipping Component" << std::endl; return; } } void add_Child ( uint32_t parent_id, Component::ptr_t obj_ptr ) { IdVertexMap_t::iterator pos; IdVertexMap_t::iterator cpos; if ( obj_ptr.get() == 0 ) { std::cerr << boost::format("Exception throw in %s at line %d") % __FILE__ % __LINE__ << std::endl; return; } pos = m_index.find (parent_id); cpos = m_index.find ( obj_ptr->get_ID() ); if (pos == m_index.end()) { std::cerr << "ERROR: Cannot find parent. Skipping adding component #" << obj_ptr->get_ID() << std::endl; return; } // Add edge from parent to child Edge_t link; if (! (add_edge ( pos->second, cpos->second, m_graph).second)) { std::cerr << "ERROR: Duplicate edge exists from " << parent_id << " to " << obj_ptr->get_ID() << std::endl; } else { std::cout << boost::format("Added edge: %d -> %d") % parent_id % obj_ptr->get_ID() << std::endl; std::cout << "Number of edges is " << num_edges ( m_graph ) << std::endl; } } Graph_Base::Graph_t const& get_Graph () const { return m_graph; } Component::ptr_t get_Component (const Vertex_t& node) const { Graph_Base::Property_Map_const_t clist = get(boost::vertex_name, m_graph); return clist[node]; } private: Graph_Base::Graph_t m_graph; IdVertexMap_t m_index; }; int main (int, char**) { // CREATE Component_Graph Component_Graph m_graph; // Create Components Component::ptr_t node_one ( new Component ( 1 ) ); Component::ptr_t node_twenty ( new Component ( 20 ) ); node_twenty->set_Data_Source ( 1 ); Component::ptr_t node_thirty ( new Component ( 30 ) ); node_thirty->set_Data_Source ( 1 ); Component::ptr_t node_forty ( new Component ( 40 ) ); node_forty->set_Data_Source ( 1 ); Component::ptr_t node_five ( new Component ( 5 ) ); node_five->set_Data_Source ( 1 ); node_five->set_Data_Source ( 20 ); node_five->set_Data_Source ( 30 ); node_five->set_Data_Source ( 40 ); // Add Components to Graph m_graph.add_Component ( node_one ); m_graph.add_Component ( node_twenty ); m_graph.add_Component ( node_thirty ); m_graph.add_Component ( node_forty ); m_graph.add_Component ( node_five ); // Call topological_sort on graph typedef std::vector<Component_Graph::Vertex_t> m_container; m_container comp_list; boost::topological_sort ( m_graph.get_Graph(), std::back_inserter ( comp_list ) ); std::cout << "A topological ordering: "; for ( m_container::reverse_iterator ii = comp_list.rbegin(); ii != comp_list.rend(); ++ii ) { Component::ptr_t comp_ptr = m_graph.get_Component ( *ii ); std::cout << comp_ptr->get_ID() << " "; } std::cout << std::endl; return 0; }

1 0

math toolkit review
by Arnaldur Gylfason 25 Apr '07

25 Apr '07

Hi, This is my contribution to the boost::math review. This is a partial review of components 1) and 2) mentioned in the formal review announcement, i.e. 1) the statistical distributions and 2) special functions. ? What is your evaluation of the design? Very good in my opinion. I think using global functions is very appropriate in libraries such as this one. ? What is your evaluation of the implementation? I did not look at the implementation but I compared it with another implementation and it compares favorably. More on this below. ? What is your evaluation of the documentation? Very clear. I only browsed it, but that was enough to get the feel for the library and start using it right away. ? What is your evaluation of the potential usefulness of the library? Very useful in applications that deal with anything related to statistics or probability. ? Did you try to use the library? With what compiler? Did you have any problems? Yes I used it on a Linux box using g++ 4.0.2. No problems, except I was using version 1.33.0 of boost so I had to change all use of tuple to be in namespace tuples. Took a short time though. ? How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? I guess a quick reading plus I wrote 2 small test programs that compare accuracy and speed with implementations from the R-project. ? Are you knowledgeable about the problem domain? I have been working in a development group in a Statistics department of a genetics company for several years so I guess I'm fairly knowledgeable. ? Do you think the library should be accepted as a Boost library? Yes, definitely. The test programs are compareAccuracy.cc and compareSpeed.cc. The programs were compiled with g++ 4.0.2 using -O3 and run on a Linux box with Intel Xeon 2.4 GHz. I can give more info on this if anyone needs more info. comparAccuracy calls several statistical distribution functions over a range of values, comparing results with what similar routines from the R-project give. The output gives the maximum abs difference and maximum of relative absolute difference between boost::math and R. The results were: norm pdf max diff: 5.55112e-17 norm pdf max rel diff: 2.20594e-16 t pdf max diff: 1.11022e-16 t pdf max rel diff: 1.17145e-15 norm cdf max diff: 1.11022e-16 norm cdf max rel diff: 2.55269e-15 t cdf max diff: 1.59317e-14 t cdf max rel diff: 3.18634e-14 F pdf max diff: 1.77636e-15 F pdf max rel diff: 7.05565e-14 F cdf max diff: 5.55112e-16 F cdf max rel diff: 1.56512e-14 chi2 pdf max diff: 5.55112e-17 chi2 pdf max rel diff: 4.26471e-14 chi2 cdf max diff: 3.46945e-16 chi2 cdf max rel diff: 6.27547e-14 exp pdf max diff: 0 exp pdf max rel diff: 0 exp cdf max diff: 0 exp cdf max rel diff: 0 gamma pdf max diff: 2.77556e-17 gamma pdf max rel diff: 3.84987e-15 gamma cdf max diff: 1.11022e-16 gamma cdf max rel diff: 1.85721e-15 lognorm pdf max diff: 1.11022e-16 lognorm pdf max rel diff: 2.21914e-16 lognorm cdf max diff: 1.11022e-16 lognorm cdf max rel diff: 1.43305e-15 cauchy pdf max diff: 0 cauchy pdf max rel diff: 0 cauchy cdf max diff: 1.11022e-16 cauchy cdf max rel diff: 2.2064e-16 weibull pdf max diff: 1.11022e-16 weibull pdf max rel diff: 2.22042e-16 weibull cdf max diff: 0 weibull cdf max rel diff: 0 norm quantile max diff: 8.88178e-16 norm quantile max rel diff: 4.00185e-16 t quantile max diff: 4.07907e-14 t quantile max rel diff: inf F quantile max diff: 1.11022e-15 F quantile max rel diff: 1.08231e-15 F quantile max diff: 1.11022e-15 F quantile max rel diff: 1.08231e-15 chi2 quantile max diff: 4.26326e-14 chi2 quantile max rel diff: 3.92646e-16 exp quantile max diff: 5.55112e-17 exp quantile max rel diff: 2.11093e-16 gamma quantile max diff: 3.55271e-15 gamma quantile max rel diff: 3.56265e-16 lognorm quantile max diff: 1.42109e-14 lognorm quantile max rel diff: 9.10487e-16 cauchy quantile max diff: 2.17426e-12 cauchy quantile max rel diff: 0.104537 weibull quantile max diff: 1.11022e-16 weibull quantile max rel diff: 2.0992e-16 uniform pdf max diff: 0 uniform pdf max rel diff: 0 uniform cdf max diff: 0 uniform cdf max rel diff: 0 uniform quantile max diff: 0 uniform quantile max rel diff: 0 beta pdf max diff: 1.11022e-15 beta pdf max rel diff: 3.14562e-15 beta cdf max diff: 4.44089e-16 beta cdf max rel diff: 2.9679e-15 beta quantile max diff: 2.22045e-16 beta quantile max rel diff: 8.38281e-16 binom pdf max diff: 2.08167e-17 binom pdf max rel diff: 0.00011212 binom cdf max diff: 9.4369e-16 binom cdf max rel diff: 3.46145e-14 poisson pdf max diff: 1.04083e-17 poisson pdf max rel diff: 1.05393e-13 poisson cdf max diff: 0 poisson cdf max rel diff: 0 nbinom pdf max diff: 1.38778e-17 nbinom pdf max rel diff: 1.16396e-13 nbinom cdf max diff: 8.88178e-16 nbinom cdf max rel diff: 2.37872e-15 lgamma max diff: 1.13687e-13 lgamma max rel diff: 0.211576 tgamma max diff: 7.43092e+142 tgamma max rel diff: 9.15759e-14 A few results need comment. ->t quantile max diff: 4.07907e-14 ->t quantile max rel diff: inf Here division by 0 gives inf. max diff is quite acceptable though. Some guards should be placed to handle 0 or near 0 but I haven't done it. I'm not worried about the accuracy but anyone may feel free to remedy this. ->cauchy quantile max diff: 2.17426e-12 ->cauchy quantile max rel diff: 0.104537 Here we are almost surely again dividing by something near 0. Similar comments as above apply. ->lgamma max diff: 1.13687e-13 ->lgamma max rel diff: 0.211576 Same old story ->tgamma max diff: 7.43092e+142 ->tgamma max rel diff: 9.15759e-14 At the higher end of the range tgamma gives such high numbers, that max diff doesn't tell us much. max rel diff gives acceptable results though. No quantile comparisons are given for the discrete distributions since R always returns integers but boost::math gives fractional values. It depends on application what you want obviously but giving results within the range (discrete in this case) is in some sense more natural. All in all I am quite happy with the results. Obviously R could be wrong but it's use is widespread in the Statistics community so it should be very well tested. comparSpeed calls a few statistical distribution functions repeatedly (see code), timing the loop, repeating the same thing for the R version. The output is the time in second: N repeats = 5000000 R norm pdf: 1.31 boost::math norm pdf: 1.1 R norm cdf: 1.49 boost::math norm cdf: 0.27 R norm quantile: 0.75 boost::math norm quantile: 1.83 R lgamma: 4.02 boost::math lgamma: 7.4 N repeats = 1000000 R t pdf: 0.91 boost::math t pdf: 4.85 R t cdf: 0.17 boost::math t cdf: 0.03 R t quantile: 12.88 boost::math t quantile: 56.15 R F pdf: 0.06 boost::math F pdf: 0.05 R F cdf: 0.07 boost::math F cdf: 0.85 R F quantile: 18.59 boost::math F quantile: 54.54 The results vary somewhat but this would be acceptable for my applications. quantile functions seem to be somewhat slower in boost::math than in R. Maybe they're more accurate. More detailed analysis would be called for if people are concerned about this. The 2 test programs are attached to this message. If they're somehow scrambled, anyone can write to me and ask for them. Last but certainly not the least, my compliments to the authors of boost::math ;-) cheers Arnaldur Gylfason, deCODE genetics

2 1

Regex match problem
by Kalin Nakov 25 Apr '07

25 Apr '07

Hi, I experience big troubles with regex matching. The code below should obviously match 'abc', but does not, because it tries to match the whole string. If r='abcdefg', then match is successfull, but if it is only 'abc' and input is 'abcdef', the match always fails as described below. boost::match_results<std::string::const_iterator> m; std::string inp = "abcdefg"; boost::regex r = "abc"; if (!boost::regex_match(inp, m, r, boost::match_default)) // always fails, don't know why How can I successfully match 'abc' agains input 'abcdefg'? Thank you very much in advance, Kalin

2 1

Re: [Boost-users] Regex match problem
by KLINIK Markus SDI2-G (AREVA NP GmbH) 25 Apr '07

25 Apr '07

You are right, regex_match tries to match the whole input string. What you want is regex_search. Best Regards Markus

1 0

Serialization and filesystem::path
by Hughes, James 25 Apr '07

25 Apr '07

Hello all, Am I right in thinking that I need to provide serialization support for filesystem::path myself because it is not built in to the serialization libraries? If that is the case, what is the best way to go about it? I had thought it was built in originally, but not been able to get things to compile - have I missed something? James This message (including any attachments) contains confidential and/or proprietary information intended only for the addressee. Any unauthorized disclosure, copying, distribution or reliance on the contents of this information is strictly prohibited and may constitute a violation of law. If you are not the intended recipient, please notify the sender immediately by responding to this e-mail, and delete the message from your system. If you have any questions about this e-mail please notify the sender immediately.

2 1

[std][msvc++][vs2005sp1] unable to open iostream with greek letters in path name
by TOL Tsagarakis Manos 25 Apr '07

25 Apr '07

Hello everyone, I know this is not a boost related issue, but I hope someone has a solution. The question is very simple and should not even be asked: “How can I open a file using std::iostreams, if the files full path, contains Greek letters (or probably any other language except English)?” The test case below shows part of the problem as it successfully opens the file using std::oftream and writes some Greek in it. Then I can read back its contents using std::ifstream. Now the file name in windows explorer or command line should be "ελληνικό όνομα αρχείου.txt" (in case you can't read this, it is "greek file name.txt"). But instead it becomes "åëëçíéêü üíïìá áñ÷åßïõ.txt" Actually when this is done by a full MFC application it is impossible to open the file! I get assertion failure! I use MS Visual Studio 2005 sp1 and std lib and CRT that comes with it. Has anyone faced this problem before? Do I have to do something special in order to be able to use standard iostreams library with Greek file names? Thank you in advanced, Emmanuil Tsagarakis // test_greek_filenames.cpp compile with: /EHsc #include <iostream> #include <fstream> #include <iterator> #include <algorithm> #include <string> #include <vector> #include <assert.h> using namespace std; namespace { struct string_by_line : std::string { }; std::istream & operator >> (std::istream & is, string_by_line & strLine) { getline(is, strLine); return is; } const string s_strFileName("ελληνικό όνομα αρχείου.txt"); } int main(int argc, char **argv) { ofstream ofs; ofs.open(s_strFileName.c_str()); assert(ofs.good()); ofs << "Writing to file ..." << endl; ofs << "Ελληνικά περιεχόμενα στο αρχείο (greek file contents) ..." << endl; ofs.close(); ifstream ifs; ifs.open(s_strFileName.c_str()); assert(ifs.good()); std::vector<std::string> vecContents; std::copy(std::istream_iterator<string_by_line>(ifs ), std::istream_iterator<string_by_line>(), std::back_inserter(vecContents)); for (size_t i=0; i<vecContents.size(); ++i) cout << vecContents.at(i) << endl; ifs.close(); }

2 2

Re: [Boost-users] [SPAM] - Re: [bind, regex] strange MSVC 7.1 compiler effect: Members ofunnamednamespace are put in boost::re_detail when stdafx.hincludesbind.hpp and regex.hpp - E-Mail-Adresse wurde in Betreff-Zeile gefunden.
by Stefan Felkel 25 Apr '07

25 Apr '07

> -----Ursprüngliche Nachricht----- > Von: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org]Im Auftrag von > John Maddock > Gesendet: Mittwoch, 25. April 2007 11:38 > An: boost-users(a)lists.boost.org > Betreff: [SPAM] - Re: [Boost-users] [bind,regex] strange MSVC 7.1 > compiler effect: Members ofunnamednamespace are put in > boost::re_detail > when stdafx.hincludesbind.hpp and regex.hpp - E-Mail-Adresse wurde in > Betreff-Zeile gefunden. > > > Stefan Felkel wrote: > > Hi there, > > > > I have a strange compiler effect with Microsoft Visual Studio.NET > > 2003 and boost 1.33.1 in a project that uses bind and regex. All > > Symbols defined in an unnamed namespace are part of the namespace > > boost::re_detail::'anonymous-namespace'. The effect occurres when I > > use precompiled headers and bind.hpp is included before regex.hpp. > > > > This is my stdafx.h which is used to generate the > precompiled header: > > > > #pragma once > > > > #include <boost/bind.hpp> > > #include <boost/regex.hpp> > > > > This is the main source file: > > > > #include "stdafx.h" > > #include "boost/current_function.hpp" > > > > namespace { > > void foo( void ) > > { > > printf( "%s\n", BOOST_CURRENT_FUNCTION ); > > } > > } > > > > int main( int argc, char * argv[] ) > > { > > foo(); > > return 1; > > } > > > > The program generates this output: > > > > void __cdecl boost::re_detail::`anonymous-namespace'::foo(void) > > > > instead of the expected output: > > > > void __cdecl `anonymous-namespace'::foo(void) > > > > When I change the include order in stdafx.h so that regex.hpp is > > included before bind.hpp the output is as expected. > > Has someone else came across such a problem? Is it a compiler bug? > > Weird indeed, I don't believe it's our problem as such: > except that both > regex and bind use unnamed namespaces. Looks like the poor > compiler is > getting confused :-( > > John. > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users > I think you're right - Microsoft Visual Studio.NET 2005 doesn't have this problem. Stefan

1 0

Adapter to object instance
by MainBrain 25 Apr '07

25 Apr '07

Hello, im looking through http://www.boost.org/libs/functional/index.html, there are ways to access a class method but i cant find a way to access a method of an object. How can i write an adapter for "instance.bar()" in this example: class foo { int _i; public: bar(); // manipulates _i } instance; Greetings, Yelve Yakut -- View this message in context: http://www.nabble.com/Adapter-to-object-instance-tf3632838.html#a10144039 Sent from the Boost - Users mailing list archive at Nabble.com.

2 2

[bind, regex] strange MSVC 7.1 compiler effect: Members of unnamed namespace are put in boost::re_detail when stdafx.h includes bind.hpp and regex.hpp
by Stefan Felkel 25 Apr '07

25 Apr '07

Hi there, I have a strange compiler effect with Microsoft Visual Studio.NET 2003 and boost 1.33.1 in a project that uses bind and regex. All Symbols defined in an unnamed namespace are part of the namespace boost::re_detail::'anonymous-namespace'. The effect occurres when I use precompiled headers and bind.hpp is included before regex.hpp. This is my stdafx.h which is used to generate the precompiled header: #pragma once #include <boost/bind.hpp> #include <boost/regex.hpp> This is the main source file: #include "stdafx.h" #include "boost/current_function.hpp" namespace { void foo( void ) { printf( "%s\n", BOOST_CURRENT_FUNCTION ); } } int main( int argc, char * argv[] ) { foo(); return 1; } The program generates this output: void __cdecl boost::re_detail::`anonymous-namespace'::foo(void) instead of the expected output: void __cdecl `anonymous-namespace'::foo(void) When I change the include order in stdafx.h so that regex.hpp is included before bind.hpp the output is as expected. Has someone else came across such a problem? Is it a compiler bug? Regards, Stefan

2 1

Re: [Boost-users] [program_options] missing typed_value
by Romulus 24 Apr '07

24 Apr '07

>> Hi everybody, [...] >> Here is the error message: >> option_groups.cpp: In function 'int main(int, char**)': >> option_groups.cpp:42: error: 'class >> boost::program_options::typed_value<std::basic_string<char, >> std::char_traits<char>, std::allocator<char> >, char>' has no member named >> 'implicit' >Can you please post some sample here, how you are trying to use it? I >assume there is a problem >with implicit function operator () call. But it would be clearer if you post >some usage sample >here. >With Kind Regards, >Ovanes Markarian The problem occurs with the sample file (attached) : /usr/share/doc/libboost-doc/examples/libs/program_options/example/option_groups.cpp Regards

2 1

boost::thread::thread() crashes in pthread_create
by Venikov, Andy 24 Apr '07

24 Apr '07

Hi all, recently I had to move from Mandrake to RedHat linux. On the new system, a simple thing like this crashes: <------- test.cpp #include <boost/thread/thread.hpp> void * Thread1() { //sleep some time return 0; } int main(int, char**) { boost::thread thread1(Thread1); thread1.join(); return 0; } --------> The crash happens in the create_pthread call in boost::thread constructor. Here's the build command: g++ -c test.cpp g++ test.o ../boost/stage/lib/libboost_thread-gcc-mt.a -lpthread Outuput of g++ --version: g++ (GCC) 3.4.5 20051201 (Red Hat 3.4.5-2) Output of uname -a: Linux joe.rps.local 2.6.9-34.ELsmp #1 SMP Fri Feb 24 16:54:53 EST 2006 i686 i686 i386 GNU/Linux Everythink worked fine on Mandrake. I followed exactly the same steps to build boost on the new system.... Thanks, Andy.

2 1

Maps: one-to-one one-to-many many-to-many
by Travis Parks 24 Apr '07

24 Apr '07

Hello: I am constantly trying to jump into boost. However, I can only read so many pages of documentation before my brain explodes. I have always been interested in a data structure for storing pairs of of keys. In math it is a one-to-one mapping. I find it useful from time to time to have a container that allows me to treat it like an enum, but then to do the operation the other way. I usually do it lazily and just do a map and then do a linear search for the value when I need to. However, I have been thinking about it, and why should I have to suffer linear half the time? So today I wrote a very ugly class that does it log n both ways for me. I did it in less than 30 minutes so it has three methods, namely, insert, get_by_first and get_by_second. It is exceptionally ugly because you have to guaruntee that you will never change the data structure by returning a reference to one of the keys. Worse, if you want to save memory and make sure comparisons work the way you expect them, you have to use two maps of pointers with custom comparison functions that call the user's comparison function with the key-pointers dereferenced! I am wondering if there is something like this already out there already. Or is there a better way of dealing with my issue? I want structures that let me go on to things like one-to-many and many-to-many as well. Of course, what would "many" look like? Would it be an array of the mapped values? Perhaps I should stick with one-to-one! Finally, what would be a good name for this structure? I have been calling it bi-directional map. But this name doesn't carry well for one-to-many and many-to-many. And what should the interface look like? This structure is kind of hard to map to a STL container's interface due to the two keys (no operator[] for instance and no mapped_type or key_type). Thanks for any input! Ask if you want my horrible source code. Ever see two const_casts in one line? Want to?

4 3

SPACE problem in replace_all_regex
by llwaeva＠21cn.com 24 Apr '07

24 Apr '07

Hi there, I am using replace_all_regex to do a batch replace, for instance replace_all_regex( source, boost::regex("(xxx)|(yyy)"), string("(?1 FIRST)(?2 SECOND)"), format_all ); the format string is seperated with (?N XXX) pattern, where N is a decimal number. Using the format string shown above, all xxx will be replaced with " FIRST" (no quotation mark) and yyy will be replaced with " SECOND" (no quotation mark) instead of "FIRST" and "SECOND" (no extra space). Someone said the problem can be solved by rewriting the format string as string("(?1FIRST)(?2SECOND)") However, if the replacing string also begins with a decimal string, this approach doesn't work. For example, if I want to replace xxx with "55FIRST" (without quotation mark), the following function will TRANSLATE: replace the N0. 155 pattern with FIRST, but not replace N0.1 pattern with 55FIRST replace_all_regex( source, boost::regex("(xxx)"), string("(?155FIRST)"), format_all ); How can I solve such probelm? Thanks

1 0

Help installing (building) boost - Windows2K w/ MSVC++
by Beauregard Dommit 23 Apr '07

23 Apr '07

I'm trying to install boost on Windows 2000 running Visual C++, and having lots of problems. It's W2K w/ SP4, and SP6 for Visual Studio. First, I take it there is no precompiled "install" package, even for Windows? First problem - I unpack boost and put bjam in the boost directory. I run it from a command prompt w/ something like (I've tried a few variations): bjam "-sTOOLS=msvc" "--prefix=C:\program files\boost" "--PYTHON-ROOT=C:\Program Files\Python25" "--with-python-version=2.5" "--builddir=G:\temp\buildboost" install > install_log.txt (Sorry for whatever the mailer might be doing to the text - the above is one line.) I also tried the command line with lower case for the Python stuff - the above was my last desperate attempt. In my output file I see: skipping Boost.Python library build due to missing or incorrect configuration couldn't find Python.h in "c:/Python25/include" You can configure the location of your python installation by setting: PYTHON_VERSION - The 2-part python Major.Minor version number (e.g. "2.2", NOT "2.2.1") - currently "2.5" etc................ I guess I'm doing something stupid here, but what? Jam is apparently finding the prefix and builddir OK - it does build boost, or at least part of it, and installs a bunch of libraries and includes in the right place. I do have Python installed and working in C:\Program Files\Python25, and Python.h is there. Second problem - after the above, I get about 2000 lines of errors, or mostly errors. A lot of them are duplicates, but still that doesn't seem good. The first ones are about the Program Options package. That was the part of Boost I was going to try using first, so I'd like to get that fixed. Here are the error msgs: vc-C++ G:\temp\buildboost\bin\boost\libs\program_options\build\libboost_program_options.lib\msvc\debug\runtime-link-static\cmdline.obj cmdline.cpp G:\Temp\newboost\boost_1_33_1\boost/program_options/options_description.hpp(156) : error C2258: illegal pure syntax, must be '= 0' G:\Temp\newboost\boost_1_33_1\boost/program_options/options_description.hpp(156) : error C2252: 'm_default_line_length' : pure specifier can only bespecified for functions G:\Temp\newboost\boost_1_33_1\boost/program_options/options_description.hpp(159) : error C2065: 'm_default_line_length' : undeclared identifier Then a bunch of errors about the Bind package, etc, etc, etc. If someone can help me fix the above problems I'll be very grateful. Gard

4 3

Re: [Boost-users] [Serialization, XML] - how to get info "where am i?" in serialization helper (encoding is not recursive)?
by Frank Bergemann 23 Apr '07

23 Apr '07

Hi Robert, when i use this xml_oarchive wrapper: /*************************** * * xml_oarchive wrapper * ***************************/ template <class Archive> class xml_oarchive_orga_impl : public xml_oarchive_impl<Archive> { #ifdef BOOST_NO_MEMBER_TEMPLATE_FRIENDS public: #else friend class detail::interface_oarchive<Archive>; friend class xml_oarchive_impl<Archive>; friend class save_access; protected: #endif xml_oarchive_orga_impl(std::ostream & os, unsigned int flags) : xml_oarchive_impl<Archive>(os, flags) { }; ~xml_oarchive_orga_impl() { } ; template<class T> void save_override( #ifndef BOOST_NO_FUNCTION_TEMPLATE_ORDERING const #endif boost::serialization::nvp<T> & t, int i ){ MakeNVPPathConcat(t.name()); xml_oarchive_impl<Archive>::save_override(t, i); } }; // do not derive from this class. If you want to extend this functionality // via inhertance, derived from xml_iarchive_orga_impl instead. This will // preserve correct static polymorphism. class xml_oarchive_orga : public xml_oarchive_orga_impl<xml_oarchive_orga> { public: xml_oarchive_orga(std::ostream & os, unsigned int flags = 0) : xml_oarchive_orga_impl<xml_oarchive_orga>(os, flags) {} ~xml_oarchive_orga() { }; }; ... i got a compile error: /nfs/usta/FBergemann/SCMws/OPSC_DIAXHBS_dev_R1.8_provcorba/include/boost/archive/detail/interface_oarchive.hpp: In member function `Archive& boost::archive::detail::interface_oarchive<Archive>::operator<<(T&) [with T = const boost::archive::version_type, Archive = boost::archive::xml_oarchive_orga]': /nfs/usta/FBergemann/SCMws/OPSC_DIAXHBS_dev_R1.8_provcorba/include/boost/archive/detail/common_oarchive.hpp:34: instantiated from `void boost::archive::detail::co mmon_oarchive<Archive>::vsave(boost::archive::version_type) [with Archive = boost::archive::xml_oarchive_orga]' /nfs/usta/FBergemann/SCMws/OPSC_DIAXHBS_dev_R1.8_provcorba/include/boost/archive/detail/iserializer.hpp:557: instantiated from here /nfs/usta/FBergemann/SCMws/OPSC_DIAXHBS_dev_R1.8_provcorba/include/boost/archive/detail/interface_oarchive.hpp:78: error: no matching function for call to `boost::archive::xml_oarchive_orga:: save_override(const boost::archive::version_type&, int)' Do i have to add different overloads for save_override(...) in my class - even if i do NOT want to change the ones from the base class? \Frank > -----Ursprüngliche Nachricht----- > Von: "Frank Bergemann" <FBergemann(a)web.de> > Gesendet: 23.04.07 08:25:14 > An: boost-users(a)lists.boost.org > Betreff: Re: [Boost-users] [Serialization, XML] - how to get info "where am i?" in serialization helper (encoding is not recursive)? > > Hi Robert, > > > -----Ursprüngliche Nachricht----- > > Von: boost-users(a)lists.boost.org > > Gesendet: 23.04.07 01:37:58 > > An: boost-users(a)lists.boost.org > > Betreff: Re: [Boost-users] [Serialization, XML] - how to get info "where am i?" in serialization helper (encoding is not recursive)? > > > > > > Frank Bergemann wrote: > > > i use an external XML format for configuration of CORBA (MICO) data > > > and managed to align that with boost::serialization > > > (To not write my own encoder/decoder and to minimize efforts for my > > > module, in case the customer wants more CORBA objects/methods in > > > future. Actually i think it would be a good options to let generate > > > the boost::serialitzation helper file directly by MICO idl compiler.) > > > > What is the boost::serialitzation helper file? Oh maybe its what i called a > > wrapper > > i meant the serialize(...) functions. > The ones, which are related to the CORBA data types are plain simple now, directly related to the IDL file - e.g. > > template<class Archive> > void serialize(Archive & ar, > ::EmiHLRINData::HLRINData_V4::DCsiList_s &pInstance, > const unsigned int version) > { > ar & make_nvp_wrapper( "d_csi_opt", pInstance.d_csi_opt ); > ar & make_nvp_wrapper( "neg_ph_vlr", pInstance.neg_ph_vlr ); > ar & make_nvp_wrapper( "cap", pInstance.cap ); > ar & make_nvp_wrapper( "d_csi", pInstance.d_csi ); > ar & make_nvp_wrapper( "lowph", pInstance.lowph ); > ar & make_nvp_wrapper( "lowac", pInstance.lowac ); > } > > I saved it in a file.cc.template and let it be expanded for the Archives i use (e.g. file_xml_oarchive.cc). > So i can pre-compile the whole stuff in a library. And only re-compile, if the IDL files change. > ( Using templates it took ages to compile my module :-) ) > > > > > > OK, for this now i have to check, that the (external, non by > > > boost::serialization generated) XML image is _actually_ compliant with > > > C/C++ data structures - especially for dynamic sized data. That is > > > also covered now, the checks do fine. > > > > How much time/effort did it take to do this? > > > > Was not that much. > I have a XML "catalogue" of CORBA commands, for each cmd referring to CORBA object, method of object & related root data objects (holding event/subscriber variables inside, to be expanded). > Then I use boost::serialization save(xml_oarchive,...) to create a *dummy* reference object. > I traverse this one with some XML lib. And while traversing, i lookup corresponding positions in my XML formatted configuration file (for data to fill-into the boost::serialization image) and update the value in boost::serialization XML image. > Then i use load(xml_oarchive, ...) to create the C/C++ object, populated with my "real" data now. > I save all the objects needed for a command in a boost::any container (for invoking a generic CORBA-object/method dispatcher). > All this alignment stuff will be shifted to process startup phase. > In the end it's better than writing my own XML decoder for each CORBA data object. > It is much more generic using your boost::serialization lib :-) > > > > But what i didn't manage is to get the _location_ of error in the XML > > > file - in case there is an error. > > > > Hmmm - location as ? point to the line/character? current name? or ? > > location in XML data structure (XML-path). > > > > > > opsc_hlr :2204 084723:D:### invoked for <value> > > > opsc_hlr :2204 084723:D:### c'tor > > > opsc_hlr :2204 084723:D:### done for <value> > > > opsc_hlr :2204 084723:D:### d'tor > > > > > So there is no recursion(???). > > > > > Is there another way to get a "where am i" information within a > > > serialize (load/save) helper? > > > > make_...wrapper is not recurssive, save/load are. > > > > I would derive from xml_?archive and override the save(NVP(T)..) and/or > > load(NVP...) to capture/whatever the tags as they are read/writting. Don't > > forget to call the original save/load. > > Could you pls refer to short example for deriving from xml_?archive ? > > > Robert Ramey > > > > \Frank > _______________________________________________________________ SMS schreiben mit WEB.DE FreeMail - einfach, schnell und kostenguenstig. Jetzt gleich testen! http://f.web.de/?mc=021192

2 1

[multi_index] using boost::tuple and hash_unique
by Ovanes Markarian 23 Apr '07

23 Apr '07

Hello, unfortunately I can't figure out how to specify member access for a hash function to a hash indexed mult-index container containing boost::tuple. I would like to hash by the first tuple member only. Can someone help? Here is an example: typedef boost::tuples::tuple<std::string, int, some_other_type> my_tuple; struct hash {}; multi_index_container< my_tuple , indexed_by< hashed_unique<tag<hash>, ???? , other_index_type... > > hashed_container; I would like this tuple to be hashed by the first member. boost::tuple has no access member function to the first member. The only way to access it is: my_tuple t("aaa", 10, xyz); std::string s(get<0>(t)); but as I can see the doc for multi_index it supports only access through a member function or by using the hash function which is applied to the whole object. The second scenario does not suit well, since I must pass an object instance to the hasher, where I would like to pass a name only. Should I write my own key_extractor class? Any help is appreciated. With Kind Regards, Ovanes

2 4

[iostreams] replacement of std::ifstream, review request
by Sascha Ochsenknecht 23 Apr '07

23 Apr '07

Hi, I made a library which gets an std::ifstream and read a certain file format. Now I would like to support also gzip compressed input files, but it should also support not compressed files. I used boost::iostreams to implement a new stream class which should replace the std::ifstream in my library. Following functions are called from std::ifstream: - std::ifstream(const char*) - read(...) - seek(...) - close(...) My question is, is everything done correctly or is there a more elegant way to implement this? I'm not a stream expert, so I doubt if I do it in a good way :-). Would be great if someone from the experts can have a look to it and review it. Thanks in advance, Sascha I derived my class from boost::iostreams::filtering_istream, here is my implementation: #ifndef PAT_INPUTSTREAM_H #define PAT_INPUTSTREAM_H #include <boost/iostreams/device/file.hpp> #include <boost/iostreams/filter/gzip.hpp> #include <boost/iostreams/filtering_stream.hpp> #include <string> namespace my { namespace io = boost::iostreams; /*! Check if a given file is a (gzipped-)compressed format It is using functions from zlib */ bool isCompressed(const char* p_name); /*! \class ifstream Special input stream to handle compressed files. After opening an my::ifstream, it should be checked with is_open() if it is openend correctly. */ class ifstream : public io::filtering_istream { private: std::string _name; // the filename is needed for re-opening in seek() public: ifstream(const char* p_name) : _name(p_name) { if (isCompressed(p_name)) { io::filtering_istream::push(io::gzip_decompressor()); io::filtering_istream::push(io::file_source(p_name, std::ios::binary)); } else { io::filtering_istream::push(io::file_source(p_name)); } } bool open(const char* p_name) { if (!is_open()) { _name = p_name; if (isCompressed(p_name)) { io::filtering_istream::push(io::gzip_decompressor()); io::filtering_istream::push(io::file_source(p_name, std::ios::binary)); } else { io::filtering_istream::push(io::file_source(p_name)); } } return is_open(); } void close() { if (is_open()) { while (io::filtering_istream::size()) { io::filtering_istream::pop(); } } } bool is_open() { if (io::filtering_istream::size()) { // the last components is the file device io::file_source* device = io::filtering_istream::component<io::file_source>(io::filtering_istream::size()-1); if (device) return device->is_open(); } return false; } ifstream& seekg(std::streampos p_pos) { // seek means close the stream // and read until position is reached were we // want to be if (is_open()) { close(); if (open(_name.c_str())) { const std::streampos PAT_BLOCK_SIZE = 1024; char* buf = new char[PAT_BLOCK_SIZE]; while (p_pos) { if (p_pos / PAT_BLOCK_SIZE) { read(buf, PAT_BLOCK_SIZE); p_pos -= PAT_BLOCK_SIZE; } else { read(buf, p_pos % PAT_BLOCK_SIZE); p_pos -= (p_pos % PAT_BLOCK_SIZE); } } delete [] buf; } } return *this; } }; } // end of namespace pat #endif

1 0

[program_options] missing typed_value implicit()
by Romulus 23 Apr '07

23 Apr '07

Hi everybody, I'm trying the program_options library, I'd like to create my own options groups, but when i compile (using -lboost_program_options) option_groups.cpp from the example directory, i'm told that "implicit()" method from the typed_value class doesn't exist. Btw it doesn't appear in http://www.boost.org/doc/html/typed_value.html What is "implicit()" supposed to do, is it different from "default_value()" ? How can i solve this problem ? Here is the error message: option_groups.cpp: In function 'int main(int, char**)': option_groups.cpp:42: error: 'class boost::program_options::typed_value<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, char>' has no member named 'implicit' Regards -- Romuald THION Doctorant level 3.0 "la vie, c'est comme un jeu mal foutu dont on ne connait pas les règles et où il n'y a pas de sauvegardes"

2 1

Including boost threads
by Christian Mol 23 Apr '07

23 Apr '07

Hello, Probably a newbie question, but here it goes: if I include the boost thread as follows #include <boost/thread/thread.hpp> and try to compile my library in MSVC++ 2005, I get a lot of errors in c:\boost\include\boost-1_33_1\boost\bind\mem_fn_template.hpp I have included a piece of the errorlog next: 3>c:\boost\include\boost-1_33_1\boost\bind\mem_fn_template.hpp(120) : error C2917: '_av *' : invalid template-parameter 3>c:\boost\include\boost-1_33_1\boost\bind\mem_fn_template.hpp(126) : error C2146: syntax error : missing ';' before identifier 'second_argument_type' 3> c:\boost\include\boost-1_33_1\boost\bind\mem_fn_template.hpp(171) : see reference to class template instantiation 'boost::_mfi::mf1<R,T,_av>' being compiled 3>c:\boost\include\boost-1_33_1\boost\bind\mem_fn_template.hpp(126) : error C4430: missing type specifier - int assumed. Note: C++ does not support default-int 3>c:\boost\include\boost-1_33_1\boost\bind\mem_fn_template.hpp(126) : error C4430: missing type specifier - int assumed. Note: C++ does not support default-int ...... ...... >c:\boost\include\boost-1_33_1\boost\bind\mem_fn_template.hpp(581) : error C2917: '_av *' : invalid template-parameter 3>c:\boost\include\boost-1_33_1\boost\bind\mem_fn_template.hpp(581) : error C2991: redefinition of template parameter '_av' 3> c:\boost\include\boost-1_33_1\boost\bind\mem_fn_template.hpp(581) : see declaration of '_av' 3>c:\boost\include\boost-1_33_1\boost\bind\mem_fn_template.hpp(581) : fatal error C1003: error count exceeds 100; stopping compilation Could someone give me any pointers to what could be the problem? When using it in a very simple program, it does work. Including it in my quite large library it does not work. Kind regards, Christian

2 2

Boost and Intellisense...
by Graham Reitz 23 Apr '07

23 Apr '07

This is probably a little out of scope but I am hoping that someone has gotten this to work. A code line like this: boost::filesystem::path working_path_a( boost::filesystem::current_path() ); ...causes vstudio 2005 intellisense to stop working. It says this 'No additional Information Available' at the bottom. Anything before that line and intellisense works fine and anything after it doesn't. Any help would be greatly appreciated. As a relatively new user to boost having this feature really helps out. Thanks, Graham

9 10

[boost][thread] boost::thread::condition documentation error
by David Callu 23 Apr '07

23 Apr '07

Hi, I found an error in the boost::thread::condition documentation. The member-function template <typename L, typename Pr> bool timed_wait(L& lock, const xtime& xt, Pr pred) is documented like this template<typename ScopedLock, typename Pred> bool timed_wait(ScopedLock&, Pred); The "const xtime&" parameter is discard. Regards David Callu

1 0

[tribool] indeterminate becomes false
by Ken Klose 23 Apr '07

23 Apr '07

tribool theBool(indeterminate); cout << "theBool <" << boolalpha << theBool << ">" << endl; prints out theBool <false> What am I missing? An #include? A 'using' declaration? Both? Thanks, Ken

2 1

Re: [Boost-users] [Serialization, XML] - how to get info "where am i?" in serialization helper (encoding is not recursive)?
by Frank Bergemann 23 Apr '07

23 Apr '07

Hi Robert, > -----Ursprüngliche Nachricht----- > Von: boost-users(a)lists.boost.org > Gesendet: 23.04.07 01:37:58 > An: boost-users(a)lists.boost.org > Betreff: Re: [Boost-users] [Serialization, XML] - how to get info "where am i?" in serialization helper (encoding is not recursive)? > > Frank Bergemann wrote: > > i use an external XML format for configuration of CORBA (MICO) data > > and managed to align that with boost::serialization > > (To not write my own encoder/decoder and to minimize efforts for my > > module, in case the customer wants more CORBA objects/methods in > > future. Actually i think it would be a good options to let generate > > the boost::serialitzation helper file directly by MICO idl compiler.) > > What is the boost::serialitzation helper file? Oh maybe its what i called a > wrapper i meant the serialize(...) functions. The ones, which are related to the CORBA data types are plain simple now, directly related to the IDL file - e.g. template<class Archive> void serialize(Archive & ar, ::EmiHLRINData::HLRINData_V4::DCsiList_s &pInstance, const unsigned int version) { ar & make_nvp_wrapper( "d_csi_opt", pInstance.d_csi_opt ); ar & make_nvp_wrapper( "neg_ph_vlr", pInstance.neg_ph_vlr ); ar & make_nvp_wrapper( "cap", pInstance.cap ); ar & make_nvp_wrapper( "d_csi", pInstance.d_csi ); ar & make_nvp_wrapper( "lowph", pInstance.lowph ); ar & make_nvp_wrapper( "lowac", pInstance.lowac ); } I saved it in a file.cc.template and let it be expanded for the Archives i use (e.g. file_xml_oarchive.cc). So i can pre-compile the whole stuff in a library. And only re-compile, if the IDL files change. ( Using templates it took ages to compile my module :-) ) > > > OK, for this now i have to check, that the (external, non by > > boost::serialization generated) XML image is _actually_ compliant with > > C/C++ data structures - especially for dynamic sized data. That is > > also covered now, the checks do fine. > > How much time/effort did it take to do this? > Was not that much. I have a XML "catalogue" of CORBA commands, for each cmd referring to CORBA object, method of object & related root data objects (holding event/subscriber variables inside, to be expanded). Then I use boost::serialization save(xml_oarchive,...) to create a *dummy* reference object. I traverse this one with some XML lib. And while traversing, i lookup corresponding positions in my XML formatted configuration file (for data to fill-into the boost::serialization image) and update the value in boost::serialization XML image. Then i use load(xml_oarchive, ...) to create the C/C++ object, populated with my "real" data now. I save all the objects needed for a command in a boost::any container (for invoking a generic CORBA-object/method dispatcher). All this alignment stuff will be shifted to process startup phase. In the end it's better than writing my own XML decoder for each CORBA data object. It is much more generic using your boost::serialization lib :-) > > But what i didn't manage is to get the _location_ of error in the XML > > file - in case there is an error. > > Hmmm - location as ? point to the line/character? current name? or ? location in XML data structure (XML-path). > > > opsc_hlr :2204 084723:D:### invoked for <value> > > opsc_hlr :2204 084723:D:### c'tor > > opsc_hlr :2204 084723:D:### done for <value> > > opsc_hlr :2204 084723:D:### d'tor > > > So there is no recursion(???). > > > Is there another way to get a "where am i" information within a > > serialize (load/save) helper? > > make_...wrapper is not recurssive, save/load are. > > I would derive from xml_?archive and override the save(NVP(T)..) and/or > load(NVP...) to capture/whatever the tags as they are read/writting. Don't > forget to call the original save/load. Could you pls refer to short example for deriving from xml_?archive ? > Robert Ramey > \Frank _______________________________________________________________ SMS schreiben mit WEB.DE FreeMail - einfach, schnell und kostenguenstig. Jetzt gleich testen! http://f.web.de/?mc=021192

1 0

[Serialization, XML] - how to get info "where am i?" in serialization helper (encoding is not recursive)?
by Frank Bergemann 22 Apr '07

22 Apr '07

i use an external XML format for configuration of CORBA (MICO) data and managed to align that with boost::serialization (To not write my own encoder/decoder and to minimize efforts for my module, in case the customer wants more CORBA objects/methods in future. Actually i think it would be a good options to let generate the boost::serialitzation helper file directly by MICO idl compiler.) OK, for this now i have to check, that the (external, non by boost::serialization generated) XML image is _actually_ compliant with C/C++ data structures - especially for dynamic sized data. That is also covered now, the checks do fine. But what i didn't manage is to get the _location_ of error in the XML file - in case there is an error. I tried use an make_nvp_wrapper: class MakeNVPPathConcat { std::string org; public: static std::string make_nvp_path_; // TODO: make private, use accessor MakeNVPPathConcat(std::string name) { org = make_nvp_path_; make_nvp_path_ += (make_nvp_path_.empty())? "" : "::"; make_nvp_path_ += name; } ~MakeNVPPathConcat() { make_nvp_path_ = org; } }; namespace boost { namespace serialization { /************************************************ * * boost::serialization::make_nvp(...) wrapper * ************************************************/ template<class T> inline #ifndef BOOST_NO_FUNCTION_TEMPLATE_ORDERING const #endif boost::serialization::nvp<T> make_nvp_wrapper (const char * name, T & t ) { std::string strName ( name ); MakeNVPPathConcat makeNVPPathConcat( strName ); return boost::serialization::make_nvp<T>( name, t ); } } // namespace serialization } // namespace boost Then using the ( i hoped ) recursively concatenated path information e.g. here: template<class Archive, int TID, int max> void load ( Archive & ar, BoundedSequenceTmpl<CORBA::Short, TID, max> &p, const unsigned int version) { std::string const myname("boost::serialization::load[BoundedSequenceTmpl<CORBA::Short, TID, max>]"); std::string str; ar & make_nvp_wrapper("value", str); std::string::size_type strlength = str.size(); if (strlength > p.maximum()) { std::ostringstream err; err <<myname << " - internal error: can't import XML image for <" << MakeNVPPathConcat::make_nvp_path_ << "> (type CORBA object BoundedSequenceTmpl<CORBA::Short, TID, max>) - size #" << strlength << " exceeds maximum length #" << p.maximum(); throw std::runtime_error(err.str()); } p.length(strlength); for (std::string::size_type pos=0; pos<strlength; ++pos) { p[pos] = str.at(pos); } } But it didn't work. I was 1st wondering if my MakeNVPPathConcat might go out of scope too early. But finally i found out, that the serialize (load&save) helpers are not invoked recursively(???) Because if i use a modified version of my wrapper: class MakeNVPPathConcat // TODO: hide this one { std::string org; public: // TODO: make private, use accessor static std::string make_nvp_path_; MakeNVPPathConcat(std::string name) { OUSTprotoDebug("### c'tor"); org = make_nvp_path_; make_nvp_path_ += (make_nvp_path_.empty())? "" : "::"; make_nvp_path_ += name; } ~MakeNVPPathConcat() { // make_nvp_path_ = org; OUSTprotoDebug("### d'tor"); make_nvp_path_ += "-- reset --"; } }; namespace boost { namespace serialization { /************************************************ * * boost::serialization::make_nvp(...) wrapper * ************************************************/ template<class T> inline #ifndef BOOST_NO_FUNCTION_TEMPLATE_ORDERING const #endif boost::serialization::nvp<T> make_nvp_wrapper (const char * name, T & t ) { OUSTprotoDebug("### invoked for <%s>", name); std::string strName ( name ); MakeNVPPathConcat makeNVPPathConcat( strName ); boost::serialization::nvp<T> ret = boost::serialization::make_nvp<T>( name, t ); OUSTprotoDebug("### done for <%s>", name); return ret; } } // namespace serialization } // namespace boost The result is: opsc_hlr :2204 084723:D:### invoked for <pModifyHlrSubscriberIn> opsc_hlr :2204 084723:D:### c'tor opsc_hlr :2204 084723:D:### done for <pModifyHlrSubscriberIn> opsc_hlr :2204 084723:D:### d'tor opsc_hlr :2204 084723:D:### invoked for <imsi> opsc_hlr :2204 084723:D:### c'tor opsc_hlr :2204 084723:D:### done for <imsi> opsc_hlr :2204 084723:D:### d'tor opsc_hlr :2204 084723:D:### invoked for <value> opsc_hlr :2204 084723:D:### c'tor opsc_hlr :2204 084723:D:### done for <value> opsc_hlr :2204 084723:D:### d'tor So there is no recursion(???). Is there another way to get a "where am i" information within a serialize (load/save) helper? - thanks! Regards! Frank

2 1

Re: [Boost-users] [Threads-devel] [thread] Problems with TSS and static thread library
by Roland Schwarz 22 Apr '07

22 Apr '07

Johan Nilsson wrote: > [cross-posting this to boost.threads.devel as I tried putting out a request > for support there as well] > Thank you for analysis, I'll try to look into it as soon as possible. Please do understand, that since we are already in code freeze for 1.34 application of a fix is subject to Thomas Witts approval. Regards, Roland

3 2

BGL: filtered_graph and breadth_first_search.
by Dima F. 22 Apr '07

22 Apr '07

Hello everybody, Often, given a graph G and a subset of it's vertices, there is a need to perform something on an induced graph containing those vertices. I thought about using filtered_graph for that purpose, but for some reason I am unable to use breadth_first_search with a filtered_graph - I get pages of errors from the compiler complaining about something in filtered_graph.hpp, and I don't understand what is the problem. Here is a minimal test program which exemplifies the error. Note that if the line containing a call to a breadth_first_search is commented out, everything compiles properly. What is the problem here? --------------------------------------------------------------------- #include <boost/graph/filtered_graph.hpp> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/breadth_first_search.hpp> using namespace std; using namespace boost; template <typename Graph> class induced_graph_filter { public: typedef typename graph_traits<Graph>::edge_descriptor edge_t; typedef typename graph_traits<Graph>::vertex_descriptor vertex_t; induced_graph_filter() {} bool operator()(const vertex_t &v) {} bool operator()(const edge_t &e) {} }; int main() { typedef adjacency_list <listS, vecS, undirectedS> graph_t; graph_t g(2); add_edge(0, 1, g); typedef induced_graph_filter<graph_t> filter_t; filter_t filter; filtered_graph<graph_t, filter_t, filter_t> g2(g, filter); breadth_first_search(g2, 0, visitor(default_bfs_visitor())); } ---------------------------------------------------------------------

2 6

[numeric_cast] unwished warnings
by Ovanes Markarian 22 Apr '07

22 Apr '07

Hello! Using numeric_cast I face a warning in MSVC 8.0 Express Edition e:\libraries\boost\include\boost-1_35\boost\numeric\conversion\cast.hpp(41) : warning C4267: 'return' : conversion from 'size_t' to 'Uint32', possible loss of data e:\projects\fundamental_type_factory.cpp(62) : see reference to function template instantiation 'Target boost::numeric_cast<T,msgcat::fundamental_type::numeric_result>(Source)' being compiled with [ Target=Uint32, T=Uint32, Source=fundamental_type::numeric_result ] e:\projects\fundamental_type_factory.cpp(61) : while compiling class template member function 'fundamental_type &`anonymous-namespace'::fundamental_type_impl<T>::operator =(const fundamental_type::numeric_result &)' .... Trying to compile without warnings I am wondering about this warning, since I use the cast to raise an exception at runtime if data are lost. Is it logical? With Kind Regards, Ovanes

2 1

[filesystem] About use on Windows
by Kirit Sælensminde 22 Apr '07

22 Apr '07

Hi everyone, We've been using Boost since around '98 and have had a great deal of mileage out of the smart pointer libraries (thanks!) and are now starting to try out some of the other libraries. We ran into two problems with the filesystem library, the first we're starting with. 1) The initial problem was that we had always been compiling with the __fastcall convention, but the Boost libraries are built using __cdecl. In the end we switched to __cdecl, but should there not be a #define with the build declaration in the headers? 2) The path class only uses narrow strings. For use with the standard C++ libraries this seems fine, but I think once the new standard goes through there should be wide character variants for the file library. In any case we often use bits of the Win32 API which do take wide characters. I'm just wondering if we should just copy the path class to make a wpath class path and if we do so should we give that copy back to integrate with the normal Boost library? This second is probably of more relevance to us now that we've changed our build options. Kirit

3 4

[Boost.DateTime] Error in documentation?
by johneddy101＠comcast.net 21 Apr '07

21 Apr '07

The description of the time_duration::ticks_per_second method reads: "Return the number of ticks in a second. For example, if the duration supports nanoseconds then the returned result will be 1000000." Shouldn't it be 1000000000 or change nano to micro? Found at: http://www.boost.org/doc/html/date_time/posix_time.html#date_time.posix_tim… and in cvs at: http://boost.cvs.sourceforge.net/boost/boost/libs/date_time/xmldoc/time_dur… Thanks

3 2

Re: [Boost-users] Boost Regex in a DLL
by Metasebia Moges 21 Apr '07

21 Apr '07

>That sounds like a possible runtime-library problem. Can you switch both >your application and the dll to use the dynamic C++ runtime? Yes, thanks. The problem is fixed! Best regards, mmoges _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

1 0

boost::iostreams de/compress data from memory question.
by CPPer 21 Apr '07

21 Apr '07

Hi! Is there anyone know how to use boost::iostreams to de/compress data from memory ? >From file the code bellow works well: #include <fstream> #include <iostream> #include <boost/iostreams/filtering_streambuf.hpp> #include <boost/iostreams/copy.hpp> #include <boost/iostreams/filter/gzip.hpp> namespace io = boost::iostreams; int main() { using namespace std; ifstream file("hello.gz", ios_base::in | ios_base::binary); io::filtering_streambuf<io::input> in; in.push(io::gzip_decompressor()); in.push(file); io::copy(in, cout); } But if I changed ifstream into istringstream like this: #include <fstream> #include <sstream> #include <boost/iostreams/filtering_stream.hpp> //#include <boost/iostreams/copy.hpp> #include <boost/iostreams/filter/gzip.hpp> namespace io = boost::iostreams; int main() { using namespace std; ifstream file("hello.gz", ios_base::in | ios_base::binary); io::filtering_istream in; in.push(io::gzip_decompressor()); in.push(file); //std::ostringstream ostr; //io::copy (in, ostr); //std::string stir = ostr.str (); std::string stir; in >> stir; //ofstream ofs("output.gz", ios_base::out | ios_base::binary); ostringstream ostr; io::filtering_ostream out; out.push (io::gzip_compressor()); out.push (ostr); out << stir; stir= out.str(); } the std::string stir always NULL when I want to get the data after compress. Sorry for my bad English.. I am a Chinese.

2 3

Re: [Boost-users] Boost Regex in a DLL
by Metasebia Moges 21 Apr '07

21 Apr '07

Dear Bronek Kozicki, >because it really is bad idea. I will explain why: C++ runtime needs >access to the heap in order to be able to create objects (like strings). >On Windows each process owns multiple heaps and the runtime holds handle >to one. If you use static runtime, this handle is linked into executable >(it's a static variable). On Windows you have two kinds of executables: >DLL and EXE. Each copy of static C++ runtime that is statically linked >into an executable will have own heap handle, thus heaps (of EXE and all >DLLs linked with static runtime, running inside the process) will be >separate. Now imagine what happens if function inside a DLL creates a >string (be it 'std::string("foo bar")' or simply 'new char[20]') and >returns it to EXE that called it - string would be created in the >context of C++ runtime statically linked with the DLL (one heap) and >then passed (and some time later destroyed) in the context of another >C++ runtime, the one statically linked into the EXE (other heap). The >trouble is that you cannot allocate memory on one heap and then free it >on another, because they know nothing of one another - the attempt will >likely simply corrupt the heap of the other runtime (thus crashing your >process some time later). This is why whenever you want to use DLL and >EXE and pass C++ objects of or pointers between them, it is crucial that >they all (DLLs and EXE) use one copy of the C++ runtime - that is >dynamically linked one (option /MD for release build and /MDd for debug). What a nice lecture! Thank you very much. That helped me fix the problem. One additional thing worth mentioning is that I had to copy the boost_regex_vc71_mt_gd_1_33_1.dll into my the directory where I placed all my executables (dlls and exe). I wonder if that was mentioned somewhere in the documentation! Moreover, eventhough the boost.regex code is only in one of the dlls (isolated), I had to include the macro BOOST_REGEX_DYN_LINK (but, Dr. Maddock once informed me that this is not necessary). Just wondering. Thank you again! Best regards, mmoges _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

1 0

Re: [Boost-users] Boost Regex in a DLL
by Metasebia Moges 21 Apr '07

21 Apr '07

Dear Dr. John Maddock, >You can use Boost.Regex in a dll by defining BOOST_REGEX_DYN_LINK when >building your dll, but as long as the regex code is isolated to your dll and >doesn't spill over into it's public interface then this shouldn't be >necessary. Like I said in an earlier e-mail, the code is isolated. However, to make things sure I added it as: #define BOOST_REGEX_DYN_LINK in the source code and there is no change. Then I defined it in Properties->Preprocessor Definitions. Then it complains as: "Mixing a Boost dll with a static runtime is a really bad idea ...". I don't know why? >Other than that it's hard to say what the issue might be without >seeing your code. The surprising thing is that a single line of BOOST code (just an expression) disturbs the program. For example, I added: boost::regex sre("!NULL|sil|SIL"); only and didn't do anything with it. Then when I run the program with the perfectly working code (non-boost), it misbehaves. So I don't think it is a problem with my regex code as all. I don't think this problem is asscociated with the main program using my dll too. Otherwise, I must have missed something essential. I want to use Boost but I really need help at this point. Thank you in advance! mmoges _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

3 2

Problems with serializing
by Hansi Hansi 21 Apr '07

21 Apr '07

I don't know if this is the right forum for that... In the following example I get the compile error (VS2005) Error 1 error C2027: use of undefined type 'boost::STATIC_ASSERTION_FAILURE<x>' c:\boost_1_33_1\boost\archive\detail\oserializer.hpp 567 Can anyone say me why? If I define const gps_position it works, otherwhise it fails class gps_position { private: friend class boost::serialization::access; // When the class Archive corresponds to an output archive, the // & operator is defined similar to <<. Likewise, when the class Archive // is a type of input archive the & operator is defined similar to >>. template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & degrees; ar & minutes; ar & seconds; } int degrees; int minutes; float seconds; public: gps_position(){}; gps_position(int d, int m, float s) : degrees(d), minutes(m), seconds(s) {} }; int _tmain(int argc, _TCHAR* argv[]) { gps_position newVector; const gps_position* poldVector = new gps_position(); { std::ofstream ofs("test.dat"); boost::archive::text_oarchive oa(ofs); oa << poldVector; } { std::ifstream ifs("test.dat", std::ios_base::binary); boost::archive::text_iarchive ia(ifs); ia >> newVector; // read data } return 0; } _______________________________________________________________ SMS schreiben mit WEB.DE FreeMail - einfach, schnell und kostenguenstig. Jetzt gleich testen! http://f.web.de/?mc=021192

2 1

Timer suspended during disk operations?
by Przemyslaw Tumidajewicz 20 Apr '07

20 Apr '07

Hello everyone, I've been trying to use the boost/timer class to provide some information on the time taken by subtasks in my program. I have noticed that times seem to be reported fine as long as subtasks are doing CPU processing, but disk operations seem to suspend the timer. For instance buffering a bigger file to memory is reported to take eg. half a second, while it can clearly be seen that the program is running for 15 seconds. Any ideas on what can cause this behaviour and if there is any way to make it work properly? I am using g++ 3.4.4 with boost 1.33.1 under Win XP Pro SP2. Thanks in advance! --Przem

3 3

[Serialization/Archive] Handle comments in xml-files
by Gerrit Brehmer 20 Apr '07

20 Apr '07

Hi, can anyone tell me where in the code I can find the place, where I can disable comment-processing as normal name-value-pairs? Because If I have xml-comments () in the xml-file, the deserialization will fail with a boost::archive::archive_exception. Thanks in advance for your help! Gerrit

3 2

BGL : Ullmann algorithm for subgraph isomorphism
by Jaonary Rabarisoa 20 Apr '07

20 Apr '07

Hi all, I'd like to know wether this algorithm is already implemented in BGL or wether anyone has already tested the code given here : http://www.mail-archive.com/boost@lists.boost.org/msg06380.html I tryed to use it, but it didn't give me the result I expected. Thank you for your help, Jaonary

1 0

unsubscribe
by David Xiao 20 Apr '07

20 Apr '07

1 0

[boost][math toolkit] Review reminder
by Matthias Schabel 20 Apr '07

20 Apr '07

Just a friendly reminder from the review manager that the formal review of the proposed Boost Math Toolkit is ongoing, and will continue through the 27th of April. There has been relatively little feedback to date, possibly due to inconvenient timing of conferences and, perhaps preparations for the upcoming release. Hopefully interested individuals will find time to give this library the close look that it deserves and report next week. Matthias Schabel

1 0

Compile failure with shared_ptr
by Tim Murison 20 Apr '07

20 Apr '07

Hi, I'm getting a compiler error with MSVC .NET 2003 in release mode. Compiling the following code gives: "error C2676: binary '&&' : 'const ASP' does not define this operator or a conversion to a type acceptable to the predefined operator" If I compile in debug mode, or if I remove the "const" on the shared_ptr arguments, it complies without complaint. ==== #include <boost/shared_ptr.hpp> class A; class B; class C; typedef boost::shared_ptr<A> ASP; typedef boost::shared_ptr<B> BSP; typedef boost::shared_ptr<C> CSP; void test(const ASP& a, const BSP& b, const CSP& c) { bool rc = false; if (a && b && c) rc = true; } ====

2 1

Smaller bind?
by Eric Knudstrup 20 Apr '07

20 Apr '07

I am writing code in a memory restricted environment and I need to use something like boost::bind. Boost seems awesome, but I'm having trouble with a 75 line program yielding a 300kb stripped executable. Are there any other delegates out there that yield more reasonable binary sizes? Eric

2 1

How to separate a specified library from Boost?
by Z.L. 20 Apr '07

20 Apr '07

I want to use only the random library in Boost, and the whole Boost is too big for me. I remember there seems some tool that can strip off the dependency of the single library on the other libraries in Boost, and extracts it. But unfortunately I cannot recall the name of this tool. Could somebody give me some hints or suggestions on separating a library from Boost? Thanks a lot. Z.L.

5 7

boost serialization and RTTI
by Os 20 Apr '07

20 Apr '07

Hi, I very much want to use boost serialization but can't enable RTTI in my compiler (vc7/vc8) because of compatibility restrictions with other code. I've seen various statements on the web that boost serialization will work without RTTI, but no concrete instructions about how to make this happen. I've tried writing a trivial app using boost::archive::binary_oarchive, but I get this compiler warning (which is as good as an error): boost\smart_cast.hpp(76) : warning C4541: 'dynamic_cast' used on polymorphic type 'boost::archive::detail::basic_oarchive' with /GR-; unpredictable behavior may result So is it the case that, while serialization doesn't require RTTI, the provided archive classes do? Am I going to have to write my own archive class? Any help appreciated. cheers, os. -- os(a)collective.co.uk

2 2

Re: [Boost-users] [thread] Problems with TSS and static threadlibrary
by Johan Nilsson 20 Apr '07

20 Apr '07

Johan Nilsson wrote: > [cross-posting this to boost.threads.devel as I tried putting out a > request for support there as well] > [snip] > As you said - the static thread_specific_ptr<> destructors are run > after on_thread_exit for the main thread (actually, some of them > before, and one of them after, which is even more confusing). Reading > the comments in tss_pe.cpp, it seems to be a deliberate decision to > run on_thread_exit from the main thread before the static destructors > are run. Perhaps to be able to use static objects safely during > "normal" thread exits? Uh, sorry. Don't know what I was thinking here .. perhaps the result of debugging the problem for an extended amount of time. / Johan

1 0

more on lexical_cast bool
by Paul Moore 20 Apr '07

20 Apr '07

I hit the same problem that was addressed earlier in these lists The proposed solution was to juggle around with the internal streams. The problem with this (it seems to me) is that is leaking the implementation into the consumers face. We all know that lexical_cast is implemented using streaming in and out and thats what makes it pretty lightweight (in terms of the amount of code used) but thats no reason to leak the details out. The other problem is that lexical_cast is really slow; again becuase it uses such a general purpose mechanism. Its seems to me that the class needs specializing * to bool should accept true and false in any case, or 0 or any non-zero int and perhaps yes and no (this is the programmers expectation) * ints should use atoi and fixed size snprintfs * Etc... the general >> << mechanism is used if there is no specialization This makes it fast(er) and makes it opaque

2 1

Static typing question
by Ovanes Markarian 19 Apr '07

19 Apr '07

Hello all! I have a question on static typing. Does someone know or can imagine a way on producing unique static types. An example: typedef unsigned int some_type; typedef unsigned int other_type; typedef fusion::map< fusion::pair<some_type, std::string>, fusion::pair<other_type, std::string> > my_map; my_map my_map_(fusion::make_pair<some_type>("some_type"), fusion::make_pair<other_type>("other_type")); at_key<other_type>(my_map) should return "other_type" and not "some_type" Many thanks in advance. With Kind Regards, Ovanes

3 4

[fusion] error in map docs
by Ovanes Markarian 19 Apr '07

19 Apr '07

Hello! Thanks for the great lib again. I was using a fusion::map container and discovered the following error at: http://spirit.sourceforge.net/dl_more/fusion_v2/libs/fusion/doc/html/fusion… The exsample states: typedef map< pair<int, char> , pair<double, std::string> > map_type; map_type m( make_pair<int>('X') , make_pair<double>("Men")); std::cout << at<int>(m) << std::endl; std::cout << at<double>(m) << std::endl; ^^-- error Where it should be not at<TYPE>(...) but at_key<TYPE>(...). With Kind Regards, Ovanes

2 1

Bill Lear: "Re: store vector<> to filesystem (newbie question)"
by Gennady Khokhorin 19 Apr '07

19 Apr '07

Bill, it is the same message with different subject. I'm not sure if previous will show up on this thread as a respond to your sending. -----Original Message----- From: Gennady Khokhorin Sent: Wednesday, April 18, 2007 2:45 PM To: 'boost-users(a)lists.boost.org' Subject: Re: store vector<> to filesystem (newbie question) >template<typename Archive> >struct Serializer { > static void save(const vector<double>& timeStamps) { > std::ofstream ofs("file.bin", std::ios::binary); > > Archive oa(ofs); > oa << timeStamps; > } >}; > >Serializer<binary_oarchive>::save(timeStamps); Thanks, Bill, for your fast respond! Started reading serialization. Did try to use serialization from your sample, got stuck with error message: Error 20 error C2039: 'serialize' : is not a member of 'std::vector<_Ty>' c:\boost\include\boost-1_33_1\boost\serialization\access.hpp 109 Is it restriction sign for using std::vector<> with << operator or I'm missing some headers? my settings: #include <boost\archive\binary_oarchive.hpp> using namespace boost::archive; gok

5 5

Re: [Boost-users] Boost and Intellisense...
by james.jones＠firstinvestors.com 19 Apr '07

19 Apr '07

From: "Ferng, Andrew D" <andrew.d.ferng(a)boeing.com> > I've also seen this occur with BGL. Before I make a call to > connected_components, it's fine. Afterwards, intellisense no longer > works. > Maybe VS has an issue with reading hpp? Just my wild guess... My guess is that IntelliSense just doesn't work with templates - whenever I've introduced templates into my code (BOOST or not), IntelliSense becomes UnintelliSense. I also think this isn't too surprising. Considering the potential complexity of templated code, expecting IntelliSense to handle it well is probably not reasonable - IntelliSense would have to *execute* the entire template metaprogramming subset of C++ "on the fly" to handle template types completely. - James Jones Administrative Data Mgmt. Webmaster 375 Raritan Center Pkwy, Suite A Data Architect Edison, NJ 08837

1 0

BoostCon conference calls?
by Dave Jenkins 19 Apr '07

19 Apr '07

Does anyone know if the Aspen Center for Physics makes any conference calling facilities available to BoostCon? Because I was wondering, if special interest groups want to get together informally and have people call in and participate from wherever they are, could we do it? I know Joel de Guzman is talking about getting the Spirit group together informally for "feedback, comments and in general, discussion about what's to come" and it would be great if people not at the conference could participate. I don't know how well this would work and I don't know if Joel would like it (pizza and beer were mentioned, which don't transmit well over the phone lines), but it seems like BoostCon is a great opportunity for groups to get together and brainstorm about the future. See you at BoostCon! Dave Jenkins

2 7

Re: [Boost-users] Bill Lear store vector<> to filesystem (newbie
by Gennady Khokhorin 19 Apr '07

19 Apr '07

Thanks, Bill! Its working! I was missing <boost/serialization/vector.hpp> header. Happy programming! gok

1 0

Re: [Boost-users] store vector<> to filesystem (newbie question)
by Gennady Khokhorin 18 Apr '07

18 Apr '07

>template<typename Archive> >struct Serializer { > static void save(const vector<double>& timeStamps) { > std::ofstream ofs("file.bin", std::ios::binary); > > Archive oa(ofs); > oa << timeStamps; > } >}; > >Serializer<binary_oarchive>::save(timeStamps); Thanks, Bill, for your fast respond! Started reading serialization. Did try to use serialization from your sample, got stuck with error message: Error 20 error C2039: 'serialize' : is not a member of 'std::vector<_Ty>' c:\boost\include\boost-1_33_1\boost\serialization\access.hpp 109 Is it restriction sign for using std::vector<> with << operator or I'm missing some headers? my settings: #include <boost\archive\binary_oarchive.hpp> using namespace boost::archive; gok

1 0

filesystem path initialization question...
by Graham Reitz 18 Apr '07

18 Apr '07

Why does the following path initialization throw this? "boost::filesystem::path: invalid name "c:" in path: "c:/dev/Sandbox/file_system/ textfile1.txt" How do you set paths that should work on windows and linux without avoiding this issue? Since linux doesn't have drive like C: D: and etc? try { // Is this not an appropriate method to initialize path objects? path text_file(current_path().string() + "/textfile1.txt"); if (exists(text_file)) { cout << file_size(text_file) << endl; } } catch (const filesystem_error& e) { cout << e.what() << endl; } I am running this under windows. Thanks, Graham

3 8

[Pool][singleton_pool] Performance problem or bad usage?
by Aubrey, Jason 18 Apr '07

18 Apr '07

Hi, I've created a helper class called MemoryPooled to help add pooling to some of my classes; however, the performance seems slow by comparison to non-pooled behavior. My code is shown below, I suspect I'm doing something wrong but I don't see how it can be my class. Does anyone have any idea? -Jason // Begin code -------------------------------------- #include <Utilities/stopwatch.h> #include <boost/pool/singleton_pool.hpp> #include <boost/shared_ptr.hpp> #include <iostream> template<typename T> class MemoryPooled : public T { public: MemoryPooled(){} virtual ~MemoryPooled(){} static const int countObjectsInitiallyAllocated = 1000; typedef boost::singleton_pool<T, countObjectsInitiallyAllocated> Pool; void* operator new(size_t /*p_memSize*/) { return Pool::malloc(); } void operator delete(void* p_memBlock) { Pool::free(p_memBlock); } }; struct Test1 { int i0; int i1; int i2; int i3; int i4; int i5; int i6; int i7; int i8; int i9; }; void test(bool p_isPooled) { Utilities::StopWatch sw; // Stopwatch is my helper for getting times sw.start(); for(int i=0; i < 100000; ++i) { if( p_isPooled ) boost::shared_ptr<Test1> item(new MemoryPooled<Test1>()); else boost::shared_ptr<Test1> item(new Test1()); } const double elapsed = sw.elapsedTime(); cout << "Elapsed time: " << elapsed << " ms" << endl; } int main(int, char**) { test(true); test(false); } // End code -------------------------------------- Output: Elapsed time: 106.812 ms (Pooled) Elapsed time: 94.2158 ms (Not Pooled)

2 2

karta orkanen
by Johan Råde 18 Apr '07

18 Apr '07

Här är en länk till en karta som visar vart vi ska. Orkanen är byggnad nr 1 på kartan. --Johan http://www.mah.se/upload/6744/malmokarta_sv.pdf

1 1

store vector<> to filesystem (newbie question)
by Gennady Khokhorin 18 Apr '07

18 Apr '07

I have vector<double> timeStamps; How to store this vector to outside binary file in boost style? I'm trying to utilyze mapped file: std::vector<double> timeStamps; std::string filePath("c:\\double_test.bin"); boost::intmax_t thisFileSize(maxSize); // max good value: 0x2FFFFFFF ios::filtering_ostream out; ios::file_sink fsink(filePath); out.push(fsink); //out.write(time_stamps.begin(), thisFileSize); // out.flush(); fsink.close();

2 1

fixing graph labels
by Harry Waye 17 Apr '07

17 Apr '07

Hello, Have created a graph using erdos_renyi_generator and the vertices are labelled 1 to n. When I remove a vertex the labels are then 1 to n-1. Is there any way to stop this relabelling from happening? Heres some info: typedef adjacency_list<setS, vecS, undirectedS> Graph; typedef erdos_renyi_iterator<minstd_rand, Graph> ERGen; Graph g(ERGen(gen, n, p), ERGen(), n); Cheers, Harry

2 1

Thread safety and weak_ptr questions
by Dizzy 17 Apr '07

17 Apr '07

Hello struct A {} // executes before spawning any boost threads shared_ptr<A> sp(new A()); weak_ptr<A> wp(sp); // then in thread1 sp.reset(); // in thread thread2 shared_ptr<A> sp2(wp.lock()); Is the above code thread safe ? Is sp2 always either a default initilized shared_ptr<A> or a valid shared_ptr to the instance of A initially referenced by sp ? I couldn't find documentation on weak_ptr thread safety issues just on shared_ptr. I am unable to determine from the documentation what is the intended behaivour for the above code. I could look into the boost code and/or test it but I want to know not how it works but how it's intended to work (portably and all) :) Thank you. -- Mihai RUSU Email: dizzy(a)roedu.net GPG : http://dizzy.roedu.net/dizzy-gpg.txt WWW: http://dizzy.roedu.net "Linux is obsolete" -- AST

2 1

Re: [Boost-users] Boost Regex in a DLL
by Metasebia Moges 17 Apr '07

17 Apr '07

Dear Sir, First of all, thank you for your reply. Your replies for my requests were very helpful. >You can use Boost.Regex in a dll by defining BOOST_REGEX_DYN_LINK when >building your dll, but as long as the regex code is isolated to your dll and >doesn't spill over into it's public interface then this shouldn't be >necessary. Other than that it's hard to say what the issue might be without >seeing your code. As you said, the regex code is isolated in my dll and doesn't spill over into the public interface. Then the problem could be with my code below. Would you please inspect and correct me if I am wrong somewhere? I read a phrase from a file and search for words preceded by "W=" and if the word is different from !NULL, sil, and SIL, I store them in a list called PhraseList for further processing. boost::regex re("W=\\w+"); boost::regex sre("!NULL|sil|SIL"); string s, sbuf; string::const_iterator begin, end; size_t length; sbuf = phrase; begin = sbuf.begin(); end = sbuf.end(); boost::match_results<std::string::const_iterator>matches; boost::match_flag_type flags = boost::match_default; while(boost::regex_search(begin, end, matches, re, flags)) { if(boost::regex_search(phrase, re)) { s= matches.str(); length=matches.str().size(); string item =s.substr(2,length-1); if(boost::regex_match(item,sre)) break; else{ phraseList.addString (item.c_str()); break; }//else } //if }//while I have the following code which does the job without any problem at the expense of "not using boost". I have a line read from a file: // Parse the line len=strlen(phrase); //If the phrase is a content bearing term, put it into phrase list while(i<len){ if(phrase[i] != 'W') i++; else{ i=i+2; item=&phrase[i]; if (strncmp (item,"!NULL ",6) == 0|| strncmp(item,"sil ",4)==0 || strncmp(item,"SIL ",4)==0) break; else { memcpy(phrase, item, strlen(item)+1); phraseList.addString (phrase); break; } } } I don't like the second option in spite of the fact that it works. Moreover, I want to use boost.regex for other complex tasks and I want to test it with this simple real life problem. Your input is highly appreciated! Thank you in advance! Best regards, mmoges _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

2 1

regex_iterator with for_each question...
by Graham Reitz 17 Apr '07

17 Apr '07

I thought that for_each() goes while (it != end). How does for_each() 'know' what end is here? It doesn't seem to be initialized to anything. Thanks much, Graham class regex_callback { int m_sum; public: regex_callback() : m_sum(0) {} template <typename T> void operator()(const T& what) { m_sum += boost::lexical_cast<int>(what[1].str().c_str()); } int sum() const { return m_sum; } }; int main() { boost::regex("(\\d+),?"); string s = "1,1,2,3,5,8,13,21"; boost::sregex_iterator it(s.begin(), s.end(), reg); // Is end initialized to anything here? boost::sregex_iterator end; regex_callback c; // How is end valid here? int sum = for_each(it, end, c).sum(); return 0; }

3 2

[Serialization] Closing tag in XML description missing
by Ruediger Berlich 17 Apr '07

17 Apr '07

Hi there, I've got the problem that the XML description of my serialized classes seem to be missing the final closing tag. Funnily enough loading of the XML descriptions nevertheless works. The platform is OpenSUSE 10.2, g++ 4.1.2, Boost 1.33.1 . I'll try to illustrate the problem with a small program. Output further below. /************************************************************************/ // headers + namespace statements removed to save space class test { friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version){ using boost::serialization::make_nvp; ar & make_nvp("x",x); } int x; public: test(int i){ x = i; } void printX(void){ cout << "x = " << x << endl; } }; main() { test Test(1); // I want a stringstream, as my applicion is in remote processing ostringstream oss; assert(oss.good()); boost::archive::xml_oarchive oa(oss); oa << BOOST_SERIALIZATION_NVP(Test); // Closing tag is missing in output, see below cout << oss.str() << flush; // But the file has the correct content, see below ofstream ofs("print.xml"); assert(ofs.good()); boost::archive::xml_oarchive oa2(ofs); oa2 << BOOST_SERIALIZATION_NVP(Test); // Try to load the incorrect XML description works !?!?? test Test2(2); istringstream iss(oss.str()); assert(iss.good()); boost::archive::xml_iarchive ia(iss); ia >> BOOST_SERIALIZATION_NVP(Test2); // Funnily enough this seems to work Test2.printX(); // correctly prints "x = 1", not "x = 2" } /************************************************************************/ So when I give the xml_oarchive an ostringstream as argument (because my application is in remote processing and I don't need file output), the result is: /************************************************************************/ <?xml version="1.0" encoding="UTF-8" standalone="yes" ?> <!DOCTYPE boost_serialization> <boost_serialization signature="serialization::archive" version="3"> <Test class_id="0" tracking_level="0" version="0"> <x>1</x> </Test> /************************************************************************/ So here the closing tag </boost_serialization> is missing. If I do the same with an ofstream (see program) the file content is o.k. . /************************************************************************/ <?xml version="1.0" encoding="UTF-8" standalone="yes" ?> <!DOCTYPE boost_serialization> <boost_serialization signature="serialization::archive" version="3"> <Test class_id="0" tracking_level="0" version="0"> <x>1</x> </Test> </boost_serialization> /************************************************************************/ Funnily enough my problem with the ostringstream does not seem to have an influence on the loading of the XML description. What am I doing wrong ? Thanks and Best Regards, Ruediger

2 2

Failed gcc link and targets
by Douglas Linford 17 Apr '07

17 Apr '07

2 Davids, The output at the top of the compile after running: bjam "-sTOOLS=gcc" install > out.txt 2>&1 shows python errors followed by: ...found 13313 targets... ...updating 250 targets... And then throughout the compile there are a lot of link errors and FileClone operation not permitted errors. The the compile completes with a lot of skipped errors ending with: ....failed updating 110 targets... ...skipped 118 targets... ...updated 22 targets... So...the following list from the Boost site gave the order for compiling which I completed in order with my appended notes: 1. Download Boost <http://boost.org/more/getting_started.html#step1>. 2. Install Boost.Jam<http://boost.org/more/getting_started.html#step2>. ( I installed bjam to: /usr/local/bin/bjam) 3. Configure your compiler toolset<http://boost.org/more/getting_started.html#step3>. (This I did not do...I didn't know what they wanted me to do) 4. Go to Boost distribution directory<http://boost.org/more/getting_started.html#step4> . 5. Build and install<http://boost.org/more/getting_started.html#step5> . Could some of this be the result of the fact that I didn't configure my compiler? Thanks guys... Douglas

3 4

[ptr_container]Visual C++ 2005 visualizers for ptr_container classes and boost::array
by Bill Buklis 16 Apr '07

16 Apr '07

Since I work with the ptr_container classes (especially ptr_vector and ptr_map) quite a bit (very nice library!), I found it a little frustrating attempting to debug container and iterator variables for these classes as compared with how well the std containers show up in the VC++ watch window. After some thought and experimentation I figured out how to add these classes to the VC++ visualizer so that now these objects will display almost as well as the std containers. For those of you unfamiliar with the built-in visualizer (no surprise as there is no official documentation for it), there is a text file called autoexp.dat that contains definitions on how to display custom objects in the watch window (including CString, std::string, and the standard containers). I found this very helpful blog article that explains this in more detail: http://www.virtualdub.org/blog/pivot/entry.php?id=120. The autoexp.dat file is usually located in C:\Program Files\Microsoft Visual Studio 8\Common7\Packages\Debugger. Place the visualizer code (included down below) at the end of the "visualizer" section of autoexp.dat (probably near the end of the file). Some notes: 1. ptr_vector expands outs the same way as std::vector<T*> would rather than std::vector<T>. I did it this way so you can easily see the memory address of each contained object. 2. ptr_map unfortunately doesn't expand out exactly the same as std::map<K,T*>. This is because ptr_map uses std::map<K,void*> internally and not map<K,T*>. I couldn't figure out any way to auto convert the sub-level appropriately. As a result the expanded entries only show the value objects and not KEY and VALUE (e.g. where VALUE is the "second" member). As a compromise I display the KEY elements in the preview section so that you can still see them. The preview section can be seen in two places: as a tooltip when you highlight the variable and on the first line next to the variable in the watch window. If anyone can think of a workaround or a better alternative let me know. 3. Also included is an entry for boost::array, so that these can be seen in the watch window in the same manner as a static array. Any questions? Enjoy, -- Bill -- Add the following text to autoexp.dat: ;--------------------------------------------------------------------------- --- ; boost::ptr_vector ;--------------------------------------------------------------------------- --- boost::ptr_vector<*,*>{ children ( #array ( expr: (($T1**)($c.c_._Myfirst))[$i], size : $c.c_._Mylast-$c.c_._Myfirst ) ) preview ( #( "[", $e.c_._Mylast - $e.c_._Myfirst , "](", #array ( expr : (($T1**)($c.c_._Myfirst))[$i], size : $c.c_._Mylast-$c.c_._Myfirst ), ")" ) ) } ;--------------------------------------------------------------------------- ; boost::ptr_vector::iterator ;--------------------------------------------------------------------------- boost::void_ptr_iterator<std::_Vector_iterator<*>,*>{ preview ( #( ($T2*)(*$c.iter_._Myptr) ) ) children ( #( ptr: ($T2*)(*$c.iter_._Myptr) ) ) } ;--------------------------------------------------------------------------- ; boost::ptr_set::iterator ;--------------------------------------------------------------------------- boost::void_ptr_iterator<*,*>{ preview ( #( ($T2*) $e.iter_._Ptr->_Myval) ) children ( #(ptr: ($T2*) $e.iter_._Ptr->_Myval) ) } ;--------------------------------------------------------------------------- ; boost::ptr_map ;--------------------------------------------------------------------------- boost::ptr_map<*,*,*>{ preview ( #( "[", $e.c_._Mysize, "](", #tree ( head : $c.c_._Myhead->_Parent, skip : $c.c_._Myhead, size : $c.c_._Mysize, left : _Left, right : _Right ) : $e._Myval.first, ")" ) ) children ( #tree ( head : $c.c_._Myhead->_Parent, skip : $c.c_._Myhead, size : $c.c_._Mysize, left : _Left, right : _Right ) : ($T2*)$e._Myval.second ) } ;--------------------------------------------------------------------------- ; boost::ptr_map ;--------------------------------------------------------------------------- boost::ptr_multimap<*,*,*>{ preview ( #( "[", $e.c_._Mysize, "](", #tree ( head : $c.c_._Myhead->_Parent, skip : $c.c_._Myhead, size : $c.c_._Mysize, left : _Left, right : _Right ) : $e._Myval.first, ")" ) ) children ( #tree ( head : $c.c_._Myhead->_Parent, skip : $c.c_._Myhead, size : $c.c_._Mysize, left : _Left, right : _Right ) : ($T2*)$e._Myval.second ) } boost::ptr_map_iterator<*,*,*>{ preview ( #( "(", $c.iter_._Ptr->_Myval.first, ",", ($T3*) $c.iter_._Ptr->_Myval.second, ")" ) ) children ( #( key: $c.iter_._Ptr->_Myval.first, value: ($T3*) $c.iter_._Ptr->_Myval.second, _ptr: $c.iter_ ) ) } ;--------------------------------------------------------------------------- ; boost::ptr_set ;--------------------------------------------------------------------------- boost::ptr_set<*,*>{ preview ( #( "[", $e.c_._Mysize , "](", #tree ( head : $c.c_._Myhead->_Parent, skip : $c.c_._Myhead, left : _Left, right : _Right, size : $c.c_._Mysize ) : ($T1*)$e._Myval, ")" ) ) children ( #tree ( head : $c.c_._Myhead->_Parent, skip : $c.c_._Myhead, left : _Left, right : _Right, size : $c.c_._Mysize ) : ($T1*)$e._Myval ) } ;--------------------------------------------------------------------------- ; boost::ptr_set ;--------------------------------------------------------------------------- boost::ptr_multiset<*,*>{ preview ( #( "[", $e.c_._Mysize , "](", #tree ( head : $c.c_._Myhead->_Parent, skip : $c.c_._Myhead, left : _Left, right : _Right, size : $c.c_._Mysize ) : ($T1*)$e._Myval, ")" ) ) children ( #tree ( head : $c.c_._Myhead->_Parent, skip : $c.c_._Myhead, left : _Left, right : _Right, size : $c.c_._Mysize ) : ($T1*)$e._Myval ) } ;--------------------------------------------------------------------------- ; boost::array ;--------------------------------------------------------------------------- boost::array<*,*>{ preview( $c.elems ) children ( #array ( expr: $c.elems[$i], size : $T2 ) ) }

1 0

[ptr_container]Internal use of void* containers
by Bill Buklis 16 Apr '07

16 Apr '07

Internally, the ptr_container classes use a void* container to do its magic. For example, ptr_vector uses a std::vector<void*> (and similarly for ptr_map and ptr_set) Or come to think of it, I believe it's actually vector<void**> and map<KEY,void*>, respectively. I'm curious as to why? This, of course, works just fine and since it's an internal detail it doesn't really matter. I'm just curious as to why you didn't use the more obvious (and perhaps wrong) choice of vector<T*>. Note: I'm not suggesting that it be changed. Functionally I have no issues with it, naturally, as it works. But, it does make debugging a little more interesting. But, even that is easy to get around. Just curious, -- Bill --

2 1

dereference an iterator
by Christian Holmquist 16 Apr '07

16 Apr '07

Sorry for beeing off-topic, but is there a utility in boost for dereferencing an iterator, such as the below (but that also works for boost::reference_wrapper) template<class Iterator> typename std::iterator_traits<Iterator>::reference deref(Iterator i) { return *i; } Thanks, Christian

4 4

Deep copy of objects coupled with shared and weak pointer
by Fabian Sturm 16 Apr '07

16 Apr '07

Hi! I used the boost shared pointers for quite a while successfully but now ran into a problem I don't have a nice solution yet. I have a class A which has a vector of B classes. I now need to get from the class A to all Bs which is easy (iterating over the vector) and I need to get from any B to A (which I handle with a weak pointer) But now I need to implement a copy method to get a "real" copy of A and not a pointer to the shared instance. How would I do that? The copy also points to copies of the Bees aka. deep copy. My current solution looks like this: class A; class B; typedef boost::shared_ptr< A > A_SP; typedef boost::weak_ptr< A > A_WP; typedef boost::shared_ptr< B > B_SP; class A : public boost::enable_shared_from_this< A > { public: int x; int y; std::vector< B_SP > bees; void addB ( B_SP b ); A_SP clone (); }; class B { public: A_WP weakA; int c; B_SP clone (); }; void A::addB ( B_SP b ) { b->weakA = shared_from_this(); bees.push_back ( b ); } A_SP A::clone () { A_SP newA ( new A ); newA->x = x; newA->y = y; for ( std::vector< B_SP >::const_iterator it = bees.begin (); it != bees.end (); ++it ) { newA->addB ( (*it)->clone () ); } return newA; } B_SP B::clone () { B_SP newB ( new B ); // note I can't initialize the weak_ptr here newB->c = c; return newB; } int main() { A_SP a ( new A ); B_SP b ( new B ); a->addB ( b ); // Now make a deep copy of a A_SP newA = a->clone(); return 0; } Any ideas how this could be done more beautiful? Or more C++ish? Every help is greatly appreciated, since I still need to get accustomed to C++. Thanks a lot, Fabian

1 0

[bind] Surprising behavior
by Christian Henning 16 Apr '07

16 Apr '07

Hi there, I'm sure it's not a bug in bind but I have found a surprising behavior when using it. In my project I have to use some old school c++ classes that use character arrays instead of std::string. The following code displays a difference when using two ways of printing those character arrays. #include <iostream> #include <string> #include <vector> #include <algorithm> #include <functional> #include <boost/bind.hpp> using namespace std; using namespace boost; class A { public: A( string name ) { strncpy( _name, name.c_str(), name.length() + 1 ); } string name() const { return _name; } private: char _name[80]; }; void print( const char* s ) { cout << s << endl; } int main(int argc, char* argv[]) { vector<A> as; as.push_back( A( "A" )); as.push_back( A( "B" )); for_each( as.begin() , as.end() , bind( &print , bind( &std::string::c_str , bind( &A::name, _1 )))); vector<A>::const_iterator it = as.begin(); vector<A>::const_iterator end = as.end(); for( ; it != end; ++it ) { cout << it->name() << endl; } return 0; } The output should be A B A B But instead it's A B The foreach loop doesn't print anything. The problem is when calling the print function the char* points to an empty string. Can somebody please enlightening, here. Thanks, Christian

3 5

[BGL] How to use an array in bundled property?
by Shufei Fan 16 Apr '07

16 Apr '07

I defined an double array inside bundled vertex property, and have trouble finding ways of accessing it. Neither can I find any where in the document an example on it. Your input will be much appreciated! my graph is defined as follows: struct Node { double mode[3]; // this is hard to access }; struct Edge { double nPixels; unsigned short nTh; //no problem access them }; typedef boost::adjacency_list< boost::vecS, boost::vecS, boost::bidirectionalS, Node, Edge> Graph; Graph colGraph; I have no problem with accessing the 'nPixels' in Edge property, boost::property_map<Graph, double Edge::*>::type ew = get(&Edge::nPixels, *colGraph);//edge weight But I am in a great deal of trouble finding ways of accessing 'mode' in Node property. compiler error here: boost::property_map<Graph, double Node::*>::type nm = get(&Node::mode, *colGraph);//node mode error message is : //---------------------------------------------------- c:\...\xxx.cpp(236) : error C2440: 'initializing' : cannot convert from 'boost::property_map<Graph,Property>::type' to 'boost::bundle_property_map<Graph,Descriptor,Bundle,T>' with [ Graph=boost::adjacency_list<boost::vecS,boost::vecS,boost::bidirectionalS,Node, Edge>, Property=double (Node::* )[3] ] and [ Graph=Graph, Descriptor=boost::property_map<Graph,double Node::* >::descriptor, Bundle=Node, T=double ] No constructor could take the source type, or constructor overload resolution was ambiguous //---------------------------------------------------- neither the following works(I added '[3]' in the parameter list): boost::property_map<Graph, double Node::*[3]>::type nm = get(&Node::mode, *colGraph);//node mode This time errors are raised in the 'property.hpp' file, they are: //---------------------------------------------------- c:\Boost\include\boost-1_33_1\boost\pending\property.hpp(40) : error C2825: 'PropertyTag::kind': cannot form a qualified name c:\Boost\include\boost-1_33_1\boost\graph\properties.hpp(198) : see reference to class template instantiation 'boost::property_kind<PropertyTag>' being compiled with [ PropertyTag=double Node::* [3] ] c:\shufei\VCProjects\edison\segm\GA.cpp(236) : see reference to class template instantiation 'boost::property_map<Graph,Property>' being compiled with [ Graph=Graph, Property=double Node::* [3] ] c:\Boost\include\boost-1_33_1\boost\pending\property.hpp(40) : error C2039: 'kind' : is not a member of 'operator``global namespace''' c:\Boost\include\boost-1_33_1\boost\pending\property.hpp(40) : error C2146: syntax error : missing ';' before identifier 'type' c:\Boost\include\boost-1_33_1\boost\pending\property.hpp(40) : error C2955: 'boost::type' : use of class template requires template argument list c:\Boost\include\boost-1_33_1\boost\type.hpp(14) : see declaration of 'boost::type' c:\Boost\include\boost-1_33_1\boost\pending\property.hpp(40) : fatal error C1903: unable to recover from previous error(s); stopping compilation //---------------------------------------------------- thanks, Shufei

2 9

[test] Bug in macros when used with valarray?
by Paul Giaccone 16 Apr '07

16 Apr '07

I have a bug in my program that looks as though it might be in the macros in test. The following line gives me a segmentation fault: BOOST_CHECK_SMALL(var[a][b].first, accuracy); The variable "var" is of type boost::shared_array<std::pair<double, std::valarray<double> > >, for which memory has been allocated as follows (with variable names disguised): const unsigned int num_elements1 = /* some value */; const unsigned int num_elements2 = /* some other value */; const unsigned int num_elements3 = /* another value */; boost::shared_array<boost::shared_array<std::pair<double, std::valarray<double> > > > var_array( new boost::shared_array<std::pair<double, std::valarray<double> > >[num_elements1]); for (unsigned int a = 0; a != num_elements1; ++a) { var[a].reset(new std::pair<double, std::valarray<double> >[num_elements2]); for (b = FirstSolution; b != num_elements2; ++b) { var[a][b].second.resize(num_elements3); } } The variable "accuracy" is of type double. The variable is then passed to a test case: test_suite -> add(BOOST_TEST_CASE(boost::bind(my_test, var))); with this header: void my_test(boost::shared_array<boost::shared_array<std::pair<double, std::valarray<double> > > >& var) Within this test, "var" is passed to another function (by reference) and its contents are set. Outputting the contents shows they have been set OK (using the same array indices, note), but the segmentation fault occurs when the BOOST_CHECK_SMALL macro is used. I am using version 1.33.1 of Boost for gcc 3.2.3. I am linking against -lboost_unit_test_framework-gcc-d-1_33_1 and -lm I'm sure I have used this before without any problems in Linux. The program works perfectly well in Windows using MSVC and Boost version 1.33.1. Are there any other link flags I should be using? Is there something else I have missed? Of course, it is entirely possible that I have an array-out-of-bounds error in my code or something like that, but my diagnostics aren't picking anything like this up, and the Windows version does not report any errors with security checks enabled, and, as I say, outputting the values to std::cout does not cause a segmentation fault. Is it possible that the BOOST_CHECK_* macros don't work with std::valarray in Boost 1.33.1 for gcc 3.2.3? Thanks.

2 1

[mpl] Fix for Visual Studio Compiler Error C1060
by Holcomb, William (Tom ) 16 Apr '07

16 Apr '07

Greetings all, I've seen posts here in the past from those who've had failures compiling (fairly complex) code that uses MPL on Microsoft Visual Studio 2003 and later. On VS 2003, the compiler says that it had an internal error, but on 2005, the error looks like this: File name: fatal error C1060: compiler is out of heap space Happily, Microsoft has published a hotfix for the problem on VS 2005, available at the following link: http://support.microsoft.com/?id=927872 The informal explanation I got is that they had a fixed size internal buffer for holding type names during compilation, and the more complex MPL code--not surprisingly--exceeded that fixed size. I don't know the nature of the fix, though. BTW and FWIW, I never got the error message when compiling in VS 2005 on a 64-bit machine. Hope this helps.

1 0

BoostCon
by Christian Henning 16 Apr '07

16 Apr '07

Hi there, just went over the conference schedule. It looks very interesting but unfortunately I cannot make there. So, my question is if the lectures, speeches, etc. are going to be taped and available to the public, afterwards? I'm thinking of something similar to google education. I'm not sure if that is standard procedure when it comes to conferences. But heh, it's 2007! Thanks, Christian

11 28

Boost graph point of contact
by Stephen Torri 16 Apr '07

16 Apr '07

What group of people or person is a good contact for assistance with the boost graph library? I have not heard back anyone since Friday about a error I am receiving from a test program that I posted. I was wondering if I was going about finding help the wrong way. Stephen

1 0

Regex, no output of greed example.
by Graham Reitz 16 Apr '07

16 Apr '07

There is no output with the following example, when "Note that I'm 21 years old, not" for m[1], and "35" for m[2], is expected. (according to the example): boost::regex reg("(.*)(\\d{2})"); boost::cmatch cm; const char* text = "Note that I'm 21 years old, not 35."; if (boost::regex_search(text, cm, reg)) { if (cm[1].matched) { std::cout << "(.*) matched: " << m[1].str() << std::endl; } if (cm[2].matched) { std::cout << "Found the age: " << m[2].str() << std::endl; } } Output: (.*) matched: Found the age: Expecting: (.*) matched: Note that I'm 21 years old, not Found the age: 35 Any help would be much appreciated. I am new to regular expression and boost::regex. Thanks, Graham

2 2

Boost.Regex with QChar?
by Sebastian Pipping 15 Apr '07

15 Apr '07

It seems to me like Boost.Regex is much more powerful than QRegExp of QT. Can Boost.Regex work with QChar [1] as charT? The text "i.e. either char or wchar_t" on [2] made me unsure of this. Any limitations I should know about? Thanks for your help! Sebastian [1] http://doc.trolltech.com/4.3/qchar.html [2] http://www.boost.org/libs/regex/doc/basic_regex.html

2 2

[dynamic_bitset] beginner question - concatenation/slicing
by Kurt Schwehr 15 Apr '07

15 Apr '07

Hi All, I am new to boost and haven't done much c++ programming in the last couple years, so apologies if this question is obvious. I'm looking at dynamic_bitset to build a translator between the bits and NMEA string packaging for Maritime AIS. Basically this is each character in a string represents 6 bits of data. I'd like to make two lookup tables that let me go back and forth quickly between bitsets and the NMEA ASCII. My dynamic_bitset questions are: * how can I best concatenate multiple dynamic_bitsets? For example: lookupbits['a']+lookupbits['1']+lookupbits['g'] would return a dynamic_bitset of 18 bits. I'm looking for some sort of join operation and append does not seem to do what I want. * How can I best slice the results? If I know that, for example, and unsigned integer is at bits 11-14, is there way to do quickly get a dynamic_bitset of those bits? I've got all this working in pure python, but it is way to slow ( http://vislab-ccom.unh.edu/~schwehr/software/noaadata/ in the ais package). Any suggestions would be greatly appreciated. Thanks! -kurt http://schwehr.org

1 0

BGL: need help with connected_components and boost::setS
by Maarten Nieber 15 Apr '07

15 Apr '07

Hi all, can anyone help me with the compile error I get when compiling the following code? I'm using the MSVC 7.1 compiler (but it is not an internal compiler error). The error occurs in the last line. Your help is appreciated! With kind regards Maarten #include <boost/graph/graph_traits.hpp> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/connected_components.hpp> // Identifies the "component number" property struct component_t { enum { num = 4564 }; typedef boost::vertex_property_tag kind; }; void Test() { using namespace boost; // The "component number" property is an integer for each vertex typedef boost::property<component_t, int> VertexComponentProperty; // A graph with list storage and the "component number" property. typedef boost::adjacency_list < boost::setS, boost::setS, boost::undirectedS, VertexComponentProperty > Graph; // The property map typedef boost::property_map<Graph, component_t>::type ComponentPropertyMap; Graph g; ComponentPropertyMap vertexToComponent = boost::get(component_t(), g); // THIS LINE DOES NOT COMPILE. No problem if boost::vecS is used instead of boost::setS in the Graph typedef! connected_components(g, vertexToComponent); } __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

3 2

Boost Regex in a DLL
by Metasebia Moges 15 Apr '07

15 Apr '07

Hi All, I wanted to use boost::regex in a DLL whose methods are called a number of times by the main program. The code I wrote in the DLL compiles and builds without any problem. The code in the DLL seems to do the job the first time the DLL is called by the main program but the next time the DLL is called to do the same job again in the same run of the program, it halts. When I do the same piece of job using the standard C++ libraries somehow, everything works fine but not with boost regex. Why? I am not sure if there is any #define or something I missed when boost regex is used in a DLL. Just confused .... FYI: I use Visual C++ 2003. I appreciate any help. mmoges __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

2 1

Regex: awk
by Metasebia Moges 15 Apr '07

15 Apr '07

Hi All, I am introduced to Boost Regex recently and I have tried a few examples and it seems quite powerful. My question: I would like to do what I could with "awk" using regex in Visual C++. For instance, to parse a line containing space as a separator. I think it is designed for adding such capabilities to C++ and I hope there exists an easy way to do so. I appreciate any useful information. Best regards, mmoges. __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

2 1

[gil] new io for bmp and pnm files for gil 2.0
by Christian Henning 15 Apr '07

15 Apr '07

Hi there, the io for bmp and pnm files have been updated to compile with gil 2.0. For some reasons I was treading the whole process of updating. But I can happily report that migration was easier than I thought. Files are available at: https://gil-contributions.googlecode.com/svn/trunk/gil_2 Any comments are welcome. Christian

1 0

Re: [Boost-users] Spirit2 cookbook example suggestions welcome
by Joel de Guzman 14 Apr '07

14 Apr '07

ebo(a)sandien.com wrote: > Joel de Guzman <joel(a)boost-consulting.com> said: > >> ebo(a)sandien.com wrote: >> >> EBo! So nice to see you every now and then. > > Joel! You always make me feel so welcome ;-) > >>> Something I was playing around with a couple of years ago and never took the >>> project to full production was a user extensible machine-tool parser which >>> kept the rules and the grammar in persistent dynamically loadable objects. I >>> was able to load new commands on the fly, or actually change the grammar rules >>> themselves... >>> ... >>> Would something like that be interesting? >> Yeah, that's cool! I'm not sure it fits the criteria I outlined though. > > I'll review the criteria tomorrow... > >> Seems to be too complex for the cookbook? > > How many lines/pages of code and description is reasonable? The entire > framework for the above is something like 1,750 lines of code, but that > includes the dynamic parser and 28 RS-274 M and G codes. Stripped down for a > minimal example could be a fraction of that. Anyway, maybe we can come up > with something appropriate. I'm thinking more in the tune of a few lines of grammar here and there -- small enough to digest in a few minutes. Something like... if you want to do something like this, you write something like this. Example: "I want to parse pascal style strings where the first byte is the length (N) of the string, followed by N characters. How do you do it?" Of course that's a very simple example. We have more elaborate examples like "How do you write a C-like language and a virtual machine?". We have that. Now, I want some more in-betweens. Regards, -- Joel de Guzman http://www.boost-consulting.com http://spirit.sf.net

1 0

[boost::statechart] some questions
by Jeffrey Holle 14 Apr '07

14 Apr '07

I'm using boost CVS version gotten on Fri Apr 6 11:48:58 EDT 2007. I'm starting to use boost::statechart for the first time. Scanning the available documentation has produced some questions. I found the following text in a C++ comment within the tutorial: context<>() is used to gain access to the direct or indirect context of a state. This can either be a direct or indirect outer state or the state machine itself. 1, What does "direct" "indirect" context mean? It is documented a number of places that the possible types of reactions are: 1. custom-reaction 2. in-state-reaction 3. deferral 4. transition 2. What is the syntax for using an "in-state-reaction", which I assume is a self transition? 3. What is a custom-reaction? 4. What is a deferral?

2 6

serialization question
by Aljaz 14 Apr '07

14 Apr '07

Hello When I serialize (archive) my class I get string which looks something like: 4422 serialization::archive 3 0 1 2 15 message_request 1 0 0 1 0 1 2 1 Is there any way to hide serialization::archive and message_request, which is a name of a class that was serialized? Thanks for help Regards

3 8

Is the behaviour of the binary_from_base64 intended?
by Anatoli Sakhnik 14 Apr '07

14 Apr '07

Hello! I've run into a strange problem with encoding/decoding base64. Let's have a look at the following code: ///////////////////////////////////////////////////////// #include "boost/archive/iterators/base64_from_binary.hpp" #include "boost/archive/iterators/binary_from_base64.hpp" #include "boost/archive/iterators/transform_width.hpp" #include <string> #include <iostream> using namespace std; using namespace boost::archive::iterators; typedef base64_from_binary< transform_width<string::const_iterator, 6, 8> > base64_t; typedef transform_width< binary_from_base64<string::const_iterator>, 8, 6 > binary_t; int main() { string str("Hello, world!"); cout << str << endl; // This works quite well. string enc(base64_t(str.begin()), base64_t(str.end())); cout << enc << endl; // The following call throws an exception about unacceptable // base64 character in the stream. Probably a bug? //string dec(binary_t(enc.begin()), binary_t(enc.end())); // Hackish workaround: string dec( binary_t(enc.begin()), binary_t(enc.begin() + enc.length() - 1) ); cout << dec << endl; return 0; } ////////////////////////////////////////////////////////////// Does those transforming iterators work as expected? Why the tailoring zero is included in the transformation process? Is there a better way to workaround the problem? Thanks in advance! -- Anatoli Sakhnik.

3 4

[soc 07] SoC 2007 Projects
by Jeff Garland 14 Apr '07

14 Apr '07

Hi All - I'm happy to announce that Boost will be mentoring 9 Google SoC projects this year. They are: Title Student Mentor ----------------------------------------------------------------------------- User-friendly graphs and their measures Andrew Sutton Jeremy Siek FastCGi and SCGI-compatible CGI library Darren Garvey Christopher M Kohlhoff Boost 'Big Integer' proposal Arseny Kapoulkine Jeff Garland Signal Network library Stjepan Rajko Douglas Gregor Evolutionary Computation Library Aaron Garrett Jaakko Järvi Application to extend Boost regex with recursive matching, named sub-expressions, and automata-based matching Hugh Wimberly John Maddock Visualization Of Arrays And STL Containers Jacob R>Voytko Joaquín L. Muñoz Boost.Extension and Reflection Mariano G. Consoni Hartmut Kaiser A Generic Geometric Library Huseyin Akcan Herve Bronnimann You can find the abstracts of these projects online here: http://code.google.com/soc/boost/about.html As with last year, there were many worthy students and projects that ultimately were not selected. So, for all the students that were not selected realize that the competition for a very few slots was immense. My main advice for students that might want to try again next year is to start participating now -- it really helps to hang out on the list, submit patches, and work on ideas well in advance of SoC. I'd like to thank the mentoring team that evaluated the ~220 applications we received this year. It takes a huge effort to go thru these, read, rank, clarify and give feedback. Note that in addition to the mentors above Andreas Huber, Rene Rivera, and Daniel Wallin all helped with evaluations. For those coming to BoostCon I'll be giving a presentation on Friday about Boost and SoC: http://www.boostcon.com/program/sessions#garland-summer-of-code And, if you aren't coming to BoostCon, well, you should ;-) http://www.boostcon.com/registration Jeff

3 2

[Concept_Check] Is "int &" copy constructible?
by Wu Yinghui, Freddie 14 Apr '07

14 Apr '07

Hi all, I came to this question, since I found that my program using Boost.Concept_check failed to compile when reference types are used as models for the copy constructible concept. I can understand why it failed to compile, as the error messages below explained it: === snip === ..\..\..\boost-1.34\include\boost\concept_check.hpp(176) : warning C4181: qualifier applied to reference type; ignored ..\..\..\boost-1.34\include\boost\concept_check.hpp(176) : error C2529: 'a' : reference to reference is illegal === snip === But my question is more fundamental than this: Is a reference type considered "copy constructible" according to the C++ standard? (Sorry, since I don't have a copy of the Standard at hand, nor am I very good in English to comprehend the Standard even if I had one.) Can any kind soul enlighten me on this concept? Cheers, Freddie -- Wu Yinghui, Freddie Senior Software Engineer Advanced Technology Research and Development Group Volume Interactions Pte Ltd 1 Kim Seng Promenade #12-01 Great World City East Tower Singapore 237994 Tel: +65 62226962 (Ext 216) Fax: +65 62226215 Email: yhwu(a)volumeinteractions.com URL: http://www.volumeinteractions.com http://www.dextroscope.com Important: This message is intended for the recipient(s) addressed above. It contains privileged and confidential information. If you are not the intended recipient, please notify the sender immediately by replying to this message and then delete it from your system. You must not read, copy, use, or disseminate this communication in any form. Thank you.

2 1

[BGL] copying graphs
by Ramy Sadek 13 Apr '07

13 Apr '07

Hello All, I'm using Boost for a work project, and trying to encourage others to use boost for work as well. I've hit a snag using BGL which is hindering that effort. I defined have a class which creates a graph from a graphviz file and uses a dynamic_property_map. I adopted some code straight from the python graphviz example class. My class (mGraph) is defined as follows: class basic_graph : public stored_minstd_rand, public adjacency_list<listS, listS, DirectedS, property<vertex_index_t, std::size_t>, property<edge_index_t, std::size_t> > typedef basic_graph<bidirectionalS> Digraph; typedef boost::graph::python::Digraph mGraph; I have a function that takes in a graph, destructively extracts information from it, while storing the vertex information of visited vertices. I later queries the properties associated with those vertices. Passing by reference allows me to retrieve properties as needed, but destroys the original graph, preventing further processing. So I cobbled together a copy constructor so I could pass by value, but since the vertices are copies of the originals calling attempting to get() a property fails. I don't fully understand the reason for this, but I believe it is a deep vs shallow copy problem. My attempts to use copy_graph() have also failed as my graph uses listS instead of vecS. Changing the template argument to vecS causes internal compiler errors using VS 7.1. So I have two questions. First, how can I modify my class so that it works with copy_graph. Second, how can I implement a copy-constructor that will preserve the dynamic property map and full vertex info so that get() on the copy's properties behaves correctly? Is this even desirable, or does copy-construction have undesirable implications here? Thanks! -Ramy

1 0

Re: [Boost-users] Spirit2 cookbook example suggestions welcome
by Joel de Guzman 13 Apr '07

13 Apr '07

ebo(a)sandien.com wrote: EBo! So nice to see you every now and then. > Something I was playing around with a couple of years ago and never took the > project to full production was a user extensible machine-tool parser which > kept the rules and the grammar in persistent dynamically loadable objects. I > was able to load new commands on the fly, or actually change the grammar rules > themselves... The intent was to provide an RS-274 (D-X) parser that the end > user can overload behaviors as implemented historically by different vender's > over the last 40 years. Also, to allow the end user to implement some of the > more esoteric functionality (like PH and NURB curves). > > I would have to reimplement it in Spirit2 and seriously clean it up though... > Would something like that be interesting? Yeah, that's cool! I'm not sure it fits the criteria I outlined though. Seems to be too complex for the cookbook? Regards, -- Joel de Guzman http://www.boost-consulting.com http://spirit.sf.net

1 0

Failed gcc link and targets
by Douglas Linford 13 Apr '07

13 Apr '07

Good Day, This is my first post, so excuse me if I am unfamiliar with protocol. When I execute, bjam "-sTOOLS=gcc" install from the command line, I get the following errors: ...failed gcc-Link-action bin/boost/libs/program_options/build/libboost_program_options.so/gcc/release/shared-linkable-true/threading-multi/libboost_program_options-gcc-mt-1_33_1.so... ...skipped <@boost!lib>libboost_program_options-gcc-mt-1_33_1.so for lack of <@boost!libs!program_options!build/libboost_program_options.so/gcc/release/shared-linkable-true/threading-multi>libboost_program_options-gcc-mt-1_33_1.so... ...skipped <@boost!lib>libboost_wserialization-gcc-d.so for lack of <@boost!lib>libboost_wserialization-gcc-d-1_33_1.so.1.33.1... ...skipped <@boost!lib>libboost_wserialization-gcc-mt-d.so for lack of <@boost!lib>libboost_wserialization-gcc-mt-d-1_33_1.so.1.33.1... ...skipped <@boost!lib>libboost_wserialization-gcc.so for lack of <@boost!lib>libboost_wserialization-gcc-1_33_1.so.1.33.1... ...skipped <@boost!lib>libboost_wserialization-gcc-mt.so for lack of <@boost!lib>libboost_wserialization-gcc-mt-1_33_1.so.1.33.1... ...failed updating 46 targets... ...skipped 54 targets... root[boost_1_33_1]# What does this mean? Thanks, Douglas

4 10

Abort signal received for Invalid next free when using topological_sort
by Stephen Torri 13 Apr '07

13 Apr '07

BOOST: 1.33.1 GCC: 4.1.1 OS: Fedora Core 6 I am receiving a abort signal from glibc when I am running the test program that is attached. You will find that the program is suppose to create a directed graph of five vertexes. I have printed out how the edges are structured so you will have a picture of the graph. I hope someone is able to help me figure out what is going wrong with this test program. So far I am stumped as to what is wrong. Figuring out the problem and its solution will help me figure out a much larger problem. So the questions I have are: 1. Is there a problem with the definition of the graph? 2. Did I fail to do something in the initialization of the graph? 3. Is this the right forum for me asking my questions? Stephen ----------------------------------------- OUTPUT ----------------------------------------- [storri@localhost infrastructure]$ ./test_dag Added edge: 1 -> 20 Added edge: 1 -> 30 Added edge: 1 -> 40 Added edge: 1 -> 5 Added edge: 20 -> 5 Added edge: 30 -> 5 Added edge: 40 -> 5 *** glibc detected *** ./test_dag: free(): invalid next size (fast): 0x09f08780 *** ======= Backtrace: ========= /lib/libc.so.6[0x47c1709d] /lib/libc.so.6(cfree+0x90)[0x47c1a6f0] /usr/lib/libstdc++.so.6(_ZdlPv+0x21)[0x48058ef1] ./test_dag[0x8053357] ./test_dag[0x8053381] ./test_dag[0x80533bb] ./test_dag[0x8053db1] ./test_dag[0x805f2bd] ./test_dag[0x805f3e9] ./test_dag[0x805f434] ./test_dag[0x805f468] ./test_dag[0x804a858] /lib/libc.so.6(__libc_start_main+0xdc)[0x47bc6f2c] ./test_dag(_ZNSt15basic_streambufIcSt11char_traitsIcEE6xsputnEPKci +0x7d)[0x804a251] ======= Memory map: ======== 003e3000-003e4000 r-xp 003e3000 00:00 0 [vdso] 08048000-08068000 r-xp 00000000 fd:00 3178562 /home/storri/src/libreverse/src/infrastructure/test_dag 08068000-08069000 rwxp 0001f000 fd:00 3178562 /home/storri/src/libreverse/src/infrastructure/test_dag 09f08000-09f29000 rwxp 09f08000 00:00 0 47b94000-47bad000 r-xp 00000000 fd:00 458769 /lib/ld-2.5.so 47bad000-47bae000 r-xp 00018000 fd:00 458769 /lib/ld-2.5.so 47bae000-47baf000 rwxp 00019000 fd:00 458769 /lib/ld-2.5.so 47bb1000-47ce8000 r-xp 00000000 fd:00 458776 /lib/libc-2.5.so 47ce8000-47cea000 r-xp 00137000 fd:00 458776 /lib/libc-2.5.so 47cea000-47ceb000 rwxp 00139000 fd:00 458776 /lib/libc-2.5.so 47ceb000-47cee000 rwxp 47ceb000 00:00 0 47cf0000-47d15000 r-xp 00000000 fd:00 458802 /lib/libm-2.5.so 47d15000-47d16000 r-xp 00024000 fd:00 458802 /lib/libm-2.5.so 47d16000-47d17000 rwxp 00025000 fd:00 458802 /lib/libm-2.5.so 47f97000-47fa2000 r-xp 00000000 fd:00 458837 /lib/libgcc_s-4.1.1-20070105.so.1 47fa2000-47fa3000 rwxp 0000a000 fd:00 458837 /lib/libgcc_s-4.1.1-20070105.so.1 47fa5000-48085000 r-xp 00000000 fd:00 12363696 /usr/lib/libstdc ++.so.6.0.8 48085000-48088000 r-xp 000e0000 fd:00 12363696 /usr/lib/libstdc ++.so.6.0.8 48088000-4808a000 rwxp 000e3000 fd:00 12363696 /usr/lib/libstdc ++.so.6.0.8 4808a000-48090000 rwxp 4808a000 00:00 0 b7e00000-b7e21000 rw-p b7e00000 00:00 0 b7e21000-b7f00000 ---p b7e21000 00:00 0 b7f4c000-b7f4e000 rw-p b7f4c000 00:00 0 b7f60000-b7f62000 rw-p b7f60000 00:00 0 bfa5e000-bfa73000 rw-p bfa5e000 00:00 0 [stack] Aborted ----------------------------------------- GDB OUTPUT ----------------------------------------- (gdb) bt #0 0x009af402 in __kernel_vsyscall () #1 0x47bd9d40 in raise () from /lib/libc.so.6 #2 0x47bdb591 in abort () from /lib/libc.so.6 #3 0x47c0f33b in __libc_message () from /lib/libc.so.6 #4 0x47c1709d in _int_free () from /lib/libc.so.6 #5 0x47c1a6f0 in free () from /lib/libc.so.6 #6 0x48058ef1 in operator delete () from /usr/lib/libstdc++.so.6 #7 0x08053357 in __gnu_cxx::new_allocator<boost::default_color_type>::deallocate (this=0xbfcf7974, __p=0x97fe780) at /usr/lib/gcc/i386-redhat-linux/4.1.1/../../../../include/c++/4.1.1/ext/new_allocator.h:94 #8 0x08053381 in std::_Vector_base<boost::default_color_type, std::allocator<boost::default_color_type> >::_M_deallocate (this=0xbfcf7974, __p=0x97fe780, __n=5) at /usr/lib/gcc/i386-redhat-linux/4.1.1/../../../../include/c++/4.1.1/bits/stl_vector.h:133 #9 0x080533bb in ~_Vector_base (this=0xbfcf7974) at /usr/lib/gcc/i386-redhat-linux/4.1.1/../../../../include/c++/4.1.1/bits/stl_vector.h:119 #10 0x08053db1 in ~vector (this=0xbfcf7974) at /usr/lib/gcc/i386-redhat-linux/4.1.1/../../../../include/c++/4.1.1/bits/stl_vector.h:272 #11 0x0805f2bd in boost::detail::dfs_dispatch<boost::detail::error_property_not_found>::apply<boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned int, boost::property<boost::vertex_name_t, boost::shared_ptr<Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS>, void*, boost::topo_sort_visitor<std::back_insert_iterator<std::vector<void*, std::allocator<void*> > > >, boost::topo_sort_visitor<std::back_insert_iterator<std::vector<void*, std::allocator<void*> > > >, boost::graph_visitor_t, boost::bgl_named_params<int, boost::buffer_param_t, boost::no_property> > (g=@0xbfcf7ac4, vis= {<boost::dfs_visitor<boost::null_visitor>> = {m_vis = {<> = {<No data fields>}, <No data fields>}}, m_iter = {<std::iterator<std::output_iterator_tag,void,void,void,void>> = {<No data fields>}, container = 0xbfcf7b0c}}, start_vertex=0x97fe220, params=@0xbfcf7a34) at /usr/include/boost/graph/depth_first_search.hpp:246 #12 0x0805f3e9 in boost::depth_first_search<boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned int, boost::property<boost::vertex_name_t, boost::shared_ptr<Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS>, boost::topo_sort_visitor<std::back_insert_iterator<std::vector<void*, std::allocator<void*> > > >, boost::graph_visitor_t, boost::bgl_named_params<int, boost::buffer_param_t, boost::no_property> > (g=@0xbfcf7ac4, params=@0xbfcf7a34) at /usr/include/boost/graph/depth_first_search.hpp:324 #13 0x0805f434 in boost::topological_sort<boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned int, boost::property<boost::vertex_name_t, boost::shared_ptr<Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS> const, std::back_insert_iterator<std::vector<void*, std::allocator<void*> > >, int, boost::buffer_param_t, boost::no_property> ( g=@0xbfcf7ac4, result= {<std::iterator<std::output_iterator_tag,void,void,void,void>> = {<No data fields>}, container = 0xbfcf7b0c}, params=@0xbfcf7a74) at /usr/include/boost/graph/topological_sort.hpp:64 #14 0x0805f468 in boost::topological_sort<boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned int, boost::property<boost::vertex_name_t, boost::shared_ptr<Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS> const, std::back_insert_iterator<std::vector<void*, std::allocator<void*> > > > (g=@0xbfcf7ac4, result= {<std::iterator<std::output_iterator_tag,void,void,void,void>> = {<No data fields>}, container = 0xbfcf7b0c}) at /usr/include/boost/graph/topological_sort.hpp:70 #15 0x0804a858 in main () at test_dag.cpp:256 ------------------------------- TEST PROGRAM -------------------------------- #include <boost/graph/adjacency_list.hpp> #include <boost/shared_ptr.hpp> #include <boost/cstdint.hpp> #include <boost/format.hpp> #include <boost/graph/topological_sort.hpp> #include <iostream> #include <map> class Component; class Graph_Base { public: typedef boost::property< boost::vertex_index_t, boost::uint32_t, boost::property< boost::vertex_name_t, boost::shared_ptr<Component> > > VertexProperty_t; typedef boost::adjacency_list< boost::setS, // OutEdgeList boost::setS, // VertexList boost::directedS, // Directed VertexProperty_t > // VertexProperties Graph_t; typedef boost::adj_list_vertex_property_map<Graph_Base::Graph_t, boost::shared_ptr<Component>, const boost::shared_ptr<Component>&, boost::vertex_name_t> Property_Map_const_t; }; class Component { public: typedef boost::shared_ptr<Component> ptr_t; Component ( boost::uint32_t id ) : m_id ( id ) {} ~Component () { m_source_list.clear(); } // Now part of Component_Data void set_Data_Source ( uint32_t id ) { if ( ! m_source_list.insert ( std::make_pair ( id, false ) ).second ) { std::cerr << "WARNING: Attempted to add a duplicate component id."; std::cerr << std::endl; std::cerr << "Ignoring component id." << std::endl; } } std::map<boost::uint32_t, bool>::const_iterator get_Source_List_Begin() const { return m_source_list.begin(); } std::map<boost::uint32_t, bool>::const_iterator get_Source_List_End() const { return m_source_list.end(); } boost::uint32_t get_ID (void) const { return m_id; } private: boost::uint32_t m_id; std::map<boost::uint32_t, bool> m_source_list; }; class Component_Graph { public: typedef boost::graph_traits<Graph_Base::Graph_t>::vertex_descriptor Vertex_t; typedef boost::graph_traits<Graph_Base::Graph_t>::edge_descriptor Edge_t; typedef std::map<uint32_t, Vertex_t> IdVertexMap_t; Component_Graph () {} void add_Component ( Component::ptr_t obj_ptr ) { bool no_duplicate; IdVertexMap_t::iterator pos; Vertex_t node; if ( obj_ptr.get() == 0 ) { std::cerr << boost::format("Exception throw in %s at line %d") % __FILE__ % __LINE__ << std::endl; return; } boost::tie (pos, no_duplicate) = m_index.insert (std::make_pair(obj_ptr->get_ID(), node)); if ( no_duplicate ) { // Insertion was successful // Make a new vertex and return handle to 'node' node = add_vertex(m_graph); // Get list of Components boost::property_map<Graph_Base::Graph_t, boost::vertex_name_t>::type clist = boost::get(boost::vertex_name, m_graph); // Assign component to vertex position clist[node] = obj_ptr; // Add vertex handle to map position pos->second = node; // Get list of indexes boost::property_map<Graph_Base::Graph_t, boost::vertex_index_t>::type ilist = get(boost::vertex_index, m_graph); ilist[node] = obj_ptr->get_ID(); for ( std::map<boost::uint32_t,bool>::const_iterator cpos = obj_ptr->get_Source_List_Begin(); cpos != obj_ptr->get_Source_List_End(); ++cpos ) { this->add_Child ( (*cpos).first, obj_ptr ); } } else { std::cerr << "ERROR: Duplicate source found. Skipping Component" << std::endl; return; } } void add_Child ( uint32_t parent_id, Component::ptr_t obj_ptr ) { IdVertexMap_t::iterator pos; IdVertexMap_t::iterator cpos; if ( obj_ptr.get() == 0 ) { std::cerr << boost::format("Exception throw in %s at line %d") % __FILE__ % __LINE__ << std::endl; return; } pos = m_index.find (parent_id); cpos = m_index.find ( obj_ptr->get_ID() ); if (pos == m_index.end()) { std::cerr << "ERROR: Cannot find parent. Skipping adding component #" << obj_ptr->get_ID() << std::endl; return; } // Add edge from parent to child Edge_t link; if (! (add_edge ( pos->second, cpos->second, m_graph).second)) { std::cerr << "ERROR: Duplicate edge exists from " << parent_id << " to " << obj_ptr->get_ID() << std::endl; return; } else { std::cout << boost::format("Added edge: %d -> %d") % parent_id % obj_ptr->get_ID() << std::endl; } } Graph_Base::Graph_t const& get_Graph () const { return m_graph; } Component::ptr_t get_Component (const Vertex_t& node) const { Graph_Base::Property_Map_const_t clist = get(boost::vertex_name, m_graph); return clist[node]; } private: Graph_Base::Graph_t m_graph; IdVertexMap_t m_index; }; int main (int, char**) { // CREATE Component_Graph Component_Graph m_graph; // Create Components Component::ptr_t node_one ( new Component ( 1 ) ); Component::ptr_t node_twenty ( new Component ( 20 ) ); node_twenty->set_Data_Source ( 1 ); Component::ptr_t node_thirty ( new Component ( 30 ) ); node_thirty->set_Data_Source ( 1 ); Component::ptr_t node_forty ( new Component ( 40 ) ); node_forty->set_Data_Source ( 1 ); Component::ptr_t node_five ( new Component ( 5 ) ); node_five->set_Data_Source ( 1 ); node_five->set_Data_Source ( 20 ); node_five->set_Data_Source ( 30 ); node_five->set_Data_Source ( 40 ); // Add Components to Graph m_graph.add_Component ( node_one ); m_graph.add_Component ( node_twenty ); m_graph.add_Component ( node_thirty ); m_graph.add_Component ( node_forty ); m_graph.add_Component ( node_five ); // Call topological_sort on graph typedef std::vector<Component_Graph::Vertex_t> m_container; m_container comp_list; boost::topological_sort ( m_graph.get_Graph(), std::back_inserter ( comp_list ) ); std::cout << "A topological ordering: "; for ( m_container::reverse_iterator ii = comp_list.rbegin(); ii != comp_list.rend(); ++ii ) { Component::ptr_t comp_ptr = m_graph.get_Component ( *ii ); std::cout << comp_ptr->get_ID() << " "; } std::cout << std::endl; return 0; }

2 6

[filesystem] Any way to preserve timestamps with copy_file?
by Windflower Waters 13 Apr '07

13 Apr '07

I'm copying .jpg files off a camera and I need to know the date the pictures were taken. Because of other constraints I want to accomplish this preserving the timestamp when I copy the file over. -- Windflower Waters

2 1