Sorting and Searching Algorithms Library
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 ,
Send Boost mailing list submissions to boost@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@lists.boost.org
You can reach the person managing the list at boost-owner@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
To: "boost@lists.boost.org" Subject: [boost] building boost libraries with pdb files under windows Message-ID: < DB6PR0501MB27593FBAC29B49059A752178C6690@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
To: boost@lists.boost.org, phdcluster@gmail.com Subject: Re: [boost] Boost Digest, Vol 5998, Issue 1 Message-ID: < CA+iicpFdnd67wpP25MVjXtBxW5TFEkGb78XL-SK5RPosw_nMHQ@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 ,
wrote: Send Boost mailing list submissions to boost@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@lists.boost.org
You can reach the person managing the list at boost-owner@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
To: boost@lists.boost.org Subject: [boost] qxcalc(GSoC2019) Message-ID: <20190207100710.Horde.VkEf1bfe3uAO1wELKmHKrul@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
To: boost@lists.boost.org Subject: [boost] qxcalc(GSoC2019)-2 Message-ID: <20190207110116.Horde.VeAEqWouVIYk0-9NMfOsi9P@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
To: boost@lists.boost.org Subject: [boost] Sorting Algorithms Library Message-ID: 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
To: boost@lists.boost.org Cc: Siddhartha Sen Subject: Re: [boost] Sorting Algorithms Library Message-ID: < CAKYCxYFSbMoxJf4ycjgMxLQSQq9ddkuZUa1BF7bMfBOhntWO1Q@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@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
To: Nir Friedman Cc: Boost Subject: Re: [boost] Feedback desired for reflective enum library Message-ID: < CAFYdOOLxMqup9-0Vub+UNJGgpvaqTGL0mWr1d1txuq4mstMJGg@mail.gmail.com> Content-Type: text/plain; charset="UTF-8" On Tue, Feb 5, 2019, 2:00 PM Nir Friedman
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
To: boost@lists.boost.org Subject: Re: [boost] building boost libraries with pdb files under windows Message-ID: <9a268d74-c868-f79b-2f2e-52f693482356@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 **************************************
participants (1)
-
Siddhartha Sen