- Boost-users - lists.boost.org

Re: [Boost-users] BoostCon 2007 Program Committee progress report
by Andrew Marlow 15 Jan '07

15 Jan '07

boost-users-bounces(a)lists.boost.org wrote: > The conference dates (May 14-16) are firm, and other > arrangements are moving forward. See > http://www.boost.org/more/BoostCon07.html > This sounds like the bees knees. Unfortunately I will not be able to persaude my current employer to send me and my colleagues to Colorado for that week. What plans does Boost have for a UK conference please? I am trying to get my employer to consider using boost for some platform independence. Regards, Andrew Marlow ******************************************************************************" The data and information (collectively called Information) herein is the sole property of ICAP. The Information is confidential, may be legally privileged and is intended solely for the use of the individual or entity to whom it is addressed. Unauthorised disclosure, copying or distribution of the Information is strictly prohibited and the recipient of the Information shall not redistribute the Information in any form to a third party. If you received this Information in error please tell us by reply (or telephone the sender) and delete all copies on your system. References in this Information to ICAP are references to ICAP plc, a company incorporated in England with registered number 3611426 whose registered office is 2 Broadgate, London, EC2M 7UR and where the context requires, includes its subsidiary and associated undertakings. As applicable, certain companies within the ICAP group are authorised and regulated by the Financial Services Authority. Any investment research sent from ICAP will provide an impartial and objective assessment of the securities, companies or other matters that are the subject of their research and our Conflicts of Interest Management Policy regarding investment research can be viewed by requesting a copy from your usual contact at ICAP. Please visit www.icap.com for further regulatory information including details regarding the European eCommerce Directive. *******************************************************************************" We have taken precautions to minimise the risk of transmitting software viruses, but we advise you to carry out your own virus checks on any attachment to this message. We cannot accept liability for any loss or damage caused by software viruses. " *******************************************************************************

1 0

[bind] Overloaded function names
by Mark Ruzon 15 Jan '07

15 Jan '07

I have a function that performs the same task on several data types and data combinations: template <typename T> int f(const type1<T>& x); template <typename T> int f(const type2<T>& x); template <typename T> int f(const type2<T>& x, const type2<T>& y); I want to create a function object out of the second function. However, bind(f, _1) is ambiguous. Is there a way to disambiguate this using a bind call, or do I have to create my own function object? Thanks, Mark

2 1

[BGL] remove_edge with vecS for vertices and setS for edges
by Alejandro Marcos Aragón 15 Jan '07

15 Jan '07

Hi everyone, I was wondering if the library handles the edge removal for graphs that use the vecS as a container for the vertices and the setS for the edges. I've been trying to use the function and I have a segmentation fault. Thank you, a^2

2 1

What's wrong in regular expression
by Игорь Микушкин 15 Jan '07

15 Jan '07

Hello! I wrote the regular expression: ^\s*(?:([A-Za-z_]*)\s*=\s*([A-Za-z0-9_/\.]*)\s*)*$ for splitting lines like: name = abc value1 = def value2 = ghi I need the result like: match [1] = name match [2] = abc ... match [6] = ghi But I get ! : match [1] = value2 match [2] = ghi (the last 2 matches) What is wrong in my expression? Thank You. --------------------------------- Вы уже с Yahoo!? Испытайте обновленную и улучшенную Yahoo! Почту!

3 2

[graph design] Advise needed - edge-to-edge passing cost
by james.jones＠firstinvestors.com 15 Jan '07

15 Jan '07

From: "Anton A. Patrushev" <anton(a)orkney.co.jp> > I need to construct a graph with following requirements: > 1. Edges should have a cost (trivial) > 2. Vertices should have a cost (also trivial) > 3. For each edge I need to define a costs of passing from this edge to > any other adjacent edge (my problem is here!) > It means that just vertex cost doesn't work - from one edge I can pass > to several edges through the same vertex and I need separate cost for > each way. > I can't split edges and vertices to many, 'cause in my case it will > drastically increase the data. > > Can anybody, please, make an advise how to implement the third rule? I'm not sure if this solves your problem, but have you considered constructing the dual of your graph and then using the vertex cost? - James Jones Administrative Data Mgmt. Webmaster 375 Raritan Center Pkwy, Suite A Data Architect Edison, NJ 08837

2 1

[Boost.Serialization] Best way to serialize binary data?
by sadrok 14 Jan '07

14 Jan '07

Hello I need to serialize some raw binary data. What is the best way to do it for all three archive implementations? I've had troubles with the two text-based ones giving me base64 errors on loading when I use load_binary. Also I noticed that the xml_?archive doesn't produce nice XML when I use save/load_binary. Thanks -- sadrok(a)gmail.com Yahoo! IM: sadrok_za Jabber ID: sadrok(a)jabber.obsidian.co.za

2 2

Boost conversion to struct tm for version 1.31
by debayan.bhattacharya＠firstinvestors.com 12 Jan '07

12 Jan '07

Hi all, I need some help converting a boost::gregorian::date to struct tm in version 1.31. to_tm(date) function dont seems to work in this version. Your help is greatly appreciated. Thanks Debayan

2 1

serialize std::map
by Mark Wyszomierski 12 Jan '07

12 Jan '07

Hi, I'm experiencing a runtime error while using boost's serialization for std::map. I am defining a map like: std::map<int, CSomeData> m; and serializing it as I do any other container or primitive type. However when the map contains more than two elements, there is a runtime exception when reading a serialized file back in. I'm using visual studio 8. Following is the exact source code I'm trying this with (very short sample app). Can anyone see what I'm doing wrong, or if there is an error with the boost code? I took a look at the written file in a binary editor and it looks fine. #include <boost/archive/binary_oarchive.hpp> #include <boost/archive/binary_iarchive.hpp> #include <boost/serialization/map.hpp> #include <fstream> #include <string> #include <map> using namespace std; // This is a test class to use as the map data. class CSomeData { public: CSomeData(){}; CSomeData(float f0, string str0) { m_f0 = f0; m_str0 = str0; } float m_f0; string m_str0; private: friend class boost::serialization::access; template<class Archive> void serialize(Archive &ar, const unsigned int version) { ar & m_f0; ar & m_str0; } }; // This is the class we really want to try serializing. class CTest { public: CTest(){}; CTest(int nNumber) { m_nNumber = nNumber; // Fill with some dummy data. m_mTst.insert(make_pair(0, CSomeData(0.23f, "hi hi hi"))); m_mTst.insert(make_pair(1, CSomeData(7.65f, "second one"))); m_mTst.insert(make_pair(2, CSomeData(9.23f, "third one"))); m_mTst.insert(make_pair(3, CSomeData(5.6766, "chosen one"))); } ~CTest(){}; int m_nNumber; map<int, CSomeData> m_mTst; private: friend class boost::serialization::access; template<class Archive> void serialize(Archive &ar, const unsigned int version) { ar & m_nNumber; ar & m_mTst; } }; int main() { std::ofstream ofs("filename"); // Write class instance to archive. Writing seems to work ok. const CTest ct(5); { boost::archive::binary_oarchive oa(ofs); oa << ct; } // Try to restore it sometime later. CTest ctNew; { std::ifstream ifs("filename", std::ios::binary); boost::archive::binary_iarchive ia(ifs); // READING CAUSES THE EXCEPTION! ia >> ctNew; } return 0; } Thanks, Mark

2 4

Re: [Boost-users] [Threads]
by Robert Marion 12 Jan '07

12 Jan '07

Manuel Jung wrote: >> Hi, >> >> I have a strange problem. The destructor of a class calls join_all(). >> But it seems that he hangs there. Even though some other code behind the >> join_all() is executed before it finishs! >> Lets get concret: >> >> seal::~seal() >> { >> ThgPrgs.join_all(); >> cout<<"Crabd quits, goodbye"<<endl; >> } > > Could you possibly post a small (complete) example that demonstrates the > behaviour? I am not able to guess where to problem might be from looking > at the destructor only. Are you expecting the destructor to be called once? Probably what is happening is your default constructor is being called more than once (during a copy operation) and you are unaware of it. So your destructor gets called more than once. Robert Marion

2 1

[graph design] Advise needed - edge-to-edge passing cost
by Anton A. Patrushev 12 Jan '07

12 Jan '07

Dear all, I need to construct a graph with following requirements: 1. Edges should have a cost (trivial) 2. Vertices should have a cost (also trivial) 3. For each edge I need to define a costs of passing from this edge to any other adjacent edge (my problem is here!) It means that just vertex cost doesn't work - from one edge I can pass to several edges through the same vertex and I need separate cost for each way. I can't split edges and vertices to many, 'cause in my case it will drastically increase the data. Can anybody, please, make an advise how to implement the third rule? Thanks! Anton.

1 0