- Boost - lists.boost.org

Re: [boost] version conflicts: is there a solution?
by Artyom 24 Jun '09

24 Jun '09

Hi, Take a look on this namespace renaming script: http://lists.boost.org/Archives/boost/2009/05/151816.php It should work, not sure about correctness of build system. I consider to submit it officially once it polished, but it seems to work. Artyom --- On Wed, 6/24/09, Lewis Hyatt <lhyatt(a)gmail.com> wrote: > From: Lewis Hyatt <lhyatt(a)gmail.com> > Subject: [boost] version conflicts: is there a solution? > To: boost(a)lists.boost.org > Date: Wednesday, June 24, 2009, 3:49 AM > Hi Everyone- > > This has been discussed before > (http://thread.gmane.org/gmane.comp.lib.boost.devel/180008) > but I think my > question is along a slightly different line so I thought I > would ask about it. > Let's say I want to compile and distribute a library > (without the source), and I > happen to use some boost header-only libraries as an > implementation detail in > some of my functions. None of the headers associated with > my library include > boost headers; it's purely an internal detail. > > Now, it seems to me that users of my library will still > have to be aware of the > fact that I used boost in my implementation -- > specifically, if they happen to > use different versions of the same boost libraries in their > code, then the ODR > is violated and the behavior is undefined. > > I realize this isn't a boost-specific problem (it would > affect any library of > template functions), but I am wondering if there is a > boost-specific solution > already worked out? Has anyone thought about this? It seems > to me that in this > case, what would be ideal would be if I could do: > > #define BOOST_NAMESPACE some_unique_namespace_for_boost > #include "boost/algorithm/string.hpp" > BOOST_NAMESPACE::shared_ptr<void> x; //or whatever > > Then I can insure there are no ODR violations and I don't > need to bother users > of my library with the fact that I used boost at all. > > Other than the sheer annoyance of having to go through all > the boost code to use > this macro, is there a strong downside to this approach? > > Alternatively, I could try: > > namespace { > #include "boost/..." > } > > But I don't know, could this work? Or are there boost > headers that rely on fully > qualified references like ::boost::algorithm::whatever? > > I'd appreciate anyone's thoughts on this issue, thanks! > > -Lewis > > _______________________________________________ > Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost >

1 0

Re: [boost] Proposal: Monotonic Containers - Comparison with boost::pool, boost::fast_pool and TBB
by Christian Schladetsch 24 Jun '09

24 Jun '09

> Updated tests (more of them, better formatting of results) for > https://svn.boost.org/svn/boost/sandbox/monotonic/libs/monotonic/test/compa… here > http://tinyurl.com/m83vll for GCC and here http://tinyurl.com/n9g8jv for > MSVC. I also added a column for std::allocator/mono. Have added comparison against TBB, as requested. These results are at the same location as linked to above. Christian.

7 39

Re: [boost] boost namespace
by Artyom 24 Jun '09

24 Jun '09

> I need to use two versions of boost in my > application. One the libs I link > against is statically linked against boost 1.34 and I'd > like to use 1.35's > asio library. First of all Asio comes as stand alone library outside of boost namespace. So, you may just use it as is or use namespace renaming: #ifdef USE_BOOST_ASIO #include <boost/asio.hpp> namespace netio = boost::asio; using boost::system::error_code; using boost::system::system_error; #else #include <asio.hpp> namespace netio = asio; using asio::error_code; using asio::system_error; #endif And then just relate to netio::... so you would keep an ability to upgrade to boost asio in future. This is the way I build CppCMS http://cppcms.sourceforge.net/ conditionally using Boost 1.33.1 and Asio or boost 1.35 and above only. > I believe I can make both versions > co-exist if I can manage > to rename boost 1.35's namespace to something like > boost135. > Take a look on a script I had written once: http://lists.boost.org/boost-build/2009/05/21911.php But note! boost 1.35 and 1.34 are not compatible nither ABI nor API. So you **must** not mix them in same module! This may be very tricky. So you can't use boost in interfaces between modules that use different versions of boost. Artyom

2 1

[Review Request] polygon
by Simonson, Lucanus J 23 Jun '09

23 Jun '09

Gtl was renamed to boost::polygon. The source is available at https://svn.boost.org/svn/boost/sandbox/gtl/boost/polygon/ And the documentation is at https://svn.boost.org/svn/boost/sandbox/gtl/doc/index.htm I have a review manager and a number of prospective reviewers lined up, so we should be able to at least get the review started smoothly. I would like the review wizard to contact me off list to discuss which dates are more suitable to have the review given my personal schedule. Thanks, Luke

2 4

SafeInt code proposal
by Omer Katz 23 Jun '09

23 Jun '09

A friend and I have started working on a SafeInt library which we hope will be included in Boost the library is composed of a template class, which excepts existing integer types as a parameter, and an exception class. not all operators have been implemented and there is still work to be done on the library, but we have reached a stage in which at least the basic operators are ready and tested. I've attached to this thread a zip file containing the code for the library and a tester we wrote (as an example for how the class should be used) I've also uploaded it to the boost vault. We would appreciate it if you took the time to review our code and give us your comments, tips and opinions (either as a reply to this thread or by email - omerktz(a)gmail.com) thanks, Omer Katz and Zil Levi

8 16

[task] boost.task-0.2
by k-oli＠gmx.de 23 Jun '09

23 Jun '09

Hi, I've uploaded a new version of boost.task (boost.threadpool) to boost vault http://www.boost-consulting.com/vault/index.php?directory=Concurrent Programming Changes: - detail/atomic.hpp with atomic_exchange (gcc + x86|ppc) - handle< R > with new function get_future() returning reference to internal shared future - moved execution-policies new_thread, own_thread and as_sub_task in separat headers - async() with as_sub_task as default execution-policy - functions interrupt_and_wait_until() and interrupt_and_wait_for() from handle< R > returning boolean indicating if op. succeeded or timed out - move semantics for task< R > and static_pool< R > - new function interrupt_all_worker() for static_pool< Channel > in order to interrupt all worker-threads without invalidating the pool - default_pool() removed because thread_resource_error exceptions thrown by static pool - support of processor-binding for FreeBSD (>=7.1) - tests updated - examples updated - documentation updated regards, Oliver

1 0

How to speed up the djikstra graph
by Lennart Berg 23 Jun '09

23 Jun '09

Hi Everybody I have had the pleasure of using the boost graph library for my project now, but I have ran into some problems, that I hope you can guide me on. First of all, let me tell a little about the project. I am a third party developer for paradox interactive, making an expansion for one of their games. Now i have implemented the djikstra alghorithm to simulate the transport capacity of countries, and it works pretty well. However I still think that the speeds to be improved somewhat (takes about 1-2 secs to compute), to make it more playable. First of all the map consists of ~2500 provinces / vertexes each with 4-8 edges / neighbours. I Find all the provinces I can access and then add all neighbours from it as edges. Each edge is allocated a cost according to infrastructure, terrain and distance from orgin to destination. Each "round" of the game is an hour, so a day is effectively 24 rounds. Right now I make a new graph once every day, one separate graph for each country, and compute it for every country once a day. However as the game has up to 300+ countries that becomes a pretty harsh computational burden. Now pretty much every variable in this setup can change hourly. ( location of units, conquest / loss of provinces, destruction of infrastructure, expansion / repair of infrastructure) So the question is how I can improve this approach. Optimally the graph should be persistant and allow me to dynamically add / remove provinces and change the cost of the edges every hour (as I understand it the boost library allows that right now with vertex_clear / add etc.), and giving new values without recomputing every single edge in the graph 300 times every hour. Is that possible? And if how would that be done? Thanks in advance Lennart Berg

8 18

[BGL] boost::add_vertex - add unique vertexes to graph
by Mariusz Kwiczala 23 Jun '09

23 Jun '09

Hi, Currently I externally check if vertex exist in graph. But it is look like boost::add_vertex can check internally if vertexes are unique. if (optional<vertex_descriptor> v = g.vertex_by_property(get_property_value(p, vertex_bundle))) return *v; Could you send me any example where boost::add_vertex just return already created vertex (line: "return *v") instead of create new one? boost_1_39_0\boost\graph\detail\adjacency_list.hpp contain: template <class Graph, class Config, class Base> inline typename Config::vertex_descriptor add_vertex(const typename Config::vertex_property_type& p, vec_adj_list_impl<Graph, Config, Base>& g_) { typedef typename Config::vertex_descriptor vertex_descriptor; Graph& g = static_cast<Graph&>(g_); if (optional<vertex_descriptor> v = g.vertex_by_property(get_property_value(p, vertex_bundle))) return *v; typedef typename Config::stored_vertex stored_vertex; g.m_vertices.push_back(stored_vertex(p)); g.added_vertex(g.m_vertices.size() - 1); return g.m_vertices.size() - 1; } Best regards, Mariusz

2 1

Re: [boost] GSoC Unicode library: second preview
by Artyom 23 Jun '09

23 Jun '09

> Of course, the library works with UTF-8 and UTF-32 just as > well, it makes no difference to the generic algorithms > (which don't exist yet, but expect substring searching and > the like), it's up to you to choose what makes the most > sense to use for your situation (for example, you may choose > to use UTF-8 because you need to interact a lot with > programming interfaces expecting that format). > Ok, this is really good. > They should be fairly easy to find. > Either you're using the algorithm that does the task > correctly, or you're fiddling with the encoding by hand > which is likely to be wrong. They are easy to find in the Unicode aware unit tests but not in real program. I did once a small test, what Unicode aware programs support characters outside of BMP, i.e. I tested a glyph that was encoded as surrogate pair in UTF-16... The results were total disaster: - Windows standard dialogs: displayed character correctly but every operation like deletion related to is as two pairs. For example file name dialog had problems. - Same behavior in notepad or any standard text-area widgets didn't work correctly. - Qt3 hadn't supported surrogate pairs at all (in Qt4 most of it was fixed) displaying two square "glyphs". - Opera Web browser, had similar problems with editing and displaying such characters. So... There is a huge problem with this encoding, because such simple QA test shouldn't give such bad results for such big amount of programs. Also, all programs that used internally utf-8 or utf-32 had passed these tests very well. So I really **do not** suggest recommending this encoding as "best" one for internal use. Artyom

1 0

boost namespace
by Igor S 22 Jun '09

22 Jun '09

Hi Everyone. I need to use two versions of boost in my application. One the libs I link against is statically linked against boost 1.34 and I'd like to use 1.35's asio library. I believe I can make both versions co-exist if I can manage to rename boost 1.35's namespace to something like boost135. I know this project could be time-consuming so I'd like you know your thoughts. What changes would I need to make to the build system? Thanks. -- Igor

1 0