Intersection of two sets
Jan Hönig
hrominium at gmail.com
Tue Dec 3 18:45:18 UTC 2019
On Tuesday, 3 December 2019 at 13:55:51 UTC, Alex wrote:
>
> This depends on the available accesses on your sets. In terms
> of ranges:
> Are your sets InputRanges, ForwardRange, ... ?
>
>
>> 2) Are there some build-in function for handling such sets?
>
> This is maybe what you are looking for:
> https://dlang.org/phobos/std_algorithm_setops.html
In terms of ranges, i need to understand ranges properly first.
The std.algorithm.setops have definitely the functionality i need.
I guess my current implementation would be a simple array.
I just need to make sure delete, or not create double entries.
More information about the Digitalmars-d-learn
mailing list