327 lines · cpp
1//===----------------------------------------------------------------------===//2//3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.4// See https://llvm.org/LICENSE.txt for license information.5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception6//7//===----------------------------------------------------------------------===//8 9// <algorithm>10 11// UNSUPPORTED: c++03, c++11, c++14, c++17, c++2012// ADDITIONAL_COMPILE_FLAGS(has-fconstexpr-steps): -fconstexpr-steps=200000013 14// template<forward_iterator I1, sentinel_for<I1> S1,15// forward_iterator I2, sentinel_for<I2> S2, class Proj = identity>16// requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2>17// constexpr bool ranges::contains_subrange(I1 first1, S1 last1, I2 first2, S2 last2,18// Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++2319 20// template<forward_range R1, forward_range R2,21// class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>22// requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>23// constexpr bool ranges::contains_subrange(R1&& r1, R2&& r2, Pred pred = {},24// Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++2325 26#include <algorithm>27#include <array>28#include <cassert>29#include <concepts>30#include <ranges>31#include <utility>32 33#include "almost_satisfies_types.h"34#include "test_iterators.h"35#include "type_algorithms.h"36 37struct NotEqualityComparable {};38 39template <class Iter1, class Sent1 = Iter1, class Iter2 = int*, class Sent2 = Iter2>40concept HasContainsSubrangeIt = requires(Iter1 first1, Sent1 last1, Iter2 first2, Sent2 last2) {41 std::ranges::contains_subrange(first1, last1, first2, last2);42};43 44static_assert(HasContainsSubrangeIt<int*>);45static_assert(!HasContainsSubrangeIt<ForwardIteratorNotDerivedFrom>);46static_assert(!HasContainsSubrangeIt<ForwardIteratorNotIncrementable>);47static_assert(!HasContainsSubrangeIt<int*, SentinelForNotSemiregular>);48static_assert(!HasContainsSubrangeIt<int*, int*, int**>); // not indirectly comparable49static_assert(!HasContainsSubrangeIt<int*, SentinelForNotWeaklyEqualityComparableWith>);50static_assert(!HasContainsSubrangeIt<int*, int*, ForwardIteratorNotDerivedFrom>);51static_assert(!HasContainsSubrangeIt<int*, int*, ForwardIteratorNotIncrementable>);52static_assert(!HasContainsSubrangeIt<int*, int*, int*, SentinelForNotSemiregular>);53static_assert(!HasContainsSubrangeIt<int*, int*, int*, SentinelForNotWeaklyEqualityComparableWith>);54 55template <class Range1, class Range2 = UncheckedRange<int*>>56concept HasContainsSubrangeR = requires(Range1&& range1, Range2&& range2) {57 std::ranges::contains_subrange(std::forward<Range1>(range1), std::forward<Range2>(range2));58};59 60static_assert(HasContainsSubrangeR<UncheckedRange<int*>>);61static_assert(!HasContainsSubrangeR<ForwardRangeNotDerivedFrom>);62static_assert(!HasContainsSubrangeR<ForwardIteratorNotIncrementable>);63static_assert(!HasContainsSubrangeR<ForwardRangeNotSentinelSemiregular>);64static_assert(!HasContainsSubrangeR<ForwardRangeNotSentinelEqualityComparableWith>);65static_assert(!HasContainsSubrangeR<UncheckedRange<int*>, UncheckedRange<int**>>); // not indirectly comparable66static_assert(!HasContainsSubrangeR<UncheckedRange<int*>, ForwardRangeNotDerivedFrom>);67static_assert(!HasContainsSubrangeR<UncheckedRange<int*>, ForwardRangeNotIncrementable>);68static_assert(!HasContainsSubrangeR<UncheckedRange<int*>, ForwardRangeNotSentinelSemiregular>);69static_assert(!HasContainsSubrangeR<UncheckedRange<int*>, ForwardRangeNotSentinelEqualityComparableWith>);70 71template <class Iter1, class Sent1 = Iter1, class Iter2, class Sent2 = Iter2>72constexpr void test_iterators() {73 { // simple tests74 int a[] = {1, 2, 3, 4, 5, 6};75 int p[] = {3, 4, 5};76 auto whole = std::ranges::subrange(Iter1(a), Sent1(Iter1(std::end(a))));77 auto subrange = std::ranges::subrange(Iter2(p), Sent2(Iter2(std::end(p))));78 {79 std::same_as<bool> decltype(auto) ret =80 std::ranges::contains_subrange(whole.begin(), whole.end(), subrange.begin(), subrange.end());81 assert(ret);82 }83 {84 std::same_as<bool> decltype(auto) ret = std::ranges::contains_subrange(whole, subrange);85 assert(ret);86 }87 }88 89 { // no match90 int a[] = {1, 2, 3, 4, 5, 6};91 int p[] = {3, 4, 2};92 auto whole = std::ranges::subrange(Iter1(a), Sent1(Iter1(std::end(a))));93 auto subrange = std::ranges::subrange(Iter2(p), Sent2(Iter2(std::end(p))));94 {95 bool ret = std::ranges::contains_subrange(whole.begin(), whole.end(), subrange.begin(), subrange.end());96 assert(!ret);97 }98 {99 bool ret = std::ranges::contains_subrange(whole, subrange);100 assert(!ret);101 }102 }103 104 { // range consists of just one element105 int a[] = {3};106 int p[] = {3, 4, 2};107 auto whole = std::ranges::subrange(Iter1(a), Sent1(Iter1(std::end(a))));108 auto subrange = std::ranges::subrange(Iter2(p), Sent2(Iter2(std::end(p))));109 {110 bool ret = std::ranges::contains_subrange(whole.begin(), whole.end(), subrange.begin(), subrange.end());111 assert(!ret);112 }113 {114 bool ret = std::ranges::contains_subrange(whole, subrange);115 assert(!ret);116 }117 }118 119 { // subrange consists of just one element120 int a[] = {23, 1, 20, 3, 54, 2};121 int p[] = {3};122 auto whole = std::ranges::subrange(Iter1(a), Sent1(Iter1(std::end(a))));123 auto subrange = std::ranges::subrange(Iter2(p), Sent2(Iter2(std::end(p))));124 {125 bool ret = std::ranges::contains_subrange(whole.begin(), whole.end(), subrange.begin(), subrange.end());126 assert(ret);127 }128 {129 bool ret = std::ranges::contains_subrange(whole, subrange);130 assert(ret);131 }132 }133 134 { // range has zero length135 std::array<int, 0> a = {};136 int p[] = {3, 4, 2};137 auto whole = std::ranges::subrange(Iter1(a.data()), Sent1(Iter1(a.data())));138 auto subrange = std::ranges::subrange(Iter2(p), Sent2(Iter2(std::end(p))));139 {140 bool ret = std::ranges::contains_subrange(whole.begin(), whole.end(), subrange.begin(), subrange.end());141 assert(!ret);142 }143 {144 bool ret = std::ranges::contains_subrange(whole, subrange);145 assert(!ret);146 }147 }148 149 { // subrange has zero length150 int a[] = {3, 4, 2};151 std::array<int, 0> p = {};152 auto whole = std::ranges::subrange(Iter1(a), Sent1(Iter1(std::end(a))));153 auto subrange = std::ranges::subrange(Iter2(p.data()), Sent2(Iter2(p.data())));154 {155 bool ret = std::ranges::contains_subrange(whole.begin(), whole.end(), subrange.begin(), subrange.end());156 assert(ret);157 }158 {159 bool ret = std::ranges::contains_subrange(whole, subrange);160 assert(ret);161 }162 }163 164 { // range and subrange both have zero length165 std::array<int, 0> a = {};166 std::array<int, 0> p = {};167 auto whole = std::ranges::subrange(Iter1(a.data()), Sent1(Iter1(a.data())));168 auto subrange = std::ranges::subrange(Iter2(p.data()), Sent2(Iter2(p.data())));169 {170 bool ret = std::ranges::contains_subrange(whole.begin(), whole.end(), subrange.begin(), subrange.end());171 assert(ret);172 }173 {174 bool ret = std::ranges::contains_subrange(whole, subrange);175 assert(ret);176 }177 }178 179 { // range and subrange are identical180 int a[] = {3, 4, 11, 32, 54, 2};181 int p[] = {3, 4, 11, 32, 54, 2};182 auto whole = std::ranges::subrange(Iter1(a), Sent1(Iter1(std::end(a))));183 auto subrange = std::ranges::subrange(Iter2(p), Sent2(Iter2(std::end(p))));184 {185 bool ret = std::ranges::contains_subrange(whole.begin(), whole.end(), subrange.begin(), subrange.end());186 assert(ret);187 }188 {189 bool ret = std::ranges::contains_subrange(whole, subrange);190 assert(ret);191 }192 }193 194 { // subrange is longer than range195 int a[] = {3, 4, 2};196 int p[] = {23, 3, 4, 2, 11, 32, 54, 2};197 auto whole = std::ranges::subrange(Iter1(a), Sent1(Iter1(std::end(a))));198 auto subrange = std::ranges::subrange(Iter2(p), Sent2(Iter2(std::end(p))));199 {200 bool ret = std::ranges::contains_subrange(whole.begin(), whole.end(), subrange.begin(), subrange.end());201 assert(!ret);202 }203 {204 bool ret = std::ranges::contains_subrange(whole, subrange);205 assert(!ret);206 }207 }208 209 { // subrange is the prefix210 int a[] = {3, 43, 5, 100, 433, 278, 6457, 900};211 int p[] = {3, 43, 5};212 auto whole = std::ranges::subrange(Iter1(a), Sent1(Iter1(std::end(a))));213 auto subrange = std::ranges::subrange(Iter2(p), Sent2(Iter2(std::end(p))));214 {215 bool ret = std::ranges::contains_subrange(whole.begin(), whole.end(), subrange.begin(), subrange.end());216 assert(ret);217 }218 {219 bool ret = std::ranges::contains_subrange(whole, subrange);220 assert(ret);221 }222 }223 224 { // subrange is the suffix225 int a[] = {3, 43, 5, 7, 68, 100, 433, 900};226 int p[] = {100, 433, 900};227 auto whole = std::ranges::subrange(Iter1(a), Sent1(Iter1(std::end(a))));228 auto subrange = std::ranges::subrange(Iter2(p), Sent2(Iter2(std::end(p))));229 {230 bool ret = std::ranges::contains_subrange(whole.begin(), whole.end(), subrange.begin(), subrange.end());231 assert(ret);232 }233 {234 bool ret = std::ranges::contains_subrange(whole, subrange);235 assert(ret);236 }237 }238 239 { // subrange is a subsequence240 int a[] = {23, 1, 0, 54, 2};241 int p[] = {1, 0, 2};242 auto whole = std::ranges::subrange(Iter1(a), Sent1(Iter1(std::end(a))));243 auto subrange = std::ranges::subrange(Iter2(p), Sent2(Iter2(std::end(p))));244 {245 bool ret = std::ranges::contains_subrange(whole.begin(), whole.end(), subrange.begin(), subrange.end());246 assert(!ret);247 }248 {249 bool ret = std::ranges::contains_subrange(whole, subrange);250 assert(!ret);251 }252 }253 254 { // repeated subrange255 int a[] = {23, 1, 0, 2, 54, 1, 0, 2, 23, 33};256 int p[] = {1, 0, 2};257 auto whole = std::ranges::subrange(Iter1(a), Sent1(Iter1(std::end(a))));258 auto subrange = std::ranges::subrange(Iter2(p), Sent2(Iter2(std::end(p))));259 {260 bool ret = std::ranges::contains_subrange(whole.begin(), whole.end(), subrange.begin(), subrange.end());261 assert(ret);262 }263 {264 bool ret = std::ranges::contains_subrange(whole, subrange);265 assert(ret);266 }267 }268 269 { // check that the predicate is used270 int a[] = {23, 81, 61, 0, 42, 25, 1, 2, 1, 29, 2};271 int p[] = {-1, -2, -1};272 auto pred = [](int l, int r) { return l * -1 == r; };273 auto whole = std::ranges::subrange(Iter1(a), Sent1(Iter1(std::end(a))));274 auto subrange = std::ranges::subrange(Iter2(p), Sent2(Iter2(std::end(p))));275 {276 bool ret = std::ranges::contains_subrange(whole.begin(), whole.end(), subrange.begin(), subrange.end(), pred);277 assert(ret);278 }279 {280 bool ret = std::ranges::contains_subrange(whole, subrange, pred);281 assert(ret);282 }283 }284 285 { // check that the projections are used286 int a[] = {1, 3, 15, 1, 2, 1, 8};287 int p[] = {2, 1, 2};288 auto whole = std::ranges::subrange(Iter1(a), Sent1(Iter1(std::end(a))));289 auto subrange = std::ranges::subrange(Iter2(p), Sent2(Iter2(std::end(p))));290 auto proj1 = [](int i) { return i - 3; };291 auto proj2 = [](int i) { return i * -1; };292 {293 bool ret = std::ranges::contains_subrange(294 whole.begin(), whole.end(), subrange.begin(), subrange.end(), {}, proj1, proj2);295 assert(ret);296 }297 {298 bool ret = std::ranges::contains_subrange(whole, subrange, {}, proj1, proj2);299 assert(ret);300 }301 }302}303 304constexpr bool test() {305 types::for_each(types::forward_iterator_list<int*>{}, []<class Iter1> {306 types::for_each(types::forward_iterator_list<int*>{}, []<class Iter2> {307 test_iterators<Iter1, Iter1, Iter2, Iter2>();308 test_iterators<Iter1, Iter1, Iter2, sized_sentinel<Iter2>>();309 test_iterators<Iter1, sized_sentinel<Iter1>, Iter2, Iter2>();310 test_iterators<Iter1, sized_sentinel<Iter1>, Iter2, sized_sentinel<Iter2>>();311 });312 });313 314 assert(std::ranges::contains_subrange(315 std::views::iota(0, 5), std::views::iota(0, 5) | std::views::filter([](int) { return true; })));316 assert(!std::ranges::contains_subrange(std::views::iota(0ULL, 42ULL), std::views::iota(0ULL, 1ULL << 32)));317 318 return true;319}320 321int main(int, char**) {322 test();323 static_assert(test());324 325 return 0;326}327