Searched refs:binary_rules (Results 1 – 6 of 6) sorted by relevance
| /external/libtextclassifier/native/utils/grammar/utils/ |
| D | rules_test.cc | 49 EXPECT_THAT(frozen_rules.rules.front()->binary_rules, SizeIs(3)); in TEST()
75 EXPECT_THAT(frozen_rules.rules.front()->binary_rules, SizeIs(3)); in TEST()
164 EXPECT_THAT(frozen_rules.rules.front()->binary_rules, SizeIs(1)); in TEST()
190 EXPECT_THAT(frozen_rules.rules.front()->binary_rules, SizeIs(3)); in TEST()
214 EXPECT_THAT(frozen_rules.rules.front()->binary_rules, SizeIs(4)); in TEST()
|
| D | ir.cc | 151 binary_rules, in SerializeBinaryRulesShard() argument
153 const size_t num_buckets = std::min(binary_rules.size(), kMaxHashTableSize); in SerializeBinaryRulesShard()
155 rules->binary_rules.emplace_back( in SerializeBinaryRulesShard()
161 for (const auto& it : binary_rules) { in SerializeBinaryRulesShard()
166 rules->binary_rules[bucket_index]->rules.push_back( in SerializeBinaryRulesShard()
470 SerializeBinaryRulesShard(shards_[i].binary_rules, output, rules); in Serialize()
|
| D | ir_test.cc | 160 EXPECT_THAT(rules.rules.front()->binary_rules, SizeIs(3)); in TEST()
219 EXPECT_THAT(rules.rules[0]->binary_rules, SizeIs(3)); in TEST()
220 EXPECT_THAT(rules.rules[1]->binary_rules, SizeIs(3)); in TEST()
|
| D | ir.h | 97 std::unordered_map<TwoNonterms, LhsSet, BinaryRuleHasher> binary_rules; member
160 return AddRule(lhs, {rhs_1, rhs_2}, &shards_[shard].binary_rules);
|
| /external/libtextclassifier/native/utils/grammar/parsing/ |
| D | matcher.cc | 195 if (!rules->binary_rules()) { in FindBinaryRulesMatches()
201 BinaryRuleHasher()(nonterminals) % rules->binary_rules()->size(); in FindBinaryRulesMatches()
205 rules->binary_rules()->Get(bucket_index)) { in FindBinaryRulesMatches()
|
| /external/libtextclassifier/native/utils/grammar/ |
| D | rules.fbs | 84 binary_rules:[Rules_.BinaryRuleTableBucket];
182 // The `terminals`, `unary_rules` and `binary_rules` maps below represent
|