Lines Matching defs:value
71 int value = data[index];
72 assert(translationTable.find(value) != translationTable.end());
73 result.data.push_back(translationTable[value]);
124 int value = dfa.fTransitions[t][s];
125 assert(value >= 0 && value < (int)states);
126 data[t] = value;
127 transitionSet.insert(value);
133 // This transition table was completely empty (every value was zero). No data needed;
138 // Use a compact representation that squishes each value down to a few bits.
148 // Find the largest value for each compact-entry slot.
165 // Emit the compact-entry structure; minimize the number of bits needed per value.
181 for (int value : entry.data) {
182 out << value << ", ";
226 << " int value = entry.data[transition >> " << std::log2(kDataPerByte) << "];\n"
227 << " value >>= " << kNumBits << " * (transition & " << kDataPerByte - 1 << ");\n"
228 << " value &= " << kNumValues << ";\n"
240 << " return table[value];\n"