On Wednesday, 13 January 2021 at 12:06:05 UTC, Roguish wrote:
which seems perfectly adequate.
What about sets?
You can also search https://code.dlang.org
I use:
https://code.dlang.org/packages/emsi_containers
Which has hashset:
On Wednesday, 13 January 2021 at 12:39:50 UTC, evilrat wrote:
There is no specific set container, they just implemented as
generic algorithms over the ranges.
I see. Thanks for pointing that out.
On Wednesday, 13 January 2021 at 12:48:47 UTC, Ferhat Kurtulmuş
wrote:
I read many posts that rbtree can be a replacement for sets in
dlang.
see its behaviour is identical.
Thanks, will read up.
On Wednesday, 13 January 2021 at 12:06:05 UTC, Roguish wrote:
On Wednesday, 13 January 2021 at 11:58:11 UTC, Roguish wrote:
I can't find anything about collections in D. All I have found
are arrays and maps ("associative arrays"). What about lists
and sets? What if I just want a l
On Wednesday, 13 January 2021 at 12:06:05 UTC, Roguish wrote:
What about sets?
There is no specific set container, they just implemented as
generic algorithms over the ranges.
There is a section for set operations (std.algorithm.setops
module).
https://dlang.org/phobos/std_algorithm.html
On Wednesday, 13 January 2021 at 11:58:11 UTC, Roguish wrote:
I can't find anything about collections in D. All I have found
are arrays and maps ("associative arrays"). What about lists
and sets? What if I just want a linked list?
It seems collections are called "containers&q
On Wednesday, 13 January 2021 at 11:58:11 UTC, Roguish wrote:
I can't find anything about collections in D. All I have found
are arrays and maps ("associative arrays"). What about lists
and sets? What if I just want a linked list?
You can refer to the docs for them:
https://dlang.
I can't find anything about collections in D. All I have found
are arrays and maps ("associative arrays"). What about lists and
sets? What if I just want a linked list?
