October 2016 - Boost - lists.boost.org

Re: [boost] [config] Changes to reflect Visual C++ "15" preview 5
by Tom Kent 15 Oct '16

15 Oct '16

I've now added a runner to the test suite with msvc-15.0 (preview 5 installed), it should show up in a couple hours as "teeks99-09o-win2012R2-64on64" (the far right column). The run only took a few minutes instead of an hour or two, so I'm expecting it to look pretty broken. Just glancing at the logs it looks like the compiler isn't even being found. Does this require b2 updates? Tom

2 1

[algorithm] New search algorithms
by Зайцев Александр 14 Oct '16

14 Oct '16

Hello. Now in Boost. Algorithm there are 3 algorithms for searching: Knuth-Morris-Prata, Boyer-Moore, Boyer-Moore-Horspool. They are good algorithms, but there are other efficient algorithms like Turbo-Boyer-Moore, Quick Search, etc. You can find some more here: http://www-igm.univ-mlv.fr/~lecroq/string/index.html Now i am working on new search algorithms for Boost.Algorithm. Maybe are there anybody,who familiar with string search algorithms? -- Best regards, Alexander Zaitsev

1 0

[program_options] -d directory is falling into positional input-files 1_62_0
by Roger Martin 14 Oct '16

14 Oct '16

Hi, Pulled this from a larger application to isolate to the problem: -d ./tmp or -d "./tmp" doesn't go to directory string but is with the positionals: #include <stdlib.h> #include <iostream> #include <exception> #include <string> #include <cstring> #include <memory> #include <fstream> #include "boost/program_options.hpp" int main(int argc, char** argv) { try { boost::program_options::positional_options_description p; p.add("input-file", -1); std::string directory = "./"; boost::program_options::options_description visible("Allowed options"); visible.add_options() ("input-file", boost::program_options::value<std::vector<std::string>>(), "input files can be *.xml, *.pdb, *.mol2, *.mtz, *.cif, *.csv, and *.sdf. Csv and sdf formats are for NMR calculations. csv lists the atoms for which the shifts will be computed. 1st line containts the Header: \"Chain\",\"Residue ID\",\"Sequence\",\"Atom Name\",\"Unbound ppm\",\"Bound ppm\". Then atoms may be listed i.e \"A\",\"MET\",231,\"CE\",10.30,10.50. sdf file contains the ligands for a CSP calculation. ") ("directory,d", boost::program_options::value<std::string>(&directory)->implicit_value("./"), "Directory for publishing output.") ; boost::program_options::options_description all("Allowed options"); all.add(visible);//.add(hidden); boost::program_options::variables_map vm; boost::program_options::store(boost::program_options::command_line_parser(argc, argv).options(all).positional(p).run(), vm); boost::program_options::notify(vm); std::vector<std::string> fileList = vm["input-file"].as < std::vector < std::string >> (); for (unsigned int fileListIndex = 0; fileListIndex < fileList.size(); fileListIndex++) { std::cout<<" "<<fileList[fileListIndex]<<" "<<std::endl; } } catch (std::exception& e) { std::cout << e.what() << std::endl; } return 0; } Built with g++ 4.9.0 on Linux frodo.quantumbioinc.com 2.6.32-573.7.1.el6.centos.plus.x86_64 #1 SMP Wed Sep 23 03:02:55 UTC 2015 x86_64 x86_64 x86_64 GNU/Linux g++ -fPIE -std=c++11 -I${BOOST_HOME}/include -Wl,--allow-multiple-definition -MT main.o -MMD -MP -O3 -c -o main.o main.cpp g++ -pie -Wl,--allow-multiple-definition -o main main.o -L${BOOST_HOME}/lib -lboost_program_options -lc -lm -lpthread -lz -lstdc++ -ldl -lrt And run as ./main 2-aminoethanol.pdb -d ./tmp which results in 2-aminoethanol.pdb ./tmp This code had been working with 1_57_0. Some change in the API I need to adjust for?

1 0

[algorithm] Longest palindromic substring in Boost.Algorithm
by Зайцев Александр 14 Oct '16

14 Oct '16

Hello I want to add to Boost.Algorithm algorithm for finding all palindromes in a sequence in O(N). https://en.wikipedia.org/wiki/Longest_palindromic_substring Is it useful algorithm for Boost? Have you any suggestions? -- Best regards, Alexander Zaitsev

3 2

Re: [boost] [fixed_point] First presentation from GSoC 2015 and more
by John McFarlane 13 Oct '16

13 Oct '16

Hi Christopher. I'm actually the main culprit behind P0037. :) Date: Wed, 12 Oct 2016 18:32:26 +0000 (UTC) > From: Christopher Kormanyos <e_float(a)yahoo.com> > To: "boost(a)lists.boost.org" <boost(a)lists.boost.org> > Subject: Re: [boost] [fixed_point] First presentation from GSoC 2015 > and more > Message-ID: <1026507022.4306136.1476297146580(a)mail.yahoo.com> > Content-Type: text/plain; charset=UTF-8 > > > I'm a bit surprised I didn't see this work before. > > Are you aware that SG14, the gamedev, real-time simulations, embedded > > software and financing study group for the standard > > is working on fixed point real proposal too? > > Here is a version of the proposal:>http://johnmcfarlane > .github.io/fixed_point/papers/p0037r2.html and>http://johnmcfarlane.githu > b.io/fixed_point/papers/p0381r0.html > > I will notify SG14 in case they missed your work too. > Thanks for the information. > We became aware of your work unfortunately very late inthe project. Much > of our fixed_point work stems from myearly prototyping dating from 2011 - > 2013. > I see a lot of similarities in the two bodies of work.Maybe we could > identify the strengths of each work.I don't know if it makes sense to > combine them,but maybe share some concepts or interface ideaswould make > sense. > I discuss P0106R0 (a revision to N3352) in my paper, the latest draft of which is always available here: https://github.com/ johnmcfarlane/fixed_point/blob/master/doc/p0037.md#p0106 I'm honestly not sure which approach is preferable overall. The set of features and qualities requested during SG14 and SG6 meetings is large and conflicting. It includes minimal build times, minimal run-time overhead, every rounding and overflow strategy listed in P0105, decimal radix and support for specialized fixed-point instructions on embedded architectures. > > In your work I've been experiencing some trouble withthe division routine. Can you elaborate? Was this recently? I've been trying out numerous strategies for arithmetic operators. My current preferred approach is to pad the left-hand operand before performing the division but that's only been checked in for a few months. > I also had some problems compilingon VC12 (but you don't target that > compiler anyway).So that's no big deal. > You will need a C++11-compliant compiler as sg14::fixed_point<> creates literal types. Lack of support for features like constexpr constructors is the main obstacle to compiling under VC++ 2013 and earlier. > In your work you are using wrapped versions of elementarytranscendental > functions designed for built-in float.You might appreciate our hand-crafted > functionsdesigned to be highly efficient in several digit ranges. > Yes! I would be very interested in seeing if I could adapt those function. Mine are placeholders and I've deliberately postponed the non-trivial task of adding cmath equivalents. It's come up - maybe a couple of times - whether these functions are desired and the response has been to just keep the proposal narrow so they are not included. There are interesting questions regarding how to implement some functions. For example, you surely don't always want the same inputs and outputs from functions involving angles. And hopefully these functions can be constexpr - unlike existing functions. Also, how have you approached the trade-off between speed and accuracy? I went for a very simple sqrt function which is adequate if the value is calculated at compile time but is likely not desirable at run-time. This isn't a problem that floating-point variants face. > I have also benched our fixed_point on bare-metalembedded systems both > 8-bit and 32-bit with verysatisfying efficiency results. This is a key > featurefor our embedded users that might also be interestingfor SG14. > My current aim is to match integer performance for common arithmetic operations when using built-ins. This leads to some situations where overflow is a big problem - but no worse than dealing with raw integers. I'm curious how you deal with multiplying two int-sized values together without resorting to wider, slower types.I was under the impression that P0106 types always widen to fit their values. > > Thank you and best regards, Chris > > And thank you. Keep up the good work! John > > On Tuesday, October 11, 2016 11:37 PM, Klaim - Jo?l Lamotte < > mjklaim(a)gmail.com> wrote: > > > On 6 October 2016 at 12:07, Paul A. Bristow <pbristow(a)hetp.u-net.com> > wrote: > > > > -----Original Message----- > > > From: Boost [mailto:boost-bounces@lists.boost.org] On Behalf Of > > Christopher Kormanyos > > > Sent: 05 October 2016 23:07 > > > To: boost(a)lists.boost.org > > > Subject: Re: [boost] [fixed_point] First presentation from GSoC 2015 > and > > more > > > > > > >> A partial implementation of fixed-point in a Boost-like > > > >> style based on proposal N3352 is now available. > > > > > > > ... But your links don't work, > > > > Indeed :-( ( > > > > The correct link to the docs for some years used to be > > > > https://dl.dropboxusercontent.com/u/43940943/modular-boost/ > > libs/fixed_point/doc/html/index.html > > > > but sadly this no longer works for reasons that so far escape me (but I > > suspect some change at Dropbox?). > > > > Meanwhile here is a PDF version to whet your appetite until I get a html > > version publicly available. > > > > https://dl.dropboxusercontent.com/u/43940943/modular-boost/ > > libs/fixed_point/doc/fixed_point.pdf > > > > Boost.Fixed_point ? > > =============== > > > > A partial implementation of fixed-point in a Boost-like style based on > > proposal N3352 is now available. > > > > This work is the result of developments from 2013-2016, including efforts > > from GSoC 2015. > > > > The source code is available at: https://github.com/ > > BoostGSoC15/fixed_point > > > > (The master branch will be stable for a while but the develop branch may > > be updated in the light of your feedback). > > > > Preliminary docs are available at: > > > > https://dl.dropboxusercontent.com/u/43940943/modular-boost/ > > libs/fixed_point/index.html > > > > We are potentially interested in submitting this work for inclusion in > > Boost. > > > > We are now requesting comments and suggestions for improvements, > > corrections and any > > further test results if these become available. > > > > Some key library features include: > > > > * proper C++ header-only implementation > > * full numeric_limits and <cmath> functions > > * flexible template choice of split between resolution and range > > * automatic selection of underlying integral representation > > * portability and high efficiency for bare metal microcontrollers > > * interoperation with Boost.Math > > * seamless extension to high-precision using Boost.Multiprecision > > * extensive test suite > > > > Thank you for your consideration. > > Best regards, > > > > Christopher Kormanyos > > > > And apologies from Paul. > > > > > Hi, > > I'm a bit surprised I didn't see this work before. > Are you aware that SG14, the gamedev, real-time simulations, embedded > software and financing study group for the standard > is working on fixed point real proposal too? > Here is a version of the proposal: > http://johnmcfarlane.github.io/fixed_point/papers/p0037r2.html and > http://johnmcfarlane.github.io/fixed_point/papers/p0381r0.html > I will notify SG14 in case they missed your work too. > > Jo?l Lamotte > > _______________________________________________ > Unsubscribe & other changes: http://lists.boost.org/mailman > /listinfo.cgi/boost > > > >

2 1

Re: [boost] : Curiousity question
by Brian Wood 13 Oct '16

13 Oct '16

Edward Diener writes: > I would like to ask a design question for any Boost developers or anyone > on this mailing list who might care to answer. > > You are designing or working on a library, perhaps for Boost, perhaps > for fun, and part of the design of the library has some public > functionality taking a shared pointer as input. You: > > 1) Use boost::shared_ptr > 2) Use std::shared_ptr > 3) Use both boost::shared_ptr and std::shared_ptr with the same > functionality > 4) Use neither, you roll your own shared pointer-like functionality > 5) You don't lke shared pointers and use raw pointers instead > > I really am curious about this. I haven't put any limitation on your > library or made any presumption on who your library is for, on purpose. > Thanks for anyone answering ! I avoid shared pointers. I'll use a unique_ptr if a raw pointer won't work. -- Brian Ebenezer Enterprises - In G-d we trust. http://webEbenezer.net

2 1

[qvm] Doesn qvm contain any sse/avx etc optimizations?
by Viktor Sehr 12 Oct '16

12 Oct '16

If not, is it planned for utilizing it? /Viktor

2 1

Boost library incubator URL address
by Edward Diener 12 Oct '16

12 Oct '16

Is the Boost Library Incubator web site down or removed ? I cannot get to it anymore via a URL. I have this URL, http://www.rrsd.com/software_development/blincubator/index.htm, but it just hangs on me.

2 1

Announcing version 3 of the cxx_dual library
by Edward Diener 11 Oct '16

11 Oct '16

I have created version 3 of the cxx_dual library. version 3 is a large rewrite of the documentation to simplify the use of the library, as well as a change in the directory structure so that the basic usage of the library is through a single header file and the use of a namespace alias, and not through the macro interface. As in: #include <boost/cxx_dual/regex.hpp> void SomeFunction() { cxxd_regex_ns::regex re("A regular expression etc."); bool result(cxxd_regex_ns::regex_match("Some string...",re)); // etc. } What ! No macros ! Actually a few macros still exist for testing which dual library has been chosen and overriding the dual library chosen, but the basic functionality means almost no macros in user code. The library is available at https://github.com/eldiener/cxx_dual.git. What is it ? The Cxx Dual library, or CXXD for short, is a C++ macro header-only library which chooses between using a Boost library or its C++ standard equivalent library for a number of different C++ implementations, while allowing the end-user to use the same code to program either choice. An implementation is a Boost library which has a C++ standard library equivalent whose public interfaces are nearly the same in both cases. An 'implementation' is called a 'mod' for short and each of the possible Boost or C++ standard implementations for that mod are called a 'dual library'. The Cxx Dual library does this by automatically choosing either the Boost library or the C++ standard library for a particular mod, including the correct header file(s) needed for the dual library chosen, and creating a namespace alias for the namespace of the dual library chosen. CXXD also provides a macro-based solution for distinguishing between the Boost version and the C++ standard version of a dual library so that specific code for a particular dual library choice may be written in those cases where the public interfaces diverge.

1 0

Announcing version 3 of the cxx_dual library
by Edward Diener 11 Oct '16

11 Oct '16

I have created version 3 of the cxx_dual library. version 3 is a large rewrite of the documentation to simplify the use of the library, as well as a change in the directory structure so that the basic usage of the library is through a single header file and the use of a namespace alias, and not through the macro interface. As in: #include <boost/cxx_dual/regex.hpp> void SomeFunction() { cxxd_regex_ns::regex re("A regular expression etc."); bool result(cxxd_regex_ns::regex_match("Some string...",re)); // etc. } What ! No macros ! Actually a few macros still exist for testing which dual library has been chosen and overriding the dual library chosen, but the basic functionality means almost no macros in user code. What is it ?

1 0