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

STL MAP Insertion and Updates ..!!
by Rahul Mathur 25 Dec '13

25 Dec '13

Hi, Looking for clue for below. Having a code which has to be inserted and updated with following status - 1. Insert with unique ID and initially with two values (viz . v1[1100] & v2[1000]) 2. If v1 [viz 1100] is NOT accepted exit. 3. Else value v2[1000] is accepted. With v2 being accepted, further insert with same unique ID on which v2 was accepted but now either with three values of v3[1001] or v4[1002] or v5[1003] and UPDATE the STL MAP. 4. Print the FINAL value (v2 or v3 or v5) of STL MAP with given unique ID. Did wrote below lines which works until value v1 [1000] insertion - --- #include <iostream> #include <algorithm> #include <map> #include <iterator> using namespace std; struct TBag { int UnqID; short value_code; TBag():UnqID(1234),value_code(1000){} }; TBag ms_var1; typedef std::map<int, short> map1; class Apple { map1 abc; public: void TypeInsert ( TBag *ms_var ); }; void Apple::TypeInsert ( TBag *ms_var ) { // Insert the 'UnqID' with messages of either TC = 1000 or 1100 only. typedef std::pair <map1::iterator, bool> itr; itr it1 = abc.insert( std::make_pair( ms_var->UnqID, ms_var->value_code ) ); typedef std::pair <map1::iterator, bool> itr; //Searching for value of Value Code = 1000 if (ms_var->value_code == 1100) { std::cout << "Value Error." << endl; exit (1); } if (it1.second) { // Checking correct insertion happened with 1000 std::cout << "Unq ID (" << it1.first->first << ") => " << "Value Code (" << it1.first->second << ")" << endl; std::cout << "The Status is .." << it1.first->first << " & " << it1.first->second << endl ; // INSERT now with Value code of either 1001 or 1002 or 1003 & finally UPDATE the STL MAP std::cout << "Final Status:" << endl ; for( map<int, short>::iterator iter = map1.begin(); iter != map1.end(); ++iter ) std::cout << iter->first << " " << iter->second << endl ; std::cout << "All Status successful." << endl; } else std::cout << "Status Error." << endl; } int main () { Apple ms; ms.TypeInsert( &ms_var1 ); return 0; } --- Any help is well appreciated ..:) ~ XoXo

2 1

Re: [Boost-users] How to use the optional with property_tree‏
by 王郁槐 25 Dec '13

25 Dec '13

I still don't understand，could you please figure it out？thanks. 发送自魅族手机 -------- 原始邮件 -------- 发件人：Olivier Tristan <o.tristan(a)uvi.net> 时间：周四 12月19日 22:08 收件人：boost-users(a)lists.boost.org 主题：Re: [Boost-users] How to use the optional with property_tree‏ >Those following lines from your code should give you a hint > >if (child2) >{ >child2.get().put_value(strValue); >} >else >{ >child2.get().put_value(strValue); >} > > > >Le 19/12/2013 12:34, 王郁槐 a écrit : >> Could anyone help? Why the below code will crash on the below line? I'm using the boost property_tree. Thanks. >> >> child1.get().put(sub_field, strValue); >> >> ========================================================= >> #include <fstream> >> #include <boost/filesystem.hpp> >> #include <boost/property_tree/ptree.hpp> >> #include <boost/property_tree/ini_parser.hpp> >> #include <boost/any.hpp> >> #include <boost/optional.hpp> >> >> void writeConfig(const std::string &field, const std::string &sub_field, const std::string & strValue) >> { >> if (!boost::filesystem::exists(prog_cfg_file)) >> { >> std::ofstream ofIniConfig(prog_cfg_file, std::ofstream::out|std::ofstream::app); >> ofIniConfig.close(); >> } >> >> >> boost::property_tree::ptree pt; >> boost::property_tree::ini_parser::read_ini(prog_cfg_file, pt); >> boost::optional<boost::property_tree::ptree&> child1 = pt.get_child_optional(field); >> >> if (child1) >> { >> boost::optional<boost::property_tree::ptree&> child2 = child1.get().get_child_optional(sub_field); >> >> if (child2) >> { >> child2.get().put_value(strValue); >> }else >> { >> child2.get().put_value(strValue); >> } >> }else >> { >> child1.get().put(sub_field, strValue); >> } >> >> boost::property_tree::ini_parser::write_ini(prog_cfg_file, pt); >> } >> >> int main() >> { >> writeConfig("test", "a", "OK"); >> return 0; >> } >> >> >> >> >> -- >> 兰生幽谷, 不以无人而不芳... >> >> >> >> >> _______________________________________________ >> Boost-users mailing list >> Boost-users(a)lists.boost.org >> http://lists.boost.org/mailman/listinfo.cgi/boost-users > > >-- >Olivier TRISTAN >uvi.net > >_______________________________________________ >Boost-users mailing list >Boost-users(a)lists.boost.org >http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 2

[graph] boykov_kolmogorov_max_flow and reverse edges capacity
by Olivier Tournaire 21 Dec '13

21 Dec '13

Hi, I am trying to use boykov_kolmogorov_max_flow algorithm to find a minimum cut of some graph. To build the graph, I first create source and sink vertices. I then add some vertices, and connect them. Each time I create and edge, I also create the reverse edge: edge_descriptor_bool e01 = add_edge(v0, v1, _graph); edge_descriptor_bool e10 = add_edge(v1, v0, _graph); reverse[e01.first] = e10.first; reverse[e10.first] = e01.first; where reverse is: boost::property_map<Graph, boost::edge_reverse_t>::type reverse = get(boost::edge_reverse , _graph); I then fill edge capacity: capacity[e10.first] = this->getEnergy(fh, fh_v0); // Use policy to compute energy capacity[e01.first] = this->getEnergy(fh, fh_v0); // Use policy to compute energy My question is how capacity of reverse edge has to be computed. The doc states that reverse edge can carry capacities different than 0, but should they be the same as their parallel edge? Note that I use the algorithm with this method: _minEnergy = boykov_kolmogorov_max_flow(_graph, _source, _sink); Any help would be appreciated. Regards, Olivier

2 1

BGL: using short integer as vertex_descriptor
by Adam Celick 21 Dec '13

21 Dec '13

Hi, I am using the graph library in a memory constrained environment. By default vertex_descriptor for an adjacency_list (of vectors, i.e. vecS, vecS) seems to be std::size_t. I was wondering if there's a way to use say uint16_t for the vertex_descriptor? Thanks, -Adam

2 1

[boost.test] Unable to perform init at startup
by Adam Nielsen 21 Dec '13

21 Dec '13

Hi all, I'm having a bit of a problem trying to figure out how to perform some class init while manually registering my tests.

1 0

[boost.asio] Concurrently Ping 1000+ Hosts
by Kyle Ketterer 21 Dec '13

21 Dec '13

Hello, So the subject line pretty much says it all. Basically, I am trying to expand off of the icmp ping example given by the boost library documentation. I would like to ping 1000+ hosts in say, a matter of minutes rather than a matter of hours. I have already expanded the class shown here: http://www.boost.org/doc/libs/1_40_0/doc/html/boost_asio/example/icmp/ping.… Before I start posting code, I would like to discuss the strategy of trying to do this. In my Main thread, I was thinking about creating a vector of PingX objects. In the PingX class, I would have a separate io_service as well as wrap the async() functions in strands. I set the deadline timer at 800ms that way the io_service should return in less than a second. I would then call io_service run() in separate threads to *concurrently* ping these hosts. The problem appears to be that even through the async handers are wrapped in strands, there is data corruption. Is it true that when async handlers are wrapped in strands, they still cannot be executed *concurrently* ? My understanding of strand was that it serializes the handler functions to allow for thread safe access. However, I think that because I am accessing the same resources in multiple threads (such as the socket() object ), it is corrupting my expected output as well as occasionally throwing some exceptions. Are there any suggestions for the logic surrounding this or if this can be done in a multithreaded environment? Thanks! -- Kyle Ketterer

7 16

Boost.Coroutine and Object Inheritance
by Carlos Ferreira 20 Dec '13

20 Dec '13

Hello to all. I need some help using the Boost.Coroutine lib. I wanted to use the coroutines as objects and for that, I tried to build a simple object and inherit the boost::coroutines::coroutine template. ex: class SimpleObj : public boost::coroutines::coroutine<SimpleObj>{ private: std::unique_ptr<boost::asio::ip::tcp::socket> tcpSkt_uPtr; std::unique_ptr<boost::asio::ip::tcp::acceptor> acc_uPtr; public: SimpleObj(std::shared_ptr<boost::asio::io_service> ioService_ptr, boost::asio::ip::tcp::endpoint &endPoint); ~SimpleObj(); void run(); }; Is this right? Can I actually inherit from the boost::coroutines::coroutine template ? If yes, how can I proceed from here, to use the run() object method as the coroutine itself, with an io_service provided through the constructor ? Thanks for any assistance! -- Carlos Miguel Ferreira Researcher at Telecommunications Institute Aveiro - Portugal Work E-mail - cmf(a)av.it.pt Skype & GTalk -> carlosmf.pt(a)gmail.com LinkedIn -> http://www.linkedin.com/in/carlosmferreira

3 5

[git][testing] regression testing?
by Joaquín Mª López Muñoz 19 Dec '13

19 Dec '13

There's been some unanswered questions around this. I understand that regression tests, which are critical to ensure clean develop->master merges, will be eventually updated to work against git rather than the abandoned SVN, but I can't find any info on the progress of this. FWIW, I see some authors are going ahead and merging their libs anyway, which will bring breakages etc if changes are not properly validated through regression testing. Any indication on how this is progressing much appreciated. Best, Joaquín M López Muñoz Telefónica Digital ________________________________ Este mensaje se dirige exclusivamente a su destinatario. Puede consultar nuestra política de envío y recepción de correo electrónico en el enlace situado más abajo. This message is intended exclusively for its addressee. We only send and receive email on the basis of the terms set out at: http://www.tid.es/ES/PAGINAS/disclaimer.aspx

1 0

How to use the optional with property_tree‏
by 王郁槐 19 Dec '13

19 Dec '13

Could anyone help? Why the below code will crash on the below line? I'm using the boost property_tree. Thanks. child1.get().put(sub_field, strValue); ========================================================= #include <fstream> #include <boost/filesystem.hpp> #include <boost/property_tree/ptree.hpp> #include <boost/property_tree/ini_parser.hpp> #include <boost/any.hpp> #include <boost/optional.hpp> void writeConfig(const std::string &field, const std::string &sub_field, const std::string & strValue) { if (!boost::filesystem::exists(prog_cfg_file)) { std::ofstream ofIniConfig(prog_cfg_file, std::ofstream::out|std::ofstream::app); ofIniConfig.close(); } boost::property_tree::ptree pt; boost::property_tree::ini_parser::read_ini(prog_cfg_file, pt); boost::optional<boost::property_tree::ptree&> child1 = pt.get_child_optional(field); if (child1) { boost::optional<boost::property_tree::ptree&> child2 = child1.get().get_child_optional(sub_field); if (child2) { child2.get().put_value(strValue); }else { child2.get().put_value(strValue); } }else { child1.get().put(sub_field, strValue); } boost::property_tree::ini_parser::write_ini(prog_cfg_file, pt); } int main() { writeConfig("test", "a", "OK"); return 0; } -- 兰生幽谷, 不以无人而不芳...

2 1

Caching the iterator of async_resolve()?
by Kaspar Fischer 18 Dec '13

18 Dec '13

Hi everybody, Just to be on the safe side: I assume that I can cache the iterator returned by async_resolve<http://www.boost.org/doc/libs/1_49_0/doc/html/boost_asio/reference/ip__basi…>'s handler, correct? The fact that it's a forward iterator suggests so... Thanks! Kaspar

2 4