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

A* heuristic
by giridhar 24 Dec '11

24 Dec '11

Hello All, I have a question about defining A* heuristic. I am trying to implement an algorithm in a paper using BGL. Here authors have used A* Dijkstra's to calculate shortest route with an additional constraint of route length should be no longer than a threshold value t. I think due to this threshold constraint they are using A* instead of normal Dijkstra's algorithm. I came to know A* is already there in Boost Graph Library. I just have a basic knowledge about A* algorithm that it finds the shortest route based on the heuristic H. I tried to look into the example in BGL, but I did not get any hint to define a heuristic. Can anybody give me some hints or some useful links of how can I define a heuristic for this particular scenario of finding the shortest path between nodes that is no longer than threshold t through A* Dijkstra. This would be really helpful for me to proceed further. -- Regards, Giridhar

5 5

Problem with boost ::interprocess::string
by Josmon Paul 23 Dec '11

23 Dec '11

3 2

filesystem::path threadsafe ?? (1.48)
by Aris Basic 22 Dec '11

22 Dec '11

is filesystem::path threadsafe ? i think im seeing issues related to conversion of std::string to std::wstring (that is being used by path on windows) (so thats put blame onto string to wstring conversion) did anyone see anything like that ? if not ill try to create a small sample app that recreates the issue. code portion <similar code run in multiple threads> std::string spath("c:\\somefolder"); fs::path path(spath); // i get crash within this call seems like conversion is using static instance of codecvt and it breaks on call in (do_in) maybe its just windows codecvt issue

1 0

Using boost::uuids::uuid as a map index
by Tim Burgess 22 Dec '11

22 Dec '11

Hi, I'm new to using boost and have hit a problem using UUID. I have a set of classes that have UUID variables to provide unique identifiers. I wish to achieve two things: 1 - Allow objects to reference each other based on their UUID values (imagine the usual databasing student/teacher/course models); 2 - Maintain std::map collections of objects of the same class. Initially, I made the mistake of creating a class instance containing my UUID then inserting it into a map: Std::map <boost::uuid::uid, myClass> myMap; The index of the entry was set as follows: Std::pair <boost::uuids::uuid, myClass> myPair; myPair = std::make_pair( myClassInstance.UUIDField, myClassInstance); myMap.insert( myPair); All look-ups within the map based on the UUID then fail, as adding the object to the map is essentially a copy operation and UUID is non-copyable, so new unique identifiers were generated. I then tried: Std::map <boost::uuids::uuid *, myClass*> myMap; I thought that this should work as the actual UUID value would only ever be held in a single instance of myClass and the relationships between objects could be maintained by following the pointers. Unfortunately, look-ups using this scheme also fail and I can't see where I'm going wrong. Can anybody advise, please? Best wishes. Tim Burgess Raised Bar Ltd Phone: +44 (0)1827 719822 Don't forget to vote for improved access to music and music technology at http://www.raisedbar.net/petition.htm -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Cromwell Enage Sent: 10 December 2011 05:42 To: boost-users(a)lists.boost.org Subject: [Boost-users] [boost-users][container] associative placement insertion Hi, all! I'm wondering how placement insertion works for pair-associative Boost.Container types. For example, given: //[ex_code struct D { D(char,char) {} // Insert Boost.Move awareness here... }; boost::container::map<int,D> my_map; //] Will my_map.emplace(0, 't', 'p') call D('t', 'p') and move the object into the map? Will Boost.Unordered work the same way? TIA! Cromwell D. Enage _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

3 4

boost::polygon::polygon_set
by Egon Schaal 22 Dec '11

22 Dec '11

Hello I have a question to use the function template <typename T, typename coord_type> T& simplify(T& polygon_set, distance_type threshold) How must I define the parameter distance_type My typedefs are set to typedef boost::polygon::point_data<double> point; typedef boost::polygon::polygon_set_data<double> polygon_set; typedef boost::polygon::polygon_with_holes_data<double> polygonwh; typedef boost::polygon::polygon_data<double> polygon; I think the distance_type must be a double. Mit freundlichen Grüßen / Best regards Egon Schaal ///////////////////////////////////////////////// Egon Schaal CAD-Consulting, Softwareerstellung Aspacherstr. 15 71522 Backnang Email egon.schaal(a)cad-cons.net Web http://www.cad-cons.com Tel (+49)7191-84498 Fax (+49)7191-71410 SteuerNr: 51336/01006 /////////////////////////////////////////////////

1 0

Please help me to choose a container
by Jayden Shui 21 Dec '11

21 Dec '11

Hi All, I have a number of named objects of type B whose name can be accessed by B::Name(). B is polymorphic. D1, D2 and so on are derived from B. I want to put them in a set or map-like container ordered by their names. They are referenced by other objects, such as of type C. If the objects in the container are changed by its type (from type D1 to D2) or value, their users can know it automatically, i.e. those information is shared among owners and users. To erase an object in the container, first we need to ensure it is not be used by other objects. Please help me on choose a proper container with smart pointers. I am struggling with it by trying multi-index-container, pointer container, standard container, and cannot find a good way. Thanks a lot ! ! Best regards, Jayden

4 5

How to make multi_index_container work with std::unique_ptr?
by Jayden Shui 21 Dec '11

21 Dec '11

Hi All, If the elements of a multi_index_container are std::unique_ptr, it doesn't seem to work because the assignment operator of std::unique_ptr is private. Any way to let it work? If I change unique_ptr to shared_ptr, it works. But I need a good performance. Or is there anyway to work around to get pointer container performance with multi index power? Thanks a lot! Jayden

3 10

ASIO + SSL + no shared cipher
by Luke Walker 21 Dec '11

21 Dec '11

Hi All,I've taken the SSL server example "as is" but when I attempt to send a request from (Safari, Firefox, Chrome or IE) the handshake fails with "no shared cipher". I've researched the issue for several days and made a few changes. I use OpenSSL_add_all_algorithms and SSL_CTX_set_cipher_list to attempt to satisfy the cipher's but I get the same error. I also used OpenSSL > s_client to try and negotiate a cipher but it fails as well. One assumption I've assembled is that Chrome, Safari and NSURLRequest (Cocoa API) all use the same cipher list. Again I am using the ssl server example and have changed the context SSL Version but still no success. Any help would be greatly appreciated. Luke

1 0

Selecting a random neighbor
by George Bezerra 21 Dec '11

21 Dec '11

Hi, I'm totally new to BGL. I would like to know what is the best way to select a random neighbor of a vertex in an undirected graph without having to iterate through all neighbors. Can anyone help me with that? Thanks! George. -- George Bezerra Doctoral Student Department of Computer Science University of New Mexico, USA

2 1

[Regex] anyone seeing performance dip w/regex matching moving from 1.47->1.48 w/gcc?
by Kopet, Gary 20 Dec '11

20 Dec '11

Hi, I just pulled down boost regex 1.48 and built it with gcc 4.3 on CentOS 5.5. My internal regex performance tests are showing > 30% performance degradation between versions 1.47 and 1.48. I wanted to ask if anyone else has seen anything like this? We've been using the same makefile to built boost regex for a long time, and we haven't converted to bjam. So I am wondering if this could be due to our particular build environment? TIA, Gary Protected by Websense Hosted Email Security -- www.websense.com

2 2