Searched refs:number_of_transitions (Results 1 – 4 of 4) sorted by relevance
64 int number_of_transitions = 0; in Insert() local75 number_of_transitions = array->number_of_transitions(); in Insert()76 new_nof = number_of_transitions; in Insert()91 DCHECK(insertion_index >= 0 && insertion_index <= number_of_transitions); in Insert()96 for (index = number_of_transitions; index > insertion_index; --index) { in Insert()110 Map::SlackForArraySize(number_of_transitions, kMaxNumberOfTransitions)); in Insert()118 if (array->number_of_transitions() != number_of_transitions) { in Insert()119 DCHECK(array->number_of_transitions() < number_of_transitions); in Insert()121 number_of_transitions = array->number_of_transitions(); in Insert()122 new_nof = number_of_transitions; in Insert()[all …]
52 DCHECK(transition_number < number_of_transitions()); in GetKeySlot()58 DCHECK(transition_number < number_of_transitions()); in GetKey()74 DCHECK(transition_number < number_of_transitions()); in SetKey()80 DCHECK(transition_number < number_of_transitions()); in GetTarget()97 DCHECK(transition_number < number_of_transitions()); in SetTarget()176 void TransitionArray::SetNumberOfTransitions(int number_of_transitions) { in SetNumberOfTransitions() argument177 DCHECK(number_of_transitions <= Capacity(this)); in SetNumberOfTransitions()178 set(kTransitionLengthIndex, Smi::FromInt(number_of_transitions)); in SetNumberOfTransitions()
160 inline int number_of_entries() { return number_of_transitions(); } in number_of_entries()162 inline void SetNumberOfTransitions(int number_of_transitions);239 static int LengthFor(int number_of_transitions) { in LengthFor() argument240 return ToKeyIndex(number_of_transitions); in LengthFor()245 int number_of_transitions,265 int number_of_transitions() { in number_of_transitions() function
424 CHECK_LE(LengthFor(number_of_transitions()), length()); in TransitionArrayVerify()1183 for (int i = 0; i < number_of_transitions(); i++) { in IsSortedNoDuplicates()