Lines Matching refs:index
64 for (size_t index = 0; index < result.v.size(); ++index) {
65 translationTable[result.v[index]] = 1 + index;
70 for (size_t index = 0; index < data.size(); ++index) {
71 int value = data[index];
77 for (size_t index = 0; index < entries->size(); ++index) {
78 if (entries->at(index).v == result.v && entries->at(index).data == result.data) {
79 return index;
96 for (size_t index = 0; index < entries->size(); ++index) {
97 if (entries->at(index).data == result.data) {
98 return index;
112 // Assemble our compact and full data tables, and an index into them.
134 // zero pages are handled as a special index type.
139 int index = add_compact_entry(transitionSet, data, &compactEntries);
140 indices.push_back(IndexEntry{kCompactEntry, index});
143 int index = add_full_entry(transitionSet, data, &fullEntries);
144 indices.push_back(IndexEntry{kFullEntry, index});
151 for (int index=0; index < kNumValues; ++index) {
152 maxValue[index] = std::max(maxValue[index], entry.v[index]);
167 for (int index=0; index < kNumValues; ++index) {
168 if (maxValue[index] > 0) {
169 out << " State v" << index << " : " << int(std::ceil(std::log2(maxValue[index])))
192 for (int index=0; index < kNumValues; ++index) {
193 if (maxValue[index] > 0) {
194 out << entry.v[index] << ", ";
199 for (int index = 0; index < numTransitions; index++) {
200 combinedBits |= entry.data[index] << shiftBits;
222 << " IndexEntry index = kIndices[state];\n"
223 << " if (index.type == 0) { return 0; }\n"
224 << " if (index.type == 1) { return kFull[index.pos].data[transition]; }\n"
225 << " const CompactEntry& entry = kCompact[index.pos];\n"
231 for (int index=0; index < kNumValues; ++index) {
232 if (maxValue[index] > 0) {
233 out << ", entry.v" << index;