std::ranges:: find, std::ranges:: find_if, std::ranges:: find_if_not

#include <algorithm>
#include <cassert>
#include <complex>
#include <format>
#include <iostream>
#include <iterator>
#include <string>
#include <vector>
void projector_example()
{
    struct folk_info
    {
        unsigned uid;
        std::string name, position;
    };
    std::vector<folk_info> folks
    {
        {0, "Ana", "dev"},
        {1, "Bob", "devops"},
        {2, "Eve", "ops"}
    };
    const auto who{"Eve"};
    if (auto it = std::ranges::find(folks, who, &folk_info::name); it != folks.end())
        std::cout << std::format("Perfil:\n"
                                 "    UID: {}\n"
                                 "    Nombre: {}\n"
                                 "    Posición: {}\n\n",
                                 it->uid, it->name, it->position);
}
int main()
{
    namespace ranges = std::ranges;
    projector_example();
    const int n1 = 3;
    const int n2 = 5;
    const auto v = {4, 1, 3, 2};
    if (ranges::find(v, n1) != v.end())
        std::cout << "v contiene: " << n1 << '\n';
    else
        std::cout << "v no contiene: " << n1 << '\n';
    if (ranges::find(v.begin(), v.end(), n2) != v.end())
        std::cout << "v contiene: " << n2 << '\n';
    else
        std::cout << "v no contiene: " << n2 << '\n';
    auto is_even = [](int x) { return x % 2 == 0; };
    if (auto result = ranges::find_if(v.begin(), v.end(), is_even); result != v.end())
        std::cout << "Primer elemento par en v: " << *result << '\n';
    else
        std::cout << "No hay elementos pares en v\n";
    if (auto result = ranges::find_if_not(v, is_even); result != v.end())
        std::cout << "Primer elemento impar en v: " << *result << '\n';
    else
        std::cout << "No hay elementos impares en v\n";
    auto divides_13 = [](int x) { return x % 13 == 0; };
    if (auto result = ranges::find_if(v, divides_13); result != v.end())
        std::cout << "Primer elemento divisible por 13 en v: " << *result << '\n';
    else
        std::cout << "Ningún elemento en v es divisible por 13\n";
    if (auto result = ranges::find_if_not(v.begin(), v.end(), divides_13);
        result != v.end())
        std::cout << "Primer elemento no divisible por 13 en v: " << *result << '\n';
    else
        std::cout << "Todos los elementos en v son divisibles por 13\n";
    std::vector<std::complex<double>> nums{{4, 2}};
    #ifdef __cpp_lib_algorithm_default_value_type
        // T se deduce en (2) haciendo posible la inicialización de lista
        const auto it = ranges::find(nums, {4, 2});
    #else
        const auto it = ranges::find(nums, std::complex<double>{4, 2});
    #endif
    assert(it == nums.begin());
}