Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://en.cppreference.com/w/cpp/language/../algorithm/../ranges/cartesian_product_view.html below:

std::ranges::views::cartesian_product, std::ranges::cartesian_product_view - cppreference.com

Call signature

Helper concepts

Helper function templates

is a range adaptor that takes

, where

, and produces a

of tuples calculated by the

of the provided ranges. The size of produced view is a multiple of sizes of provided ranges, while each element is a tuple (of references) of the size

.

Determines if

is a common range (see also

).

Determines if

satisfies the helper concept

(see also

).

Determines if

is a sized range (see also

).

8) Determines if cartesian_product uses sized sentinel.

Returns the end of the produced

. Participates in overload resolution only if

satisfies the helper concept

.

The First range passed to cartesian_product_view is treated specially, since it is only passed through a single time. As a result, several constrains are relaxed on it:

• First is an input_range instead of forward_range;
• First does not have to be a sized_range in order for the cartesian_product_view to be random_access_range or common_range;
• First does not have to be common_range in order for the cartesian_product_view to be bidirectional_range.

The name views::cartesian_product denotes a customization point object, which is a const function object of a literal semiregular class type. See CustomizationPointObject for details.

#include <array>
#include <iostream>
#include <list>
#include <ranges>
#include <string>
#include <vector>
 
void print(std::tuple<char const&, int const&, std::string const&> t, int pos)
{
    const auto& [a, b, c] = t;
    std::cout << '(' << a << ' ' << b << ' ' << c << ')' << (pos % 4 ? " " : "\n");
}
 
int main()
{
    const auto x = std::array{'A', 'B'};
    const auto y = std::vector{1, 2, 3};
    const auto z = std::list<std::string>{"α", "β", "γ", "δ"};
 
    for (int i{1}; auto const& tuple : std::views::cartesian_product(x, y, z))
        print(tuple, i++);
}

Output:

(A 1 α) (A 1 β) (A 1 γ) (A 1 δ)
(A 2 α) (A 2 β) (A 2 γ) (A 2 δ)
(A 3 α) (A 3 β) (A 3 γ) (A 3 δ)
(B 1 α) (B 1 β) (B 1 γ) (B 1 δ)
(B 2 α) (B 2 β) (B 2 γ) (B 2 δ)
(B 3 α) (B 3 β) (B 3 γ) (B 3 δ)

• C++23 standard (ISO/IEC 14882:2024):

• 26.7.31 Cartesian product view [range.stride]

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4