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...")
 
(Miscellaneous links)
 
(14 intermediate revisions by the same user not shown)
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.
+
===Articles===
* 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)
+
Here are some draft articles that I'm working on:
* Replacing the current AA implementation with an in-library solution in order to fix some fundamental problems (currently roadblocked due to various issues).
+
 
 +
* [[Component programming with ranges]] (done)
 +
* [[User:Quickfur/Compile-time vs. compile-time]]
 +
 
 +
===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.
 +
 
 +
The [https://github.com/D-Programming-Language/phobos/pull/987 pull request] for fixing std.algorithm.joiner to work properly with transient ranges has been merged.
 +
 
 +
===Additions to std.algorithm===
 +
 
 +
====Cartesian Product====
 +
 
 +
Implementation of [https://github.com/D-Programming-Language/phobos/pull/856 std.algorithm.cartesianProduct]. Merged.
 +
 
 +
====Next Permutation====
 +
 
 +
Implementation of std.algorithm.nextPermutation and nextEvenPermutation. Merged.
 +
 
 +
===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].
 +
 
 +
==Miscellaneous links==
 +
 
 +
Probably only useful to me, but you may find them helpful.
 +
 
 +
* [[Guidelines for maintainers]]
 +
* [[Special:AllPages/template:!|List of all templates]]
 +
* [[Special:AllPages/talk:!|List of all talk pages]]
 +
* [[Proposed new D development process]]; [[Release Process]]
 +
 
 +
Works in progress:
 +
* [[/DIP scope|DIP scope]]

Latest revision as of 17:51, 6 April 2017

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.

Articles

Here are some draft articles that I'm working on:

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.

The pull request for fixing std.algorithm.joiner to work properly with transient ranges has been merged.

Additions to std.algorithm

Cartesian Product

Implementation of std.algorithm.cartesianProduct. Merged.

Next Permutation

Implementation of std.algorithm.nextPermutation and nextEvenPermutation. Merged.

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.

Miscellaneous links

Probably only useful to me, but you may find them helpful.

Works in progress: