On Saturday, 27 February 2016 at 22:31:28 UTC, Brother Bill wrote:
Clojure supports immutable lists that allow adding and removing
elements, and yet still have excellent performance.
For D language, what are the recommended techniques to use
functional programming, without massive copying of
On Sat, 27 Feb 2016 22:31:28 +, Brother Bill wrote:
> Clojure supports immutable lists that allow adding and removing
> elements, and yet still have excellent performance.
>
> For D language, what are the recommended techniques to use functional
> programming, without massive copying of data
On Saturday, 27 February 2016 at 22:31:28 UTC, Brother Bill wrote:
That is, how to create one-off changes to an immutable data
structure, while keeping the original immutable, as well as the
one-off change, and maintain good performance.
Clojure uses bit-partitioned hash tries.
I
On Saturday, 27 February 2016 at 23:19:51 UTC, w0rp wrote:
On Saturday, 27 February 2016 at 22:31:28 UTC, Brother Bill
wrote:
Clojure supports immutable lists that allow adding and
removing elements, and yet still have excellent performance.
For D language, what are the recommended techniques
On Saturday, 27 February 2016 at 22:31:28 UTC, Brother Bill wrote:
Clojure supports immutable lists that allow adding and removing
elements, and yet still have excellent performance.
For D language, what are the recommended techniques to use
functional programming, without massive copying of
Clojure supports immutable lists that allow adding and removing
elements, and yet still have excellent performance.
For D language, what are the recommended techniques to use
functional programming, without massive copying of data and
garbage collection, so that it remains immutable.
That
