April 2014 - Boost - lists.preview.boost.org

Application 0.4.6 with global_context.
by Renato Forti 15 Apr '14

15 Apr '14

Hi, thanks for your comments. >> If the main usage is likely to be 'daemonic', then Boost.Daemon would still be a good name. About the name 'application'. I chose this name because the library can support many kinds of application, see: http://www.dokfile.com/appbeta4/docs/libs/application/doc/html/boost_applic… >> From the current name, one would be unlikely to guess that it could do daemon work? The name 'Daemon' is usual in POSIX world. In Windows world the usual is 'Service'. I could call it as 'server', but it would also be wrong due to support for common application. In future the library can support other kinds of application (e.g. apache httpd modules) Thus I think that the name 'application' is more suitable. Let me know your thoughts. Thanks for help ReTF

1 0

[git] github cheat sheet
by Philippe Vaucher 15 Apr '14

15 Apr '14

Hello, I think this might be useful for many people: a list of overall tips n' tricks about github and git. https://github.com/tiimgreen/github-cheat-sheet Hope it helps, Philippe

1 0

[algorithm] Review Request: edit_distance
by Erik Erlandson 15 Apr '14

15 Apr '14

I would like to request a formal review for inclusion of the edit_distance() function. Description: The edit distance is the length of the shortest (or least-cost) edit script from one sequence to another, where an edit script is defined as a sequence of insertion, deletion and (optionally) substitution operations. The function implementing the edit distance is named edit_distance. This function will return the edit distance between two sequences, where sequences may be any valid range object supporting forward iteration. The edit_distance function will also, if requested, return the edit script. http://en.wikipedia.org/wiki/Edit_distance Documentation: http://erikerlandson.github.io/algorithm/libs/algorithm/doc/html/algorithm/… Code resides on a branch of my fork of Boost.Algorithm: https://github.com/erikerlandson/algorithm/tree/edit_distance The feature branch above includes the doc, unit tests and examples that are integrated via Jamfiles. The new dev resides specifically in this subdir: https://github.com/erikerlandson/algorithm/tree/edit_distance/sequence I have built the tests and examples on gcc and clang, with and without c++11 mode. I don't have access to a windows/MSVC build env, so I am definitely curious if it compiles properly in that env. My concept is that boost::algorithm::sequence can eventually serve as a home to additional related algorithms, for example other sequence comparison algorithms or perhaps other categories of sequence-related algorithms.

9 31

[graph] Are you interested in the Route Inspection Problems and Vehicle Routing Problems?
by Ciro Santilli 14 Apr '14

14 Apr '14

Are you interested in implementations for the following problems: - Route Inspection Problems: http://en.wikipedia.org/wiki/Route_inspection_problem - classic: find shortest path for undirected graph possibly repeating edges. O(n^3). If Eulerian path exists, it is the min. - mixed graphs. NP-complete. AKA Chinese postman problem. - k-Chinese postman problem. N postmen. - Vehicle routing problem: http://en.wikipedia.org/wiki/Vehicle_routing_problem Generalization of Route Inspection. NP-complete. Many variants: edges have one ore more weights, and multiple constraints are possible: - carrying capacity of each truck - time to travel an edge and delivery windows for each edge All of those problems have extensive literature, and obvious practical applications. Why don't you use GitHub's Issue tracker instead of the mailing list? It integrates better with the code tracking and merge requests, and is much easier to search. That would greatly reduce contribution barriers to new devs.

3 2

[variant] Why no move emulation with Boost.Move for C++03?
by Andrzej Krzemienski 14 Apr '14

14 Apr '14

Hi, I am trying to figure out what the best way to enable move semantics in Boost.Optional. I tried to pick at how Boost.Variant does it. If I understand correctly, move operations are only defined if compiler supports rvalue references. I wonder why it doesn't use Boost.Move, which would enable move semantics even for compilers w/o rvalue references. Is there any reason for this (that I should also take into account for Boost.Optional)? Regards, &rzej

7 7

Application 0.4.6 with global_context.
by Renato Forti 14 Apr '14

14 Apr '14

Hi All, I'd like to share this simple article on CP about 'Application 0.4.6'. http://www.codeproject.com/Articles/756866/Build-a-Server-Application-using… This version removes Boost.Singularity dependence and add a global context. Let me know your comments. Source: https://github.com/retf/Boost.Application ReTF

4 3

Call for Papers for Meeting C++ 2014 - one more week
by Jens Weller 13 Apr '14

13 Apr '14

Hello boost community, there is one week left to submit your talk to Meeting C++ 2014: http://meetingcpp.com/index.php/submit-your-talk.html Newsentry at Meeting C++ http://meetingcpp.com/index.php/newsreader/items/call-for-papers-one-more-w… So far 20 talks are submitted, a few of them also cover boost, most C++11/Modern C++. I also could announce the keynotes yesterday: Opening Keynote - Scott Meyers Closing Keynote - Hartmut Kaiser thanks, Jens

1 0

[BoostDocs] Need help with getting started with BoostDocs
by Andrzej Krzemienski 12 Apr '14

12 Apr '14

Hi Everyone, Perhaps someone in this list can help me generate html documentation from qbk sources. I am using MinGW on Windows and try to build the docs. I use the instructions form the following links. https://svn.boost.org/trac/boost/wiki/BoostDocs/GettingStarted http://www.boost.org/doc/libs/1_55_0/doc/html/quickbook/install.html#quickb… I am not sure if they are up to date. I downloaded all the necessary components, and when I try to run b2 on my doc folder, I get the following error messages: runtime error: file > file:///C:/_data/cpp/optional/boptional/quickbook/docbook-xsl/html/chunkfast.xsl > line 23 element variable > Recursive definition of chunks > runtime error: file > file:///C:/_data/cpp/optional/boptional/quickbook/docbook-xsl/html/chunkfast.xsl > line 32 element variable > Variable 'chunks' has not been declared. > xmlXPathCompiledEval: evaluation failed > runtime error: file > file:///C:/_data/cpp/optional/boptional/quickbook/docbook-xsl/html/chunkfast.xsl > line 32 element variable > Failed to evaluate the expression of variable 'div'. > I am not sure exactly where they are coming from. But they look like an error from the tool, rather than my qbk sources. Perhaps anyone here experienced a similar problem and knows a solution? Or perhaps there is a newer version of the instructions? Regards, &rzej

4 15

Application 0.4.6 with global_context
by Renato Forti 12 Apr '14

12 Apr '14

>> It actually provide a way to make a non-daemon application (mentionned in the part about launching the app). Yes, this is true! Officially the lib supports 2 kind (modes) of application. But user can define a new type, for sample this article, show how create a new application mode. In this case the mode is a apache httpd server module extension. http://www.codeproject.com/Articles/695937/Creating-a-New-Application-Mode

1 0

Application 0.4.6 with global_context.
by Renato Forti 12 Apr '14

12 Apr '14

>> I find the idea, to have a cross-platform way of creating daemons/services, worthwhile. >> I would like to suggest that the name be changed from Application, which is far too generic for just creating a computer program, to something more appropriate, maybe 'daemon'. Thanks for your sugestion, i will think in that. >> I have never used the Mac, but does this extend to that OS ? Yes, on mac (OSX) a daemons is generated. Thanks

1 0