Searched refs:unary_rules (Results 1 – 6 of 6) sorted by relevance
| /external/libtextclassifier/native/utils/grammar/utils/ |
| D | rules_test.cc | 50 EXPECT_THAT(frozen_rules.rules.front()->unary_rules, SizeIs(1)); in TEST()
76 EXPECT_THAT(frozen_rules.rules.front()->unary_rules, SizeIs(1)); in TEST()
167 EXPECT_THAT(frozen_rules.rules.front()->unary_rules, IsEmpty()); in TEST()
192 EXPECT_THAT(frozen_rules.rules.front()->unary_rules, IsEmpty()); in TEST()
216 EXPECT_THAT(frozen_rules.rules.front()->unary_rules, SizeIs(1)); in TEST()
|
| D | ir.cc | 139 const std::unordered_map<Nonterm, Ir::LhsSet>& unary_rules, in SerializeUnaryRulesShard() argument
141 for (const auto& it : unary_rules) { in SerializeUnaryRulesShard()
142 rules->unary_rules.push_back(RulesSet_::Rules_::UnaryRulesEntry( in SerializeUnaryRulesShard()
145 SortStructsForBinarySearchLookup(&rules->unary_rules); in SerializeUnaryRulesShard()
468 SerializeUnaryRulesShard(shards_[i].unary_rules, output, rules); in Serialize()
|
| D | ir.h | 94 std::unordered_map<Nonterm, LhsSet> unary_rules; member
152 return AddRule(lhs, rhs, &shards_[shard].unary_rules);
|
| D | ir_test.cc | 163 EXPECT_THAT(rules.rules.front()->unary_rules, SizeIs(1)); in TEST()
|
| /external/libtextclassifier/native/utils/grammar/parsing/ |
| D | matcher.cc | 181 if (!rules->unary_rules()) { in FindUnaryRulesMatches()
185 rules->unary_rules()->LookupByKey(nonterminal)) { in FindUnaryRulesMatches()
|
| /external/libtextclassifier/native/utils/grammar/ |
| D | rules.fbs | 79 unary_rules:[Rules_.UnaryRulesEntry];
182 // The `terminals`, `unary_rules` and `binary_rules` maps below represent
|