Lines Matching refs:entry
21 // The number of bits to use per entry in our compact transition table. This is customizable:
55 // Create a compact entry with the unique values from the transition set, padded out with zeros
76 // Look for an existing entry that exactly matches this one.
83 // Add this as a new entry.
91 // Create a full entry with this data.
95 // Look for an existing entry that exactly matches this one.
102 // Add this as a new entry.
148 // Find the largest value for each compact-entry slot.
150 for (const CompactEntry& entry : compactEntries) {
152 maxValue[index] = std::max(maxValue[index], entry.v[index]);
165 // Emit the compact-entry structure; minimize the number of bits needed per value.
179 for (const FullEntry& entry : fullEntries) {
181 for (int value : entry.data) {
190 for (const CompactEntry& entry : compactEntries) {
194 out << entry.v[index] << ", ";
200 combinedBits |= entry.data[index] << shiftBits;
217 for (const IndexEntry& entry : indices) {
218 out << " {" << entry.type << ", " << entry.pos << "},\n";
225 << " const CompactEntry& entry = kCompact[index.pos];\n"
226 << " int value = entry.data[transition >> " << std::log2(kDataPerByte) << "];\n"
233 out << ", entry.v" << index;