Home
last modified time | relevance | path

Searched full:m (Results 1 – 25 of 9221) sorted by relevance

12345678910>>...369

/llvm-project/libcxx/test/std/re/re.alg/re.alg.search/
H A Decma.pass.cpp15 // match_results<BidirectionalIterator, Allocator>& m,
27 std::cmatch m; in main() local
29 assert(std::regex_search(s, m, std::regex("a"))); in main()
30 assert(m.size() == 1); in main()
31 assert(!m.empty()); in main()
32 assert(!m.prefix().matched); in main()
33 assert(m.prefix().first == s); in main()
34 assert(m.prefix().second == m[0].first); in main()
35 assert(!m.suffix().matched); in main()
36 assert(m.suffix().first == m[0].second); in main()
[all …]
H A Dextended.pass.cpp15 // match_results<BidirectionalIterator, Allocator>& m,
27 std::cmatch m; in main() local
29 assert(std::regex_search(s, m, std::regex("a", std::regex_constants::extended))); in main()
30 assert(m.size() == 1); in main()
31 assert(!m.empty()); in main()
32 assert(!m.prefix().matched); in main()
33 assert(m.prefix().first == s); in main()
34 assert(m.prefix().second == m[0].first); in main()
35 assert(!m.suffix().matched); in main()
36 assert(m.suffix().first == m[0].second); in main()
[all …]
H A Dawk.pass.cpp15 // match_results<BidirectionalIterator, Allocator>& m,
27 std::cmatch m; in main() local
29 assert(std::regex_search(s, m, std::regex("a", std::regex_constants::awk))); in main()
30 assert(m.size() == 1); in main()
31 assert(!m.empty()); in main()
32 assert(!m.prefix().matched); in main()
33 assert(m.prefix().first == s); in main()
34 assert(m.prefix().second == m[0].first); in main()
35 assert(!m.suffix().matched); in main()
36 assert(m.suffix().first == m[0].second); in main()
[all …]
H A Dbasic.pass.cpp15 // match_results<BidirectionalIterator, Allocator>& m,
27 std::cmatch m; in main() local
28 assert(!std::regex_search("a", m, std::regex())); in main()
29 assert(m.size() == 0); in main()
30 assert(m.empty()); in main()
33 std::cmatch m; in main() local
35 assert(std::regex_search(s, m, std::regex("a", std::regex_constants::basic))); in main()
36 assert(m.size() == 1); in main()
37 assert(!m.empty()); in main()
38 assert(!m.prefix().matched); in main()
[all …]
/llvm-project/libcxx/test/std/re/re.alg/re.alg.match/
H A Dbasic.pass.cpp15 // match_results<BidirectionalIterator, Allocator>& m,
27 std::cmatch m; in main() local
28 assert(!std::regex_match("a", m, std::regex())); in main()
29 assert(m.size() == 0); in main()
30 assert(m.empty()); in main()
33 std::cmatch m; in main() local
35 assert(std::regex_match(s, m, std::regex("a", std::regex_constants::basic))); in main()
36 assert(m.size() == 1); in main()
37 assert(!m.empty()); in main()
38 assert(!m.prefix().matched); in main()
[all …]
H A Decma.pass.cpp15 // match_results<BidirectionalIterator, Allocator>& m,
27 std::cmatch m; in main() local
29 assert(std::regex_match(s, m, std::regex("a"))); in main()
30 assert(m.size() == 1); in main()
31 assert(!m.empty()); in main()
32 assert(!m.prefix().matched); in main()
33 assert(m.prefix().first == s); in main()
34 assert(m.prefix().second == m[0].first); in main()
35 assert(!m.suffix().matched); in main()
36 assert(m.suffix().first == m[0].second); in main()
[all …]
H A Dextended.pass.cpp14 // match_results<BidirectionalIterator, Allocator>& m,
26 std::cmatch m; in main() local
28 assert(std::regex_match(s, m, std::regex("a", std::regex_constants::extended))); in main()
29 assert(m.size() == 1); in main()
30 assert(!m.empty()); in main()
31 assert(!m.prefix().matched); in main()
32 assert(m.prefix().first == s); in main()
33 assert(m.prefix().second == m[0].first); in main()
34 assert(!m.suffix().matched); in main()
35 assert(m.suffix().first == m[0].second); in main()
[all …]
H A Dawk.pass.cpp14 // match_results<BidirectionalIterator, Allocator>& m,
27 std::cmatch m; in main() local
29 assert(std::regex_match(s, m, std::regex("a", std::regex_constants::awk))); in main()
30 assert(m.size() == 1); in main()
31 assert(!m.empty()); in main()
32 assert(!m.prefix().matched); in main()
33 assert(m.prefix().first == s); in main()
34 assert(m.prefix().second == m[0].first); in main()
35 assert(!m.suffix().matched); in main()
36 assert(m.suffix().first == m[0].second); in main()
[all …]
/llvm-project/llvm/test/CodeGen/ARM/
H A Dcmse-clear-float.ll3 ; RUN: FileCheck %s --check-prefix=CHECK-8M --check-prefix=CHECK-8M-LE
5 ; RUN: FileCheck %s --check-prefix=CHECK-8M --check-prefix=CHECK-8M-BE
7 ; RUN: llc %s -o - -mtriple=thumbv8.1m.main -mattr=+fp-armv8d16sp,+dsp | \
8 ; RUN: FileCheck %s --check-prefix=CHECK-81M --check-prefix=CHECK-81M-LE
9 ; RUN: llc %s -o - -mtriple=thumbebv8.1m.main -mattr=+fp-armv8d16sp,+dsp | \
10 ; RUN: FileCheck %s --check-prefix=CHECK-81M --check-prefix=CHECK-81M-BE
11 ; RUN: llc %s -o - -mtriple=thumbv8.1m.main -mattr=+mve | \
12 ; RUN: FileCheck %s --check-prefix=CHECK-81M --check-prefix=CHECK-81M-LE
13 ; RUN: llc %s -o - -mtriple=thumbebv8.1m.main -mattr=+mve | \
14 ; RUN: FileCheck %s --check-prefix=CHECK-81M --check-prefix=CHECK-81M-BE
[all …]
H A Dcmse-clear-float-hard.ll3 ; RUN: FileCheck %s --check-prefix=CHECK-8M --check-prefix=CHECK-8M-LE
5 ; RUN: FileCheck %s --check-prefix=CHECK-8M --check-prefix=CHECK-8M-BE
6 ; RUN: llc %s -o - -mtriple=thumbv8.1m.main -mattr=+fp-armv8d16sp,+dsp -float-abi=hard | \
7 ; RUN: FileCheck %s --check-prefix=CHECK-81M --check-prefix=CHECK-NO-MVE --check-prefix=CHECK-81M-LE
8 ; RUN: llc %s -o - -mtriple=thumbebv8.1m.main -mattr=+fp-armv8d16sp,+dsp -float-abi=hard | \
9 ; RUN: FileCheck %s --check-prefix=CHECK-81M --check-prefix=CHECK-NO-MVE --check-prefix=CHECK-81M
[all...]
H A Dcmse-clear.ll7 ; RUN: FileCheck %s --check-prefix=CHECK-8M-SOFT
9 ; RUN: FileCheck %s --check-prefix=CHECK-8M-SOFT
11 ; RUN: FileCheck %s --check-prefix=CHECK-8M-SOFTFP
13 ; RUN: FileCheck %s --check-prefix=CHECK-8M-SOFTFP
14 ; RUN: llc %s -o - -mtriple=thumbv8.1m.main -mattr=-fpregs,+dsp | \
15 ; RUN: FileCheck %s --check-prefix=CHECK-81M-SOFT
16 ; RUN: llc %s -o - -mtriple=thumbebv8.1m.main -mattr=-fpregs,+dsp | \
17 ; RUN: FileCheck %s --check-prefix=CHECK-81M-SOFT
18 ; RUN: llc %s -o - -mtriple=thumbv8.1m.main -mattr=+fp-armv8d16sp,+dsp | \
19 ; RUN: FileCheck %s --check-prefix=CHECK-81M-SOFTFP
[all …]
/llvm-project/libcxx/test/std/containers/associative/map/map.ops/
H A Dlower_bound.pass.cpp28 typedef std::map<int, double> M; in main() typedef
30 typedef M::iterator R; in main()
42 M m(ar, ar+sizeof(ar)/sizeof(ar[0])); in main() local
43 R r = m.lower_bound(5); in main()
44 assert(r == m.begin()); in main()
45 r = m.lower_bound(7); in main()
46 assert(r == std::next(m.begin())); in main()
47 r = m.lower_bound(9); in main()
48 assert(r == std::next(m.begin(), 2)); in main()
49 r = m.lower_bound(11); in main()
[all …]
H A Dequal_range.pass.cpp28 typedef std::map<int, double> M; in main() typedef
30 typedef std::pair<M::iterator, M::iterator> R; in main()
42 M m(ar, ar+sizeof(ar)/sizeof(ar[0])); in main() local
43 R r = m.equal_range(5); in main()
44 assert(r.first == std::next(m.begin(), 0)); in main()
45 assert(r.second == std::next(m.begin(), 1)); in main()
46 r = m.equal_range(7); in main()
47 assert(r.first == std::next(m.begin(), 1)); in main()
48 assert(r.second == std::next(m.begin(), 2)); in main()
49 r = m.equal_range(9); in main()
[all …]
H A Dupper_bound.pass.cpp27 typedef std::map<int, double> M; in main() typedef
29 typedef M::iterator R; in main()
41 M m(ar, ar+sizeof(ar)/sizeof(ar[0])); in main() local
42 R r = m.upper_bound(5); in main()
43 assert(r == std::next(m.begin(), 1)); in main()
44 r = m.upper_bound(7); in main()
45 assert(r == std::next(m.begin(), 2)); in main()
46 r = m.upper_bound(9); in main()
47 assert(r == std::next(m.begin(), 3)); in main()
48 r = m.upper_bound(11); in main()
[all …]
H A Dfind.pass.cpp28 typedef std::map<int, double> M; in main() typedef
30 typedef M::iterator R; in main()
42 M m(ar, ar+sizeof(ar)/sizeof(ar[0])); in main() local
43 R r = m.find(5); in main()
44 assert(r == m.begin()); in main()
45 r = m.find(6); in main()
46 assert(r == std::next(m.begin())); in main()
47 r = m.find(7); in main()
48 assert(r == std::next(m.begin(), 2)); in main()
49 r = m.find(8); in main()
[all …]
/llvm-project/libcxx/test/std/containers/associative/set/
H A Dlower_bound.pass.cpp27 typedef std::set<int> M; in main() typedef
29 typedef M::iterator R; in main()
41 M m(ar, ar+sizeof(ar)/sizeof(ar[0])); in main() local
42 R r = m.lower_bound(5); in main()
43 assert(r == m.begin()); in main()
44 r = m.lower_bound(7); in main()
45 assert(r == std::next(m.begin())); in main()
46 r = m.lower_bound(9); in main()
47 assert(r == std::next(m.begin(), 2)); in main()
48 r = m.lower_bound(11); in main()
[all …]
H A Dupper_bound.pass.cpp27 typedef std::set<int> M; in main() typedef
29 typedef M::iterator R; in main()
41 M m(ar, ar+sizeof(ar)/sizeof(ar[0])); in main() local
42 R r = m.upper_bound(5); in main()
43 assert(r == std::next(m.begin(), 1)); in main()
44 r = m.upper_bound(7); in main()
45 assert(r == std::next(m.begin(), 2)); in main()
46 r = m.upper_bound(9); in main()
47 assert(r == std::next(m.begin(), 3)); in main()
48 r = m.upper_bound(11); in main()
[all …]
H A Dequal_range.pass.cpp27 typedef std::set<int> M; in main() typedef
29 typedef std::pair<M::iterator, M::iterator> R; in main()
41 M m(ar, ar+sizeof(ar)/sizeof(ar[0])); in main() local
42 R r = m.equal_range(5); in main()
43 assert(r.first == std::next(m.begin(), 0)); in main()
44 assert(r.second == std::next(m.begin(), 1)); in main()
45 r = m.equal_range(7); in main()
46 assert(r.first == std::next(m.begin(), 1)); in main()
47 assert(r.second == std::next(m.begin(), 2)); in main()
48 r = m.equal_range(9); in main()
[all …]
H A Dfind.pass.cpp27 typedef std::set<int> M; in main() typedef
29 typedef M::iterator R; in main()
41 M m(ar, ar+sizeof(ar)/sizeof(ar[0])); in main() local
42 R r = m.find(5); in main()
43 assert(r == m.begin()); in main()
44 r = m.find(6); in main()
45 assert(r == std::next(m.begin())); in main()
46 r = m.find(7); in main()
47 assert(r == std::next(m.begin(), 2)); in main()
48 r = m.find(8); in main()
[all …]
/llvm-project/polly/lib/External/isl/test_inputs/codegen/cloog/
H A Dclassen.c1 if (m >= 1) {
3 if (m >= 2) {
9 for (int c0 = 1; c0 < 2 * m - 1; c0 += 1) {
10 if (2 * m >= c0 + 3) {
11 if (c0 + 1 == m) {
12 S5(m - 2, 1, m - 1, 1, m - 1, 1, m, 1);
13 S1(m - 1, 1, m, 1);
14 S3(m - 1, 1, m, 2, m, 1, m, 2);
15 } else if (c0 >= m) {
16 S5(c0 - 1, -m + c0 + 2, c0, -m + c0 + 2, m - 1, -m + c0 + 2, m, -m + c0 + 2);
[all …]
/llvm-project/clang-tools-extra/test/clang-tidy/checkers/modernize/
H A Dpass-by-value.cpp25 A(const Movable &M) : M(M) {} in A()
27 // CHECK-FIXES: A(Movable M) : M(std::move(M)) {}
28 Movable M; member
34 B(const Movable &M) : M(GlobalObj) {} in B()
35 // CHECK-FIXES: B(const Movable &M) : M(GlobalObj) {}
36 Movable M; member
42 C(const Movable &M) : M(M) { this->i = M.a; } in C()
43 // CHECK-FIXES: C(const Movable &M) : M(M) { this->i = M.a; }
46 C(const Movable &M, int) : M(M), i(M.a) {} in C()
47 // CHECK-FIXES: C(const Movable &M, int) : M(M), i(M.a) {}
[all …]
/llvm-project/flang/test/Semantics/
H A Dsymbol15.f904 !DEF: /m Module
5 module m module
8 !DEF: /m/iface ABSTRACT, PUBLIC (Subroutine) Subprogram
12 !DEF: /m/op1 POINTER, PUBLIC ObjectEntity REAL(4)
14 !DEF: /m/op2 POINTER, PUBLIC ObjectEntity REAL(4)
15 !DEF: /m/null INTRINSIC, PUBLIC, PURE (Function) ProcEntity
17 !DEF: /m/op3 POINTER, PUBLIC ObjectEntity REAL(4)
18 !DEF: /m/x PUBLIC, TARGET ObjectEntity REAL(4)
20 !DEF: /m/op4 POINTER, PUBLIC ObjectEntity REAL(4)
21 !DEF: /m/y PUBLIC, TARGET ObjectEntity REAL(4)
[all …]
/llvm-project/libcxx/test/std/containers/associative/multiset/
H A Dfind.pass.cpp27 typedef std::multiset<int> M; in main() typedef
29 typedef M::iterator R; in main()
41 M m(ar, ar+sizeof(ar)/sizeof(ar[0])); in main() local
42 R r = m.find(5); in main()
43 assert(r == m.begin()); in main()
44 r = m.find(6); in main()
45 assert(r == std::next(m.begin())); in main()
46 r = m.find(7); in main()
47 assert(r == std::next(m.begin(), 2)); in main()
48 r = m.find(8); in main()
[all …]
/llvm-project/libcxx/test/std/containers/associative/multimap/multimap.ops/
H A Dequal_range.pass.cpp28 typedef std::multimap<int, double> M; in main() typedef
30 typedef std::pair<M::iterator, M::iterator> R; in main()
43 M m(ar, ar+sizeof(ar)/sizeof(ar[0])); in main() local
44 R r = m.equal_range(4); in main()
45 assert(r.first == m.begin()); in main()
46 assert(r.second == m.begin()); in main()
47 r = m.equal_range(5); in main()
48 assert(r.first == m.begin()); in main()
49 assert(r.second == std::next(m.begin(), 3)); in main()
50 r = m.equal_range(6); in main()
[all …]
/llvm-project/libcxx/test/std/containers/associative/map/map.modifiers/
H A Derase_iter.pass.cpp32 typedef std::map<int, double> M; in main() typedef
34 typedef M::iterator I; in main()
46 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); in main() local
47 assert(m.size() == 8); in main()
48 I i = m.erase(std::next(m.cbegin(), 3)); in main()
49 assert(m.size() == 7); in main()
50 assert(i == std::next(m.begin(), 3)); in main()
51 assert(m.begin()->first == 1); in main()
52 assert(m.begin()->second == 1.5); in main()
53 assert(std::next(m.begin())->first == 2); in main()
[all …]

12345678910>>...369