Difference between revisions of "User:Quickfur"

From D Wiki
Jump to: navigation, search
(Created page with "==Who am I?== I'm just another programmer who grew up with C and C++, got sick of their design flaws, wasn't quite satisfied with the whole VM trend (Java and its ilk), and f...")
 
(What do I do?)
Line 5: Line 5:
 
==What do I do?==
 
==What do I do?==
  
D-related stuff that I'm involved with:
+
Here are some D-related stuff that I'm involved with.
  
* Issues with transient ranges and the bugs in Phobos related to it.
+
===Transient ranges===
* Implementation of std.algorithm.cartesianProduct (currently stuck in limbo due to a compiler template cross-talk bug).
+
 
* Implementation of std.algorithm.nextPermutation, and perhaps nextEvenPermutation (needs some work to bring it up to Phobos quality)
+
Issues with transient ranges and the bugs in Phobos related to it. Transient ranges are those whose .front value is invalidated after calling popFront(). Several algorithms in Phobos do not work correctly when passed this kind of range. It's still under discussion whether transient ranges are valid, and what should be done about them.
* Replacing the current AA implementation with an in-library solution in order to fix some fundamental problems (currently roadblocked due to various issues).
+
 
 +
Currently I have an [https://github.com/D-Programming-Language/phobos/pull/987 open pull request] for fixing std.algorithm.joiner to work properly with transient ranges.
 +
 
 +
===Additions to std.algorithm===
 +
 
 +
====Cartesian Product====
 +
 
 +
Implementation of std.algorithm.cartesianProduct. Currently stuck in limbo due to a [http://d.puremagic.com/issues/show_bug.cgi?id=8542 compiler template cross-talk bug].
 +
 
 +
====Next Permutation====
 +
 
 +
Implementation of std.algorithm.nextPermutation, and perhaps nextEvenPermutation. I have some working code that I'm using for my own projects; but it needs some work to bring it up to Phobos quality.
 +
 
 +
===New AA implementation===
 +
 
 +
The goal is to replace the current AA implementation with an in-library solution in order to fix some fundamental problems that causes quite a number of existing AA-related bugs. Currently roadblocked due to various issues. The code is available on [https://github.com/quickfur/New-AA-implementation github].

Revision as of 04:56, 10 December 2012

Who am I?

I'm just another programmer who grew up with C and C++, got sick of their design flaws, wasn't quite satisfied with the whole VM trend (Java and its ilk), and finally found D, the closest language to my ideals.

What do I do?

Here are some D-related stuff that I'm involved with.

Transient ranges

Issues with transient ranges and the bugs in Phobos related to it. Transient ranges are those whose .front value is invalidated after calling popFront(). Several algorithms in Phobos do not work correctly when passed this kind of range. It's still under discussion whether transient ranges are valid, and what should be done about them.

Currently I have an open pull request for fixing std.algorithm.joiner to work properly with transient ranges.

Additions to std.algorithm

Cartesian Product

Implementation of std.algorithm.cartesianProduct. Currently stuck in limbo due to a compiler template cross-talk bug.

Next Permutation

Implementation of std.algorithm.nextPermutation, and perhaps nextEvenPermutation. I have some working code that I'm using for my own projects; but it needs some work to bring it up to Phobos quality.

New AA implementation

The goal is to replace the current AA implementation with an in-library solution in order to fix some fundamental problems that causes quite a number of existing AA-related bugs. Currently roadblocked due to various issues. The code is available on github.