On Friday, 21 November 2014 at 12:23:58 UTC, Jacob Carlborg wrote:
> On 2014-11-21 05:38, Craig Dillabaugh wrote:
>
>> 3. Enhance regular Expressions (2011)
>> Student: Dmitry Olshansky    Mentor:  Fawzi Mohamed
>>
>> Claim of success based on: https://github.com/DmitryOlshansky/FReD
>> (and recent D-Conf talks if need be).
>
> This is now std.regex.
>
>> 5. Extended unicode support (2012)
>> Student: Dmitry Olshansky      Mentor: Andrei Alexandrescu
>> Claim of success based on: Dmitry's continued involvement in phobos
>> development, though I do not have anything on how this project actually
>> progressed.
>
> This is now std.uni.
>
>> Unsure of Status (2012)
>>
>> 1. Removing the global gc lock from common allocations in D. (2012)
>> Student: Antti-Ville Tuunainen Mentor: David Simcha
>> I haven't found much info on this one.  Can either David or Antti-Ville
>> comment on how this project went?
>
> I can't remember that last time I saw any activity here from either Antti-Ville Tuunainen or David Simcha.

Thanks for the info.  It will be added to the proposal I am
preparing for Google.

On 21.11.2014 05:38, Craig Dillabaugh wrote:
> Unsure of Status (2012)
>
> 1. Removing the global gc lock from common allocations in D. (2012)
> Student: Antti-Ville Tuunainen Mentor: David Simcha
> I haven't found much info on this one.  Can either David or Antti-Ville
> comment on how this project went?
>

The project was redirected to implementing precise scanning for the GC using RTInfo. That feature was brand new at the time, so they had to fight an awful lot of bugs in dmd, though.

My implementation of the precise GC was based on Antti-Ville's work (https://github.com/Tuna-Fish/druntime/tree/gc_poolwise_bitmap), but not a lot of code has remained from the original source.

On Wed, 2014-11-05 at 03:54 +0000, Craig Dillabaugh via Digitalmars-d
wrote:
[…]

Apologies for being late to reply. Long story, no sensible tl;dr.

[…]
> Russel Winder         Phobos/QML: std.parallelism, std.benchmark
[…]

Not sure about Phobos here but D really does need to be able to connect to QML. This proposal is therefore to create a way of communicating between D codes and QML engines via signals and slots. The model here is the Go/QML system. It works very well, but isn't D.

std.parallelism needs a review and some benchmarking, prior to making improvements: some of the things David put into it are not as performant as it would be nice for them to be. As part of this is would be good to have a standard benchmarking framework, hence the idea of std.benchmark. However there is no need for it to be in std (and hence Phobos) in the first instance. So the project(s) would be to create a comparative benchmarking framework that can then be used to analyse std.parallelism on a more scientific basis than I and others have done to date.

Hopefully this is not too late and can be iterated to something that can be posted. Is the idea to have a wiki for this, or mayhap a Git/Mercurial/Bazaar/Fossil repository with pull requests?

-- 
Russel. ============================================================================= Dr Russel Winder      t: +44 20 7585 2200   voip: sip:russel.winder@ekiga.net 41 Buckmaster Road    m: +44 7770 465 077   xmpp: russel@winder.org.uk London SW11 1EN, UK   w: www.russel.org.uk  skype: russel_winder

On Thu, 2014-11-06 at 02:41 +0000, Craig Dillabaugh via Digitalmars-d
wrote:
[…]
> Linear Algebra Library   Cristi Cobzarenco     David Simcha based on SciD
[…]

Big Data (*) is the thing of the moment. Data science generally works in the relative small using Julia, R, and Python/SciPy/Matplotlib/Pandas. All the Java "Big Data" is fairly unsophisticated in comparison, in general anyway. I am not sure if there is any C++ stuff happening generally, there is a bit in the London quant scene, but R and Python dominate with Julia the up and coming outsider.

If D really is as fast as C++ at execution and as fast as Python/R/Julia at development then it is not the language, it is the libraries that make it so. If D is to be a player then SciD need to get the same facilities as SciPy/Matplotlib/Pandas. NumPy on which the Python stuff is based is actually not as good as people make out, at least not at grunt performant parallel computation. Actually it is quite slow, I can get better performance using straight Python and Numba. On the other hand all the algorithms are already written on NumPy.

So if SciD stopped being a Linear Algebra Library, and became a library
of scientific (and statistical) algorithms with graphic visualization
rendering, there is a small window of opportunity. On the downside,
Julia, Python, R have a lot of backing.


(*) Whatever that is.

-- 
Russel. ============================================================================= Dr Russel Winder      t: +44 20 7585 2200   voip: sip:russel.winder@ekiga.net 41 Buckmaster Road    m: +44 7770 465 077   xmpp: russel@winder.org.uk London SW11 1EN, UK   w: www.russel.org.uk  skype: russel_winder

On Wednesday, 5 November 2014 at 03:54:23 UTC, Craig Dillabaugh wrote:
> This is my second Call for Proposals for the 2015 Google Summer of Code. Anyone interested in mentoring, or who has good idea's for a project for 2015 please post here.

I think it'd be awesome to have something like boost::intrusive[1] in D.
For a GSOC project, the scope could be reduced to a few of the containers from the boost version (focus should be to lay groundwork for future additions.)

The advantage of intrusive containers which I believe would have the most mass appeal is that memory management is external to the container instead of baked in.

Further more, intrusive containers can be combined and extended in interesting ways (I've found this extremely useful,) which are impossible with non-intrusive containers. I've chosen to use C++ over D for some of my programs due to this library alone.

[1] http://www.boost.org/doc/libs/1_57_0/doc/html/intrusive.html

On Saturday, 22 November 2014 at 09:05:26 UTC, Rainer Schuetze wrote:
>
>
> On 21.11.2014 05:38, Craig Dillabaugh wrote:
>> Unsure of Status (2012)
>>
>> 1. Removing the global gc lock from common allocations in D. (2012)
>> Student: Antti-Ville Tuunainen Mentor: David Simcha
>> I haven't found much info on this one.  Can either David or Antti-Ville
>> comment on how this project went?
>>
>
> The project was redirected to implementing precise scanning for the GC using RTInfo. That feature was brand new at the time, so they had to fight an awful lot of bugs in dmd, though.
>
> My implementation of the precise GC was based on Antti-Ville's work (https://github.com/Tuna-Fish/druntime/tree/gc_poolwise_bitmap), but not a lot of code has remained from the original source.

Thank you for the update, so it at least sounds like something of value came out of the project.  Likely good enough to say it was a success in that some meaningful work was done.

On Saturday, 22 November 2014 at 15:27:00 UTC, Russel Winder via Digitalmars-d wrote:
> On Wed, 2014-11-05 at 03:54 +0000, Craig Dillabaugh via Digitalmars-d
> wrote:
> […]
>
> Apologies for being late to reply. Long story, no sensible tl;dr.
>
> […]
>> Russel Winder         Phobos/QML: std.parallelism, std.benchmark
> […]
>
> Not sure about Phobos here but D really does need to be able to connect
> to QML. This proposal is therefore to create a way of communicating
> between D codes and QML engines via signals and slots. The model here is
> the Go/QML system. It works very well, but isn't D.
>
> std.parallelism needs a review and some benchmarking, prior to making
> improvements: some of the things David put into it are not as performant
> as it would be nice for them to be. As part of this is would be good to
> have a standard benchmarking framework, hence the idea of std.benchmark.
> However there is no need for it to be in std (and hence Phobos) in the
> first instance. So the project(s) would be to create a comparative
> benchmarking framework that can then be used to analyse std.parallelism
> on a more scientific basis than I and others have done to date.
>
> Hopefully this is not too late and can be iterated to something that can
> be posted. Is the idea to have a wiki for this, or mayhap a
> Git/Mercurial/Bazaar/Fossil repository with pull requests?

We still have lots of time to flesh out ideas - things don't need to be finalized until February.  Thanks for giving some more info on your proposed projects.  I am sort of slow ... so if I can get things in advance that is always good.

On Saturday, 22 November 2014 at 16:38:43 UTC, safety0ff wrote:
> On Wednesday, 5 November 2014 at 03:54:23 UTC, Craig Dillabaugh wrote:
>> This is my second Call for Proposals for the 2015 Google Summer of Code. Anyone interested in mentoring, or who has good idea's for a project for 2015 please post here.
>
> I think it'd be awesome to have something like boost::intrusive[1] in D.
> For a GSOC project, the scope could be reduced to a few of the containers from the boost version (focus should be to lay groundwork for future additions.)
>
> The advantage of intrusive containers which I believe would have the most mass appeal is that memory management is external to the container instead of baked in.
>
> Further more, intrusive containers can be combined and extended in interesting ways (I've found this extremely useful,) which are impossible with non-intrusive containers. I've chosen to use C++ over D for some of my programs due to this library alone.
>
> [1] http://www.boost.org/doc/libs/1_57_0/doc/html/intrusive.html

Are interested in mentoring such a project?