René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"DiscussionForumPosting","headline":"[Question, Suggestion] Would a variadic `zip()` be useful for the library?","articleBody":"A variadic `zip()` might make implementing other variadic algorithms easy in terms of existing stl algorithms.\r\nIt might also be useful on its own.\r\n\r\nThe function would take variadic number of ranges, and return a range that iterates over all the input ranges, advancing all the input range iterators at each step, and yielding a tuple of values when dereferencing. The zipped range would only iterate until the shortest input range is consumed.\r\n\r\nFor example:\r\n```cpp\r\nauto a = std::vector{1, 2, 3, 4};\r\nauto b = std::vector{1, 2};\r\nauto zipped = zip(a, b);\r\nauto it = zipped.begin();\r\n\r\n*it == std::tuple{*a.begin(), *b.begin()};\r\n++it;\r\n*it == std::tuple{*(a.begin()+1), *(b.begin() + 1)};\r\n++it;\r\n(it != zipped.end()) == false; // b only had 2 elements\r\n```\r\n\r\nI played around a bit with the idea and wrote a little poc implementation https://godbolt.org/z/9oGWs9.\r\n\r\nPs. boost seems to have something similar https://www.boost.org/doc/libs/1_75_0/libs/iterator/doc/zip_iterator.html\r\n","author":{"url":"https://github.com/juntuu","@type":"Person","name":"juntuu"},"datePublished":"2021-02-28T13:06:30.000Z","interactionStatistic":{"@type":"InteractionCounter","interactionType":"https://schema.org/CommentAction","userInteractionCount":4},"url":"https://github.com/2/An-Algorithm-Library/issues/2"}