Searched refs:HasMatch (Results 1 – 11 of 11) sorted by relevance
| /external/libtextclassifier/native/utils/grammar/parsing/ |
| D | chart_test.cc | 98 EXPECT_TRUE(chart.HasMatch(0, CodepointSpan{0, 1})); in TEST_F()
99 EXPECT_FALSE(chart.HasMatch(0, CodepointSpan{0, 2})); in TEST_F()
100 EXPECT_TRUE(chart.HasMatch(1, CodepointSpan{0, 2})); in TEST_F()
101 EXPECT_TRUE(chart.HasMatch(2, CodepointSpan{0, 2})); in TEST_F()
102 EXPECT_FALSE(chart.HasMatch(0, CodepointSpan{0, 2})); in TEST_F()
|
| D | chart.h | 58 bool HasMatch(const Nonterm nonterm, const CodepointSpan& span) const;
93 bool Chart<NumBuckets>::HasMatch(const Nonterm nonterm, in HasMatch() function
|
| D | matcher.cc | 453 if (!chart_.HasMatch(item->exclusion_nonterm, item->codepoint_span)) { in ProcessPendingExclusionMatches()
|
| /external/llvm/utils/TableGen/ |
| D | CodeGenSchedule.cpp | 873 bool HasMatch = false; in inferFromItinClass() local
879 if (HasMatch) in inferFromItinClass()
883 HasMatch = true; in inferFromItinClass()
1606 bool HasMatch = false; in collectItinProcResources() local
1612 if (HasMatch) in collectItinProcResources()
1616 HasMatch = true; in collectItinProcResources()
|
| /external/llvm-project/llvm/utils/TableGen/ |
| D | CodeGenSchedule.cpp | 1248 bool HasMatch = false; in inferFromItinClass() local
1253 if (HasMatch) in inferFromItinClass()
1257 HasMatch = true; in inferFromItinClass()
2045 bool HasMatch = false; in collectItinProcResources() local
2051 if (HasMatch) in collectItinProcResources()
2055 HasMatch = true; in collectItinProcResources()
|
| /external/angle/third_party/abseil-cpp/absl/container/internal/ |
| D | btree.h | 446 static constexpr bool HasMatch() { return true; }
461 static constexpr bool HasMatch() { return false; }
1946 const bool equal = res.HasMatch()
1992 if (res.HasMatch()) {
2596 if (res.HasMatch()) {
|
| /external/openscreen/third_party/abseil/src/absl/container/internal/ |
| D | btree.h | 417 static constexpr bool HasMatch() { return true; }
432 static constexpr bool HasMatch() { return false; }
1899 if (res.HasMatch() ? !res.IsEq()
1941 if (res.HasMatch()) {
2542 if (res.HasMatch()) {
|
| /external/libtextclassifier/abseil-cpp/absl/container/internal/ |
| D | btree.h | 385 static constexpr bool HasMatch() { return true; }
396 static constexpr bool HasMatch() { return false; }
1940 if (res.HasMatch()) {
2579 if (res.HasMatch()) {
|
| /external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/container/internal/ |
| D | btree.h | 385 static constexpr bool HasMatch() { return true; }
396 static constexpr bool HasMatch() { return false; }
1940 if (res.HasMatch()) {
2579 if (res.HasMatch()) {
|
| /external/webrtc/third_party/abseil-cpp/absl/container/internal/ |
| D | btree.h | 346 static constexpr bool HasMatch() { return true; }
357 static constexpr bool HasMatch() { return false; }
1887 if (res.HasMatch()) {
2557 if (res.HasMatch()) {
|
| /external/abseil-cpp/absl/container/internal/ |
| D | btree.h | 346 static constexpr bool HasMatch() { return true; }
357 static constexpr bool HasMatch() { return false; }
1887 if (res.HasMatch()) {
2557 if (res.HasMatch()) {
|