February 2019 - Boost - lists.preview.boost.org

Regarding Boost.Real
by Sreejith S 13 Feb '19

13 Feb '19

Hi all I am Sreejith, a sophomore at Amrita University. I had gone through GSoC projects and I found Bringing Boost.Real to review-ready state interesting. As a beginner, I tried to understand the blog post of previous year's GSoC-18 project of the same. It seemed too difficult for me. Is it ok to work on it without any experience? -- Regards, Sreejith.S Amrita Vishwa Vidyapeetham FOSS@Amrita <http://amfoss.in> | Github <https://github.com/sreejithsankar55> | Blog <http://sreejithsankar.wordpress.com>

1 0

[gsoc2019][astronomy]
by rittik verma 12 Feb '19

12 Feb '19

Hello everyone, I am Rittik Verma, a third year Computer Science student. I am looking forward to contributing to the Astronomy library for GSoC 2019. I have studied the repository and would like to add the expected features to the library. I was wondering if the potential mentor has already paired up with a student or the position is still available? My projects: https://github.com/codectile Thank you

4 3

GSoC 2019
by Shourya IIT B 12 Feb '19

12 Feb '19

Respected Sir, I am Parashuram Shourya from India. Currently, I am doing my Master’s in Geoinformatics from Centre of Studies in Resources Engineering(CSRE), Indian Institute of Technology Bombay(IITB). I have a Bachelor's degree in Computer Science and Engineering. Currently, I am learning Machine Learning and High-Performance Computing. I have vast programming experience in C, C++, Python I would love to contribute to Boost C++ Libraries in the upcoming Google Summer of Code 2019. I would be very grateful to get any directions to start with so that I can pursue and participate in GSoC 2019 with your organization.

1 0

[GSOC 19] Programming competency test for ublas
by Amit Singh 10 Feb '19

10 Feb '19

Hi, My name is Amit Singh and I’m interested in machine learning lib for ublas as already provided in my idea list in mailing list. I have completed my programming competency test for ublas and wanted to know where to submit it.

1 0

An interest in a neural net library?
by Sergei Marchenko 09 Feb '19

09 Feb '19

Hi everyone. I would like to get your opinion if there is any interest for a library that implements simple neural networks trained via backpropagation. The main idea is to define the configuration of a feed-forward multi-layer network via template parameters, and also provide implementations for a couple of well-known variations of networks (i.e. convolutional, sampling, network ensemble etc). // Define a network ensemble with two networks with the same input and output size, // but different number of neuron layers and different number of neurons in each layer. typedef neural_network<100, 50, 10> network_1; typedef neural_network<100, 70, 20, 10> network_2; auto network = ensemble(network_1(), network_2()); // Train the network from a training set. // item.input is a 100-element input vector. // item.target is the 10-element desired output vector. for (auto item : training_set) network.train(item.input, item.target, learning_rate); // Feed some input data into the network to get the result. auto result = network.process(input); This code on github that my nephew and myself wrote a couple of years ago can be used as a more detailed illustration for the idea: https://github.com/nsokolnikov/mathlib/blob/master/src/neuralnet.h Also, this github repo has two sample projects that illustrate usage of the library. First sample trains a simple network with a simulated activity pattern and then uses the network to classify more simulated load as low, medium, or high: https://github.com/nsokolnikov/mathlib/tree/master/samples/NeuralNetwork Second sample trains a network on a part of MNIST data set of hand-written digits, and then uses the network to recognize the remaining part of the MNIST data set: https://github.com/nsokolnikov/mathlib/tree/master/samples/TextRecognition Thank you, Serguei Martchenko

1 0

Sorting and Searching Algorithms Library
by Siddhartha Sen 09 Feb '19

09 Feb '19

Actually, I am interested equally in both searching and sorting algorithms. In sorting algorithms, I am actually trying recursive implementations of all the known algorithms myself, to see if somehow I can find any variations or maybe even an whole new algorithm which can give a better time complexity. As far as searching algorithm goes, my knowledge is unfortunately limited to only binary search and linear search and DFS and BFS if graphs are counted . However I am working on patterns in numbers to try and create a generic searching algorithm for integer arrays and strings. Apart from this, I am afraid I don't have a lot of idea and hence I am seeking guidance. Thanks On Sat, 9 Feb, 2019, 5:30 PM , <boost-request(a)lists.boost.org> wrote: > Send Boost mailing list submissions to > boost(a)lists.boost.org > > To subscribe or unsubscribe via the World Wide Web, visit > https://lists.boost.org/mailman/listinfo.cgi/boost > or, via email, send a message with subject or body 'help' to > boost-request(a)lists.boost.org > > You can reach the person managing the list at > boost-owner(a)lists.boost.org > > When replying, please edit your Subject line so it is more specific > than "Re: Contents of Boost digest..." > > > The boost archives may be found at: http://lists.boost.org/Archives/boost/ > > > Today's Topics: > > 1. building boost libraries with pdb files under windows > (Sean Farrow) > 2. Re: Boost Digest, Vol 5998, Issue 1 (Siddhartha Sen) > 3. Re: building boost libraries with pdb files under windows > (Daniela Engert) > > > ---------------------------------------------------------------------- > > Message: 1 > Date: Fri, 8 Feb 2019 12:05:58 +0000 > From: Sean Farrow <sean.farrow(a)seanfarrow.co.uk> > To: "boost(a)lists.boost.org" <boost(a)lists.boost.org> > Subject: [boost] building boost libraries with pdb files under windows > Message-ID: > < > DB6PR0501MB27593FBAC29B49059A752178C6690(a)DB6PR0501MB2759.eurprd05.prod.outlook.com > > > > Content-Type: text/plain; charset="us-ascii" > > Hi, > > Is there a way to build boost libraries with PDB files under visual C++ > 2017? > > Any help appreciated. > > Kind regards > Sean. > > > ------------------------------ > > Message: 2 > Date: Fri, 8 Feb 2019 22:32:18 +0530 > From: Siddhartha Sen <siddhartha99.sen(a)gmail.com> > To: boost(a)lists.boost.org, phdcluster(a)gmail.com > Subject: Re: [boost] Boost Digest, Vol 5998, Issue 1 > Message-ID: > < > CA+iicpFdnd67wpP25MVjXtBxW5TFEkGb78XL-SK5RPosw_nMHQ(a)mail.gmail.com> > Content-Type: text/plain; charset="UTF-8" > > Actually, I am interested equally in both searching and sorting algorithms. > In sorting algorithms, I am actually trying recursive implementations of > all the known algorithms myself, to see if somehow I can find any > variations or maybe even an whole new algorithm which can give a better > time complexity. As far as searching algorithm goes, my knowledge is > unfortunately limited to only binary search and linear search and DFS and > BFS if graphs are counted . However I am working on patterns in numbers to > try and create a generic searching algorithm for integer arrays and > strings. Apart from this, I am afraid I don't have a lot of idea and hence > I am seeking guidance. > Thanks > > On Fri, 8 Feb, 2019, 5:30 PM , <boost-request(a)lists.boost.org> wrote: > > > Send Boost mailing list submissions to > > boost(a)lists.boost.org > > > > To subscribe or unsubscribe via the World Wide Web, visit > > https://lists.boost.org/mailman/listinfo.cgi/boost > > or, via email, send a message with subject or body 'help' to > > boost-request(a)lists.boost.org > > > > You can reach the person managing the list at > > boost-owner(a)lists.boost.org > > > > When replying, please edit your Subject line so it is more specific > > than "Re: Contents of Boost digest..." > > > > > > The boost archives may be found at: > http://lists.boost.org/Archives/boost/ > > > > > > Today's Topics: > > > > 1. qxcalc(GSoC2019) (Ggh) > > 2. qxcalc(GSoC2019)-2 (Ggh) > > 3. Sorting Algorithms Library (Siddhartha Sen) > > 4. Re: Sorting Algorithms Library (phdcluster) > > 5. Re: Feedback desired for reflective enum library (David Sankel) > > > > > > ---------------------------------------------------------------------- > > > > Message: 1 > > Date: Thu, 07 Feb 2019 10:07:10 +0200 > > From: Ggh <ggh(a)multi.fi> > > To: boost(a)lists.boost.org > > Subject: [boost] qxcalc(GSoC2019) > > Message-ID: > > <20190207100710.Horde.VkEf1bfe3uAO1wELKmHKrul(a)webmail.multi.fi> > > Content-Type: text/plain; charset=utf-8; format=flowed; DelSp=Yes > > > > > > Hi all, > > Not sure if there is interest, but some years ago I coded a > > parser/lexer with flex and yacc to do math. > > > > The project is online here > > "http://qxcalc.sourceforge.net/" > > > > Greg > > > > > > > > ------------------------------ > > > > Message: 2 > > Date: Thu, 07 Feb 2019 11:01:16 +0200 > > From: Ggh <ggh(a)multi.fi> > > To: boost(a)lists.boost.org > > Subject: [boost] qxcalc(GSoC2019)-2 > > Message-ID: > > <20190207110116.Horde.VeAEqWouVIYk0-9NMfOsi9P(a)webmail.multi.fi> > > Content-Type: text/plain; charset=utf-8; format=flowed; DelSp=Yes > > > > Some links on my page(these pages are not always online): > > > > http://www.multi.fi/~ghaga/qxcalcdocs/html/index.html > > http://www.multi.fi/~ghaga/qxcalc/ > > http://www.multi.fi/~ghaga/qxcalc/download.php > > > > Ty, > > Greg > > > > > > > > > > ------------------------------ > > > > Message: 3 > > Date: Fri, 8 Feb 2019 01:43:42 +0530 > > From: Siddhartha Sen <siddhartha99.sen(a)gmail.com> > > To: boost(a)lists.boost.org > > Subject: [boost] Sorting Algorithms Library > > Message-ID: > > <CA+iicpGMx+zroF= > > RhE7AtAqJiN4Rw6Fz3hvPnvKmKP6+htKQJg(a)mail.gmail.com> > > Content-Type: text/plain; charset="UTF-8" > > > > Hi, > > This is Siddhartha Sen, a student of Information Science and > > Engineering. I am proficient in C++ and am particularly interested in > > sorting algorithms. Being a GSOC aspirant, I was looking to pair up with > a > > potential mentor in this domain, who could give me some much needed > > guidance. > > Thank You > > > > > > ------------------------------ > > > > Message: 4 > > Date: Thu, 7 Feb 2019 17:30:36 -0500 > > From: phdcluster <phdcluster(a)gmail.com> > > To: boost(a)lists.boost.org > > Cc: Siddhartha Sen <siddhartha99.sen(a)gmail.com> > > Subject: Re: [boost] Sorting Algorithms Library > > Message-ID: > > < > > CAKYCxYFSbMoxJf4ycjgMxLQSQq9ddkuZUa1BF7bMfBOhntWO1Q(a)mail.gmail.com> > > Content-Type: text/plain; charset="UTF-8" > > > > What particular sorting algorithm you are interested in? Or what > algorithms > > you have in mind? > > > > Thanks, > > > > Wen > > > > On Thu, Feb 7, 2019 at 3:50 PM Siddhartha Sen via Boost < > > boost(a)lists.boost.org> wrote: > > > > > Hi, > > > This is Siddhartha Sen, a student of Information Science and > > > Engineering. I am proficient in C++ and am particularly interested in > > > sorting algorithms. Being a GSOC aspirant, I was looking to pair up > with > > a > > > potential mentor in this domain, who could give me some much needed > > > guidance. > > > Thank You > > > > > > _______________________________________________ > > > Unsubscribe & other changes: > > > <http://lists.boost.org/mailman/listinfo.cgi/boost> > > > http://lists.boost.org/mailman/listinfo.cgi/boost > > > > > > > > > ------------------------------ > > > > Message: 5 > > Date: Thu, 7 Feb 2019 19:39:11 -0500 > > From: David Sankel <camior(a)gmail.com> > > To: Nir Friedman <quicknir(a)gmail.com> > > Cc: Boost <boost(a)lists.boost.org> > > Subject: Re: [boost] Feedback desired for reflective enum library > > Message-ID: > > < > > CAFYdOOLxMqup9-0Vub+UNJGgpvaqTGL0mWr1d1txuq4mstMJGg(a)mail.gmail.com> > > Content-Type: text/plain; charset="UTF-8" > > > > On Tue, Feb 5, 2019, 2:00 PM Nir Friedman <quicknir(a)gmail.com> wrote: > > > > > Sure, I'm open to such a thing. Although, I feel like there may be > > caveats > > > to that (i.e. whether the reflection TS interface is easy to use, > whether > > > it's easy to emulate library-only, how likely it is to continue > changing, > > > etc). Do you have a link to a paper that shows what the latest in the > > > reflection TS for enums looks like? > > > > > > > http://cplusplus.github.io/reflection-ts/draft.pdf > > > > > > > > > > > ------------------------------ > > > > Subject: Digest Footer > > > > _______________________________________________ > > Unsubscribe & other changes: > > http://lists.boost.org/mailman/listinfo.cgi/boost > > > > > > ------------------------------ > > > > End of Boost Digest, Vol 5998, Issue 1 > > ************************************** > > > > > ------------------------------ > > Message: 3 > Date: Fri, 8 Feb 2019 19:16:44 +0100 > From: Daniela Engert <dani(a)ngrt.de> > To: boost(a)lists.boost.org > Subject: Re: [boost] building boost libraries with pdb files under > windows > Message-ID: <9a268d74-c868-f79b-2f2e-52f693482356(a)ngrt.de> > Content-Type: text/plain; charset=iso-8859-15 > > Hi Sean! > > Am 08.02.2019 um 13:05 schrieb Sean Farrow via Boost: > > > Is there a way to build boost libraries with PDB files under visual C++ > 2017? > > Well, I am generating PDBs for a couple of years now using a slightly > modified msvc.jam (see > https://github.com/DanielaE/boost.build/commits/vc) Unfortunatly, this > is just a hack that happens to work well enough for my use-case and > requires an additional step to collect the PDBs from the build tree to > the stage directory using some script. Putting more effort into this > isn't economical for at most three distribution build per year. > > Ciao, > Dani > > > > > ------------------------------ > > Subject: Digest Footer > > _______________________________________________ > Unsubscribe & other changes: > http://lists.boost.org/mailman/listinfo.cgi/boost > > > ------------------------------ > > End of Boost Digest, Vol 5999, Issue 1 > ************************************** >

1 0

building boost libraries with pdb files under windows
by Sean Farrow 08 Feb '19

08 Feb '19

Hi, Is there a way to build boost libraries with PDB files under visual C++ 2017? Any help appreciated. Kind regards Sean.

2 1

Re: [boost] Boost Digest, Vol 5998, Issue 1
by Siddhartha Sen 08 Feb '19

08 Feb '19

Actually, I am interested equally in both searching and sorting algorithms. In sorting algorithms, I am actually trying recursive implementations of all the known algorithms myself, to see if somehow I can find any variations or maybe even an whole new algorithm which can give a better time complexity. As far as searching algorithm goes, my knowledge is unfortunately limited to only binary search and linear search and DFS and BFS if graphs are counted . However I am working on patterns in numbers to try and create a generic searching algorithm for integer arrays and strings. Apart from this, I am afraid I don't have a lot of idea and hence I am seeking guidance. Thanks On Fri, 8 Feb, 2019, 5:30 PM , <boost-request(a)lists.boost.org> wrote: > Send Boost mailing list submissions to > boost(a)lists.boost.org > > To subscribe or unsubscribe via the World Wide Web, visit > https://lists.boost.org/mailman/listinfo.cgi/boost > or, via email, send a message with subject or body 'help' to > boost-request(a)lists.boost.org > > You can reach the person managing the list at > boost-owner(a)lists.boost.org > > When replying, please edit your Subject line so it is more specific > than "Re: Contents of Boost digest..." > > > The boost archives may be found at: http://lists.boost.org/Archives/boost/ > > > Today's Topics: > > 1. qxcalc(GSoC2019) (Ggh) > 2. qxcalc(GSoC2019)-2 (Ggh) > 3. Sorting Algorithms Library (Siddhartha Sen) > 4. Re: Sorting Algorithms Library (phdcluster) > 5. Re: Feedback desired for reflective enum library (David Sankel) > > > ---------------------------------------------------------------------- > > Message: 1 > Date: Thu, 07 Feb 2019 10:07:10 +0200 > From: Ggh <ggh(a)multi.fi> > To: boost(a)lists.boost.org > Subject: [boost] qxcalc(GSoC2019) > Message-ID: > <20190207100710.Horde.VkEf1bfe3uAO1wELKmHKrul(a)webmail.multi.fi> > Content-Type: text/plain; charset=utf-8; format=flowed; DelSp=Yes > > > Hi all, > Not sure if there is interest, but some years ago I coded a > parser/lexer with flex and yacc to do math. > > The project is online here > "http://qxcalc.sourceforge.net/" > > Greg > > > > ------------------------------ > > Message: 2 > Date: Thu, 07 Feb 2019 11:01:16 +0200 > From: Ggh <ggh(a)multi.fi> > To: boost(a)lists.boost.org > Subject: [boost] qxcalc(GSoC2019)-2 > Message-ID: > <20190207110116.Horde.VeAEqWouVIYk0-9NMfOsi9P(a)webmail.multi.fi> > Content-Type: text/plain; charset=utf-8; format=flowed; DelSp=Yes > > Some links on my page(these pages are not always online): > > http://www.multi.fi/~ghaga/qxcalcdocs/html/index.html > http://www.multi.fi/~ghaga/qxcalc/ > http://www.multi.fi/~ghaga/qxcalc/download.php > > Ty, > Greg > > > > > ------------------------------ > > Message: 3 > Date: Fri, 8 Feb 2019 01:43:42 +0530 > From: Siddhartha Sen <siddhartha99.sen(a)gmail.com> > To: boost(a)lists.boost.org > Subject: [boost] Sorting Algorithms Library > Message-ID: > <CA+iicpGMx+zroF= > RhE7AtAqJiN4Rw6Fz3hvPnvKmKP6+htKQJg(a)mail.gmail.com> > Content-Type: text/plain; charset="UTF-8" > > Hi, > This is Siddhartha Sen, a student of Information Science and > Engineering. I am proficient in C++ and am particularly interested in > sorting algorithms. Being a GSOC aspirant, I was looking to pair up with a > potential mentor in this domain, who could give me some much needed > guidance. > Thank You > > > ------------------------------ > > Message: 4 > Date: Thu, 7 Feb 2019 17:30:36 -0500 > From: phdcluster <phdcluster(a)gmail.com> > To: boost(a)lists.boost.org > Cc: Siddhartha Sen <siddhartha99.sen(a)gmail.com> > Subject: Re: [boost] Sorting Algorithms Library > Message-ID: > < > CAKYCxYFSbMoxJf4ycjgMxLQSQq9ddkuZUa1BF7bMfBOhntWO1Q(a)mail.gmail.com> > Content-Type: text/plain; charset="UTF-8" > > What particular sorting algorithm you are interested in? Or what algorithms > you have in mind? > > Thanks, > > Wen > > On Thu, Feb 7, 2019 at 3:50 PM Siddhartha Sen via Boost < > boost(a)lists.boost.org> wrote: > > > Hi, > > This is Siddhartha Sen, a student of Information Science and > > Engineering. I am proficient in C++ and am particularly interested in > > sorting algorithms. Being a GSOC aspirant, I was looking to pair up with > a > > potential mentor in this domain, who could give me some much needed > > guidance. > > Thank You > > > > _______________________________________________ > > Unsubscribe & other changes: > > <http://lists.boost.org/mailman/listinfo.cgi/boost> > > http://lists.boost.org/mailman/listinfo.cgi/boost > > > > > ------------------------------ > > Message: 5 > Date: Thu, 7 Feb 2019 19:39:11 -0500 > From: David Sankel <camior(a)gmail.com> > To: Nir Friedman <quicknir(a)gmail.com> > Cc: Boost <boost(a)lists.boost.org> > Subject: Re: [boost] Feedback desired for reflective enum library > Message-ID: > < > CAFYdOOLxMqup9-0Vub+UNJGgpvaqTGL0mWr1d1txuq4mstMJGg(a)mail.gmail.com> > Content-Type: text/plain; charset="UTF-8" > > On Tue, Feb 5, 2019, 2:00 PM Nir Friedman <quicknir(a)gmail.com> wrote: > > > Sure, I'm open to such a thing. Although, I feel like there may be > caveats > > to that (i.e. whether the reflection TS interface is easy to use, whether > > it's easy to emulate library-only, how likely it is to continue changing, > > etc). Do you have a link to a paper that shows what the latest in the > > reflection TS for enums looks like? > > > > http://cplusplus.github.io/reflection-ts/draft.pdf > > > > > > ------------------------------ > > Subject: Digest Footer > > _______________________________________________ > Unsubscribe & other changes: > http://lists.boost.org/mailman/listinfo.cgi/boost > > > ------------------------------ > > End of Boost Digest, Vol 5998, Issue 1 > ************************************** >

1 0

Feedback desired for reflective enum library
by Nir Friedman 08 Feb '19

08 Feb '19

Hey, I have a reflective enum library available here: https://github.com/quicknir/wise_enum. I've been working on this on and off for a couple of months. I've added features, dealt with various issues, added docs, expanded support through 11-17 and as idiomatically as possible. Overall I think the library is in nice shape (lacks unit tests though, though I do already have a boost license for the code). I feel like a reflective enum is just a very standard requirement in pretty much every codebase I've ever worked on. Simply to be able to reasonably log enums already makes it mandatory. It's also invaluable in configuration, error message alerting, and many other places. There is nothing for this in boost and actually there isn't really much of a standard, standalone solution anyway. The closest is Better Enums ( http://aantron.github.io/better-enums/) but this has some major issues (it doesn't actually create enums but rather enum-like classes, it targets 03). So I think a library like this is needed and my implementation ticks off the major requirements. Feedback on the overall design, any issues, any key features it fails to meet, would be very useful. The library itself is very small and simple so its easy to review. Once it seems like there's some consensus on the core design I'm willing to do the work involved getting it into boost (naming conventions/requirements, directory structure, tests, boost-style docs, etc). Note I'm not on the boost mailing list so please respond directly to this email so I can see! Cheers, Nir

3 4

Sorting Algorithms Library
by Siddhartha Sen 07 Feb '19

07 Feb '19

Hi, This is Siddhartha Sen, a student of Information Science and Engineering. I am proficient in C++ and am particularly interested in sorting algorithms. Being a GSOC aspirant, I was looking to pair up with a potential mentor in this domain, who could give me some much needed guidance. Thank You

2 1