adds task 11.10

Author: c71n93

CMakeLists.txt

@@ -62,7 +62,7 @@ include_directories(shared)
 
 
 ##### subdirectories #####
-set(DIRS week-W week-2 week-3 week-4 week-5 week-6 week-7 week-8 week-9 week-10 week-11)
+set(DIRS week-W week-2 week-3 week-4 week-5 week-6 week-7 week-8 week-9 week-10 week-11 week-13)
 foreach(DIR ${DIRS})
     add_subdirectory(${DIR})
 endforeach()

week-13/CMakeLists.txt

@@ -0,0 +1,4 @@
+set(DIRS task-11-10)
+foreach(DIR ${DIRS})
+    add_subdirectory(${DIR})
+endforeach()

week-13/task-11-10/CMakeLists.txt

@@ -0,0 +1,3 @@
+include_directories(include)
+
+add_subdirectory(test)

week-13/task-11-10/include/smth_of.hpp

@@ -0,0 +1,30 @@
+#pragma once
+#include <ranges>
+
+namespace my_algorithm {
+
+template <std::ranges::range Range, typename T>
+    requires std::convertible_to<T, typename Range::value_type>
+bool has_one(const Range& range, T&& value) {
+    return std::ranges::find(range, std::forward<T>(value)) != range.end();
+}
+
+template <std::ranges::range Range, typename... Args>
+    requires(std::convertible_to<Args, typename Range::size_type> && ...)
+bool any_of(const Range& range, Args&&... args) {
+    return (has_one(range, std::forward<Args>(args)) || ...);
+}
+
+template <std::ranges::range Range, typename... Args>
+    requires(std::convertible_to<Args, typename Range::size_type> && ...)
+bool all_of(const Range& range, Args&&... args) {
+    return (has_one(range, std::forward<Args>(args)) && ...);
+}
+
+template <std::ranges::range Range, typename... Args>
+    requires(std::convertible_to<Args, typename Range::size_type> && ...)
+bool none_of(const Range& range, Args&&... args) {
+    return (!has_one(range, std::forward<Args>(args)) && ...);
+}
+
+}  // namespace my_algorithm

week-13/task-11-10/test/CMakeLists.txt

@@ -0,0 +1 @@
+cpp_test(test-11-10.cpp)

week-13/task-11-10/test/test-11-10.cpp

@@ -0,0 +1,68 @@
+#include <gtest/gtest.h>
+
+#include <list>
+
+#include "smth_of.hpp"
+
+using my_algorithm::all_of;
+using my_algorithm::any_of;
+using my_algorithm::has_one;
+using my_algorithm::none_of;
+
+TEST(HasOne, Array) {
+    const std::array<std::string, 5> a{"one", "two", "three", "four", "five"};
+    EXPECT_TRUE(has_one(a, "two"));
+    EXPECT_FALSE(has_one(a, "six"));
+}
+
+TEST(AnyOfAllOfNoneOf, Vector) {
+    const std::vector<int> vec = {1, 2, 3, 4, 5};  // NOLINT
+
+    EXPECT_TRUE(any_of(vec, 2, 6));
+    EXPECT_FALSE(any_of(vec, 6, 7));
+
+    EXPECT_TRUE(all_of(vec, 1, 2, 3));
+    EXPECT_FALSE(all_of(vec, 1, 2, 6));
+
+    EXPECT_TRUE(none_of(vec, 6, 7, 8));
+    EXPECT_FALSE(none_of(vec, 1, 6, 7));
+}
+
+TEST(AnyOfAllOfNoneOf, Set) {
+    const std::set<int> s = {10, 20, 30, 40};  // NOLINT
+
+    EXPECT_TRUE(any_of(s, 20, 50));
+    EXPECT_FALSE(any_of(s, 50, 60));
+
+    EXPECT_TRUE(all_of(s, 10, 20));
+    EXPECT_FALSE(all_of(s, 10, 50));
+
+    EXPECT_TRUE(none_of(s, 50, 60));
+    EXPECT_FALSE(none_of(s, 20, 60));
+}
+
+TEST(AnyOfAllOfNoneOf, List) {
+    const std::list<int> lst = {5, 10, 15, 20};  // NOLINT
+
+    EXPECT_TRUE(any_of(lst, 10, 25));
+    EXPECT_FALSE(any_of(lst, 30, 35));
+
+    EXPECT_TRUE(all_of(lst, 5, 10));
+    EXPECT_FALSE(all_of(lst, 5, 30));
+
+    EXPECT_TRUE(none_of(lst, 25, 30));
+    EXPECT_FALSE(none_of(lst, 10, 30));
+}
+
+TEST(AnyOfAllOfNoneOf, String) {
+    const std::string str = "hello";  // NOLINT
+
+    EXPECT_TRUE(any_of(str, 'h', 'x'));
+    EXPECT_FALSE(any_of(str, 'x', 'y'));
+
+    EXPECT_TRUE(all_of(str, 'h', 'e'));
+    EXPECT_FALSE(all_of(str, 'h', 'z'));
+
+    EXPECT_TRUE(none_of(str, 'x', 'y'));
+    EXPECT_FALSE(none_of(str, 'h', 'y'));
+}