@@ -356,23 +356,23 @@ template <bool checkp, IteratorConcept ... P, int ... I>
356356struct Match <checkp, std::tuple<P ...>, mp::int_list<I ...>>
357357{
358358 std::tuple<P ...> t;
359- constexpr static rank_t rs = [] { rank_t r=BAD; return ((r=choose_rank (ra:: rank_s<P>(), r)), ...); }();
359+ constexpr static rank_t rs = [] { rank_t r=BAD; return ((r=choose_rank (rank_s<P>(), r)), ...); }();
360360
361361// 0: fail, 1: rt, 2: pass
362362 consteval static int
363363 check_s ()
364364 {
365- if constexpr (sizeof ...(P)<2 || sizeof ...(P)==1 +(bool (0 ==ra:: rank_s<P>()) + ...)) {
365+ if constexpr (sizeof ...(P)<2 || sizeof ...(P)==1 +(bool (0 ==rank_s<P>()) + ...)) {
366366 return 2 ;
367367 } else if constexpr (ANY!=rs) {
368368 bool tbc = false ;
369369 for (int k=0 ; k<rs; ++k) {
370370 dim_t ls = len_s (k);
371- if (((k<ra:: rank_s<P>() && ls!=choose_len (std::decay_t <P>::len_s (k), ls)) || ...)) {
371+ if (((k<rank_s<P>() && ls!=choose_len (std::decay_t <P>::len_s (k), ls)) || ...)) {
372372 return 0 ;
373373 }
374- int anyk = ((k<ra:: rank_s<P>() && (ANY==std::decay_t <P>::len_s (k))) + ...);
375- int fixk = ((k<ra:: rank_s<P>() && (0 <=std::decay_t <P>::len_s (k))) + ...);
374+ int anyk = ((k<rank_s<P>() && (ANY==std::decay_t <P>::len_s (k))) + ...);
375+ int fixk = ((k<rank_s<P>() && (0 <=std::decay_t <P>::len_s (k))) + ...);
376376 tbc = tbc || (anyk>0 && anyk+fixk>1 );
377377 }
378378 return tbc ? 1 : 2 ;
@@ -423,7 +423,7 @@ struct Match<checkp, std::tuple<P ...>, mp::int_list<I ...>>
423423 len_s (int k)
424424 {
425425 auto f = [&k]<class A >(dim_t s) {
426- constexpr rank_t ar = ra:: rank_s<A>();
426+ constexpr rank_t ar = rank_s<A>();
427427 return (ar<0 || k<ar) ? choose_len (A::len_s (k), s) : s;
428428 };
429429 dim_t s = BAD; (void )(((s = f.template operator ()<std::decay_t <P>>(s)) < 0 ) && ...);
0 commit comments