September 2021 - Boost - lists.preview.boost.org

Boost.Text is looking for a (mini-)review manager
by Zach Laine 07 Dec '22

07 Dec '22

I've made all the recommended changes to Boost.Text that came up in the review. Glen, the previous review manager, recommended a mini review of Boost.Text once I'd made those changes. If you'd like to manage the mini-review, please let me know. For everyone, including potential reviewers and review managers, here are the major changes: * All the specific review feedback issues have been addressed. * The string layer is now gone. * The text layer got a major re-work. It is now a set of template-based adaptors (basic_text<>, vs. a text typedef. etc.), which lets everyone get what they want. You can change the underlying storage type (including whatever allocator you prefer), select UTF-8 or UTF-16, and change the normalization form. Glen recommended I drop this layer, but the library is way less useful without this stuff, and these changes address all the concerns raised about the text layer in the review. The updated docs can be found here: https://tzlaine.github.io/text/doc/html/index.html Oh yeah, and I added concept constraints to the whole library when you build in C++20 mode. Zach

17 46

[review][JSON] Review of JSON starts today: Sept 14 - Sept 23
by Pranam Lashkari 09 Aug '22

09 Aug '22

Boost formal review of Vinnie Falco and Krystian Stasiowski's library JSON starts today and will run for 10 days ending on 23 Sept 2020. Both of these authors have already developed a couple of libraries which are accepted in Boost(boost beast and Static String) This library focuses on a common and popular use-case for JSON. It provides a container to hold parsed and serialised JSON types. It provides more flexibility and better benchmark performance than its competitors. JSON highlights the following features in the documentation: - Fast compilation - Require only C++11 - Fast streaming parser and serializer - Easy and safe API with allocator support - Constant-time key lookup for objects - Options to allow non-standard JSON - Compile without Boost, define BOOST_JSON_STANDALONE - Optional header-only, without linking to a library (a point I would like to add in highlight: it has cool Jason logo 😝) To quickly understand and get the flavour of the library take a look at "Quick Look" <http://master.json.cpp.al/json/usage/quick_look.html> You can find the source code to be reviewed here: <https://github.com/CPPAlliance/json/tree/master> You can find the latest documentation here: <http://master.json.cpp.al/> Benchmarks are also given in the document which can be found here: <http://master.json.cpp.al/json/benchmarks.html> Some people have also given the early reviews, the thread can be found here: <https://lists.boost.org/Archives/boost/2020/09/249745.php> Please provide in your review information you think is valuable to understand your choice to ACCEPT or REJECT including JSON as a Boost library. Please be explicit about your decision (ACCEPT or REJECT). Some other questions you might want to consider answering: - What is your evaluation of the design? - What is your evaluation of the implementation? - What is your evaluation of the documentation? - What is your evaluation of the potential usefulness of the library? - Did you try to use the library? With which compiler(s)? Did you have any problems? - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? - Are you knowledgeable about the problem domain? More information about the Boost Formal Review Process can be found here: <http://www.boost.org/community/reviews.html> Thank you for your effort in the Boost community. -- Thank you, Pranam Lashkari, https://lpranam.github.io/

21 73

[container] Contributing 'stationary_vector' to Boost
by Mehrdad Niknami 13 Jun '22

13 Jun '22

Hi all, Happy new year! New mailing list member here. I've developed an STL-style stationary_vector class that retains elements in-place when growing. Very briefly, it is effectively a piecewise-contiguous vector, with the following advantages over vector: - Appending has O(1) overhead in the *worst* case (e.g., push_back() does not move elements) - Insertion and random-access can be done in parallel, as prior iterators & references remain valid This has a variety of benefits, including better UX (no "hiccups" due to reallocations), and the ability to simplify parallel processing of streaming data. It occurred to me the larger C++ community might find this useful. I was wondering if there would be interest in incorporating it into Boost.Container, and if so, what steps I could take to make that happen? I'm of course happy to discuss the design etc. with anyone who might be interested. Summary: https://github.com/mehrdadn/libvital/blob/master/doc/vital/container/statio… Implementation: https://github.com/mehrdadn/libvital/blob/master/include/vital/container/st… Thank you, Mehrdad

7 19

[ASIO] Do I have to use shared_ptrs with ASIO?
by Andrzej Krzemienski 29 Dec '21

29 Dec '21

Hi Everyone, I am looking at an example implementation of an asynchronous TCP echo server in Boost.ASIO library: https://www.boost.org/doc/libs/1_77_0/doc/html/boost_asio/example/cpp11/ech… It uses a shared_ptr in the implementation to store the things related to session: socket handle, data buffers. I tried to modify it in a number of ways to avoid the usage of shared_ptr (and any form of shared ownership), but they all failed. It looks like I have to use a shared_pointer (or equivalent) when I use ASIO sockets. But conceptually, there is never a point in time where two tasks have to access members of this `session` concurrently: they are always sequenced. So, at least conceptually, there should be a way to do this with a session type that is only movable, with unique ownership: a task does its job with the session and then moves it to the subsequent task. So is this necessity to use a shared pointer an unnecessary and suboptimal design choice? Or is there something fundamental that prevents the unique ownership of buffers and socket handles? Or maybe is there a way to do it in ASIO that I overlooked? I am not trying to solve any specific problem. It just strikes me that a shared_ptr is used in a demo example for the library. I was always of the opinion that a shared_ptr is often abused as a way of doing an ad-hoc GC. Regards, &rzej;

8 21

Adding my sorting algorithm, ska_sort, to boost, attempt 2
by Malte Skarupke 24 Nov '21

24 Nov '21

Hi everyone, I started a discussion about this in October, but at the time the maintainer of the sort library was busy, then I was busy, so now it's January... I wrote a generalized version of radix sort a couple years ago and gave a talk about it here: https://www.youtube.com/watch?v=zqs87a_7zxw I would like to get a new version of that sorting algorithm into boost. It's faster than what I showed several years ago. It's also even more general and has a new interface that should be easier to extend. I uploaded the code here: https://github.com/skarupke/sort/tree/master The documentation is also already updated with new benchmark results. Let me know what's required to get this into boost. Would you like this in the form of a pull request? One of the big things that probably needs review is the interface, since radix sorting works differently than comparison based sorting. For most normal uses you just need to provide a sort key, but more complicated cases can get more complicated. I tried very hard to make everything easy, but I'd also be curious if others can come up with better ways of doing the interface. Thanks, Malte -- Malte Skarupke malteskarupke(a)fastmail.fm

8 10

Re: [boost] Simple boost fix for sparc64
by John Klos 30 Sep '21

30 Sep '21

>> Here's a failure example: >> https://ftp.ziaspace.com/pub/pkgsrc/reports/9.0_2021Q2/sparc64/boost-libs-1… > > Seems like it's already fixed: > https://github.com/boostorg/predef/commit/1be0e4a2d8db15a405f64a6f65507b87c… Excellent. I'll look for that in 1.78.0. Thanks, John Klos

1 0

regarding exception_ptr
by rajesh daggumati 30 Sep '21

30 Sep '21

Hi Team, PFB code snippet: try { BOOST_THROW_EXCEPTION(std::invalid_argument("Blah")); } catch(...) { boost::exception_ptr exception = boost::current_exception(); const std::invalid_arguement* p; try{ boost :: rethrow_exception(exceptionptr) } catch(std::invalid_argument &e) { p = dynamic_cast<const std::invalid_argument*>(&e) } const std::invalid_argument* actualStdPtr = ExceptionHelper::ExtractConstPtr<std::invalid_argument>(exceptionptr); EXPECT_TRUE(((void*)p) == ((void*)actualStdPtr)) << "Same Object"; //this condition is getting failed. }} static const t* ExtractConstPtr(boost::exception_ptr ep) { try { boost::rethrow_excepton(ep); } catch(T &e){ const T* exceptType = dynamic_cast<const T*>(&e); return exceptType; } catch (std::exception & e){ const T* exceptType = dynamic_cast<const T*>(&e); return exceptType; } } //EXPECT_TRUE(((void*)p) == ((void*)actualStdPtr)) -->what will be the reason to get failed as I do same thing in both cases. Regards, Rajesh D

2 2

conversion issues from boost::exception_ptr to exception class shared_ptr
by rajesh daggumati 29 Sep '21

29 Sep '21

HI Team, // i have caught exception in exception_ptr and I and trying to convert to ExceptionPtr_t but I am facing issue at below derived->severity(). * unknown file: error: SEH exception with code 0xc0000005 thrown in the test body.* *code snippet is :* *E*xceptionPtr_t ExceptionHelper::TryGetExceptionPtr(boost::exception_ptr exception) { ExceptionPtr_t result ; std::string res; if(!exception) return result; try { boost::rethrow_exception(exception) *}catch(boost::exception &e)* *{boost::throw_file::value_type const* throw_file_data = boost::get_error_info<boost::throw_file>(e);* *if(* *throw_file_data)* *{* * result = exceptionPtr_t(new ExceptionWrapper(exception,*throw_filed_data,true))* *}* *return result;* *}* class Exception : public virtual std::exception, public virtual boost::exception { protected: string what; serviorytype m_severity; public: explicit Exception(const std::string& what); virtual ~Exception() throw() {} // we have some member functions like severity(),setseverity(value)... } class ExceptionWrapper : public Exception { private: string m_what_inner; boost::exception_ptr m_inner; public: explict ExceptionWrapper(boost::exception_ptr inner,string &what() = std::string,bool copythrow = true); explict ExceptionWrapper(boost::exceptionPtr_t inner,string &what() = std::string,bool copythrow = true); virtual ~ExceptionWrapper() throw(){} // some methods like severity(),setSeverity(value),.....) } I was doing like: const Exception* derived = reinterPret_cast<const Exception*> (&exception)// here exception is type of exception_ptr if(derived) { derived->severity(); // here exception is coming... if i put this line in try block then its going for catch block and new exception is being rasied. if i dont put try block then *unknown file: error: SEH exception with code 0xc0000005 thrown in the test body.* } Please help me to resolve this issue

2 1

Simple boost fix for sparc64
by John Klos 27 Sep '21

27 Sep '21

Hello, boost people, This is a small, simple patch to make boost compile properly on NetBSD/sparc64, at very least, and on SPARC and UltraSPARC in general. Here's a failure example: https://ftp.ziaspace.com/pub/pkgsrc/reports/9.0_2021Q2/sparc64/boost-libs-1… Thanks very much, John Klos --- libs/predef/include/boost/predef/architecture/sparc.h.orig 2021-09-27 16:03:19.965761565 +0000 +++ libs/predef/include/boost/predef/architecture/sparc.h 2021-09-27 16:11:18.084758689 +0000 @@ -34,10 +34,10 @@ #if defined(__sparc__) || defined(__sparc) # undef BOOST_ARCH_SPARC -# if !defined(BOOST_ARCH_SPARC) && (defined(__sparcv9) || defined(__sparc_v9__) +# if !defined(BOOST_ARCH_SPARC) && (defined(__sparcv9) || defined(__sparc_v9__)) # define BOOST_ARCH_SPARC BOOST_VERSION_NUMBER(9,0,0) # endif -# if !defined(BOOST_ARCH_SPARC) && (defined(__sparcv8) || defined(__sparc_v8__) +# if !defined(BOOST_ARCH_SPARC) && (defined(__sparcv8) || defined(__sparc_v8__)) # define BOOST_ARCH_SPARC BOOST_VERSION_NUMBER(8,0,0) # endif # if !defined(BOOST_ARCH_SPARC)

2 1

access violation and data stealing
by rajesh daggumati 27 Sep '21

27 Sep '21

Hi Team, I am preparing a document for boost library(1.76.0) to be used in our organisation. as part of documnet, I need some information. 1.Regarding data integrity and security of gtest and how it interacts with any software. 2.if we use boost, we see any access violation or data stealing? 3.is there any group who supports on cyber security while we are using boost 1.76.0 Please kindly answer above 3 queries. Regards, Raesh D

2 1

please guide me to open source world
by Saurabh Tiwari 23 Sep '21

23 Sep '21

Hai SIR/MAAM this side SAURABH TIWARI currently I am in my 3rd year of Btech I don’t know much about the open source can you please help how to get started for the same I know C++, C, basic data structures and algorithms I would be very thankful if you please help me sir so that I can contribute to this open-source world.

4 5

New to boost
by rajesh daggumati 22 Sep '21

22 Sep '21

Hi Team, in my code,I had to write like below: const int* p = boost::get_error_info<boost::throw_line>(exception); But while building the code,I am facing issue like below: error C2683: 'dynamic_cast':'boost::exception_ptr' is not a polymorphic type.. Then I have added one dummy virtual function in exception_ptr class then this issue got resolved but I am getting some test cases failed at this line: Const int* p = boost::get_error_info<boost::throw_line>(exception); Please help me where will be the issue is.what will be the solution.

4 3

Published various template libraries...
by David Bien 22 Sep '21

22 Sep '21

That I have been working on over the past 23 years (when not working for actual money). Directed Graph Template Library: https://github.com/davidbien/dgraph Original email to boost mailing list from year 2000: https://lists.boost.org/Archives/boost/2000/04/2834.php Lexical Analyzer Generator Template Library: https://github.com/davidbien/lexang Original email to boost mailing list from year 2000: https://lists.boost.org/Archives/boost/2000/04/2837.php This depends on the dgraph git submodule above. The above are written in "old" C++ - but updated to compiler in the latest compilers (MSVC, clang11). Built on the above: XML Parser/Writer/DOM Template Library: https://github.com/davidbien/xmlpinc This I developed over the last winter. It is written in C++20 and requires msvc19 or clang11. I heavily use C++20 concepts. There is a lack of documentation. As well: XML Parser/Writer/DOM Development Environment: https://github.com/davidbien/xmlp This contains the LEX specifications (which are written using overridden C++ operators in a namespace) that produce the state machines for UTF8, UTF16 and UTF32 versions of the XML parser - which are then, upon modification, checked into: https://github.com/davidbien/xmlpinc This as well requires the nearly latest versions of MSVC or clang. Once again: There is a lack of documentation. I don't use boost in these libraries - preferring not to have a dependency on it. I also published: https://github.com/davidbien/bienutil Which contains a lot of stuff from year 2000, but also contains some new stuff which is pretty cool: 1. An actually performant and memory-conservative implementation of a Van Emde Boas Tree: https://github.com/davidbien/bienutil/blob/master/_vebtree.h 2. An "exponential chunked array" (misnamed as "logarray.h") that uses a single piece of memory initially: https://github.com/davidbien/bienutil/blob/master/_logarray.h 3. A bunch of other stuff that I wrote back in 2000 since there wasn't much available back then in terms of C++ utility templates. There is a testbed for the dgraph impl but I haven't yet converted them to CMAKE/googletest. There is also a testbed for the vebtree impl but once again not converted to CMAKE/googletest. (I only have so many fingers). Anyway, I'd like to know what people think. The XML parser is meant to be fully compliant with XML Version 1.0 and meant to be a development environment that can be used to extend to full compatibility. I am currently working on a Parser Generator Template Library (think replacement for yacc or bison) that will work with my LEX replacement and allow use of the LEX terminals in the EBNF for the parser specification (which will again be encoding using C++ overridden operators in a namespace). Sincerely, David Bien

2 2

Please guide me for open source
by Saurabh Tiwari 21 Sep '21

21 Sep '21

Hai SIR/MAAM this side SAURABH TIWARI currently I am in my 3rd year of Btech I don’t know much about open source can you please help how to get started for the same I know C++ ,C, basic data structures and algorithms, html , css (basics), and learning web development. I would be very thankful of you please help me sir so that I can contribute to this open source world.

1 0

[any] [basic_any] This seems like a little pearl in Boost 1.77, but it's a bit underdocumented?
by Viktor Sehr 21 Sep '21

21 Sep '21

I just discovered basic_any which is a very nice addition for me. However it's a bit under-documented for the moment. For example: - I assume it's stack-allocated, does it allocate on the heap if assigned an object larger than the stack (like small_vector) or is this not allowed (like static_vector)? - An idea would also be to add a flag which breaks compilation if an object larger than the OptimizeForSize argument is assigned? - (For detail) If allocated on the stack, are the first bytes of the basic_any the same as the contained object? /Viktor

2 2

[ICL] Proposal to support other set/map implementations
by Martin Duvanel 18 Sep '21

18 Sep '21

Hello, We are using boost::icl::interval_set with very large amounts of intervals, and we are having some performance issues. Profiling showed that, in our use-case, a lot of time was spent on memory allocation/deallocation, and swapping std::set for boost::flat_set made a huge, positive difference. We may have a very specific use-case, but would you consider a small modification to the library inside "boost/icl/impl_config.hpp", in order to open the door for other set/map implementations? Here is the simple change we made to "boost/icl/impl_config.hpp" for this experiment: <code> #if defined(ICL_USE_BOOST_MOVE_IMPLEMENTATION) # define ICL_IMPL_SPACE boost::container #elif defined(ICL_USE_STD_IMPLEMENTATION) # define ICL_IMPL_SPACE std + #elif defined(ICL_USE_CUSTOM_IMPLEMENTATION) + # define ICL_IMPL_SPACE ICL_CUSTOM_IMPL_SPACE #else # define ICL_IMPL_SPACE std #endif </code> And then declaring the following before including: <code> namespace custom_icl { template <class Key, class T, class Compare, class Allocator> using map = boost::container::flat_map<Key, T, Compare, Allocator>; template <class Key, class Compare, class Allocator> using set = boost::container::flat_set<Key, Compare, Allocator>; } // namespace custom_icl #define ICL_USE_CUSTOM_IMPLEMENTATION 1 #define ICL_CUSTOM_IMPL_SPACE custom_icl </code> Would such a change make sense in your opinion? If that's the case, then I would be happy to participate in the contribution. Thank you and best regards, Martin Duvanel

3 4

New contributor in Boost
by RUCHIT RAUSHAN 18 Sep '21

18 Sep '21

Hey there, I am a student of branch Information Technology and currently gaining knowledge in C++. I would love to contribute to the Boost community in every possible way, so I would like to know how to start with it. Thank You! RUCHIT RAUSHAN

3 2

16th Google Summer of Code Participation
by Cem Bassoy 15 Sep '21

15 Sep '21

Since 16 years, the Boost foundation has been selected as a mentor organization by the Google Summer of Code <https://summerofcode.withgoogle.com/> committee. If I am not mistaken, Boost has mentored over 100 students who contributed to existing and experimental boost libraries. This year, 8 students successfully contributed to Boost.Real, Boost.Gil, Boost.Math, Boost.Python, Boost.uBlas, Boost.Multiprecision, see project descriptions <https://summerofcode.withgoogle.com/organizations/6722937052200960/#projects> . Here <https://opensource.googleblog.com/2021/06/google-summer-of-code-2021-studen…> are some stats about GSoC21. I would like to thank all students for their contribution and all mentors who have made this possible. Keep up the good work! All the best, Cem

2 1

New to Boost
by Abhishek Rathore 14 Sep '21

14 Sep '21

Hey! I am a student majoring in Computer Science and am currently learning C++. I would love to contribute to the Boost community in any way possible in the near future so that is why, I would like to know how to go about it. Thanks and Super excited! Abhishek

2 1

Re: [boost] New to Boost
by Kenneth Porter 14 Sep '21

14 Sep '21

--On Tuesday, September 14, 2021 3:41 PM +0530 Abhishek Rathore via Boost <boost(a)lists.boost.org> wrote: > I am a student majoring in Computer Science and am currently learning C++. > I would love to contribute to the Boost community in any way possible in > the near future so that is why, I would like to know how to go about it. Head to Github and check out the issues on all the libraries. Fork, fix, and submit pull requests. <https://svn.boost.org/trac10/wiki/StartModPatchAndPullReq> (I don't see anything here about legal issues. Does one need to file a contributor release?)

1 0

Regarding boost 1.76.0
by rajesh daggumati 09 Sep '21

09 Sep '21

Hi Team, Is boost 1.76.0 version is stable version or not.please confirm me asap. Regards, Rajesh D

4 4

Regarding usage of boost 1.76.0
by rajesh daggumati 08 Sep '21

08 Sep '21

Hi Team, Please help me for below query. What are the steps we need to do to include boost in to our code base and release bour software without any obligation? Ex: include license along with our binaries or we need to publish our code to boost platform....? Are we oblige to share anything to boost? Regards, Rajesh D

2 1

Regarding suppporting end date of boost 1.776.0
by rajesh daggumati 08 Sep '21

08 Sep '21

Hi Team, What is the supporting end date for boost 1.76.0 version? Please let me know asap. Regards, Rajesh D

2 1

Can we create boost-config
by Sreeraj K 06 Sep '21

06 Sep '21

*[I initialially raised this question in https://github.com/boostorg/boost/issues/548 <https://github.com/boostorg/boost/issues/548>, but @mclaw recommended this mailing list.]* Similar to many other packages (eg: curl, krb5, pcre, xml2, xslt etc..), can we also ship boost-config that would provide the installation options ? We can probably start with something like this ? $ /usr/bin/boost-config --help Usage: boost-config [ options ] Options: --cflags print compiler options --ldflags print linker options --prefix print the boost prefix --version print the boost version --help print this usage summary $ /usr/bin/boost-config --version 1.66.0 $ /usr/bin/boost-config --cflags -I/usr/include $ /usr/bin/boost-config --ldflags -L/usr/lib64 -Wl,-R/usr/lib64 Thanks.

4 4

[Asio] Propose optimization patch for QNX OS.
by Alex Steshkin 06 Sep '21

06 Sep '21

Hello, By default on QNX OS the select_reactor class is used, which uses the POSIX select() to wait for I/O and write to a pipe to interrupt the wait. Neither select() nor pipes are efficient on QNX OS. We propose to introduce new ionotify_reactor class for QNX OS, which uses ionotify() and pulses instead of select() and pipes. If you are interested in this patch please let me know how to proceed with it: - what repo and branch should I use for this patch? - what is mandatory test set should be done for this patch? - what documentation should be updated to reflect this patch? Thanks, Alex Steshkin ---------------------------------------------------------------------- This transmission (including any attachments) may contain confidential information, privileged material (including material protected by the solicitor-client or other applicable privileges), or constitute non-public information. Any use of this information by anyone other than the intended recipient is prohibited. If you have received this transmission in error, please immediately reply to the sender and delete this information from your system. Use, dissemination, distribution, or reproduction of this transmission by unintended recipients is not authorized and may be unlawful.

2 1

Fwd: Reg, Boost lib dijkstra_shortest_paths for ECMP paths
by kathireswaran thanuskodi 06 Sep '21

06 Sep '21

Hi Team, I came across the boost lib to identify the shortest paths in an network using vertex/edge properties, and have using dijkstra_shortest_paths method with predecessor_map concept with that able to get the shortest path in the graph. Have a requirement like to know about multiple shortest paths also if present, for example below find the below network diagram with 4 edges, A ------- B | | | | D ------- C Edges -> (A,B), (A,D), (B,C), (C,D) with equal distance 1. With the predecessor_map as of now able to get path as A->B->C so that the parent of C is noted as B. In this example we have ECMP(equal cost multiple path) from src A to destination C, tried to search for existing lib to achieve fetching all the paths but unfortunately unable to identify the way. kindly guide how to get such kind of multiple path info with the existing library itself or not. If there exists how to get those info. *<code snip>* const int num_nodes = 4; enum nodes { A, B, C, D}; Edge edge_array[] = { Edge(A, B), Edge(B, C), Edge(A, D), Edge(C,D) }; int weights[] = { 1, 1, 1,1 }; int num_arcs = sizeof(edge_array) / sizeof(Edge); graph_traits<graph_t>::vertex_iterator i, iend; graph_t g(edge_array, edge_array + num_arcs, weights, num_nodes); property_map<graph_t, edge_weight_t>::type weightmap = get(edge_weight, g); // Manually intialize the vertex index and name maps property_map<graph_t, vertex_index_t>::type indexmap = get(vertex_index, g); property_map<graph_t, vertex_name_t>::type name = get(vertex_name, g); int c = 0; for (boost::tie(i, iend) = vertices(g); i != iend; ++i, ++c) { indexmap[*i] = c; name[*i] = 'A' + c; } vertex_descriptor s = vertex(A, g); property_map<graph_t, vertex_distance_t>::type d = get(vertex_distance, g); property_map<graph_t, vertex_predecessor_t>::type p = get(vertex_predecessor, g); dijkstra_shortest_paths(g, s, predecessor_map(p).distance_map(d)); std::cout << "distances and parents:" << std::endl; graph_traits < graph_t >::vertex_iterator vi, vend; for (boost::tie(vi, vend) = vertices(g); vi != vend; ++vi) { std::cout << "distance(" << name[*vi] << ") = " << d[*vi] << ", "; std::cout << "parent(" << name[*vi] << ") = " << name[p[*vi]] << std:: endl; } std::cout << std::endl; *<code snip>* *<output>* distances and parents: distance(A) = 0, parent(A) = A distance(B) = 1, parent(B) = A*distance(C) = 2, parent(C) = B <<<<<<<<<<<<<<<* distance(D) = 1, parent(D) = A Regards, Kathir

1 0

Documentation is not updating since June 10
by Nikita Kniazev 03 Sep '21

03 Sep '21

https://www.boost.org/doc/libs/develop/doc/html/accumulators.html Last revised: June 10, 2021 at 02:32:49 GMT https://www.boost.org/doc/libs/master/doc/html/accumulators.html Last revised: June 10, 2021 at 15:48:57 GMT I thought it was related to the regression matrix not being updated but that was fixed while documentation is still stale.

1 0