Lines Matching defs:index
188 return -bit_size.index - 1
202 ${val.index}, /* ${val.var_name} */
325 self.index = varset[self.var_name]
346 return self.index == other.index
395 # and save the index for the order they were added.
434 """Recursively count and index commutative expressions
583 return 0 if self.is_search or a.index == b.index else None
622 if self._var_classes[val.index] is None:
623 self._var_classes[val.index] = val
625 other = self._var_classes[val.index]
784 self.condition_index = condition_list.index(self.condition)
828 index or find the index associated to an object quickly using a hash
829 table. Compared to a list, it has a constant time index(). Compared to a
854 def index(self, obj):
861 index = len(self.objects)
863 self.map[obj] = index
864 return index
959 # Bijection from state to index. q in the original algorithm is
964 # Offset in the ->transforms table for each state index
966 # Map from state index to filtered state index for each opcode.
968 # Bijections from filtered state to filtered state index for each
973 # Everything in self.states with a index at least worklist_index is part
1019 rep_index = rep.index(filtered)
1146 /* Mapping from state index to offset in transforms (0 being no transforms) */
1173 % for index, condition in enumerate(condition_list):
1174 condition_flags[${index}] = ${condition};