Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

cartesianProduct should have length for finite ranges #9871

Open
dlangBugzillaToGithub opened this issue May 7, 2024 · 0 comments
Open

cartesianProduct should have length for finite ranges #9871

dlangBugzillaToGithub opened this issue May 7, 2024 · 0 comments

Comments

@dlangBugzillaToGithub
Copy link

dlang-bugzilla (@CyberShadow) reported this on 2024-05-07T09:16:37Z

Transfered from https://issues.dlang.org/show_bug.cgi?id=24541

Description

Does not compile:

    import std.algorithm.setops;
    assert(cartesianProduct([1, 2], [3, 4]).length == 4);

Currently the code does:

        return joiner(map!((ElementType!R1 a) => zip(repeat(a), range2.save))
                          (range1));
@LightBender LightBender removed the P4 label Dec 6, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

2 participants