Home
last modified time | relevance | path

Searched refs:HasMatch (Results 1 – 12 of 12) sorted by relevance

/external/libtextclassifier/native/utils/grammar/parsing/
Dchart_test.cc98 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()
Dchart.h58 bool HasMatch(const Nonterm nonterm, const CodepointSpan& span) const;
93 bool Chart<NumBuckets>::HasMatch(const Nonterm nonterm, in HasMatch() function
Dmatcher.cc453 if (!chart_.HasMatch(item->exclusion_nonterm, item->codepoint_span)) { in ProcessPendingExclusionMatches()
/external/llvm/utils/TableGen/
DCodeGenSchedule.cpp873 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/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/container/internal/
Dbtree.h428 static constexpr bool HasMatch() { return true; }
443 static constexpr bool HasMatch() { return false; }
1925 const bool equal = res.HasMatch()
1971 if (res.HasMatch()) {
2575 if (res.HasMatch()) {
/external/openscreen/third_party/abseil/src/absl/container/internal/
Dbtree.h417 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/tensorflow/third_party/absl/abseil-cpp/absl/container/internal/
Dbtree.h491 static constexpr bool HasMatch() { return true; }
506 static constexpr bool HasMatch() { return false; }
2097 const bool equal = res.HasMatch()
2143 if (res.HasMatch()) {
2765 if (res.HasMatch()) {
/external/webrtc/third_party/abseil-cpp/absl/container/internal/
Dbtree.h468 static constexpr bool HasMatch() { return true; }
483 static constexpr bool HasMatch() { return false; }
2169 const bool equal = res.HasMatch()
2215 if (res.HasMatch()) {
2850 if (res.HasMatch()) {
/external/cronet/third_party/abseil-cpp/absl/container/internal/
Dbtree.h468 static constexpr bool HasMatch() { return true; }
483 static constexpr bool HasMatch() { return false; }
2244 const bool equal = res.HasMatch()
2290 if (res.HasMatch()) {
2932 if (res.HasMatch()) {
/external/abseil-cpp/absl/container/internal/
Dbtree.h491 static constexpr bool HasMatch() { return true; }
506 static constexpr bool HasMatch() { return false; }
2097 const bool equal = res.HasMatch()
2143 if (res.HasMatch()) {
2765 if (res.HasMatch()) {
/external/angle/third_party/abseil-cpp/absl/container/internal/
Dbtree.h468 static constexpr bool HasMatch() { return true; }
483 static constexpr bool HasMatch() { return false; }
2250 const bool equal = res.HasMatch()
2296 if (res.HasMatch()) {
2969 if (res.HasMatch()) {
/external/libtextclassifier/abseil-cpp/absl/container/internal/
Dbtree.h385 static constexpr bool HasMatch() { return true; }
396 static constexpr bool HasMatch() { return false; }
1940 if (res.HasMatch()) {
2579 if (res.HasMatch()) {