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

Re: [Boost-users] [boost] Subversion repository closing. Conversion to Git imminent.
by Beman Dawes 22 Nov '13

22 Nov '13

On Fri, Nov 22, 2013 at 6:09 PM, Edward Diener <eldiener(a)tropicsoft.com>wrote: > On 11/22/2013 11:52 AM, Beman Dawes wrote:... > >> >> Please make no svn commits after that time. We will be adding a pre-commit >> hook that prevents commits, but please do not wait for that becomes >> active. >> >> After svn is closed, the conversion will be run one last time, and then >> turned off. Then there is a week set aside for final validity checks, >> testing, and general scurrying around. When that is done, the boostorg >> repo >> on GitHub will open for business. If everything goes smoothly, it may take >> less than a week but if there are glitches it may take longer. >> > > Can the boostorg repo on GitHub be pulled from at any time during that > week or is the idea to wait until everything has been verified first. > The boostorg repos, both super-project and individual libraries, can be cloned and that might be useful for some limited testing. For example, creating a private branch "experiments" and making some trial changes and commits. But there is still a risk that any changes pushed up to the GitHub boostpro public repo will get overwritten. This would happen if we decide to rerun the conversion one last time to fix some showstopper that surfaces during testing. So other than throw-away experiments, best bet is to relax, and don't depend on the GitHub public repos until we post a message saying we are totally live. Useful questions, Thanks! --Beman

1 0

[Geometry] Finding polygon self-intersections efficiently
by Rob Conde 22 Nov '13

22 Nov '13

Given a possibly self-intersecting polygon, I'm trying to find the self-intersecting segments of the polygon. I can do this naively of course using Segment and intersects, but I'd like to know if there's a more efficient suggested approach in Boost.Geometry...I'm having a hard time finding anything from the documentation. Thanks, Rob Conde

1 0

Re: [Boost-users] [Boost-docs] [boost] Improving Documentation
by Paul A. Bristow 22 Nov '13

22 Nov '13

> -----Original Message----- > From: Boost-docs [mailto:boost-docs-bounces@lists.boost.org] On Behalf Of Paul A. Bristow > Sent: Wednesday, November 20, 2013 12:09 PM > To: Discussion of Boost Documentation > Subject: [Boost-docs] FW: [boost] Improving Documentation I've had yet another go at Robert Ramey's challenge to document his to-be-proposed Safe Integers library You can see the results of my most recent efforts (now only for users) at https://dl.dropboxusercontent.com/u/43940943/safe_numerics/libs/safe_numeri… and as a single pdf file https://dl.dropboxusercontent.com/u/43940943/safe_numerics/libs/safe_numeri… Apart from the effort involved in providing Doxygen comments (which I believe is small, especially during writing the code, because there is lots of boiler plating possible), our main differences of view are on how to provide the 'concepts' information. The only true concepts used by this library (at present) are the ubiquitous assignable and copyconstructable. For the more common concepts, I have used a simple link to the concept like http://www.sgi.com/tech/stl/Assignable.html because the library is not using Boost.Concept (yet). (There is also a concept of a Numeric type but this is not enforced by the use of the library, although it can be tested using file https://dl.dropboxusercontent.com/u/43940943/safe_numerics/boost/safe_numer… provided). The information on type Numeric in this file is documented in my Doxygenated version here: https://dl.dropboxusercontent.com/u/43940943/safe_numerics/libs/safe_numeri… Robert has contrasted his presentation of concepts (and other information) thus http://htmlpreview.github.io/?https://raw.github.com/robertramey/safe_numer… doc/html/index.html with mine. I believe that it contains the same information (about Numeric) and can be found by using the automatically produced Index - see https://dl.dropboxusercontent.com/u/43940943/safe_numerics/libs/safe_numeri… l The other information about operators can also be found using the index, for example, operator>= see https://dl.dropboxusercontent.com/u/43940943/safe_numerics/libs/safe_numeri… /safe_compare/greater_than_equal.html The difference is that Robert provides a simple list, whereas I provide an index to individual operators (not all are currently documented - retrofitting is tedious!). IMO the user will find the index method easier (when that is the users' expectation). With a tiny library like this (chosen as a demo because it is small) it may be easy to find the concepts section, but for a typical much larger library making the table and finding it will be less attractive. The size of the documentation is much, much bigger, but it is more likely to be complete, and more likely to be accurate, (and nearly all will be unread so its repetitions unimportant). A typical example of what the user is likely to read is about the key template 'safe': https://dl.dropboxusercontent.com/u/43940943/safe_numerics/libs/safe_numeri… /safe.html You will note how this references concepts DefaultConstructible,... If Concepts get into the C++ language, or Boost.Concept is used, or the method using by Boost.GIL - see http://www.boost.org/doc/libs/1_55_0/libs/gil/doc/html/g_i_l_0286.html I believe we could make this fairly automatic, but I think the library must do this as it is conceived. Views welcome. Paul PS A more typical library with Doxygen comments in the C++ reference section is at https://dl.dropboxusercontent.com/u/43940943/circular_buffer/libs/circular_… l showing the info about circular buffer, for example at https://dl.dropboxusercontent.com/u/43940943/circular_buffer/libs/circular_… cular_buffer.html --- Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 pbristow(a)hetp.u-net.com

1 0

Re: [Boost-users] [BGL] visitors.hpp:138: error: no type named 'event_filter' in 'class dijkstra_custom_visitor'
by The Maschine 22 Nov '13

22 Nov '13

Well Jeremiah, My email and the assumptions are completely wrong. Im sorry. just forget about it, next time Ill have my coffee before debuting code :) thanks

1 0

Subversion repository closing. Conversion to Git imminent.
by Beman Dawes 22 Nov '13

22 Nov '13

The Boost Steering Committee has given the final approval for the conversion from Subversion to Git, including the modularization of Boost library repositories. The Subversion repository will be closed for all changes to all branches, including the sandbox, Sunday, November 23 2013, 00:00 hours UTC. That's 8 PM Saturday, US East Coast time, and 5 PM US West Coast time. Please make no svn commits after that time. We will be adding a pre-commit hook that prevents commits, but please do not wait for that becomes active. After svn is closed, the conversion will be run one last time, and then turned off. Then there is a week set aside for final validity checks, testing, and general scurrying around. When that is done, the boostorg repo on GitHub will open for business. If everything goes smoothly, it may take less than a week but if there are glitches it may take longer. --Beman

1 0

self_loop=false for Unique R-MAT generator
by Николай Кинаш 22 Nov '13

22 Nov '13

Hi. I use Parallel Boost Graph Library to create network Barabási–Albert (BA) model int main(int argc, char* argv[]) { boost::mpi::environment env(argc, argv); boost::minstd_rand gen; Graph g(RMATGen(gen, 100, 400, 0.3, 0.1, 0.2, 0.03), RMATGen(), 100); write_graphviz(std::cout, g); } This graph always have self-loops vertex. How i can to forbid self_loop for Unique R-MAT generator ?

2 1

Re: [Boost-users] [BGL] visitors.hpp:138: error: no type named 'event_filter' in 'class dijkstra_custom_visitor'
by The Maschine 22 Nov '13

22 Nov '13

Hi, My code is very simple so I suspect I missing something about the real 'examine_vertex' meaning. One example with the custom visitor and one without that produces the correct results out site the 'search' (I;d like to be able to do it with a visitor though for later steps) Simplified to just the essentials. #### With VISITOR #### IndexMap indexMap = boost::get(boost::vertex_index, m_ugraph); PredecessorMap predecessorMap(&predecessors[0], indexMap); DistanceMap distanceMap(&distances[0], indexMap); glm::dvec3 s_mid = m_ugraph[*vertex_iterator_begin].m_mid_point; double thres = 500.0f; dijkstra_threshold vis(s_mid,thres); try { boost::dijkstra_shortest_paths(m_ugraph, *vertex_iterator_begin, boost::predecessor_map(predecessorMap).distance_map(distanceMap).visitor(vis)); } catch (...) { } int total_node_count2 = 0; double total_depth2 = 0.0; for (boost::tie(vi, vi_end) = boost::vertices(m_ugraph); vi != vi_end; ++vi) { if( (double(distances[*vi])*1.1) >= std::numeric_limits<double>::max() || (std::isnan(distances[*vi])) || !(std::isfinite(distances[*vi])) ) { } else { total_depth2 += double(distances[*vi]); total_node_count2 += 1; } } #### To the total distances and the number of nodes within the radius is not correct… #### Without a visitor outside dijkstra_shortest_paths #### try { boost::dijkstra_shortest_paths(m_ugraph, *vertex_iterator_begin, boost::predecessor_map(predecessorMap).distance_map(distanceMap)); } catch (...) { } int total_node_count2 = 0; double total_depth2 = 0.0; for (boost::tie(vi, vi_end) = boost::vertices(m_ugraph); vi != vi_end; ++vi) { if( (double(distances[*vi])*1.1) >= std::numeric_limits<double>::max() || (std::isnan(distances[*vi])) || !(std::isfinite(distances[*vi])) ) { } else { if( thres > 0.0f && glm::distance(s_mid, m_ugraph[*vi].m_mid_point) < thres ) { total_depth2 += double(distances[*vi]); total_node_count2 += 1; } } ### This give you the correct results but you searched the full graph. Any ideas? Thanks

2 1

Visitor pattern with functor front end
by Daniele Barzotti 22 Nov '13

22 Nov '13

Hi, maybe this will be a trivial question but I'm quite new to MSM. If I would to use the visitor pattern, how can I define it using the functor front-end? Regards, Daniele.

1 1

Boost.log file rotation current file name
by Daniel Krikun 22 Nov '13

22 Nov '13

Hello, I use some log viewer tool to display and filter logs. In log4j there is a feature that allows for the current logfile to have some constant name, e.g 'current.log', and only after it is finalized it is renamed to its name (probably having some timestamp/counter) in it. This feature makes it most convenient with log viewers. Is it possible to achieve this with Boost.Log? If not I would like to suggest it as a feature request. Regards,

1 0

Fwd: Boost.log file collector
by Daniel Krikun 22 Nov '13

22 Nov '13

Hello, When I set up text_file_backend with file rotation and a file collector with the target directory other from the directory where my application resides, then if the application crashes, the current log file will not be collected to the target directory. This is somewhat inconvenient, because, let's say we setup the file collector to collect all the log files under 'logs' subfolder, and then if the application crashes we ask the user to simply e-mail the 'logs' folder to see what possibly went wrong before the crash, but, alas, the most interesting piece is missing. Is there a way to work around the problem? Thanks,

1 0