What's currently the fastest way of removing the largest matching prefix from an array of prefix arrays from an array in D like

    auto x = "first_second";
    x.skipOverLargestMatch(["fir", "first"]);
    assert( == "_second");

    auto x = "first_second";
    x.skipOverLargestMatch(["fir"]);
    assert( == "st_second");

The list of prefixes is preferrably dynamically generated but can also a variadic list of arguments if necessary.

I guess we could reuse variadic find in the static case.

Reply via email to